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.003s 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.000s CPU, 0.003s wall-clock]
94 relevant atoms
33 auxiliary atoms
127 final queue length
159 total queue pushes
Completing instantiation... [0.010s CPU, 0.002s wall-clock]
Instantiating: [0.010s CPU, 0.007s 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.002s 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.010s CPU, 0.001s wall-clock]
Done! [0.020s CPU, 0.018s 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(cegar(verbosity=normal))' --internal-plan-file sas_plan < output.sas
reading input... [t=0.000697309s]
done reading input! [t=0.00128487s]
[t=0.00508988s, 62908 KB] Initializing additive Cartesian heuristic...
Initializing Exploration...
h^m landmarks m=1
Using 25 P^m fluents.
Level 1 completed.
Level 2 completed.
Level 3 completed.
h^m landmarks computed.
Removed 0 reasonable or obedient reasonable orders
Calculating achievers.
Landmarks generation time: 0.000380295s
Discovered 9 landmarks, of which 0 are disjunctive and 0 are conjunctive
8 edges
Sort 8 facts
Simplifying 44 unary operators... done! [44 unary operators]
time to simplify: 0.000104276s
Initializing additive heuristic...
Time for building abstraction: 0.000169285s
States: 5
Goal states: 2
Looping transitions: 32
Non-looping transitions: 16
Initial h value: 2
Time for building abstraction: 0.000145434s
States: 5
Goal states: 2
Looping transitions: 32
Non-looping transitions: 16
Initial h value: 1
Time for building abstraction: 0.000140001s
States: 5
Goal states: 2
Looping transitions: 32
Non-looping transitions: 16
Initial h value: 1
Time for building abstraction: 0.000145715s
States: 5
Goal states: 2
Looping transitions: 32
Non-looping transitions: 16
Initial h value: 2
Time for building abstraction: 0.000117262s
States: 4
Goal states: 2
Looping transitions: 34
Non-looping transitions: 14
Initial h value: 0
Time for building abstraction: 9.2107e-05s
States: 3
Goal states: 2
Looping transitions: 36
Non-looping transitions: 12
Initial h value: 0
Time for building abstraction: 0.000112167s
States: 4
Goal states: 2
Looping transitions: 34
Non-looping transitions: 14
Initial h value: 0
Time for building abstraction: 9.0737e-05s
States: 3
Goal states: 2
Looping transitions: 36
Non-looping transitions: 12
Initial h value: 0
Sort 8 facts
Simplifying 44 unary operators... done! [44 unary operators]
time to simplify: 6.2047e-05s
Initializing additive heuristic...
Time for building abstraction: 0.00013361s
States: 5
Goal states: 2
Looping transitions: 32
Non-looping transitions: 16
Initial h value: 0
Time for building abstraction: 0.000132483s
States: 5
Goal states: 2
Looping transitions: 32
Non-looping transitions: 16
Initial h value: 0
Time for building abstraction: 0.000138387s
States: 5
Goal states: 2
Looping transitions: 32
Non-looping transitions: 16
Initial h value: 0
Time for building abstraction: 0.000127946s
States: 5
Goal states: 2
Looping transitions: 32
Non-looping transitions: 16
Initial h value: 0
Time for building abstraction: 0.000107393s
States: 4
Goal states: 2
Looping transitions: 34
Non-looping transitions: 14
Initial h value: 0
Time for building abstraction: 8.3683e-05s
States: 3
Goal states: 2
Looping transitions: 36
Non-looping transitions: 12
Initial h value: 0
Time for building abstraction: 0.000102581s
States: 4
Goal states: 2
Looping transitions: 34
Non-looping transitions: 14
Initial h value: 0
Time for building abstraction: 8.4119e-05s
States: 3
Goal states: 2
Looping transitions: 36
Non-looping transitions: 12
Initial h value: 0
[t=0.00961532s, 139712 KB] Done initializing additive Cartesian heuristic
Time for initializing additive Cartesian heuristic: 0.00436707s
Cartesian abstractions built: 16
Cartesian states: 68
Total number of non-looping transitions: 232
Building successor generator...done! [t=0.00993986s]
peak memory difference for successor generator creation: 0 KB
time for successor generation creation: 3.4784e-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 cegar(verbosity = normal): 6
[g=0, 1 evaluated, 0 expanded, t=0.0103026s, 139712 KB]
f = 6 [1 evaluated, 0 expanded, t=0.010403s, 139712 KB]
Initial heuristic value for cegar(verbosity = normal): 6
pruning method: none
New best heuristic value for cegar(verbosity = normal): 5
[g=1, 2 evaluated, 1 expanded, t=0.0105461s, 139712 KB]
New best heuristic value for cegar(verbosity = normal): 4
[g=2, 6 evaluated, 2 expanded, t=0.0106832s, 139712 KB]
f = 7 [25 evaluated, 9 expanded, t=0.0109364s, 139712 KB]
New best heuristic value for cegar(verbosity = normal): 3
[g=4, 26 evaluated, 10 expanded, t=0.0110488s, 139712 KB]
New best heuristic value for cegar(verbosity = normal): 2
[g=5, 29 evaluated, 11 expanded, t=0.0111725s, 139712 KB]
New best heuristic value for cegar(verbosity = normal): 1
[g=6, 32 evaluated, 12 expanded, t=0.0112946s, 139712 KB]
f = 8 [133 evaluated, 61 expanded, t=0.0122193s, 139712 KB]
New best heuristic value for cegar(verbosity = normal): 0
[g=8, 137 evaluated, 63 expanded, t=0.012353s, 139712 KB]
Solution found!
Actual search time: 0.00199122s [t=0.0125059s]
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 66 state(s).
Reopened 0 state(s).
Evaluated 143 state(s).
Evaluations: 143
Generated 163 state(s).
Dead ends: 0 state(s).
Expanded until last jump: 61 state(s).
Reopened until last jump: 0 state(s).
Evaluated until last jump: 133 state(s).
Generated until last jump: 152 state(s).
Number of registered states: 143
Int hash set load factor: 143/256 = 0.558594
Int hash set resizes: 8
Search time: 0.00231224s
Total time: 0.012517s
Solution found.
Peak memory: 139712 KB
Remove intermediate file output.sas
search exit code: 0