ulimit: 1800 set time limit to: 900 INFO Running translator. INFO translator input: ['domain.pddl', 'problem.pddl'] INFO translator arguments: [] INFO translator time limit: 1799.89s 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.89 -> (1800, 1801) Parsing... Parsing: [0.000s CPU, 0.006s 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.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.030s CPU, 0.026s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.010s CPU, 0.008s 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.010s CPU, 0.011s 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.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.002s 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: 26452 KB Writing output... [0.000s CPU, 0.001s wall-clock] Done! [0.050s 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.005332 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(merge_and_shrink(shrink_strategy=shrink_bisimulation(greedy=false),merge_strategy=merge_sccs(order_of_sccs=topological,merge_selector=score_based_filtering(scoring_functions=[goal_relevance,dfp,total_order(atomic_ts_order=reverse_level,product_ts_order=new_to_old,atomic_before_product=false)])),label_reduction=exact(before_shrinking=true,before_merging=false),max_states=50000,threshold_before_merge=1,max_time=900,verbosity=normal),symmetries=sym,pruning=stubborn_sets_simple(minimum_pruning_ratio=0.01),num_por_probes=1000)'] INFO search time limit: 1799.74s 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(merge_and_shrink(shrink_strategy=shrink_bisimulation(greedy=false),merge_strategy=merge_sccs(order_of_sccs=topological,merge_selector=score_based_filtering(scoring_functions=[goal_relevance,dfp,total_order(atomic_ts_order=reverse_level,product_ts_order=new_to_old,atomic_before_product=false)])),label_reduction=exact(before_shrinking=true,before_merging=false),max_states=50000,threshold_before_merge=1,max_time=900,verbosity=normal),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.74 -> (1800, 1801) reading input... [t=3.4826e-05s] done reading input! [t=0.000611996s] packing state variables...done! [t=0.000621423s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000697655s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.2409e-05s done initializing global data [t=0.00072975s] Initializing merge-and-shrink heuristic... Merge strategy options: Type: sccs Merge order of sccs: topological Merge strategy for merging within sccs: Merge selector options: Name: score based filtering Merge scoring function: Name: goal relevance Merge scoring function: Name: dfp Merge scoring function: Name: total order Atomic transition system order: reverse level Product transition system order: new to old Consider product before atomic transition systems Random seed: -1 Options related to size limits and shrinking: Transition system size limit: 50000 Transition system size limit right before merge: 50000 Threshold to trigger shrinking right before merge: 1 Shrink strategy options: Type: bisimulation Bisimulation type: exact At limit: return Label reduction options: Before merging: disabled Before shrinking: enabled Method: all transition systems with fixpoint computation System order: random Verbosity: normal Building atomic transition systems... done initializing transition system data 0.000189066 done building transitions 0.00027022 done creating transition systems 0.000317201 done creating mas representations 0.000321975 done creating distances 0.000325002 done creating FTS 0.000351083 t=0.000359355s (after computation of atomic transition systems) building causal graph...done! [t=0.000105725s] SCCs of the causal graph: [0, 1, 2, 10, 3, 5, 4, 7, 9, 8, 6, 12, 11, 13, 14, 15, 16, 17, 18, 19, 20] Only one single SCC Next pair of indices: (5, 19) t=0.00053864s (after computation of next merge) t=0.00175739s (after merging) Next pair of indices: (3, 21) t=0.00179515s (after computation of next merge) t=0.00287649s (after merging) Next pair of indices: (4, 22) t=0.00291026s (after computation of next merge) t=0.00389222s (after merging) Next pair of indices: (10, 23) t=0.00392618s (after computation of next merge) t=0.0048248s (after merging) Next pair of indices: (2, 24) t=0.00487432s (after computation of next merge) t=0.00573862s (after merging) Next pair of indices: (1, 25) t=0.00577601s (after computation of next merge) t=0.00662844s (after merging) Next pair of indices: (0, 26) t=0.00667381s (after computation of next merge) t=0.00761584s (after merging) Next pair of indices: (6, 27) t=0.0076767s (after computation of next merge) t=0.00896241s (after merging) Next pair of indices: (8, 28) t=0.00904006s (after computation of next merge) t=0.0111009s (after merging) Next pair of indices: (9, 29) t=0.011219s (after computation of next merge) t=0.0151932s (after merging) Next pair of indices: (7, 30) t=0.0153976s (after computation of next merge) t=0.0234497s (after merging) Next pair of indices: (11, 31) t=0.0238223s (after computation of next merge) t=0.041293s (after merging) Next pair of indices: (12, 32) t=0.0420922s (after computation of next merge) t=0.107314s (after merging) Next pair of indices: (13, 33) t=0.110583s (after computation of next merge) t=0.215979s (after shrinking) not perfect anymore in iteration 13 t=0.216206s (after merging) t=0.216214s (after pruning) Next pair of indices: (14, 34) t=0.216238s (after computation of next merge) t=0.21644s (after label reduction) t=0.216469s (after merging) Next pair of indices: (15, 35) t=0.216486s (after computation of next merge) t=0.21659s (after merging) Next pair of indices: (16, 36) t=0.216607s (after computation of next merge) t=0.216713s (after merging) Next pair of indices: (17, 37) t=0.216731s (after computation of next merge) t=0.216985s (after merging) t=0.21704s (after pruning) Next pair of indices: (18, 38) t=0.217052s (after computation of next merge) t=0.217161s (after label reduction) t=0.217614s (after shrinking) t=0.217751s (after merging) t=0.217824s (after pruning) Next pair of indices: (20, 39) t=0.217832s (after computation of next merge) t=0.217922s (after label reduction) t=0.219051s (after shrinking) t=0.219267s (after merging) t=0.219362s (after pruning) Iterations with merge tiebreaking: 19 Total tiebreaking merge candidates: 196 Final transition system size: 553 Maximum intermediate abstraction size: 32768 Maximum intermediate number of transitions: 847872 Init h value improvements: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2] Course of label reduction: [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 27, 27, 27, 27, 9, 4] Course of miss qualified states shrinking: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0.999939, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Average imperfect shrinking: 0.0249985 Merge order: [(5, 19), (3, 21), (4, 22), (10, 23), (2, 24), (1, 25), (0, 26), (6, 27), (8, 28), (9, 29), (7, 30), (11, 31), (12, 32), (13, 33), (14, 34), (15, 35), (16, 36), (17, 37), (18, 38), (20, 39)] Linear merge order Relative pruning per iteration: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0.5, 0, 0, 0, 0.614062, 0.0242291, 0.318966] Average relative pruning: 0.0728629 Number of attempts to merge for symmetries: 0 Number of times non-perfect shrinking interfered merging for symmetries: 0 Number of times pruning interfered merging for symmetries: 0 Number of times merging for symmetries failed for any reason: 0 Final peak memory increase of merge-and-shrink computation: 18192 KB Done initializing merge-and-shrink heuristic [0.219471s] Initializing symmetries (eager search) Initializing symmetries Using Bliss to find group generators Done initializing symmetries: 8.6406e-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 merge_and_shrink(shrink_strategy = shrink_bisimulation(greedy = false), merge_strategy = merge_sccs(order_of_sccs = topological, merge_selector = score_based_filtering(scoring_functions = list(goal_relevance, dfp, total_order(atomic_ts_order = reverse_level, product_ts_order = new_to_old, atomic_before_product = false)))), label_reduction = exact(before_shrinking = true, before_merging = false), max_states = 50000, threshold_before_merge = 1, max_time = 900, verbosity = normal): 3 [g=0, 1 evaluated, 0 expanded, t=0.220752s, 23656 KB] f = 3 [1 evaluated, 0 expanded, t=0.220779s, 23656 KB] Initial heuristic value for merge_and_shrink(shrink_strategy = shrink_bisimulation(greedy = false), merge_strategy = merge_sccs(order_of_sccs = topological, merge_selector = score_based_filtering(scoring_functions = list(goal_relevance, dfp, total_order(atomic_ts_order = reverse_level, product_ts_order = new_to_old, atomic_before_product = false)))), label_reduction = exact(before_shrinking = true, before_merging = false), max_states = 50000, threshold_before_merge = 1, max_time = 900, verbosity = normal): 3 pruning method: stubborn sets simple New best heuristic value for merge_and_shrink(shrink_strategy = shrink_bisimulation(greedy = false), merge_strategy = merge_sccs(order_of_sccs = topological, merge_selector = score_based_filtering(scoring_functions = list(goal_relevance, dfp, total_order(atomic_ts_order = reverse_level, product_ts_order = new_to_old, atomic_before_product = false)))), label_reduction = exact(before_shrinking = true, before_merging = false), max_states = 50000, threshold_before_merge = 1, max_time = 900, verbosity = normal): 2 [g=1, 15 evaluated, 14 expanded, t=0.220945s, 23656 KB] f = 5 [29 evaluated, 28 expanded, t=0.221024s, 23656 KB] New best heuristic value for merge_and_shrink(shrink_strategy = shrink_bisimulation(greedy = false), merge_strategy = merge_sccs(order_of_sccs = topological, merge_selector = score_based_filtering(scoring_functions = list(goal_relevance, dfp, total_order(atomic_ts_order = reverse_level, product_ts_order = new_to_old, atomic_before_product = false)))), label_reduction = exact(before_shrinking = true, before_merging = false), max_states = 50000, threshold_before_merge = 1, max_time = 900, verbosity = normal): 1 [g=4, 33 evaluated, 30 expanded, t=0.221064s, 23656 KB] f = 7 [73 evaluated, 70 expanded, t=0.221231s, 23656 KB] f = 8 [100 evaluated, 98 expanded, t=0.221356s, 23656 KB] f = 10 [110 evaluated, 107 expanded, t=0.221414s, 23656 KB] New best heuristic value for merge_and_shrink(shrink_strategy = shrink_bisimulation(greedy = false), merge_strategy = merge_sccs(order_of_sccs = topological, merge_selector = score_based_filtering(scoring_functions = list(goal_relevance, dfp, total_order(atomic_ts_order = reverse_level, product_ts_order = new_to_old, atomic_before_product = false)))), label_reduction = exact(before_shrinking = true, before_merging = false), max_states = 50000, threshold_before_merge = 1, max_time = 900, verbosity = normal): 0 [g=10, 141 evaluated, 134 expanded, t=0.221536s, 23656 KB] Solution found! Actual search time: 0.00068299s [t=0.221564s] 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 135 state(s). Reopened 0 state(s). Evaluated 141 state(s). Evaluations: 141 Generated 290 state(s). Dead ends: 0 state(s). Expanded until last jump: 107 state(s). Reopened until last jump: 0 state(s). Evaluated until last jump: 110 state(s). Generated until last jump: 229 state(s). Number of registered states: 141 total successors before partial-order reduction: 290 total successors after partial-order reduction: 290 Search time: 0.000830263s Total time: 0.221567s Solution found. Peak memory: 23656 KB Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp_Yz9yj/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/tmp_Yz9yj/sas_plan 10