Parsing pddl..... Parsing pddl..: [0.000s CPU, 0.006s wall-clock] Normalizing task..... Normalizing task..: [0.000s CPU, 0.000s wall-clock] Creating abstract structure graph..... Creating abstract structure graph..: [0.000s CPU, 0.002s wall-clock] Computing image from given graph... Using graph input file /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpsIQos_/abstract-structure-graph.txt Using image output directory /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpsIQos_ Writing abstract structure graph grayscale 8bit image..... Grayscale color: 255 Creating matrix for a graph with 237 nodes.. Matrix size when created: 460800 Matrix created, filling with values for edges.. Performing bolding. Matrix size when 1s added: 460800 Number of graph nodes: 240 Shrink ratio: 3 Shrinking matrix to size 80x80.. Shrinked matrix size when created: 51200 Writing grayscale image of size 128x128 .. Writing abstract structure graph grayscale 8bit image..: [0.030s CPU, 0.021s wall-clock] Done computing image! [0.040s CPU, 0.022s wall-clock] ==== Computing an abstract structure graph from the lifted task description... ==== ==== Done computing an abstract structure graph. ==== ==== Selecting planner from learned model... ==== Using json model file /planner/dl_model/models/lifted/model.json Using h5 model file /planner/dl_model/models/lifted/model.h5 Loaded model from disk Chose 5652d59dafed-h2-simpless-dks-cpdbshc900 ==== Done selecting planner from learned model. ==== ==== Running the selected planner... ==== Running planner, call string: ['/usr/bin/python', '/planner/fast-downward.py', '--transform-task', 'preprocess', '--build', 'release64', '--search-memory-limit', '7600M', '--plan-file', 'sas_plan', 'domain.pddl', 'problem.pddl', '--symmetries', 'sym=structural_symmetries(search_symmetries=dks)', '--search', 'astar(cpdbs(patterns=hillclimbing(max_time=900),transform=multiply_out_conditional_effects),symmetries=sym,pruning=stubborn_sets_simple(minimum_pruning_ratio=0.01),num_por_probes=1000)'] INFO Running translator. INFO translator input: ['domain.pddl', 'problem.pddl'] INFO translator arguments: [] INFO translator time limit: 1799.98s 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.98 -> (1800, 1801) Parsing... Parsing: [0.000s CPU, 0.004s wall-clock] Normalizing task... [0.010s 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.004s wall-clock] Preparing model... [0.000s CPU, 0.002s 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.010s CPU, 0.005s wall-clock] Instantiating: [0.020s CPU, 0.022s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.000s CPU, 0.007s wall-clock] Checking invariant weight... [0.000s CPU, 0.000s wall-clock] Instantiating groups... [0.000s CPU, 0.002s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 20 uncovered facts Choosing groups: [0.000s CPU, 0.000s wall-clock] Building translation key... [0.000s CPU, 0.000s wall-clock] Computing fact groups: [0.000s CPU, 0.010s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.000s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.000s wall-clock] Translating task: [0.000s CPU, 0.005s 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.000s 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.010s 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: 25344 KB Writing output... [0.000s CPU, 0.001s wall-clock] Done! [0.050s CPU, 0.046s wall-clock] INFO Run task transformation (preprocess). INFO Absolute path: /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.006537 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(cpdbs(patterns=hillclimbing(max_time=900),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.86s INFO search memory limit: 7600 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(cpdbs(patterns=hillclimbing(max_time=900),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.86 -> (1800, 1801) reading input... [t=3.2685e-05s] done reading input! [t=0.000928929s] packing state variables...done! [t=0.000937969s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00101993s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.7655e-05s done initializing global data [t=0.00105419s] PDB collection construction time: 4.0862e-05s Done calculating initial PDB collection Average operator cost: 0.254902 building causal graph...done! [t=0.000125285s] Done calculating initial candidate PDBs current collection size is 4 current initial h value: 1 Improvement below threshold. Stop hill climbing. iPDB: iterations = 1 iPDB: number of patterns = 2 iPDB: size = 4 iPDB: generated = 13 iPDB: rejected = 0 iPDB: maximum pdb size = 32 iPDB: hill climbing time: 0.00368169s Pattern generation (hill climbing) time: 0.00374305s PDB collection construction time: 0.00374803s Pruned 0 of 1 maximal additive subsets Pruned 0 of 2 PDBs Dominance pruning took 6.11e-06s Initializing symmetries (eager search) Initializing symmetries Using Bliss to find group generators Done initializing symmetries: 8.6325e-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 New best heuristic value for cpdbs(patterns = hillclimbing(max_time = 900), transform = multiply_out_conditional_effects): 1 [g=0, 1 evaluated, 0 expanded, t=0.00520636s, 5284 KB] f = 1 [1 evaluated, 0 expanded, t=0.00523753s, 5284 KB] Initial heuristic value for cpdbs(patterns = hillclimbing(max_time = 900), transform = multiply_out_conditional_effects): 1 pruning method: stubborn sets simple f = 2 [15 evaluated, 14 expanded, t=0.00541998s, 5284 KB] f = 4 [29 evaluated, 28 expanded, t=0.00550762s, 5284 KB] f = 5 [43 evaluated, 42 expanded, t=0.00559351s, 5284 KB] f = 6 [73 evaluated, 70 expanded, t=0.00573653s, 5284 KB] f = 7 [96 evaluated, 94 expanded, t=0.00585773s, 5284 KB] f = 8 [124 evaluated, 122 expanded, t=0.00600452s, 5284 KB] f = 9 [133 evaluated, 131 expanded, t=0.00606941s, 5284 KB] f = 10 [146 evaluated, 145 expanded, t=0.00614885s, 5284 KB] New best heuristic value for cpdbs(patterns = hillclimbing(max_time = 900), transform = multiply_out_conditional_effects): 0 [g=10, 162 evaluated, 158 expanded, t=0.00623165s, 5284 KB] Solution found! Actual search time: 0.000909953s [t=0.00626364s] 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 159 state(s). Reopened 0 state(s). Evaluated 162 state(s). Evaluations: 162 Generated 338 state(s). Dead ends: 0 state(s). Expanded until last jump: 145 state(s). Reopened until last jump: 0 state(s). Evaluated until last jump: 146 state(s). Generated until last jump: 307 state(s). Number of registered states: 162 total successors before partial-order reduction: 338 total successors after partial-order reduction: 338 Search time: 0.00107151s Total time: 0.00626652s Solution found. Peak memory: 5284 KB Overall time: [0.150s CPU, 0.168s wall-clock] ==== Done running the selected planner. ==== Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpsIQos_/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/tmpsIQos_/sas_plan 10