INFO Running translator. INFO translator input: ['domain.pddl', 'problem.pddl'] INFO translator arguments: [] INFO translator time limit: 1799.9s INFO translator memory limit: 8192 MB INFO callstring: /usr/bin/python /planner/builds/release64/bin/translate/translate.py domain.pddl problem.pddl time limit 1799.90 -> (1800, 1801) Parsing... Parsing: [0.010s CPU, 0.005s wall-clock] Normalizing task... [0.000s CPU, 0.000s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.001s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.000s CPU, 0.005s wall-clock] Preparing model... [0.000s CPU, 0.002s wall-clock] Generated 38 rules. Computing model... [0.010s CPU, 0.012s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.010s CPU, 0.006s wall-clock] Instantiating: [0.020s CPU, 0.027s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.000s CPU, 0.007s wall-clock] Checking invariant weight... [0.000s CPU, 0.000s wall-clock] Instantiating groups... [0.010s 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.010s CPU, 0.010s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.000s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.000s wall-clock] Translating task: [0.010s CPU, 0.007s wall-clock] 112 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 7 propositions removed Detecting unreachable propositions: [0.010s CPU, 0.003s wall-clock] Reordering and filtering variables... 21 of 21 variables necessary. 16 of 19 mutex groups necessary. 78 of 78 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.000s CPU, 0.001s wall-clock] Translator variables: 21 Translator derived variables: 0 Translator facts: 80 Translator goal facts: 2 Translator mutex groups: 16 Translator total mutex groups size: 60 Translator operators: 78 Translator axioms: 0 Translator task size: 751 Translator peak memory: 25312 KB Writing output... [0.000s CPU, 0.001s wall-clock] Done! [0.060s CPU, 0.056s wall-clock] INFO Run task transformation (/planner/builds/release64/bin/preprocess). INFO callstring: /planner/builds/release64/bin/preprocess < output.sas Building causal graph... The causal graph is not acyclic. 21 variables of 21 necessary 16 of 16 mutex groups necessary. 78 of 78 operators necessary. 0 of 0 axiom rules necessary. Initializing mutex computation... Mutex computation initialized with 80 fluents. iteration for mutex detection and operator pruning Initialize m_index fw Initialized mvalues forward: reached=441, notReached=5147, spurious=812 Initialize m_ops fw Computing mutexes... Mutex computation finished with reached=5294, notReached=294, spurious=812 0 operators are spurious because were not triggered H^2 mutexes added fw: 294, unreachable: 0 0 of 78 operators detected as spurious iteration for mutex detection and operator pruning Initialize m_index bw Init values regression Initialized mvalues backward: reached=2427, notReached=2867, spurious=1106 Initialize m_ops bw Computing mutexes... Mutex computation finished with reached=3439, notReached=1855, spurious=1106 24 operators are spurious because were not triggered Unreachable proposition: Atom at(stone-01, pos-2-2) Unreachable proposition: Atom at(stone-01, pos-2-3) Unreachable proposition: Atom at(stone-01, pos-2-5) Unreachable proposition: Atom at(stone-01, pos-3-2) Unreachable proposition: Atom at(stone-01, pos-4-2) Unreachable proposition: Atom at(stone-01, pos-4-5) Unreachable proposition: Atom at(stone-01, pos-5-2) Unreachable proposition: Atom at(stone-01, pos-6-2) Unreachable proposition: Atom at(stone-01, pos-6-4) Unreachable proposition: Atom at(stone-02, pos-2-2) Unreachable proposition: Atom at(stone-02, pos-2-5) Unreachable proposition: Atom at(stone-02, pos-3-2) Unreachable proposition: Atom at(stone-02, pos-4-2) Unreachable proposition: Atom at(stone-02, pos-4-5) Unreachable proposition: Atom at(stone-02, pos-5-2) Unreachable proposition: Atom at(stone-02, pos-6-2) Unreachable proposition: Atom at(stone-02, pos-6-4) H^2 mutexes added bw: 4, unreachable: 17 3 of 54 operators detected as spurious iteration for mutex detection and operator pruning Initialize m_index fw Initialized mvalues forward: reached=441, notReached=2998, spurious=2961 Initialize m_ops fw Computing mutexes... Mutex computation finished with reached=2909, notReached=530, spurious=2961 0 operators are spurious because were not triggered Unreachable proposition: Atom at(stone-01, pos-2-4) Unreachable proposition: Atom at(stone-02, pos-4-3) H^2 mutexes added fw: 336, unreachable: 2 0 of 51 operators detected as spurious iteration for mutex detection and operator pruning Initialize m_index bw Init values regression Initialized mvalues backward: reached=1856, notReached=1053, spurious=3491 Initialize m_ops bw Computing mutexes... Mutex computation finished with reached=2909, notReached=0, spurious=3491 0 operators are spurious because were not triggered H^2 mutexes added bw: 0, unreachable: 0 0 of 51 operators detected as spurious Total mutex and disambiguation time: 0.005952 iterations: 4 333 of 333 mutex groups necessary. 51 of 78 operators necessary. 0 of 0 axiom rules necessary. Change id of operators: 51 Change id of mutexes Change id of goals Change id of initial state Remove unreachable facts from variables: 21 231 of 333 mutex groups necessary. 51 of 51 operators necessary. 0 of 0 axiom rules necessary. Updating causal graph and pruning unnecessary facts 21 variables of 21 of 21 necessary The causal graph is not acyclic. 21 variables of 21 necessary 231 of 231 mutex groups necessary. 51 of 51 operators necessary. 0 of 0 axiom rules necessary. Building domain transition graphs... solveable in poly time 0 Building successor generator... Preprocessor variables: 21 Preprocessor facts: 61 Preprocessor derived variables: 0 Preprocessor operators: 51 Preprocessor mutex groups: 231 Preprocessor task size: 900 Writing output... done INFO Running search (release64). INFO search input: output.sas INFO search arguments: ['--symmetries', 'sym=structural_symmetries(search_symmetries=dks)', '--search', 'astar(max([celmcut,lmcount(lm_factory=lm_merged([lm_rhw,lm_hm(m=1)]),admissible=true,transform=multiply_out_conditional_effects)]),symmetries=sym,pruning=stubborn_sets_simple(minimum_pruning_ratio=0.01),num_por_probes=1000)'] INFO search time limit: 1799.77s INFO search memory limit: 7744 MB INFO search executable: /planner/builds/release64/bin/downward INFO callstring: /planner/builds/release64/bin/downward --symmetries 'sym=structural_symmetries(search_symmetries=dks)' --search 'astar(max([celmcut,lmcount(lm_factory=lm_merged([lm_rhw,lm_hm(m=1)]),admissible=true,transform=multiply_out_conditional_effects)]),symmetries=sym,pruning=stubborn_sets_simple(minimum_pruning_ratio=0.01),num_por_probes=1000)' --internal-plan-file sas_plan < output.sas time limit 1799.77 -> (1800, 1801) reading input... [t=2.9053e-05s] done reading input! [t=0.000885165s] packing state variables...done! [t=0.000895304s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000975624s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.9831e-05s done initializing global data [t=0.00100727s] Initializing landmark cut heuristic... Initializing Exploration... Initializing landmarks count heuristic... Merging 2 landmark graphs Generating landmarks using the RPG/SAS+ approach Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.000792285s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges h^m landmarks m=1 Using 61 P^m fluents. Level 1 completed. Level 2 completed. Level 3 completed. Level 4 completed. Level 5 completed. Level 6 completed. Level 7 completed. Level 8 completed. Level 9 completed. Level 10 completed. Level 11 completed. Level 12 completed. Level 13 completed. Level 14 completed. Level 15 completed. Level 16 completed. Level 17 completed. Level 18 completed. h^m landmarks computed. Removed 0 reasonable or obedient reasonable orders Calculating achievers. Landmarks generation time: 0.000323357s Discovered 32 landmarks, of which 0 are disjunctive and 0 are conjunctive 63 edges Adding simple landmarks Adding disjunctive landmarks Adding orderings Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.00152186s Discovered 35 landmarks, of which 0 are disjunctive and 0 are conjunctive 160 edges Initializing symmetries (eager search) Initializing symmetries Using Bliss to find group generators Done initializing symmetries: 9.0535e-05s Number of generators: 0 Number of identity generators (on states, not on operators): 0 Order of generators: [] Conducting best first search with reopening closed nodes, (real) bound = 2147483647 19 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lm_factory = lm_merged(list(lm_rhw, lm_hm(m = 1))), admissible = true, transform = multiply_out_conditional_effects): 3 New best heuristic value for celmcut: 3 [g=0, 1 evaluated, 0 expanded, t=0.0031334s, 5092 KB] f = 3 [1 evaluated, 0 expanded, t=0.00316672s, 5092 KB] Initial heuristic value for lmcount(lm_factory = lm_merged(list(lm_rhw, lm_hm(m = 1))), admissible = true, transform = multiply_out_conditional_effects): 3 Initial heuristic value for celmcut: 3 pruning method: stubborn sets simple f = 4 [15 evaluated, 14 expanded, t=0.00349725s, 5092 KB] New best heuristic value for lmcount(lm_factory = lm_merged(list(lm_rhw, lm_hm(m = 1))), admissible = true, transform = multiply_out_conditional_effects): 2 [g=2, 29 evaluated, 28 expanded, t=0.00371784s, 5092 KB] f = 5 [29 evaluated, 28 expanded, t=0.00374602s, 5092 KB] f = 6 [43 evaluated, 42 expanded, t=0.00396033s, 5092 KB] New best heuristic value for celmcut: 2 [g=4, 45 evaluated, 43 expanded, t=0.00401486s, 5092 KB] New best heuristic value for lmcount(lm_factory = lm_merged(list(lm_rhw, lm_hm(m = 1))), admissible = true, transform = multiply_out_conditional_effects): 1 [g=5, 59 evaluated, 54 expanded, t=0.00424183s, 5092 KB] f = 7 [73 evaluated, 70 expanded, t=0.00445945s, 5092 KB] f = 8 [96 evaluated, 94 expanded, t=0.00477131s, 5092 KB] f = 9 [119 evaluated, 117 expanded, t=0.0051466s, 5092 KB] f = 10 [133 evaluated, 131 expanded, t=0.00538585s, 5092 KB] New best heuristic value for celmcut: 1 [g=9, 140 evaluated, 134 expanded, t=0.00549177s, 5092 KB] New best heuristic value for lmcount(lm_factory = lm_merged(list(lm_rhw, lm_hm(m = 1))), admissible = true, transform = multiply_out_conditional_effects): 0 New best heuristic value for celmcut: 0 [g=10, 154 evaluated, 146 expanded, t=0.00565797s, 5092 KB] Solution found! Actual search time: 0.00240472s [t=0.0056893s] 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 Expanded 147 state(s). Reopened 0 state(s). Evaluated 154 state(s). Evaluations: 308 Generated 313 state(s). Dead ends: 0 state(s). Expanded until last jump: 131 state(s). Reopened until last jump: 0 state(s). Evaluated until last jump: 133 state(s). Generated until last jump: 277 state(s). Number of registered states: 154 total successors before partial-order reduction: 313 total successors after partial-order reduction: 313 Search time: 0.00259327s Total time: 0.00569196s Solution found. Peak memory: 5092 KB Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp6gTgWK/sas_plan Plan executed successfully - checking goal Plan valid Final value: 10 Successful plans: Value: 10 /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp6gTgWK/sas_plan 10