INFO Running translator. INFO translator input: ['domain.pddl', 'problem.pddl'] INFO translator arguments: [] INFO translator time limit: 1799.93s 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.93 -> (1800, 1801) Parsing... Parsing: [0.000s CPU, 0.004s wall-clock] Normalizing task... [0.000s CPU, 0.000s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.001s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.003s wall-clock] Preparing model... [0.000s CPU, 0.002s wall-clock] Generated 38 rules. Computing model... [0.000s CPU, 0.010s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.010s CPU, 0.005s wall-clock] Instantiating: [0.020s CPU, 0.021s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.010s CPU, 0.005s wall-clock] Checking invariant weight... [0.000s CPU, 0.000s wall-clock] Instantiating groups... [0.000s 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.008s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.000s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.000s wall-clock] Translating task: [0.000s CPU, 0.006s 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.002s 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: 25560 KB Writing output... [0.000s CPU, 0.001s wall-clock] Done! [0.040s CPU, 0.043s wall-clock] INFO Running preprocessor (release64). INFO preprocessor input: output.sas INFO preprocessor arguments: [] INFO preprocessor time limit: 1799.85s INFO preprocessor memory limit: 8192 MB INFO callstring: /planner/builds/release64/bin/preprocess < output.sas time limit 1799.85 -> (1800, 1801) 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. 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.005774 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... Preprocessor peak memory: 2496 KB done INFO Running search (release64). INFO search input: output INFO search arguments: ['--search', 'astar(modular_pdb(modular_rbp(time_limit=200),rand_walk(time_limit=10),900,pdb_factory=modular_symbolic,create_perimeter=true))'] INFO search time limit: 1799.83s INFO search memory limit: 8192 MB INFO search executable: /planner/builds/release64/bin/downward INFO callstring: /planner/builds/release64/bin/downward --search 'astar(modular_pdb(modular_rbp(time_limit=200),rand_walk(time_limit=10),900,pdb_factory=modular_symbolic,create_perimeter=true))' --internal-plan-file sas_plan < output time limit 1799.83 -> (1800, 1801) reading input... [t=0.00225774s] done reading input! [t=0.0032532s] packing state variables...done! [t=0.00326185s] Variables: 21 Facts: 61 Bytes per state: 4 Building successor generator...done! [t=0.00337345s] done initalizing global data [t=0.00337703s] building causal graph...done! [t=0.000115563s] Sym variable order: 7 4 9 5 19 13 16 15 14 18 17 11 20 12 8 6 10 3 0 2 1 Initializing Symbolic Variables Num variables: 21 => 27 Initialize Symbolic Manager(54, 296296, 16000000, 0) Generating binary variables Symbolic Variables... Done. hello modular_RBP hello EvaluatorRandWalk Sym variable order: 1 2 0 10 6 3 8 12 20 18 17 11 14 15 16 19 13 5 9 4 7 Initializing Symbolic Variables Num variables: 21 => 27 Initialize Symbolic Manager(54, 296296, 16000000, 0) Generating binary variables Symbolic Variables... Done. Hi modular_v1 modular_time_limit:900 terminate_creation:0 pdb_type:symbolic only_gamer:0 only_CBP:0 hello GamerStyle pattern selection! overall_num_goals:2 after goals_choice initial_pdb_size:1e+09 initial pdb type:symbolic num_vars:21 PatternCollectionGeneratorRBP::num_vars:21 Overall problem size:8.38861e+07 starting with a max_single_PDB_size of:8 because PDB_factory issymbolic starting with a min_single_PDB_size of:4 starting with a pdb_gen_time_limit of:5 because PDB_factory issymbolic Gamer, initial pattern made of all goals:,19,20 initial candidate_pattern for Gamer-Style selection, candidate_vars:9 Initial Gamer PDB:[19,20,] initial avg_h for Gamer-Style:1.1875initial h value for Gamer-Style:1 First call to check_improv,initial avg_h:1.1875 temp_pattern.size:21,num_vars:21 overall_problem_size:8.38861e+07 seeding with creating_perimeter,time:0.543637s perimeter PC:[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,] Solution found with cost 10 total time: 0.549534s Marking Perimeter as solved First call, pdbs empty First call, max_additive_subsets empty adding :[ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20] non_dead_ends:0 mergeBucketDeadEnds time:1.34298e-06 Perimeter solved the problem! seeding with creating_perimeter finished,time:0.551875s,h_val:10 Solution found while generating PDB candidate of type:symbolic, adding PDB and exiting generation at time0.551877 prev pdbs:1 prev max_additive_subsets::1 adding :[ 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20] pruning method: none Conducting best first search with reopening closed nodes, (real) bound = 2147483647 initial state children:1 New best heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 10 [g=0, 1 evaluated, 0 expanded, t=0.551962s, 995780 KB] f = 10 [1 evaluated, 0 expanded, t=0.55202s, 995780 KB] Initial heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 10 New best heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 9 [g=1, 15 evaluated, 12 expanded, t=0.552104s, 995780 KB] New best heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 8 [g=2, 29 evaluated, 23 expanded, t=0.55217s, 995780 KB] New best heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 7 [g=3, 31 evaluated, 24 expanded, t=0.552202s, 995780 KB] New best heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 6 [g=4, 33 evaluated, 25 expanded, t=0.552232s, 995780 KB] New best heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 5 [g=5, 39 evaluated, 28 expanded, t=0.55227s, 995780 KB] New best heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 4 [g=6, 52 evaluated, 37 expanded, t=0.552326s, 995780 KB] New best heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 3 [g=7, 60 evaluated, 44 expanded, t=0.552376s, 995780 KB] New best heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 2 [g=8, 67 evaluated, 49 expanded, t=0.552419s, 995780 KB] New best heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 1 [g=9, 69 evaluated, 50 expanded, t=0.552448s, 995780 KB] New best heuristic value for modular_pdb(modular_rbp(time_limit = 200), rand_walk(time_limit = 10), 900, pdb_factory = modular_symbolic, create_perimeter = true): 0 [g=10, 78 evaluated, 55 expanded, t=0.552496s, 995780 KB] Solution found! Actual search time: 0.000472885s [t=0.552525s] 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-3-5 dir-down (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) move player-01 pos-2-4 pos-3-4 dir-right (0) 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) move player-01 pos-2-5 pos-2-4 dir-up (0) 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: 55 step(s). Plan cost: 10 Expanded 56 state(s). Reopened 0 state(s). Evaluated 78 state(s). Evaluations: 78 Generated 124 state(s). Dead ends: 22 state(s). Expanded until last jump: 0 state(s). Reopened until last jump: 0 state(s). Evaluated until last jump: 1 state(s). Generated until last jump: 0 state(s). Number of registered states: 78 Search time: 0.00059349s Total time: 0.552528s Solution found. Peak memory: 995812 KB Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp9OJzhl/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/tmp9OJzhl/sas_plan 10