/home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny Functions: ( :functions ( total-cost ) - number ) | Action cost: move | without_action_costs | 0 Action cost: push-to-nongoal | ( increase ( total-cost ) 1 ) | 0 Action cost: push-to-goal | ( increase ( total-cost ) 1 ) | 0 Fluent: ( = ( total-cost ) 0 ) Metric: ( :metric minimize ( total-cost ) ) /planner/src/parser /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny original_domain: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/domain.pddl domain_wac: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/domain_without_action_costs.txt domain_wce: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/domain_wce.txt domain_ready: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/domain_ready.txt original_problem: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/problem.pddl problem_wac: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/problem_without_action_costs.txt problem_wce: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/facts_wce.txt problem_ready: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/problem_ready.txt action_costs_domain_file: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/action_costs_from_domain_file.txt action_costs_problem_file: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/action_costs_from_problem_file.txt Action costs processed. highest number of when per action: 0 El dominio original no tiene efectos condicionales, por lo tanto no es necesario realizar la compilacion. 1. Running translator Second argument is a file name: use two translator arguments. Parsing... [0.000s CPU, 0.002s wall-clock] Instantiating... Normalizing task... [0.000s CPU, 0.000s wall-clock] Generating Datalog program... [0.000s CPU, 0.000s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.000s CPU, 0.003s wall-clock] Preparing model... [0.000s CPU, 0.001s wall-clock] Generated 38 rules. Computing model... [0.010s CPU, 0.010s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.000s CPU, 0.004s wall-clock] Instantiating: [0.010s CPU, 0.019s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates [0.000s CPU, 0.005s wall-clock] Checking invariant weight... [0.000s CPU, 0.000s wall-clock] Instantiating groups... [0.010s CPU, 0.001s 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.010s CPU, 0.007s 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] 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 implied effects removed 34 effect conditions simplified 0 implied preconditions added Building mutex information... Building mutex information: [0.000s CPU, 0.000s wall-clock] Detecting unreachable propositions... 0 operators removed 7 propositions removed Detecting unreachable propositions: [0.000s CPU, 0.001s wall-clock] Writing translation key... [0.000s CPU, 0.000s wall-clock] Writing mutex key... [0.000s CPU, 0.000s wall-clock] Writing output... [0.000s CPU, 0.000s wall-clock] Done! [0.020s CPU, 0.033s wall-clock] 2. Running preprocessor Building causal graph... The causal graph is not acyclic. 21 variables of 21 necessary 78 of 78 operators necessary. 0 of 0 axiom rules necessary. Building domain transition graphs... solveable in poly time 0 Building successor generator... Writing output... done End Running preprocessor 3. Running search Dispatcher selected state size 1. This is a nonunit task. Simplifying transitions... done! path_all_groups: all.groups Initializing Exploration... Reading invariants from file... all.groups: all.groups done Generating landmarks using the RPG/SAS+ approach approx. reasonable orders approx. obedient reasonable orders Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.000342213s Discovered 3 landmarks, of which 0 are disjunctive and 0 are conjunctive 1 edges Initializing LAMA-FF Synergy Object Initializing landmarks count heuristic... 2 initial landmarks, 2 goal landmarks Initializing Exploration... Reading invariants from file... all.groups: all.groups done Generating landmarks using the RPG/SAS+ approach approx. reasonable orders approx. obedient reasonable orders Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.000319892s Discovered 3 landmarks, of which 0 are disjunctive and 0 are conjunctive 1 edges Initializing LAMA-FF Synergy Object Initializing landmarks count heuristic... 2 initial landmarks, 2 goal landmarks insert bound insert bound insert bound insert bound insert bound insert bound insert bound insert bound open inner_list size: 6 open local_inner_list size: 6 Starting search: lazy_two_level_macro_type_greedy(hff1,hlm1,preferred=(hff1,hlm1)) Conducting lazy best first search, (real) bound = 2147483647 Best heuristic value: 1/9 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 1/8 [g=0, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 1/7 [g=0, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 1/6 [g=0, 4 evaluated, 3 expanded, t=0s] Best heuristic value: 1/5 [g=0, 5 evaluated, 4 expanded, t=0s] Best heuristic value: 1/4 [g=0, 6 evaluated, 5 expanded, t=0s] Best heuristic value: 1/3 [g=5, 58 evaluated, 52 expanded, t=0s] Best heuristic value: 1/2 [g=9, 99 evaluated, 88 expanded, t=0s] Best heuristic value: 1/1 [g=9, 100 evaluated, 89 expanded, t=0s] Solution found! Actual search time: 0.01s [t=0.01s] Real Plan cost: 10. Real Total time: 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-3-5 dir-down (0) move player-01 pos-3-5 pos-2-5 dir-left (0) move player-01 pos-2-5 pos-2-4 dir-up (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: 53 step(s). Plan cost: 10. plan_id: 1 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-3-5 dir-down (0) move player-01 pos-3-5 pos-2-5 dir-left (0) move player-01 pos-2-5 pos-2-4 dir-up (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: 53 step(s). Plan cost: 10. 2016; 1566;257 cmd: pwd;ulimit -t 257;/planner/src/jasper/search/one_run_aras -run_one_plan_aras /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result--1 /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result-output_bound -o /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result-aras -mrw_shared "-iterative -run_aras -aras_time -1 -aras_mem -1" < output >> /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result_aras_tmp_output **************start aras*************** /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny **************end aras*************** aras_plan_bound: 10 1 ARAS is disabled by FIRST_RUN_CHECK!! Initial state h value: 1/9. Expanded 90 state(s). Reopened 0 state(s). Evaluated 101 state(s). Evaluations: 202 Generated 207 state(s). Best solution cost so far: 10 Solution found - keep searching insert bound Starting search: lazy_greedy(hff2,hlm2,preferred=(hff2,hlm2),reopen_closed=false) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.01s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.01s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.01s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.01s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.01s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.01s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.01s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.01s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.01s] Best heuristic value: 1/5 [g=9, 82 evaluated, 72 expanded, t=0.01s] Best heuristic value: 1/4 [g=9, 84 evaluated, 74 expanded, t=0.01s] Best heuristic value: 1/3 [g=9, 85 evaluated, 75 expanded, t=0.01s] Best heuristic value: 1/2 [g=9, 86 evaluated, 76 expanded, t=0.01s] Completely explored state space -- no solution! Actual search time: 0s [t=0.01s] Initial state h value: 2/13. Expanded 164 state(s). Reopened 0 state(s). Evaluated 180 state(s). Evaluations: 360 Generated 369 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=5) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.01s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.01s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.01s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.01s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.01s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.01s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.02s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.02s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.02s] Best heuristic value: 1/5 [g=9, 84 evaluated, 74 expanded, t=0.02s] Best heuristic value: 1/4 [g=9, 86 evaluated, 76 expanded, t=0.02s] Best heuristic value: 1/3 [g=9, 87 evaluated, 77 expanded, t=0.02s] Best heuristic value: 1/2 [g=9, 88 evaluated, 78 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0.01s [t=0.02s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=3) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.02s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.02s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.02s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.02s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.02s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.02s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.02s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.02s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.02s] Best heuristic value: 1/5 [g=9, 84 evaluated, 74 expanded, t=0.02s] Best heuristic value: 1/4 [g=9, 86 evaluated, 76 expanded, t=0.02s] Best heuristic value: 1/3 [g=9, 87 evaluated, 77 expanded, t=0.02s] Best heuristic value: 1/2 [g=9, 88 evaluated, 78 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0s [t=0.02s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=2) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.02s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.02s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.02s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.02s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.02s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.02s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.02s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.02s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.02s] Best heuristic value: 1/5 [g=9, 84 evaluated, 74 expanded, t=0.02s] Best heuristic value: 1/4 [g=9, 86 evaluated, 76 expanded, t=0.02s] Best heuristic value: 1/3 [g=9, 87 evaluated, 77 expanded, t=0.02s] Best heuristic value: 1/2 [g=9, 88 evaluated, 78 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0.01s [t=0.03s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=1) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.03s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.03s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.03s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.03s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.03s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.03s] Best heuristic value: 2/7 [g=3, 57 evaluated, 51 expanded, t=0.03s] Best heuristic value: 2/6 [g=4, 58 evaluated, 52 expanded, t=0.03s] Best heuristic value: 2/5 [g=5, 74 evaluated, 67 expanded, t=0.03s] Best heuristic value: 1/5 [g=9, 111 evaluated, 98 expanded, t=0.03s] Best heuristic value: 1/4 [g=9, 113 evaluated, 100 expanded, t=0.03s] Best heuristic value: 1/3 [g=9, 114 evaluated, 101 expanded, t=0.03s] Best heuristic value: 1/2 [g=9, 115 evaluated, 102 expanded, t=0.03s] Completely explored state space -- no solution! Actual search time: 0s [t=0.03s] Initial state h value: 2/13. Expanded 165 state(s). Reopened 1 state(s). Evaluated 181 state(s). Evaluations: 362 Generated 371 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound open inner_list size: 6 open local_inner_list size: 6 Starting search: lazy_two_level_macro_type_greedy(hff1,hlm1,preferred=(hff1,hlm1)) Conducting lazy best first search, (real) bound = 2147483647 Best heuristic value: 1/9 [g=0, 1 evaluated, 0 expanded, t=0.03s] Best heuristic value: 1/8 [g=0, 2 evaluated, 1 expanded, t=0.03s] Best heuristic value: 1/7 [g=0, 3 evaluated, 2 expanded, t=0.03s] Best heuristic value: 1/6 [g=0, 4 evaluated, 3 expanded, t=0.03s] Best heuristic value: 1/5 [g=0, 5 evaluated, 4 expanded, t=0.03s] Best heuristic value: 1/4 [g=0, 6 evaluated, 5 expanded, t=0.03s] Best heuristic value: 1/3 [g=5, 64 evaluated, 56 expanded, t=0.03s] Best heuristic value: 1/2 [g=9, 87 evaluated, 76 expanded, t=0.03s] Best heuristic value: 1/1 [g=9, 88 evaluated, 77 expanded, t=0.03s] Solution found! Actual search time: 0s [t=0.03s] Initial state h value: 1/9. Expanded 78 state(s). Reopened 0 state(s). Evaluated 89 state(s). Evaluations: 178 Generated 184 state(s). Best solution cost so far: 10 Solution found - keep searching insert bound Starting search: lazy_greedy(hff2,hlm2,preferred=(hff2,hlm2),reopen_closed=false) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.03s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.03s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.03s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.03s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.03s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.03s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.03s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.03s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.03s] Best heuristic value: 1/5 [g=9, 80 evaluated, 71 expanded, t=0.03s] Best heuristic value: 1/4 [g=9, 82 evaluated, 73 expanded, t=0.03s] Best heuristic value: 1/3 [g=9, 83 evaluated, 74 expanded, t=0.03s] Best heuristic value: 1/2 [g=9, 84 evaluated, 75 expanded, t=0.03s] Completely explored state space -- no solution! Actual search time: 0s [t=0.03s] Initial state h value: 2/13. Expanded 164 state(s). Reopened 0 state(s). Evaluated 180 state(s). Evaluations: 360 Generated 369 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=5) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.03s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.03s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.03s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.03s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.03s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.03s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.03s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.03s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.03s] Best heuristic value: 1/5 [g=9, 83 evaluated, 74 expanded, t=0.03s] Best heuristic value: 1/4 [g=9, 85 evaluated, 76 expanded, t=0.03s] Best heuristic value: 1/3 [g=9, 86 evaluated, 77 expanded, t=0.03s] Best heuristic value: 1/2 [g=9, 87 evaluated, 78 expanded, t=0.03s] Completely explored state space -- no solution! Actual search time: 0s [t=0.03s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=3) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.03s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.03s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.03s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.03s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.03s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.03s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.03s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.03s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.03s] Best heuristic value: 1/5 [g=9, 82 evaluated, 73 expanded, t=0.04s] Best heuristic value: 1/4 [g=9, 84 evaluated, 75 expanded, t=0.04s] Best heuristic value: 1/3 [g=9, 85 evaluated, 76 expanded, t=0.04s] Best heuristic value: 1/2 [g=9, 86 evaluated, 77 expanded, t=0.04s] Completely explored state space -- no solution! Actual search time: 0.01s [t=0.04s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=2) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.04s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.04s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.04s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.04s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.04s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.04s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.04s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.04s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.04s] Best heuristic value: 1/5 [g=9, 84 evaluated, 74 expanded, t=0.04s] Best heuristic value: 1/4 [g=9, 86 evaluated, 76 expanded, t=0.04s] Best heuristic value: 1/3 [g=9, 87 evaluated, 77 expanded, t=0.04s] Best heuristic value: 1/2 [g=9, 88 evaluated, 78 expanded, t=0.04s] Completely explored state space -- no solution! Actual search time: 0s [t=0.04s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=1) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.04s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.04s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.04s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.04s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.04s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.04s] Best heuristic value: 2/7 [g=3, 57 evaluated, 51 expanded, t=0.04s] Best heuristic value: 2/6 [g=4, 58 evaluated, 52 expanded, t=0.04s] Best heuristic value: 2/5 [g=5, 74 evaluated, 67 expanded, t=0.04s] Best heuristic value: 1/5 [g=9, 101 evaluated, 91 expanded, t=0.04s] Best heuristic value: 1/4 [g=9, 104 evaluated, 94 expanded, t=0.04s] Best heuristic value: 1/3 [g=9, 106 evaluated, 96 expanded, t=0.04s] Best heuristic value: 1/2 [g=9, 107 evaluated, 97 expanded, t=0.04s] Completely explored state space -- no solution! Actual search time: 0s [t=0.04s] Initial state h value: 2/13. Expanded 165 state(s). Reopened 1 state(s). Evaluated 181 state(s). Evaluations: 362 Generated 371 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound open inner_list size: 6 open local_inner_list size: 6 Starting search: lazy_two_level_macro_type_greedy(hff1,hlm1,preferred=(hff1,hlm1)) Conducting lazy best first search, (real) bound = 2147483647 Best heuristic value: 1/9 [g=0, 1 evaluated, 0 expanded, t=0.04s] Best heuristic value: 1/8 [g=0, 2 evaluated, 1 expanded, t=0.04s] Best heuristic value: 1/7 [g=0, 3 evaluated, 2 expanded, t=0.04s] Best heuristic value: 1/6 [g=0, 4 evaluated, 3 expanded, t=0.04s] Best heuristic value: 1/5 [g=0, 5 evaluated, 4 expanded, t=0.04s] Best heuristic value: 1/4 [g=0, 6 evaluated, 5 expanded, t=0.04s] Best heuristic value: 1/3 [g=4, 60 evaluated, 54 expanded, t=0.04s] Best heuristic value: 1/2 [g=9, 116 evaluated, 103 expanded, t=0.05s] Best heuristic value: 1/1 [g=9, 117 evaluated, 104 expanded, t=0.05s] Solution found! Actual search time: 0.01s [t=0.05s] Initial state h value: 1/9. Expanded 105 state(s). Reopened 0 state(s). Evaluated 118 state(s). Evaluations: 236 Generated 241 state(s). Best solution cost so far: 10 Solution found - keep searching insert bound Starting search: lazy_greedy(hff2,hlm2,preferred=(hff2,hlm2),reopen_closed=false) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.05s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.05s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.05s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.05s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.05s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.05s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.05s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.05s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.05s] Best heuristic value: 1/5 [g=9, 82 evaluated, 72 expanded, t=0.05s] Best heuristic value: 1/4 [g=9, 84 evaluated, 74 expanded, t=0.05s] Best heuristic value: 1/3 [g=9, 85 evaluated, 75 expanded, t=0.05s] Best heuristic value: 1/2 [g=9, 86 evaluated, 76 expanded, t=0.05s] Completely explored state space -- no solution! Actual search time: 0s [t=0.05s] Initial state h value: 2/13. Expanded 164 state(s). Reopened 0 state(s). Evaluated 180 state(s). Evaluations: 360 Generated 369 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=5) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.05s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.05s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.05s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.05s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.05s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.05s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.05s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.05s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.05s] Best heuristic value: 1/5 [g=9, 83 evaluated, 74 expanded, t=0.05s] Best heuristic value: 1/4 [g=9, 85 evaluated, 76 expanded, t=0.05s] Best heuristic value: 1/3 [g=9, 86 evaluated, 77 expanded, t=0.05s] Best heuristic value: 1/2 [g=9, 87 evaluated, 78 expanded, t=0.05s] Completely explored state space -- no solution! Actual search time: 0s [t=0.05s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=3) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.05s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.05s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.05s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.05s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.05s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.05s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.05s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.05s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.05s] Best heuristic value: 1/5 [g=9, 84 evaluated, 74 expanded, t=0.05s] Best heuristic value: 1/4 [g=9, 86 evaluated, 76 expanded, t=0.05s] Best heuristic value: 1/3 [g=9, 87 evaluated, 77 expanded, t=0.05s] Best heuristic value: 1/2 [g=9, 88 evaluated, 78 expanded, t=0.05s] Completely explored state space -- no solution! Actual search time: 0s [t=0.05s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=2) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.05s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.05s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.05s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.05s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.05s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.05s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.05s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.05s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.05s] Best heuristic value: 1/5 [g=9, 82 evaluated, 73 expanded, t=0.05s] Best heuristic value: 1/4 [g=9, 84 evaluated, 75 expanded, t=0.05s] Best heuristic value: 1/3 [g=9, 85 evaluated, 76 expanded, t=0.05s] Best heuristic value: 1/2 [g=9, 86 evaluated, 77 expanded, t=0.05s] Completely explored state space -- no solution! Actual search time: 0s [t=0.05s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=1) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.05s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.05s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.05s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.05s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.05s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.05s] Best heuristic value: 2/7 [g=3, 57 evaluated, 51 expanded, t=0.06s] Best heuristic value: 2/6 [g=4, 58 evaluated, 52 expanded, t=0.06s] Best heuristic value: 2/5 [g=5, 74 evaluated, 67 expanded, t=0.06s] Best heuristic value: 1/5 [g=9, 111 evaluated, 98 expanded, t=0.06s] Best heuristic value: 1/4 [g=9, 113 evaluated, 100 expanded, t=0.06s] Best heuristic value: 1/3 [g=9, 114 evaluated, 101 expanded, t=0.06s] Best heuristic value: 1/2 [g=9, 115 evaluated, 102 expanded, t=0.06s] Completely explored state space -- no solution! Actual search time: 0.01s [t=0.06s] Initial state h value: 2/13. Expanded 165 state(s). Reopened 1 state(s). Evaluated 181 state(s). Evaluations: 362 Generated 371 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound open inner_list size: 6 open local_inner_list size: 6 Starting search: lazy_two_level_macro_type_greedy(hff1,hlm1,preferred=(hff1,hlm1)) Conducting lazy best first search, (real) bound = 2147483647 Best heuristic value: 1/9 [g=0, 1 evaluated, 0 expanded, t=0.06s] Best heuristic value: 1/8 [g=0, 2 evaluated, 1 expanded, t=0.06s] Best heuristic value: 1/7 [g=0, 3 evaluated, 2 expanded, t=0.06s] Best heuristic value: 1/6 [g=0, 4 evaluated, 3 expanded, t=0.06s] Best heuristic value: 1/5 [g=0, 5 evaluated, 4 expanded, t=0.06s] Best heuristic value: 1/4 [g=0, 6 evaluated, 5 expanded, t=0.06s] Best heuristic value: 1/3 [g=4, 45 evaluated, 39 expanded, t=0.06s] Best heuristic value: 1/2 [g=9, 108 evaluated, 97 expanded, t=0.06s] Best heuristic value: 1/1 [g=9, 109 evaluated, 98 expanded, t=0.06s] Solution found! Actual search time: 0s [t=0.06s] Initial state h value: 1/9. Expanded 99 state(s). Reopened 0 state(s). Evaluated 110 state(s). Evaluations: 220 Generated 225 state(s). Best solution cost so far: 10 Solution found - keep searching insert bound Starting search: lazy_greedy(hff2,hlm2,preferred=(hff2,hlm2),reopen_closed=false) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.06s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.06s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.06s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.06s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.06s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.06s] Best heuristic value: 2/7 [g=4, 55 evaluated, 49 expanded, t=0.06s] Best heuristic value: 2/6 [g=4, 56 evaluated, 50 expanded, t=0.06s] Best heuristic value: 2/5 [g=5, 57 evaluated, 51 expanded, t=0.06s] Best heuristic value: 1/5 [g=9, 82 evaluated, 72 expanded, t=0.06s] Best heuristic value: 1/4 [g=9, 84 evaluated, 74 expanded, t=0.06s] Best heuristic value: 1/3 [g=9, 85 evaluated, 75 expanded, t=0.06s] Best heuristic value: 1/2 [g=9, 86 evaluated, 76 expanded, t=0.06s] Completely explored state space -- no solution! Actual search time: 0s [t=0.06s] Initial state h value: 2/13. Expanded 164 state(s). Reopened 0 state(s). Evaluated 180 state(s). Evaluations: 360 Generated 369 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=5) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.06s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.06s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.06s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.06s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.06s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.06s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.06s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.06s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.06s] Best heuristic value: 1/5 [g=9, 84 evaluated, 74 expanded, t=0.06s] Best heuristic value: 1/4 [g=9, 86 evaluated, 76 expanded, t=0.06s] Best heuristic value: 1/3 [g=9, 87 evaluated, 77 expanded, t=0.06s] Best heuristic value: 1/2 [g=9, 88 evaluated, 78 expanded, t=0.06s] Completely explored state space -- no solution! Actual search time: 0.01s [t=0.07s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=3) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.07s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.07s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.07s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.07s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.07s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.07s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.07s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.07s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.07s] Best heuristic value: 1/5 [g=9, 84 evaluated, 74 expanded, t=0.07s] Best heuristic value: 1/4 [g=9, 86 evaluated, 76 expanded, t=0.07s] Best heuristic value: 1/3 [g=9, 87 evaluated, 77 expanded, t=0.07s] Best heuristic value: 1/2 [g=9, 88 evaluated, 78 expanded, t=0.07s] Completely explored state space -- no solution! Actual search time: 0s [t=0.07s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=2) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.07s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.07s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.07s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.07s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.07s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.07s] Best heuristic value: 2/7 [g=4, 55 evaluated, 49 expanded, t=0.07s] Best heuristic value: 2/6 [g=4, 56 evaluated, 50 expanded, t=0.07s] Best heuristic value: 2/5 [g=5, 57 evaluated, 51 expanded, t=0.07s] Best heuristic value: 1/5 [g=9, 84 evaluated, 74 expanded, t=0.07s] Best heuristic value: 1/4 [g=9, 86 evaluated, 76 expanded, t=0.07s] Best heuristic value: 1/3 [g=9, 87 evaluated, 77 expanded, t=0.07s] Best heuristic value: 1/2 [g=9, 88 evaluated, 78 expanded, t=0.07s] Completely explored state space -- no solution! Actual search time: 0s [t=0.07s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Best solution cost so far: 10 No solution found - keep searching insert bound Starting search: lazy_wastar(hff2,hlm2,preferred=(hff2,hlm2),w=1) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.07s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.07s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.07s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.07s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.07s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.07s] Best heuristic value: 2/7 [g=3, 57 evaluated, 51 expanded, t=0.07s] Best heuristic value: 2/6 [g=4, 58 evaluated, 52 expanded, t=0.07s] Best heuristic value: 2/5 [g=5, 74 evaluated, 67 expanded, t=0.07s] Best heuristic value: 1/5 [g=9, 101 evaluated, 91 expanded, t=0.07s] Best heuristic value: 1/4 [g=9, 104 evaluated, 94 expanded, t=0.07s] Best heuristic value: 1/3 [g=9, 106 evaluated, 96 expanded, t=0.07s] Best heuristic value: 1/2 [g=9, 107 evaluated, 97 expanded, t=0.07s] Completely explored state space -- no solution! Actual search time: 0s [t=0.07s] Initial state h value: 2/13. Expanded 165 state(s). Reopened 1 state(s). Evaluated 181 state(s). Evaluations: 362 Generated 371 state(s). Best solution cost so far: 10 No solution found - keep searching Actual search time: 0.07s [t=0.07s] Cumulative statistics: Initial state h value: . Expanded 3716 state(s). Reopened 64 state(s). Evaluated 4082 state(s). Evaluations: 8164 Generated 8377 state(s). Search time: 0.07s Total time: 0.07s Peak memory: 6140 KB 1. Running translator Second argument is a file name: use two translator arguments. Parsing... Parsing: [0.010s CPU, 0.009s wall-clock] Normalizing task... [0.000s CPU, 0.000s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.003s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.009s wall-clock] Preparing model... [0.000s CPU, 0.007s wall-clock] Generated 38 rules. Computing model... [0.080s CPU, 0.077s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.020s CPU, 0.016s wall-clock] Instantiating: [0.110s CPU, 0.113s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.020s CPU, 0.019s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.003s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 20 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.020s CPU, 0.025s 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.001s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.001s wall-clock] Translating task: [0.020s CPU, 0.015s 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.003s 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: 101724 KB Writing output... [0.030s CPU, 0.023s wall-clock] Done! [0.190s CPU, 0.190s 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 /planner/src/mercury/src/search/downward < output ipc seq-sat-mercury --plan-file /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result 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: 0.000152445s 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: 0.000157475s 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: 9/1 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 8/1 [g=1, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 7/1 [g=2, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 6/1 [g=3, 4 evaluated, 3 expanded, t=0s] Best heuristic value: 5/1 [g=4, 5 evaluated, 4 expanded, t=0s] Best heuristic value: 4/1 [g=5, 6 evaluated, 5 expanded, t=0s] Best heuristic value: 3/1 [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: 9/1. 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: 0.02s [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 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=0.02s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0.02s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0.02s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0.02s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0.02s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0.02s] Best heuristic value: 3/2 [g=4, 49 evaluated, 43 expanded, t=0.02s] Best heuristic value: 3/1 [g=9, 106 evaluated, 93 expanded, t=0.02s] Best heuristic value: 2/1 [g=9, 109 evaluated, 96 expanded, t=0.02s] Best heuristic value: 1/1 [g=9, 110 evaluated, 97 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0s [t=0.02s] 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=0.02s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0.02s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0.02s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0.02s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0.02s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0.02s] Best heuristic value: 3/2 [g=4, 49 evaluated, 43 expanded, t=0.02s] Best heuristic value: 3/1 [g=9, 106 evaluated, 93 expanded, t=0.02s] Best heuristic value: 2/1 [g=9, 109 evaluated, 96 expanded, t=0.02s] Best heuristic value: 1/1 [g=9, 110 evaluated, 97 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0s [t=0.02s] 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.02s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0.02s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0.02s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0.02s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0.02s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0.02s] Best heuristic value: 3/2 [g=4, 49 evaluated, 43 expanded, t=0.02s] Best heuristic value: 3/1 [g=9, 119 evaluated, 106 expanded, 11 reopened, t=0.02s] Best heuristic value: 2/1 [g=9, 122 evaluated, 109 expanded, 11 reopened, t=0.02s] Best heuristic value: 1/1 [g=9, 123 evaluated, 110 expanded, 11 reopened, t=0.02s] Completely explored state space -- no solution! Actual search time: 0s [t=0.02s] 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.02s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0.02s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0.02s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0.02s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0.02s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0.02s] Best heuristic value: 3/2 [g=4, 62 evaluated, 56 expanded, t=0.02s] Best heuristic value: 3/1 [g=9, 115 evaluated, 102 expanded, t=0.02s] Best heuristic value: 2/1 [g=9, 118 evaluated, 105 expanded, t=0.02s] Best heuristic value: 1/1 [g=9, 119 evaluated, 106 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0s [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: 3864 KB MEMORY TOTAL: 16752996352 /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny /planner/src Run command: python2.7 /planner/src/parser/parse.py /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/domain.pddl /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/problem.pddl Portfolio runs original domain/problem Time took 1.0 seconds Original_Domain: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/domain.pddl Original_Problem: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/problem.pddl Modified_Domain: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/domain_ready.txt Modified_Problem: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/problem_ready.txt Original_Plan_file: sas_plan Plans folder: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny **************************************************** *** Planner_path: /planner/src/jasper/plan TimeOut: 257 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result--1 New best plan cost found: 10 Run command: mv /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result--1 sas_plan.1 Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result-aras ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result-aras is worse (10) than the previous plan generated (10), therefore we remove it Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result-aras_stat ERROR: Plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result-aras_stat is not valid or the plan cost is equal to -1, therefore we remove it Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result-output_bound ERROR: Plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result-output_bound is not valid or the plan cost is equal to -1, therefore we remove it Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 is worse (10) than the previous plan generated (10), therefore we remove it Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result_aras_tmp_output ERROR: Plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result_aras_tmp_output is not valid or the plan cost is equal to -1, therefore we remove it Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result_stat ERROR: Plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result_stat is not valid or the plan cost is equal to -1, therefore we remove it Planner /planner/src/jasper/plan run 5 seconds **************************************************** *** Planner_path: /planner/src/mercury/plan TimeOut: 257 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 is worse (10) than the previous plan generated (10), therefore we remove it Planner /planner/src/mercury/plan run 5 seconds **************************************************** *** Planner_path: --- OK. Match tree built with 78 nodes. PDDL problem description loaded: Domain: SOKOBAN-SEQUENTIAL Problem: P014-MICROBAN-SEQUENTIAL #Actions: 78 #Fluents: 62 Landmarks found: 2 Starting search with BFS(novel,land,h_add)... --[4294967295 / 16]-- --[1 / 16]-- --[1 / 13]-- --[1 / 11]-- --[1 / 9]-- --[1 / 7]-- --[1 / 5]-- --[1 / 3]-- --[1 / 2]-- --[1 / 1]-- --[1 / 0]-- --[0 / 0]-- Total time: 0.004 Nodes generated during search: 302 Nodes expanded during search: 141 Plan found with cost: 51 BFS search completed in 0.004 secs --- OK. Match tree built with 78 nodes. PDDL problem description loaded: Domain: SOKOBAN-SEQUENTIAL Problem: P014-MICROBAN-SEQUENTIAL #Actions: 78 #Fluents: 62 Landmarks found: 2 Starting search with IW (time budget is 60 secs)... Try allocate size: 0.000484375 MB Try allocate size: 0.000484375 MB Caption {#goals, #UNnachieved, #Achieved} -> IW(max_w) {2/2/0}:IW(1) -> [2][3][4][5][6][7][8][9][10]Try allocate size: 0.0300313 MB {2/2/0}:IW(2) -> [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26]Try allocate size: 0.000484375 MB {2/1/1}:IW(1) -> [2][3][4][5][6][7][8][9][10]Try allocate size: 0.0300313 MB {2/1/1}:IW(2) -> [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31]Try allocate size: 1.86194 MB {2/1/1}:IW(3) -> [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27]Try allocate size: 0.000484375 MB Plan found with cost: 51 Total time: 0.016 Nodes generated during search: 887 Nodes expanded during search: 842 IW search completed in 0.016 secs Skip the translate Skip the preprocess 3. Running search Dispatcher selected state size 1. This is a nonunit task. External time limit: 257 Internal time limit: 257 External memory limit: 7965671424 Internal memory limit: 7913242624 WARNING! elapsed_time not found -- assuming full time available. remaining time at start: 257.0 g bound: infinity next plan number: 1 remaining time: 256.98 config 0: relative time 330, remaining 1595 args: ['/planner/src/fdss-2/../search/downward-1', '--heuristic', 'h=ff(cost_type=1)', '--search', 'eager_greedy(h,preferred=h,cost_type=1,bound=infinity)', '--plan-file', '/home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1'] timeout: 53.17 Simplifying transitions... done! Conducting best first search without reopening closed nodes, (real) bound = 2147483647 Initializing FF heuristic... Initializing additive heuristic... Simplifying 314 unary operators... done! [314 unary operators] Best heuristic value: 9 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 8 [g=1, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 7 [g=2, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 6 [g=3, 4 evaluated, 3 expanded, t=0s] Best heuristic value: 5 [g=4, 5 evaluated, 4 expanded, t=0s] Best heuristic value: 4 [g=5, 7 evaluated, 5 expanded, t=0s] Best heuristic value: 3 [g=33, 57 evaluated, 44 expanded, t=0s] Best heuristic value: 2 [g=49, 112 evaluated, 86 expanded, t=0s] Best heuristic value: 1 [g=50, 114 evaluated, 87 expanded, t=0s] Best heuristic value: 0 [g=51, 115 evaluated, 88 expanded, t=0s] 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-3-4 dir-right (0) move player-01 pos-3-4 pos-3-5 dir-down (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: 9. Expanded 89 state(s). Reopened 0 state(s). Evaluated 115 state(s). Evaluations: 203 Generated 201 state(s). Dead ends: 10 state(s). Search space hash size: 115 Search space hash bucket count: 193 Search time: 0s Total time: 0s Solution found. Peak memory: 4080 KB returncode: 0 g bound: 10 next plan number: 2 remaining time: 256.96 config 0: relative time 330, remaining 1595 args: ['/planner/src/fdss-2/../search/downward-1', '--heuristic', 'h=ff(cost_type=2)', '--search', 'eager_greedy(h,preferred=h,cost_type=0,bound=10)', '--plan-file', '/home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.2'] timeout: 53.16 Simplifying transitions... done! Conducting best first search without reopening closed nodes, (real) bound = 10 Initializing FF heuristic... Initializing additive heuristic... Simplifying 314 unary operators... done! [314 unary operators] Best heuristic value: 13 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 12 [g=0, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 11 [g=0, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 10 [g=0, 4 evaluated, 3 expanded, t=0s] Best heuristic value: 9 [g=0, 5 evaluated, 4 expanded, t=0s] Best heuristic value: 8 [g=0, 7 evaluated, 5 expanded, t=0s] Best heuristic value: 7 [g=4, 57 evaluated, 46 expanded, t=0s] Best heuristic value: 6 [g=4, 58 evaluated, 47 expanded, t=0s] Best heuristic value: 5 [g=5, 59 evaluated, 48 expanded, t=0s] Best heuristic value: 4 [g=9, 94 evaluated, 71 expanded, t=0s] Best heuristic value: 3 [g=9, 95 evaluated, 72 expanded, t=0s] Best heuristic value: 2 [g=9, 97 evaluated, 73 expanded, t=0s] Completely explored state space -- no solution! Actual search time: 0s [t=0s] Initial state h value: 13. Expanded 164 state(s). Reopened 0 state(s). Evaluated 180 state(s). Evaluations: 344 Generated 365 state(s). Dead ends: 16 state(s). Search space hash size: 180 Search space hash bucket count: 193 Search time: 0s Total time: 0s Search stopped without finding a solution. Peak memory: 4080 KB returncode: 5 Build final config. Abort portfolio and run final config. g bound: 10 next plan number: 2 remaining time: 256.94 config 0: relative time 1, remaining 1 args: ['/planner/src/fdss-2/../search/downward-1', '--heuristic', 'h=ff(cost_type=2)', '--search', 'iterated([eager(single(sum([g(),weight(h,5)])),preferred=h,cost_type=0),eager(single(sum([g(),weight(h,3)])),preferred=h,cost_type=0),eager(single(sum([g(),weight(h,2)])),preferred=h,cost_type=0),eager(single(sum([g(),weight(h,1)])),preferred=h,cost_type=0)],bound=10,repeat_last=true,plan_counter=1)', '--plan-file', '/home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result'] timeout: 256.94 Simplifying transitions... done! Starting search: eager(single(sum(list(g, weight(h, 5)))), preferred = h, cost_type = 0) Conducting best first search without reopening closed nodes, (real) bound = 10 Initializing FF heuristic... Initializing additive heuristic... Simplifying 314 unary operators... done! [314 unary operators] Best heuristic value: 13 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 12 [g=0, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 11 [g=0, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 10 [g=0, 4 evaluated, 3 expanded, t=0s] Best heuristic value: 9 [g=0, 5 evaluated, 4 expanded, t=0s] Best heuristic value: 8 [g=0, 7 evaluated, 5 expanded, t=0s] Best heuristic value: 7 [g=4, 51 evaluated, 41 expanded, t=0s] Best heuristic value: 6 [g=4, 52 evaluated, 42 expanded, t=0s] Best heuristic value: 5 [g=5, 53 evaluated, 43 expanded, t=0s] Best heuristic value: 4 [g=9, 93 evaluated, 71 expanded, t=0s] Best heuristic value: 3 [g=9, 94 evaluated, 72 expanded, t=0s] Best heuristic value: 2 [g=9, 96 evaluated, 73 expanded, t=0s] Completely explored state space -- no solution! Actual search time: 0s [t=0s] Initial state h value: 13. Expanded 155 state(s). Reopened 0 state(s). Evaluated 169 state(s). Evaluations: 324 Generated 343 state(s). Dead ends: 14 state(s). Search space hash size: 169 Search space hash bucket count: 193 No solution found - stop searching Actual search time: 0s [t=0s] Cumulative statistics: Expanded 155 state(s). Reopened 0 state(s). Evaluated 169 state(s). Evaluations: 324 Generated 343 state(s). Dead ends: 0 state(s). Search time: 0s Total time: 0s Search stopped without finding a solution. Peak memory: 4080 KB returncode: 5 Exit codes: [0, 5, 5] run_portfolio /planner/src/fdss-2/../search/downward-seq-sat-fdss-2.py --plan-file /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result --- OK. Fluents=64 Operators=81 ================================================ ;; PROBE searching... ================================================ [0] [1] [2] [3] [4] Advancing to distance: 5 gn:0(0/5 nodes expanded so far) open: 5 [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [0] [0] [1] [2] [0] [1] [2] Advancing to distance: 3 gn:6(36/33 nodes expanded so far) open: 24 [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [0] [1] Advancing to distance: 2 gn:9(60/47 nodes expanded so far) open: 31 ================================================ ;; SOLUTION 1 ;; Plan cost: 10.000000, steps: 51 ;; Time: 0.008 ================================================ ================================================ ;; WA*, h_add_RP, w = 5.000, bound = 10.000 ================================================ ;; Minimum h value: 16.000 ;; Minimum h value: 14.000 ;; Minimum h value: 13.000 ;; Minimum h value: 12.000 ;; Minimum h value: 11.000 ;; Minimum h value: 10.000 ;; Minimum h value: 9.000 ;; Minimum h value: 7.000 ;; Minimum h value: 1.000 suboptimal yahsp search, threads : 32, teams : 2, strategy : 2 anytime behavior domain file : /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/domain.pddl problem file : /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/problem.pddl output file : /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result Parsing domain.................... done : 0.00 Parsing problem................... done : 0.00 domain : sokoban-sequential problem : p014-microban-sequential Instantiating operators........... done : 0.12 Creating initial structures....... done : 0.00 Computing bound................... done : 0.00 Refreshing structures............. done : 0.00 Finalizing structures............. done : 0.00 plan found : cost 10 -- search time 0.02 -- total time 0.15 Computed nodes : 993 Evaluated nodes : 363 Expanded nodes : 304 Evaluated nodes/sec : 6050.00 Search us time : 0.07 Search wc time : 0.02 Core utility : 40.30 Total us time : 0.19 Total wc time : 0.15 Skip the translate Skip the preprocess 3. Running search Dispatcher selected state size . This is a nonunit task. Failed to match magic word 'begin_variables'. Got ''. Peak memory: -1 KB 1. Running translator Second argument is a file name: use two translator arguments. Parsing... Parsing: [0.010s CPU, 0.008s wall-clock] Normalizing task... [0.000s CPU, 0.000s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.011s wall-clock] Preparing model... [0.000s CPU, 0.007s wall-clock] Generated 38 rules. Computing model... [0.100s CPU, 0.091s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.020s CPU, 0.017s wall-clock] Instantiating: [0.140s CPU, 0.131s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.020s CPU, 0.019s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.003s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 20 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.020s CPU, 0.025s 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.001s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.001s wall-clock] Translating task: [0.010s CPU, 0.015s 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.010s CPU, 0.003s 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: 101724 KB Writing output... [0.020s CPU, 0.023s wall-clock] Done! [0.210s CPU, 0.208s 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 /planner/src/mercury/src/search/downward < output ipc seq-sat-mercury --plan-file /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result 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: 0.000253366s 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: 0.000263575s 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: 9/1 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 8/1 [g=1, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 7/1 [g=2, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 6/1 [g=3, 4 evaluated, 3 expanded, t=0s] Best heuristic value: 5/1 [g=4, 5 evaluated, 4 expanded, t=0s] Best heuristic value: 4/1 [g=5, 6 evaluated, 5 expanded, t=0s] Best heuristic value: 3/1 [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: 9/1. 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=0.02s] Best heuristic value: 3/1 [g=9, 106 evaluated, 93 expanded, t=0.02s] Best heuristic value: 2/1 [g=9, 109 evaluated, 96 expanded, t=0.02s] Best heuristic value: 1/1 [g=9, 110 evaluated, 97 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0.02s [t=0.02s] 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=0.02s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0.02s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0.02s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0.02s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0.02s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0.02s] Best heuristic value: 3/2 [g=4, 49 evaluated, 43 expanded, t=0.02s] Best heuristic value: 3/1 [g=9, 106 evaluated, 93 expanded, t=0.02s] Best heuristic value: 2/1 [g=9, 109 evaluated, 96 expanded, t=0.02s] Best heuristic value: 1/1 [g=9, 110 evaluated, 97 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0s [t=0.02s] 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.02s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0.02s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0.02s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0.02s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0.02s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0.02s] Best heuristic value: 3/2 [g=4, 49 evaluated, 43 expanded, t=0.02s] Best heuristic value: 3/1 [g=9, 119 evaluated, 106 expanded, 11 reopened, t=0.02s] Best heuristic value: 2/1 [g=9, 122 evaluated, 109 expanded, 11 reopened, t=0.02s] Best heuristic value: 1/1 [g=9, 123 evaluated, 110 expanded, 11 reopened, t=0.02s] Completely explored state space -- no solution! Actual search time: 0.02s [t=0.04s] 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.04s] Best heuristic value: 8/2 [g=0, 2 evaluated, 1 expanded, t=0.04s] Best heuristic value: 7/2 [g=0, 3 evaluated, 2 expanded, t=0.04s] Best heuristic value: 6/2 [g=0, 4 evaluated, 3 expanded, t=0.04s] Best heuristic value: 5/2 [g=0, 5 evaluated, 4 expanded, t=0.04s] Best heuristic value: 4/2 [g=0, 6 evaluated, 5 expanded, t=0.04s] Best heuristic value: 3/2 [g=4, 62 evaluated, 56 expanded, t=0.04s] Best heuristic value: 3/1 [g=9, 115 evaluated, 102 expanded, t=0.04s] Best heuristic value: 2/1 [g=9, 118 evaluated, 105 expanded, t=0.04s] Best heuristic value: 1/1 [g=9, 119 evaluated, 106 expanded, t=0.04s] Completely explored state space -- no solution! Actual search time: 0s [t=0.04s] 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.04s [t=0.04s] 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.04s Total time: 0.04s Solution found. Peak memory: 3864 KB --- OK. Match tree built with 78 nodes. PDDL problem description loaded: Domain: SOKOBAN-SEQUENTIAL Problem: P014-MICROBAN-SEQUENTIAL #Actions: 78 #Fluents: 62 Landmarks found: 2 Starting search with BFS(novel,land,h_add)... --[4294967295 / 16]-- --[1 / 16]-- --[1 / 13]-- --[1 / 11]-- --[1 / 9]-- --[1 / 7]-- --[1 / 5]-- --[1 / 3]-- --[1 / 2]-- --[1 / 1]-- --[1 / 0]-- --[0 / 0]-- Total time: 0.004 Nodes generated during search: 302 Nodes expanded during search: 141 Plan found with cost: 51 BFS search completed in 0.004 secs /planner/src/bfs-f/plan TimeOut: 257 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result is worse (10) than the previous plan generated (10), therefore we remove it Planner /planner/src/bfs-f/plan run 5 seconds **************************************************** *** Planner_path: /planner/src/siw/plan TimeOut: 257 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result is worse (10) than the previous plan generated (10), therefore we remove it Planner /planner/src/siw/plan run 5 seconds **************************************************** *** Planner_path: /planner/src/fdss-2/plan TimeOut: 257 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 is worse (10) than the previous plan generated (10), therefore we remove it Planner /planner/src/fdss-2/plan run 5 seconds **************************************************** *** Planner_path: /planner/src/probe/plan TimeOut: 257 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 is worse (10) than the previous plan generated (10), therefore we remove it Planner /planner/src/probe/plan run 40 seconds **************************************************** *** Planner_path: /planner/src/yahsp2-mt/plan TimeOut: 257 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 ERROR: Plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 is not valid or the plan cost is equal to -1, therefore we remove it Planner /planner/src/yahsp2-mt/plan run 5 seconds First Step -- Main portfolio runs 0.0394444444444 seconds 71.0 1800 True True Original_Domain: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/domain.pddl Original_Problem: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/problem.pddl Original_Plan_file: sas_plan Plans folder: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny **************************************************** *** Planner_path: /planner/src/jasper/plan TimeOut: 1729 *** **************************************************** Planner /planner/src/jasper/plan run 5 seconds **************************************************** *** Planner_path: /planner/src/mercury/plan TimeOut: 1729 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 is worse (10) than the previous plan generated (10), therefore we remove it Planner /planner/src/mercury/plan run 5 seconds **************************************************** *** Planner_path: /planner/src/bfs-f/plan TimeOut: 1729 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result ERROR: El plan /home/linuxbuilds --- OK. Match tree built with 78 nodes. PDDL problem description loaded: Domain: SOKOBAN-SEQUENTIAL Problem: P014-MICROBAN-SEQUENTIAL #Actions: 78 #Fluents: 62 Landmarks found: 2 Starting search with IW (time budget is 60 secs)... Try allocate size: 0.000484375 MB Try allocate size: 0.000484375 MB Caption {#goals, #UNnachieved, #Achieved} -> IW(max_w) {2/2/0}:IW(1) -> [2][3][4][5][6][7][8][9][10]Try allocate size: 0.0300313 MB {2/2/0}:IW(2) -> [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26]Try allocate size: 0.000484375 MB {2/1/1}:IW(1) -> [2][3][4][5][6][7][8][9][10]Try allocate size: 0.0300313 MB {2/1/1}:IW(2) -> [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30][31]Try allocate size: 1.86194 MB {2/1/1}:IW(3) -> [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27]Try allocate size: 0.000484375 MB Plan found with cost: 51 Total time: 0.016 Nodes generated during search: 887 Nodes expanded during search: 842 IW search completed in 0.016 secs Skip the translate Skip the preprocess 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: 0.00021337s Discovered 3 landmarks, of which 0 are disjunctive and 0 are conjunctive 1 edges Initializing LAMA-FF Synergy Object 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: 0.000195396s Discovered 3 landmarks, of which 0 are disjunctive and 0 are conjunctive 1 edges Initializing LAMA-FF Synergy Object Initializing landmarks count heuristic... 2 initial landmarks, 2 goal landmarks Starting search: lazy_greedy(list(hff1, hlm1), preferred = list(hff1, hlm1), cost_type = 1, reopen_closed = false) Conducting lazy best first search, (real) bound = 2147483647 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] Best heuristic value: 1/2 [g=49, 99 evaluated, 86 expanded, t=0s] Best heuristic value: 1/1 [g=50, 100 evaluated, 87 expanded, t=0s] 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 88 state(s). Reopened 0 state(s). Evaluated 101 state(s). Evaluations: 202 Generated 206 state(s). Dead ends: 12 state(s). Best solution cost so far: 10 Solution found - keep searching Starting search: lazy_greedy(list(hff2, hlm2), preferred = list(hff2, hlm2), reopen_closed = false) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0s] Best heuristic value: 1/5 [g=9, 82 evaluated, 72 expanded, t=0s] Best heuristic value: 1/4 [g=9, 84 evaluated, 74 expanded, t=0s] Best heuristic value: 1/3 [g=9, 85 evaluated, 75 expanded, t=0s] Best heuristic value: 1/2 [g=9, 86 evaluated, 76 expanded, t=0s] Completely explored state space -- no solution! Actual search time: 0s [t=0s] Initial state h value: 2/13. 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(hff2, hlm2), preferred = list(hff2, hlm2), w = 5) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.02s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.02s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.02s] Best heuristic value: 1/5 [g=9, 84 evaluated, 74 expanded, t=0.02s] Best heuristic value: 1/4 [g=9, 86 evaluated, 76 expanded, t=0.02s] Best heuristic value: 1/3 [g=9, 87 evaluated, 77 expanded, t=0.02s] Best heuristic value: 1/2 [g=9, 88 evaluated, 78 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0.02s [t=0.02s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Dead ends: 16 state(s). Best solution cost so far: 10 No solution found - keep searching Starting search: lazy_wastar(list(hff2, hlm2), preferred = list(hff2, hlm2), w = 3) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.02s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.02s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.02s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.02s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.02s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.02s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.02s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.02s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.02s] Best heuristic value: 1/5 [g=9, 84 evaluated, 74 expanded, t=0.02s] Best heuristic value: 1/4 [g=9, 86 evaluated, 76 expanded, t=0.02s] Best heuristic value: 1/3 [g=9, 87 evaluated, 77 expanded, t=0.02s] Best heuristic value: 1/2 [g=9, 88 evaluated, 78 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0s [t=0.02s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Dead ends: 16 state(s). Best solution cost so far: 10 No solution found - keep searching Starting search: lazy_wastar(list(hff2, hlm2), preferred = list(hff2, hlm2), w = 2) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.02s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.02s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.02s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.02s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.02s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.02s] Best heuristic value: 2/7 [g=4, 54 evaluated, 48 expanded, t=0.02s] Best heuristic value: 2/6 [g=4, 55 evaluated, 49 expanded, t=0.02s] Best heuristic value: 2/5 [g=5, 56 evaluated, 50 expanded, t=0.02s] Best heuristic value: 1/5 [g=9, 84 evaluated, 74 expanded, t=0.02s] Best heuristic value: 1/4 [g=9, 86 evaluated, 76 expanded, t=0.02s] Best heuristic value: 1/3 [g=9, 87 evaluated, 77 expanded, t=0.02s] Best heuristic value: 1/2 [g=9, 88 evaluated, 78 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0s [t=0.02s] Initial state h value: 2/13. Expanded 169 state(s). Reopened 5 state(s). Evaluated 185 state(s). Evaluations: 370 Generated 380 state(s). Dead ends: 16 state(s). Best solution cost so far: 10 No solution found - keep searching Starting search: lazy_wastar(list(hff2, hlm2), preferred = list(hff2, hlm2), w = 1) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 2/13 [g=0, 1 evaluated, 0 expanded, t=0.02s] Best heuristic value: 2/12 [g=0, 2 evaluated, 1 expanded, t=0.02s] Best heuristic value: 2/11 [g=0, 3 evaluated, 2 expanded, t=0.02s] Best heuristic value: 2/10 [g=0, 4 evaluated, 3 expanded, t=0.02s] Best heuristic value: 2/9 [g=0, 5 evaluated, 4 expanded, t=0.02s] Best heuristic value: 2/8 [g=0, 6 evaluated, 5 expanded, t=0.02s] Best heuristic value: 2/7 [g=3, 57 evaluated, 51 expanded, t=0.02s] Best heuristic value: 2/6 [g=4, 58 evaluated, 52 expanded, t=0.02s] Best heuristic value: 2/5 [g=5, 74 evaluated, 67 expanded, t=0.02s] Best heuristic value: 1/5 [g=9, 111 evaluated, 98 expanded, t=0.02s] Best heuristic value: 1/4 [g=9, 113 evaluated, 100 expanded, t=0.02s] Best heuristic value: 1/3 [g=9, 114 evaluated, 101 expanded, t=0.02s] Best heuristic value: 1/2 [g=9, 115 evaluated, 102 expanded, t=0.02s] Completely explored state space -- no solution! Actual search time: 0.02s [t=0.04s] Initial state h value: 2/13. Expanded 165 state(s). Reopened 1 state(s). Evaluated 181 state(s). Evaluations: 362 Generated 371 state(s). Dead ends: 16 state(s). Best solution cost so far: 10 No solution found - keep searching Actual search time: 0.04s [t=0.04s] Cumulative statistics: Expanded 924 state(s). Reopened 16 state(s). Evaluated 1017 state(s). Evaluations: 2034 Generated 2086 state(s). Dead ends: 0 state(s). Search time: 0.04s Total time: 0.04s Solution found. Peak memory: 4212 KB 1. Running translator Parsing... [0.000s CPU, 0.003s wall-clock] Instantiating... Normalizing task... [0.000s CPU, 0.000s wall-clock] Generating Datalog program... [0.000s CPU, 0.001s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.000s CPU, 0.004s wall-clock] Preparing model... [0.000s CPU, 0.001s wall-clock] Generated 38 rules. Computing model... [0.020s CPU, 0.016s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.010s CPU, 0.007s wall-clock] Instantiating: [0.030s CPU, 0.029s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates [0.000s CPU, 0.001s 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.003s 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] 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.004s wall-clock] 0 implied effects removed 34 effect conditions simplified 0 implied preconditions added Building mutex information... [0.000s CPU, 0.000s wall-clock] Detecting unreachable propositions... 0 operators removed 7 propositions removed Detecting unreachable propositions: [0.000s CPU, 0.001s wall-clock] Writing translation key... [0.000s CPU, 0.000s wall-clock] Writing mutex key... [0.000s CPU, 0.001s wall-clock] Writing output... [0.000s CPU, 0.001s wall-clock] Done! [0.040s CPU, 0.044s wall-clock] 2. Running preprocessor Building causal graph... The causal graph is not acyclic. 21 variables of 21 necessary 78 of 78 operators necessary. 0 of 0 axiom rules necessary. Building domain transition graphs... solveable in poly time 0 Building successor generator... Writing output... done 3. Running search Simplifying transitions... done! Initializing HSP/FF heuristic... Reading invariants from file... done Generating landmarks using the RPG/SAS+ approach approx. reasonable orders approx. obedient reasonable orders Removed 0 reasonable or obedient reasonable orders Generated 3 landmarks, of which 0 are disjunctive 1 edges 2 initial landmarks, 2 goal landmarks Landmarks generation time: 0 seconds Randomizing search (where applicable), with seed: 2011 Search iteration 1 Using the following heuristic(s): FF heuristic with preferred operators Landmark heuristic with preferred operators Initializing HSP/FF heuristic... Initializing landmarks count heuristic... Conducting best first search. Best heuristic value: 2/15 [expanded 1 state(s)] Best heuristic value: 2/12 [expanded 2 state(s)] Best heuristic value: 2/11 [expanded 3 state(s)] Best heuristic value: 2/10 [expanded 4 state(s)] Best heuristic value: 2/9 [expanded 5 state(s)] Best heuristic value: 2/8 [expanded 6 state(s)] Best heuristic value: 2/7 [expanded 52 state(s)] Best heuristic value: 2/6 [expanded 53 state(s)] Best heuristic value: 2/5 [expanded 54 state(s)] Best heuristic value: 1/5 [expanded 77 state(s)] Best heuristic value: 1/4 [expanded 79 state(s)] Best heuristic value: 1/3 [expanded 80 state(s)] Best heuristic value: 1/2 [expanded 81 state(s)] Solution found! 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), cost: 10. Expanded 82 state(s). Generated 170 state(s). Search time: 0 seconds Total time: 0 seconds Search iteration 2 Using the following heuristic(s): FF heuristic with preferred operators Landmark heuristic with preferred operators Initializing landmarks count heuristic... Conducting weighted A* search, weight is 5, bound is 10. Best heuristic value: 2/13 [expanded 1 state(s)] Best heuristic value: 2/12 [expanded 2 state(s)] Best heuristic value: 2/10 [expanded 4 state(s)] Best heuristic value: 2/9 [expanded 5 state(s)] Best heuristic value: 2/8 [expanded 6 state(s)] Best heuristic value: 2/7 [expanded 52 state(s)] Best heuristic value: 2/6 [expanded 53 state(s)] Best heuristic value: 2/5 [expanded 60 state(s)] Best heuristic value: 1/5 [expanded 115 state(s)] Best heuristic value: 1/4 [expanded 117 state(s)] Best heuristic value: 1/3 [expanded 118 state(s)] Best heuristic value: 1/2 [expanded 119 state(s)] Completely explored state space -- no solution! Expanded 180 state(s). Generated 380 state(s). Search time: 0.01 seconds Total time: 0.01 seconds 3. Running search MRW Param 0: Walk Type: MHA Heuristic: FD FF Step Type: STATE Extending Rate: 1.5 Length Walk: 10 Alpha: 0.9 Extending Period: 0.1 Walk Bias Temp: 10 Num Walks: 2000 Jump Length: 10 Max Steps: 7 Bounding Factor: 0.9 Deepening: true Tie-breaking: false Conservative Steps: false solution_bounding: g_prunning Length STDev: 0 MRW Param 1: Walk Type: MDA Heuristic: FD FF Step Type: STATE Extending Rate: 2 Length Walk: 1 Alpha: 0.9 Extending Period: 0.1 Walk Bias Temp: 0.5 Num Walks: 2000 Jump Length: 1 Max Steps: 7 Bounding Factor: 0.9 Deepening: true Tie-breaking: false Conservative Steps: false solution_bounding: g_prunning Length STDev: 0 MRW Param 2: Walk Type: MHA Heuristic: FD FF Step Type: STATE Extending Rate: 1.5 Length Walk: 1 Alpha: 0.9 Extending Period: 0.1 Walk Bias Temp: 10 Num Walks: 2000 Jump Length: 1 Max Steps: 7 Bounding Factor: 0.9 Deepening: true Tie-breaking: false Conservative Steps: false solution_bounding: g_prunning Length STDev: 0 Shared MRW Parameters: SMART Pool Size: 50 Activation Level: 50 Iterative search: true UCB Constant Value: 0.5 Use Aras: true regression graph: true Aras Memory Limit: 2000000 Aras Time Limit: NONE seed: 2011 Simplifying transitions... done! UCB Constant: 0.5 Initializing HSP/FF heuristic... Simplifying 314 unary operators... done! [314 unary operators] MRW ... Initial heuristic value from heuristic Plan Validated Total time: 34.86s cost: 10. build regression graph: true Initial plan size: 337 Initial plan cost: 10 After action elimination Plan size: 53 plan cost: 10 Plan Validated Plan Validated Step: 0 n: 1000 Plan_size: 55 Plan_cost: 10 Iteration_Time: 0.03s Total_Time: 34.89s Size: 1046 Number_goals: 14 Memory usage: 363 Plan Validated Step: 1 n: 2000 Plan_size: 55 Plan_cost: 10 Iteration_Time: 0.05s Total_Time: 34.94s Size: 1304 Number_goals: 14 Memory usage: 443 Plan Validated Step: 2 n: 4000 Plan_size: 55 Plan_cost: 10 Iteration_Time: 0.05s Total_Time: 34.99s Size: 1414 Number_goals: 14 Memory usage: 479 Plan Validated Step: 3 n: 8000 Plan_size: 55 Plan_cost: 10 Iteration_Time: 0.06s Total_Time: 35.05s Size: 1414 Number_goals: 14 Memory usage: 479 Neighborhood graph does not grow any more lave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result is worse (10) than the previous plan generated (10), therefore we remove it Planner /planner/src/bfs-f/plan run 5 seconds **************************************************** *** Planner_path: /planner/src/siw/plan TimeOut: 1729 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result is worse (10) than the previous plan generated (10), therefore we remove it Planner /planner/src/siw/plan run 5 seconds Second Step portfolio plus default planner run 91.0 seconds (in total) *** Planner List *** lama-2011 1709 lamar 1709 arvand 1709 *** end planner list *** Original_Domain: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/domain.pddl Original_Problem: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/problem.pddl Modified_Domain: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/domain_ready.txt Modified_Problem: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/problem_ready.txt Original_Plan_file: sas_plan Plans folder: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny **************************************************** *** Planner_path: /planner/src/lama-2011/plan TimeOut: 1709 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 is worse (10) than the previous plan generated (10), therefore we remove it Planner /planner/src/lama-2011/plan run 5 seconds **************************************************** *** Planner_path: /planner/src/lamar/plan TimeOut: 1709 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 is worse (10) than the previous plan generated (10), therefore we remove it Planner /planner/src/lamar/plan run 5 seconds **************************************************** *** Planner_path: /planner/src/arvand/plan TimeOut: 1709 *** **************************************************** Name: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 ERROR: El plan /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/cleaned_result.result.1 is worse (10) than the previous plan generated (10), therefore we remove it Planner /planner/src/arvand/plan run 1710 seconds The portfolio runs 1811.0 seconds -------------------- END -------------------- Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp7c2bny/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/tmp7c2bny/sas_plan.1 10