Domain: domain.pddl Problem: problem.pddl Parsing... Parsing: [0.010s CPU, 0.005s wall-clock] 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.005s wall-clock] goal relaxed reachable: True 64 atoms Computing fact groups... Finding invariants... 7 initial candidates Time limit reached, aborting invariant generation Finding invariants: [0.000s CPU, 0.001s wall-clock] Checking invariant weight... [0.000s CPU, 0.000s wall-clock] Instantiating groups... [0.000s CPU, 0.000s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 64 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.002s wall-clock] Axioms 0 Deterministic 78 actions 0 negated fluents created Invariants 64 Match tree built with 78 nodes. PDDL problem description loaded: Domain: sokoban-sequential Problem: p014-microban-sequential #Actions: 78 #Fluents: 64 Goals found: 2 Goals_Edges found: 2 Starting search with BFWS-f5... --[1 / 0]-- --[1 / 2]-- --[1 / 3]-- --[1 / 4]-- --[1 / 6]-- --[1 / 8]-- --[1 / 9]-- --[1 / 10]-- --[1 / 11]-- --[1 / 13]-- --[1 / 16]-- --[1 / 17]-- --[1 / 18]-- --[0 / 0]-- --[0 / 12]-- Total time: 0.004 Nodes generated during search: 1400 Nodes expanded during search: 622 Plan found with cost: 10.041 Fast-BFS search completed in 0.004 secs INFO Running translator. INFO translator input: ['domain.pddl', 'problem.pddl'] INFO translator arguments: [] INFO translator time limit: 1799.97s INFO translator memory limit: 8192 MB INFO callstring: /usr/bin/python /planner/Fast-Downward-2018-2/builds/release64/bin/translate/translate.py domain.pddl problem.pddl time limit 1799.97 -> (1800, 1801) Parsing... Parsing: [0.000s CPU, 0.003s 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.004s wall-clock] Preparing model... [0.010s CPU, 0.002s wall-clock] Generated 38 rules. Computing model... [0.000s CPU, 0.009s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.010s CPU, 0.004s wall-clock] Instantiating: [0.020s CPU, 0.020s 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.004s 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.002s 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: 26444 KB Writing output... [0.010s CPU, 0.001s wall-clock] Done! [0.040s CPU, 0.041s wall-clock] 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.005932 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: ['--if-unit-cost', '--heuristic', 'hlm=lama_synergy(lm_rhw(reasonable_orders=true))', '--heuristic', 'hff=ff_synergy(hlm)', '--search', 'iterated([lazy_wastar([hff,hlm],preferred=[hff,hlm],w=5),lazy_wastar([hff,hlm],preferred=[hff,hlm],w=3),lazy_wastar([hff,hlm],preferred=[hff,hlm],w=2),lazy_wastar([hff,hlm],preferred=[hff,hlm],w=1)],repeat_last=true,continue_on_fail=true,external_bound=10)', '--if-non-unit-cost', '--heuristic', 'hlm1=lama_synergy(lm_rhw(reasonable_orders=true,lm_cost_type=one),transform=adapt_costs(one))', '--heuristic', 'hff1=ff_synergy(hlm1)', '--heuristic', 'hlm2=lama_synergy(lm_rhw(reasonable_orders=true,lm_cost_type=plusone),transform=adapt_costs(plusone))', '--heuristic', 'hff2=ff_synergy(hlm2)', '--search', 'iterated([lazy_wastar([hff2,hlm2],preferred=[hff2,hlm2],w=5),lazy_wastar([hff2,hlm2],preferred=[hff2,hlm2],w=3),lazy_wastar([hff2,hlm2],preferred=[hff2,hlm2],w=2),lazy_wastar([hff2,hlm2],preferred=[hff2,hlm2],w=1)],repeat_last=true,continue_on_fail=true,external_bound=10)', '--always'] INFO search time limit: 1799.87s INFO search memory limit: 8192 MB INFO search executable: /planner/Fast-Downward-2018-2/builds/release64/bin/downward INFO callstring: /planner/Fast-Downward-2018-2/builds/release64/bin/downward --if-unit-cost --heuristic 'hlm=lama_synergy(lm_rhw(reasonable_orders=true))' --heuristic 'hff=ff_synergy(hlm)' --search 'iterated([lazy_wastar([hff,hlm],preferred=[hff,hlm],w=5),lazy_wastar([hff,hlm],preferred=[hff,hlm],w=3),lazy_wastar([hff,hlm],preferred=[hff,hlm],w=2),lazy_wastar([hff,hlm],preferred=[hff,hlm],w=1)],repeat_last=true,continue_on_fail=true,external_bound=10)' --if-non-unit-cost --heuristic 'hlm1=lama_synergy(lm_rhw(reasonable_orders=true,lm_cost_type=one),transform=adapt_costs(one))' --heuristic 'hff1=ff_synergy(hlm1)' --heuristic 'hlm2=lama_synergy(lm_rhw(reasonable_orders=true,lm_cost_type=plusone),transform=adapt_costs(plusone))' --heuristic 'hff2=ff_synergy(hlm2)' --search 'iterated([lazy_wastar([hff2,hlm2],preferred=[hff2,hlm2],w=5),lazy_wastar([hff2,hlm2],preferred=[hff2,hlm2],w=3),lazy_wastar([hff2,hlm2],preferred=[hff2,hlm2],w=2),lazy_wastar([hff2,hlm2],preferred=[hff2,hlm2],w=1)],repeat_last=true,continue_on_fail=true,external_bound=10)' --always --internal-plan-file sas_plan < output.sas time limit 1799.87 -> (1800, 1801) reading input... [t=0.000659189s] done reading input! [t=0.00123197s] packing state variables...done! [t=0.00124166s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.0013172s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.4754e-05s done initializing global data [t=0.001349s] Initializing Exploration... Initializing landmarks count heuristic... 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.000697633s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initializing LAMA-FF synergy master Initializing LAMA-FF synergy slave Initializing Exploration... Initializing landmarks count heuristic... 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.000681338s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initializing LAMA-FF synergy master Initializing LAMA-FF synergy slave Starting search: lazy_wastar(list(hff2, hlm2), preferred = list(hff2, hlm2), w = 5) Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 19 New best heuristic value for ff_synergy(hlm2): 19 [g=0, 1 evaluated, 0 expanded, t=0.00336331s, 5064 KB] Initial heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 19 Initial heuristic value for ff_synergy(hlm2): 19 New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 18 [g=0, 3 evaluated, 2 expanded, t=0.00344108s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 17 [g=0, 4 evaluated, 3 expanded, t=0.00349204s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 16 [g=0, 5 evaluated, 4 expanded, t=0.00353889s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 15 [g=0, 6 evaluated, 5 expanded, t=0.00358473s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 14 [g=0, 7 evaluated, 6 expanded, t=0.00364766s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 13 [g=0, 8 evaluated, 7 expanded, t=0.0037032s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 12 [g=0, 9 evaluated, 8 expanded, t=0.00374884s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 11 [g=0, 11 evaluated, 10 expanded, t=0.00381012s, 5064 KB] New best heuristic value for ff_synergy(hlm2): 16 [g=0, 12 evaluated, 11 expanded, t=0.00385801s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 10 [g=0, 13 evaluated, 12 expanded, t=0.00390568s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 9 [g=1, 14 evaluated, 13 expanded, t=0.00395046s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 8 [g=1, 15 evaluated, 14 expanded, t=0.00400559s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 7 [g=1, 18 evaluated, 17 expanded, t=0.00410039s, 5064 KB] New best heuristic value for ff_synergy(hlm2): 13 [g=1, 23 evaluated, 22 expanded, t=0.00422994s, 5064 KB] New best heuristic value for ff_synergy(hlm2): 12 [g=1, 26 evaluated, 25 expanded, t=0.00431867s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 6 [g=2, 29 evaluated, 28 expanded, t=0.00440184s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 5 [g=2, 30 evaluated, 29 expanded, t=0.00445637s, 5064 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 3 New best heuristic value for ff_synergy(hlm2): 11 [g=4, 34 evaluated, 33 expanded, t=0.00456963s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 7 [g=4, 40 evaluated, 39 expanded, t=0.00471959s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 6 [g=4, 41 evaluated, 40 expanded, t=0.00477166s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 1 [g=9, 79 evaluated, 78 expanded, t=0.00548101s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 5 [g=9, 80 evaluated, 79 expanded, t=0.00553304s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 4 [g=9, 81 evaluated, 80 expanded, t=0.00558035s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 3 [g=9, 82 evaluated, 81 expanded, t=0.0056294s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 2 [g=9, 83 evaluated, 82 expanded, t=0.00567411s, 5196 KB] Completely explored state space -- no solution! Actual search time: 0.00414553s [t=0.00747818s] Expanded 175 state(s). Reopened 11 state(s). Evaluated 175 state(s). Evaluations: 339 Generated 370 state(s). Dead ends: 0 state(s). Number of registered states: 164 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 18 initial landmarks, 2 goal landmarks New best heuristic value for ff_synergy(hlm2): 19 New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 19 [g=0, 1 evaluated, 0 expanded, t=0.00757397s, 5196 KB] Initial heuristic value for ff_synergy(hlm2): 19 Initial heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 19 New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 18 [g=0, 3 evaluated, 2 expanded, t=0.00767118s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 17 [g=0, 4 evaluated, 3 expanded, t=0.00772197s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 16 [g=0, 5 evaluated, 4 expanded, t=0.00776879s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 15 [g=0, 6 evaluated, 5 expanded, t=0.00781466s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 14 [g=0, 7 evaluated, 6 expanded, t=0.00785878s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 13 [g=0, 8 evaluated, 7 expanded, t=0.00790306s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 12 [g=0, 9 evaluated, 8 expanded, t=0.0079474s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 11 [g=0, 11 evaluated, 10 expanded, t=0.0080072s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 16 [g=0, 12 evaluated, 11 expanded, t=0.00805113s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 10 [g=0, 13 evaluated, 12 expanded, t=0.00809576s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 9 [g=1, 14 evaluated, 13 expanded, t=0.00813964s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 8 [g=1, 15 evaluated, 14 expanded, t=0.00819175s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 7 [g=1, 18 evaluated, 17 expanded, t=0.00828115s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 13 [g=1, 23 evaluated, 22 expanded, t=0.00840529s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 12 [g=1, 26 evaluated, 25 expanded, t=0.0084932s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 6 [g=2, 29 evaluated, 28 expanded, t=0.00857256s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 5 [g=2, 30 evaluated, 29 expanded, t=0.00862811s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 11 New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 3 [g=4, 34 evaluated, 33 expanded, t=0.00873819s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 7 [g=4, 40 evaluated, 39 expanded, t=0.00887732s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 6 [g=4, 41 evaluated, 40 expanded, t=0.00892599s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 1 [g=9, 79 evaluated, 78 expanded, t=0.00963087s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 5 [g=9, 80 evaluated, 79 expanded, t=0.00968068s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 4 [g=9, 81 evaluated, 80 expanded, t=0.00972743s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 3 [g=9, 82 evaluated, 81 expanded, t=0.00977259s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 2 [g=9, 83 evaluated, 82 expanded, t=0.00981602s, 5196 KB] Completely explored state space -- no solution! Actual search time: 0.00402615s [t=0.0115825s] Expanded 174 state(s). Reopened 10 state(s). Evaluated 174 state(s). Evaluations: 338 Generated 368 state(s). Dead ends: 0 state(s). Number of registered states: 164 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 18 initial landmarks, 2 goal landmarks New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 19 New best heuristic value for ff_synergy(hlm2): 19 [g=0, 1 evaluated, 0 expanded, t=0.0117006s, 5196 KB] Initial heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 19 Initial heuristic value for ff_synergy(hlm2): 19 New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 18 [g=0, 3 evaluated, 2 expanded, t=0.0117689s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 17 [g=0, 4 evaluated, 3 expanded, t=0.0118162s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 16 [g=0, 5 evaluated, 4 expanded, t=0.0118617s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 15 [g=0, 6 evaluated, 5 expanded, t=0.0119063s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 14 [g=0, 7 evaluated, 6 expanded, t=0.0119497s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 13 [g=0, 8 evaluated, 7 expanded, t=0.0119933s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 12 [g=0, 9 evaluated, 8 expanded, t=0.0120371s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 11 [g=0, 11 evaluated, 10 expanded, t=0.0120964s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 16 [g=0, 12 evaluated, 11 expanded, t=0.0121407s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 10 [g=0, 13 evaluated, 12 expanded, t=0.012195s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 9 [g=1, 14 evaluated, 13 expanded, t=0.0122493s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 8 [g=1, 15 evaluated, 14 expanded, t=0.0123064s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 7 [g=1, 18 evaluated, 17 expanded, t=0.0123963s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 13 [g=1, 23 evaluated, 22 expanded, t=0.0125214s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 12 [g=1, 26 evaluated, 25 expanded, t=0.0126092s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 6 [g=2, 29 evaluated, 28 expanded, t=0.0126878s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 5 [g=2, 30 evaluated, 29 expanded, t=0.0127398s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 3 New best heuristic value for ff_synergy(hlm2): 11 [g=4, 34 evaluated, 33 expanded, t=0.0128503s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 7 [g=4, 42 evaluated, 41 expanded, t=0.0130266s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 6 [g=4, 43 evaluated, 42 expanded, t=0.0130754s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 1 [g=9, 79 evaluated, 78 expanded, t=0.0137252s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 5 [g=9, 80 evaluated, 79 expanded, t=0.0137738s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 4 [g=9, 81 evaluated, 80 expanded, t=0.0138193s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 3 [g=9, 82 evaluated, 81 expanded, t=0.0138632s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 2 [g=9, 83 evaluated, 82 expanded, t=0.0139058s, 5196 KB] Completely explored state space -- no solution! Actual search time: 0.00403941s [t=0.0157226s] Expanded 176 state(s). Reopened 12 state(s). Evaluated 176 state(s). Evaluations: 340 Generated 372 state(s). Dead ends: 0 state(s). Number of registered states: 164 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 18 initial landmarks, 2 goal landmarks New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 19 New best heuristic value for ff_synergy(hlm2): 19 [g=0, 1 evaluated, 0 expanded, t=0.0158151s, 5196 KB] Initial heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 19 Initial heuristic value for ff_synergy(hlm2): 19 New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 18 [g=0, 3 evaluated, 2 expanded, t=0.0158826s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 17 [g=0, 4 evaluated, 3 expanded, t=0.0159287s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 16 [g=0, 5 evaluated, 4 expanded, t=0.0159734s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 15 [g=0, 6 evaluated, 5 expanded, t=0.0160178s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 14 [g=0, 7 evaluated, 6 expanded, t=0.0160607s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 13 [g=0, 8 evaluated, 7 expanded, t=0.0161047s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 12 [g=0, 9 evaluated, 8 expanded, t=0.0161531s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 11 [g=0, 11 evaluated, 10 expanded, t=0.0162129s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 16 [g=0, 12 evaluated, 11 expanded, t=0.0162571s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 10 [g=0, 13 evaluated, 12 expanded, t=0.0163014s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 9 [g=1, 14 evaluated, 13 expanded, t=0.0163453s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 8 [g=1, 15 evaluated, 14 expanded, t=0.0163986s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 7 [g=1, 18 evaluated, 17 expanded, t=0.0164879s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 13 [g=1, 23 evaluated, 22 expanded, t=0.0166112s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 12 [g=1, 26 evaluated, 25 expanded, t=0.0166978s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 6 [g=2, 29 evaluated, 28 expanded, t=0.0167754s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 5 [g=2, 30 evaluated, 29 expanded, t=0.0168264s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 3 New best heuristic value for ff_synergy(hlm2): 11 [g=4, 34 evaluated, 33 expanded, t=0.0169335s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 8 [g=3, 50 evaluated, 49 expanded, t=0.0172511s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 7 [g=3, 51 evaluated, 50 expanded, t=0.0173012s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 6 [g=4, 55 evaluated, 54 expanded, t=0.0174024s, 5196 KB] New best heuristic value for lama_synergy(lm_rhw(reasonable_orders = true, lm_cost_type = plusone), transform = adapt_costs(plusone)): 1 [g=9, 79 evaluated, 78 expanded, t=0.0178283s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 5 [g=9, 80 evaluated, 79 expanded, t=0.0178763s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 4 [g=9, 81 evaluated, 80 expanded, t=0.0179214s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 3 [g=9, 82 evaluated, 81 expanded, t=0.0179657s, 5196 KB] New best heuristic value for ff_synergy(hlm2): 2 [g=9, 83 evaluated, 82 expanded, t=0.0180084s, 5196 KB] Completely explored state space -- no solution! Actual search time: 0.00396345s [t=0.0197615s] Expanded 175 state(s). Reopened 11 state(s). Evaluated 175 state(s). Evaluations: 339 Generated 370 state(s). Dead ends: 0 state(s). Number of registered states: 164 No solution found - keep searching Actual search time: 0.0165049s [t=0.0197812s] Cumulative statistics: Expanded 700 state(s). Reopened 44 state(s). Evaluated 700 state(s). Evaluations: 1356 Generated 1480 state(s). Dead ends: 0 state(s). Search time: 0.0165091s Total time: 0.0197839s Search stopped without finding a solution. Peak memory: 5196 KB Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpOC_KbT/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/tmpOC_KbT/sas_plan.1 10