1. Running translator Second argument is a file name: use two translator arguments. Parsing... Parsing: [0.000s CPU, 0.002s 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.010s CPU, 0.006s wall-clock] Preparing model... [0.000s CPU, 0.002s wall-clock] Generated 38 rules. Computing model... [0.010s CPU, 0.013s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.020s CPU, 0.006s wall-clock] Instantiating: [0.040s CPU, 0.028s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.000s CPU, 0.007s wall-clock] Checking invariant weight... [0.000s CPU, 0.000s wall-clock] Instantiating groups... [0.000s CPU, 0.002s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 20 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.010s 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.010s CPU, 0.007s wall-clock] 0 implied effects removed 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 7 propositions removed Detecting unreachable propositions: [0.000s CPU, 0.001s wall-clock] Translator variables: 21 Translator derived variables: 0 Translator facts: 80 Translator goal facts: 2 Translator mutex groups: 19 Translator total mutex groups size: 104 Translator operators: 78 Translator axioms: 0 Translator task size: 795 Translator peak memory: 25328 KB Writing output... [0.010s CPU, 0.001s wall-clock] Done! [0.060s CPU, 0.051s wall-clock] 2. Running preprocessor Building causal graph... The causal graph is not acyclic. 21 variables of 21 necessary 16 of 19 mutex groups necessary. 78 of 78 operators necessary. 0 of 0 axiom rules necessary. Building domain transition graphs... solveable in poly time 0 Building successor generator... Preprocessor facts: 80 Preprocessor derived variables: 0 Preprocessor task size: 751 Writing output... done 3. Running search Dispatcher selected state size 1. This is a nonunit task. Simplifying transitions... done! Initializing Exploration... Generating landmarks using the RPG/SAS+ approach approx. reasonable orders approx. obedient reasonable orders Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 9.9573e-05s Discovered 3 landmarks, of which 0 are disjunctive and 0 are conjunctive 1 edges Initializing landmarks count heuristic... 2 initial landmarks, 2 goal landmarks Initializing Exploration... Generating landmarks using the RPG/SAS+ approach approx. reasonable orders approx. obedient reasonable orders Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 9.5418e-05s Discovered 3 landmarks, of which 0 are disjunctive and 0 are conjunctive 1 edges Initializing landmarks count heuristic... 2 initial landmarks, 2 goal landmarks Starting search: lazy_greedy(list(hrb, hlm1), preferred = list(hrb, hlm1), cost_type = 1, reopen_closed = false) Conducting lazy best first search, (real) bound = 2147483647 Initializing Red-Black Relaxation heuristic... Running A* instead of Dijkstra. Using the distances ignoring outside conditions for heuristic estimates. Preferred operators (if used) are set from relaxed plan Conflict costs are estimated Initializing FF heuristic... Initializing additive heuristic... Simplifying 314 unary operators... done! [314 unary operators] Initializing extended DTGs Adding 78 operators to extended DTGs Checking invertibility... Done checking invertibility Checking connectivity... Done checking connectivity Total number of invertible variables is 3 Invertible variables connection status: 1 Invertible variables without leafs connection status: 1 Setting black variables... Variables order is set --------------------------------------------------------------------------------------- Total number of black variables is 2 Total number of black root variables is 0 Total number of variables is 21 Total number of variables with all pairs of values connected is 0 Total number of variables with all values connected to goal is 0 Total number of black variables with strongly connected parents only is 0 Maximal number of side effects for black variable is 4 --------------------------------------------------------------------------------------- Black DAG usage status: 0 Counting red preconditions.. Keeping achieving operators for red facts.. Initializing black variables... Adding edges to forward graph, for the later calculation of missing values Precalculating all pair shortest paths Finished initializing Red-Black Relaxation heuristic at time step [t=0s] Best heuristic value: 1/9 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 1/8 [g=1, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 1/7 [g=2, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 1/6 [g=3, 4 evaluated, 3 expanded, t=0s] Best heuristic value: 1/5 [g=4, 5 evaluated, 4 expanded, t=0s] Best heuristic value: 1/4 [g=5, 6 evaluated, 5 expanded, t=0s] Best heuristic value: 1/3 [g=31, 49 evaluated, 43 expanded, t=0s] Cost to: 9, cost from: 1 the total is: 10 Solution found! Actual search time: 0s [t=0s] move player-01 pos-6-4 pos-6-3 dir-up (0) move player-01 pos-6-3 pos-6-2 dir-up (0) move player-01 pos-6-2 pos-5-2 dir-left (0) move player-01 pos-5-2 pos-4-2 dir-left (0) move player-01 pos-4-2 pos-3-2 dir-left (0) move player-01 pos-3-2 pos-2-2 dir-left (0) move player-01 pos-2-2 pos-2-3 dir-down (0) move player-01 pos-2-3 pos-2-4 dir-down (0) move player-01 pos-2-4 pos-2-5 dir-down (0) move player-01 pos-2-5 pos-3-5 dir-right (0) move player-01 pos-3-5 pos-4-5 dir-right (0) push-to-nongoal player-01 stone-01 pos-4-5 pos-4-4 pos-4-3 dir-up (1) move player-01 pos-4-4 pos-3-4 dir-left (0) move player-01 pos-3-4 pos-2-4 dir-left (0) move player-01 pos-2-4 pos-2-3 dir-up (0) move player-01 pos-2-3 pos-2-2 dir-up (0) move player-01 pos-2-2 pos-3-2 dir-right (0) move player-01 pos-3-2 pos-4-2 dir-right (0) move player-01 pos-4-2 pos-5-2 dir-right (0) move player-01 pos-5-2 pos-6-2 dir-right (0) move player-01 pos-6-2 pos-6-3 dir-down (0) move player-01 pos-6-3 pos-6-4 dir-down (0) push-to-nongoal player-01 stone-02 pos-6-4 pos-5-4 pos-4-4 dir-left (1) push-to-nongoal player-01 stone-02 pos-5-4 pos-4-4 pos-3-4 dir-left (1) push-to-goal player-01 stone-02 pos-4-4 pos-3-4 pos-2-4 dir-left (1) move player-01 pos-3-4 pos-4-4 dir-right (0) move player-01 pos-4-4 pos-5-4 dir-right (0) move player-01 pos-5-4 pos-6-4 dir-right (0) move player-01 pos-6-4 pos-6-3 dir-up (0) move player-01 pos-6-3 pos-6-2 dir-up (0) move player-01 pos-6-2 pos-5-2 dir-left (0) move player-01 pos-5-2 pos-4-2 dir-left (0) push-to-nongoal player-01 stone-01 pos-4-2 pos-4-3 pos-4-4 dir-down (1) move player-01 pos-4-3 pos-4-2 dir-up (0) move player-01 pos-4-2 pos-5-2 dir-right (0) move player-01 pos-5-2 pos-6-2 dir-right (0) move player-01 pos-6-2 pos-6-3 dir-down (0) move player-01 pos-6-3 pos-6-4 dir-down (0) move player-01 pos-6-4 pos-5-4 dir-left (0) push-to-nongoal player-01 stone-01 pos-5-4 pos-4-4 pos-3-4 dir-left (1) move player-01 pos-4-4 pos-4-5 dir-down (0) move player-01 pos-4-5 pos-3-5 dir-left (0) move player-01 pos-3-5 pos-2-5 dir-left (0) push-to-nongoal player-01 stone-02 pos-2-5 pos-2-4 pos-2-3 dir-up (1) push-to-nongoal player-01 stone-01 pos-2-4 pos-3-4 pos-4-4 dir-right (1) push-to-goal player-01 stone-01 pos-3-4 pos-4-4 pos-5-4 dir-right (1) move player-01 pos-4-4 pos-4-3 dir-up (0) move player-01 pos-4-3 pos-4-2 dir-up (0) move player-01 pos-4-2 pos-3-2 dir-left (0) move player-01 pos-3-2 pos-2-2 dir-left (0) push-to-goal player-01 stone-02 pos-2-2 pos-2-3 pos-2-4 dir-down (1) Plan length: 51 step(s). Plan cost: 10 Initial state h value: 1/9. Expanded 93 state(s). Reopened 0 state(s). Evaluated 106 state(s). Evaluations: 212 Generated 215 state(s). Dead ends: 12 state(s). Best solution cost so far: 10 Solution found - keep searching Starting search: lazy_greedy(list(hrb, hlm2), preferred = list(hrb, hlm2), reopen_closed = false) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 9/2 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0s] Best heuristic value: 3/2 [g=4, 49 evaluated, 43 expanded, t=0s] Best heuristic value: 3/1 [g=9, 106 evaluated, 93 expanded, t=0s] Best heuristic value: 2/1 [g=9, 109 evaluated, 96 expanded, t=0s] Best heuristic value: 1/1 [g=9, 110 evaluated, 97 expanded, t=0s] Completely explored state space -- no solution! Actual search time: 0s [t=0s] Initial state h value: 9/2. Expanded 164 state(s). Reopened 0 state(s). Evaluated 180 state(s). Evaluations: 360 Generated 369 state(s). Dead ends: 16 state(s). Best solution cost so far: 10 No solution found - keep searching Starting search: lazy_wastar(list(hrb, hlm2), preferred = list(hrb, hlm2), w = 5) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 9/2 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0s] Best heuristic value: 3/2 [g=4, 49 evaluated, 43 expanded, t=0s] Best heuristic value: 3/1 [g=9, 106 evaluated, 93 expanded, t=0s] Best heuristic value: 2/1 [g=9, 109 evaluated, 96 expanded, t=0s] Best heuristic value: 1/1 [g=9, 110 evaluated, 97 expanded, t=0s] Completely explored state space -- no solution! Actual search time: 0s [t=0s] Initial state h value: 9/2. Expanded 177 state(s). Reopened 13 state(s). Evaluated 193 state(s). Evaluations: 386 Generated 397 state(s). Dead ends: 16 state(s). Best solution cost so far: 10 No solution found - keep searching Starting search: lazy_wastar(list(hrb, hlm2), preferred = list(hrb, hlm2), w = 3) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 9/2 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0.01s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0.01s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0.01s] Best heuristic value: 3/2 [g=4, 49 evaluated, 43 expanded, t=0.01s] Best heuristic value: 3/1 [g=9, 106 evaluated, 93 expanded, t=0.01s] Best heuristic value: 2/1 [g=9, 109 evaluated, 96 expanded, t=0.01s] Best heuristic value: 1/1 [g=9, 110 evaluated, 97 expanded, t=0.01s] Completely explored state space -- no solution! Actual search time: 0.01s [t=0.01s] Initial state h value: 9/2. Expanded 175 state(s). Reopened 11 state(s). Evaluated 191 state(s). Evaluations: 382 Generated 394 state(s). Dead ends: 16 state(s). Best solution cost so far: 10 No solution found - keep searching Starting search: lazy_wastar(list(hrb, hlm2), preferred = list(hrb, hlm2), w = 2) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 9/2 [g=0, 1 evaluated, 0 expanded, t=0.01s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0.01s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0.01s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0.01s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0.01s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0.01s] Best heuristic value: 3/2 [g=4, 49 evaluated, 43 expanded, t=0.01s] Best heuristic value: 3/1 [g=9, 119 evaluated, 106 expanded, 11 reopened, t=0.01s] Best heuristic value: 2/1 [g=9, 122 evaluated, 109 expanded, 11 reopened, t=0.01s] Best heuristic value: 1/1 [g=9, 123 evaluated, 110 expanded, 11 reopened, t=0.01s] Completely explored state space -- no solution! Actual search time: 0s [t=0.01s] Initial state h value: 9/2. Expanded 175 state(s). Reopened 11 state(s). Evaluated 191 state(s). Evaluations: 382 Generated 394 state(s). Dead ends: 16 state(s). Best solution cost so far: 10 No solution found - keep searching Starting search: lazy_wastar(list(hrb, hlm2), preferred = list(hrb, hlm2), w = 1) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 9/2 [g=0, 1 evaluated, 0 expanded, t=0.01s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0.01s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0.01s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0.01s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0.01s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0.01s] Best heuristic value: 3/2 [g=4, 62 evaluated, 56 expanded, t=0.01s] Best heuristic value: 3/1 [g=9, 115 evaluated, 102 expanded, t=0.01s] Best heuristic value: 2/1 [g=9, 118 evaluated, 105 expanded, t=0.01s] Best heuristic value: 1/1 [g=9, 119 evaluated, 106 expanded, t=0.01s] Completely explored state space -- no solution! Actual search time: 0.01s [t=0.02s] Initial state h value: 9/2. Expanded 164 state(s). Reopened 0 state(s). Evaluated 180 state(s). Evaluations: 360 Generated 369 state(s). Dead ends: 16 state(s). Best solution cost so far: 10 No solution found - keep searching Actual search time: 0.02s [t=0.02s] Cumulative statistics: Expanded 948 state(s). Reopened 35 state(s). Evaluated 1041 state(s). Evaluations: 2082 Generated 2138 state(s). Dead ends: 0 state(s). Search time: 0.02s Total time: 0.02s Solution found. Peak memory: 4180 KB Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpfD09Pf/sas_plan.1 Plan executed successfully - checking goal Plan valid Final value: 10 Successful plans: Value: 10 /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpfD09Pf/sas_plan.1 10