INFO Running translator.
INFO translator stdin: None
INFO translator time limit: None
INFO translator memory limit: None
INFO translator command line string: /home/heusma01/anaconda2/bin/python /home/heusma01/Workplace/planners/fd-repos/downward/builds/release/bin/translate/translate.py /home/heusma01/downward-benchmarks/visitall-opt11-strips/domain.pddl /home/heusma01/downward-benchmarks/visitall-opt11-strips/problem03-full.pddl --sas-file output.sas
Parsing...
Parsing: [0.000s CPU, 0.004s wall-clock]
Normalizing task... [0.000s CPU, 0.000s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.001s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.001s wall-clock]
Preparing model... [0.000s CPU, 0.001s wall-clock]
Generated 6 rules.
Computing model... [0.010s CPU, 0.003s wall-clock]
94 relevant atoms
33 auxiliary atoms
127 final queue length
159 total queue pushes
Completing instantiation... [0.000s CPU, 0.002s wall-clock]
Instantiating: [0.010s CPU, 0.008s wall-clock]
Computing fact groups...
Finding invariants...
4 initial candidates
Finding invariants: [0.000s CPU, 0.001s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
9 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.000s CPU, 0.002s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.000s wall-clock]
Translating task: [0.000s CPU, 0.003s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
3 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.002s wall-clock]
Reordering and filtering variables...
9 of 9 variables necessary.
0 of 1 mutex groups necessary.
24 of 24 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.001s wall-clock]
Translator variables: 9
Translator derived variables: 0
Translator facts: 25
Translator goal facts: 8
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 24
Translator axioms: 0
Translator task size: 134
Translator peak memory: 54528 KB
Writing output... [0.000s CPU, 0.001s wall-clock]
Done! [0.010s CPU, 0.021s wall-clock]
translate exit code: 0
INFO Running search (release).
INFO search stdin: output.sas
INFO search time limit: None
INFO search memory limit: None
INFO search command line string: /home/heusma01/Workplace/planners/fd-repos/downward/builds/release/bin/downward --search 'astar(diverse_potentials(verbosity=verbose))' --internal-plan-file sas_plan < output.sas
reading input... [t=0.000853365s]
done reading input! [t=0.00144936s]
Time for filtering dead ends: 0.0740041s
Duplicate samples: 684
Dead end samples: 0
Unique non-dead-end samples: 316
Find heuristic #1
Removed 207 samples. 109 remaining.
Find heuristic #2
Removed 60 samples. 49 remaining.
Find heuristic #3
No sample removed -> Use arbitrary precomputed function.
Removed 15 samples. 34 remaining.
Find heuristic #4
No sample removed -> Use arbitrary precomputed function.
Removed 1 samples. 33 remaining.
Find heuristic #5
No sample removed -> Use arbitrary precomputed function.
Removed 6 samples. 27 remaining.
Find heuristic #6
No sample removed -> Use arbitrary precomputed function.
Removed 5 samples. 22 remaining.
Find heuristic #7
No sample removed -> Use arbitrary precomputed function.
Removed 7 samples. 15 remaining.
Find heuristic #8
No sample removed -> Use arbitrary precomputed function.
Removed 1 samples. 14 remaining.
Find heuristic #9
No sample removed -> Use arbitrary precomputed function.
Removed 6 samples. 8 remaining.
Find heuristic #10
No sample removed -> Use arbitrary precomputed function.
Removed 1 samples. 7 remaining.
Find heuristic #11
No sample removed -> Use arbitrary precomputed function.
Removed 1 samples. 6 remaining.
Find heuristic #12
No sample removed -> Use arbitrary precomputed function.
Removed 1 samples. 5 remaining.
Find heuristic #13
Removed 3 samples. 2 remaining.
Find heuristic #14
Removed 2 samples. 0 remaining.
Time for covering samples: 0.00337507s
Potential heuristics: 14
Initialization of potential heuristics: 0.086127s
Building successor generator...done! [t=0.0926398s]
peak memory difference for successor generator creation: 0 KB
time for successor generation creation: 1.7579e-05s
Variables: 9
FactPairs: 25
Bytes per state: 4
Conducting best first search with reopening closed nodes, (real) bound = 2147483647
New best heuristic value for diverse_potentials(verbosity = verbose): 8
[g=0, 1 evaluated, 0 expanded, t=0.0928845s, 64228 KB]
f = 8 [1 evaluated, 0 expanded, t=0.0929476s, 64228 KB]
Initial heuristic value for diverse_potentials(verbosity = verbose): 8
pruning method: none
New best heuristic value for diverse_potentials(verbosity = verbose): 7
[g=1, 2 evaluated, 1 expanded, t=0.0930392s, 64228 KB]
New best heuristic value for diverse_potentials(verbosity = verbose): 6
[g=2, 6 evaluated, 2 expanded, t=0.0931184s, 64228 KB]
New best heuristic value for diverse_potentials(verbosity = verbose): 5
[g=3, 10 evaluated, 3 expanded, t=0.0931982s, 64228 KB]
New best heuristic value for diverse_potentials(verbosity = verbose): 4
[g=4, 13 evaluated, 4 expanded, t=0.0932713s, 64228 KB]
New best heuristic value for diverse_potentials(verbosity = verbose): 3
[g=5, 15 evaluated, 5 expanded, t=0.0933408s, 64228 KB]
New best heuristic value for diverse_potentials(verbosity = verbose): 2
[g=6, 18 evaluated, 6 expanded, t=0.0934151s, 64228 KB]
New best heuristic value for diverse_potentials(verbosity = verbose): 1
[g=7, 19 evaluated, 7 expanded, t=0.0934797s, 64228 KB]
New best heuristic value for diverse_potentials(verbosity = verbose): 0
[g=8, 21 evaluated, 8 expanded, t=0.0935476s, 64228 KB]
Solution found!
Actual search time: 0.000598685s [t=0.0936207s]
move loc-x1-y1 loc-x0-y1 (1)
move loc-x0-y1 loc-x0-y0 (1)
move loc-x0-y0 loc-x1-y0 (1)
move loc-x1-y0 loc-x2-y0 (1)
move loc-x2-y0 loc-x2-y1 (1)
move loc-x2-y1 loc-x2-y2 (1)
move loc-x2-y2 loc-x1-y2 (1)
move loc-x1-y2 loc-x0-y2 (1)
Plan length: 8 step(s).
Plan cost: 8
Expanded 9 state(s).
Reopened 0 state(s).
Evaluated 23 state(s).
Evaluations: 23
Generated 22 state(s).
Dead ends: 0 state(s).
Expanded until last jump: 0 state(s).
Reopened until last jump: 0 state(s).
Evaluated until last jump: 1 state(s).
Generated until last jump: 0 state(s).
Number of registered states: 23
Int hash set load factor: 23/32 = 0.71875
Int hash set resizes: 5
Search time: 0.000808787s
Total time: 0.0936278s
Solution found.
Peak memory: 64228 KB
Remove intermediate file output.sas
search exit code: 0