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.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.010s 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.000s CPU, 0.005s wall-clock] Instantiating: [0.020s CPU, 0.022s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.010s CPU, 0.006s 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.009s 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.010s 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.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: 26456 KB Writing output... [0.000s CPU, 0.001s wall-clock] Done! [0.040s CPU, 0.046s wall-clock] INFO Run task transformation (/planner/builds/h2-mutexes/bin/preprocess). INFO callstring: /planner/builds/h2-mutexes/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.004964 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: [] INFO search time limit: 1799.78s INFO search memory limit: 8192 MB INFO search executable: /planner/builds/release64/bin/downward INFO search portfolio: /planner/driver/portfolios/seq_sat_fdss_2018.py Exit codes: remaining time: 1799.78 config 0: relative time 26, remaining 1583 g bound: infinity next plan number: 1 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hlm,hff=lm_ff_syn(lm_rhw(reasonable_orders=true, lm_cost_type=one), transform=adapt_costs(one))', '--search', 'lazy(alt([single(hff), single(hff, pref_only=true), single(hlm), single(hlm, pref_only=true), type_based([hff, g()])], boost=1000), preferred=[hff,hlm], cost_type=one, reopen_closed=false, randomize_successors=True, preferred_successors_first=False, bound=infinity)', '--internal-previous-portfolio-plans', '0', '--internal-plan-file', 'sas_plan'] time limit 29.56 -> (30, 31) reading input... [t=0.00061342s] done reading input! [t=0.00118467s] packing state variables...done! [t=0.00119325s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00129944s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.932e-05s done initializing global data [t=0.00135125s] 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.000692687s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initializing LAMA-FF synergy object Conducting lazy best first search, (real) bound = 2147483647 18 initial landmarks, 2 goal landmarks New best heuristic value for : 16 New best heuristic value for : 16 [g=0, 1 evaluated, 0 expanded, t=0.00239059s, 4916 KB] Initial heuristic value for : 16 Initial heuristic value for : 16 New best heuristic value for : 15 [g=2, 3 evaluated, 2 expanded, t=0.00247242s, 4916 KB] New best heuristic value for : 14 [g=3, 4 evaluated, 3 expanded, t=0.00252163s, 4916 KB] New best heuristic value for : 13 [g=4, 5 evaluated, 4 expanded, t=0.00256953s, 4916 KB] New best heuristic value for : 12 [g=5, 6 evaluated, 5 expanded, t=0.00261628s, 4916 KB] New best heuristic value for : 11 [g=6, 7 evaluated, 6 expanded, t=0.00266153s, 4916 KB] New best heuristic value for : 10 [g=7, 8 evaluated, 7 expanded, t=0.00270864s, 4916 KB] New best heuristic value for : 9 [g=8, 9 evaluated, 8 expanded, t=0.00275766s, 4916 KB] New best heuristic value for : 8 [g=9, 11 evaluated, 10 expanded, t=0.00282015s, 4916 KB] New best heuristic value for : 13 [g=10, 12 evaluated, 11 expanded, t=0.00286744s, 4916 KB] New best heuristic value for : 11 New best heuristic value for : 7 [g=11, 13 evaluated, 12 expanded, t=0.00291612s, 4916 KB] New best heuristic value for : 5 [g=13, 15 evaluated, 14 expanded, t=0.00298546s, 4916 KB] New best heuristic value for : 10 [g=18, 20 evaluated, 19 expanded, t=0.00312498s, 5048 KB] New best heuristic value for : 9 [g=20, 23 evaluated, 22 expanded, t=0.00322617s, 5048 KB] New best heuristic value for : 4 [g=24, 27 evaluated, 26 expanded, t=0.00333018s, 5048 KB] New best heuristic value for : 2 [g=25, 29 evaluated, 28 expanded, t=0.00340091s, 5048 KB] New best heuristic value for : 5 [g=31, 38 evaluated, 37 expanded, t=0.00361395s, 5048 KB] New best heuristic value for : 4 [g=32, 39 evaluated, 38 expanded, t=0.00366516s, 5048 KB] New best heuristic value for : 3 [g=39, 46 evaluated, 45 expanded, t=0.00381051s, 5048 KB] New best heuristic value for : 1 [g=46, 54 evaluated, 53 expanded, t=0.00397777s, 5048 KB] New best heuristic value for : 2 [g=49, 57 evaluated, 56 expanded, t=0.00405469s, 5048 KB] New best heuristic value for : 1 [g=50, 58 evaluated, 57 expanded, t=0.00410038s, 5048 KB] Solution found! Actual search time: 0.00177083s [t=0.00413662s] 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-3-4 dir-right (0) move player-01 pos-3-4 pos-3-5 dir-down (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 58 state(s). Reopened 0 state(s). Evaluated 59 state(s). Evaluations: 118 Generated 127 state(s). Dead ends: 0 state(s). Number of registered states: 59 Int hash set load factor: 59/64 = 0.921875 Int hash set resizes: 6 Search time: 0.00178858s Total time: 0.00413938s Solution found. Peak memory: 5048 KB exitcode: 0 plan manager: found new plan with cost 10 remaining time: 1799.75 config 1: relative time 25, remaining 1557 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_rhw(only_causal_landmarks=false,disjunctive_landmarks=true,conjunctive_landmarks=true,no_orders=true,lm_cost_type=2)', '--heuristic', 'hLM,hFF=lm_ff_syn(lmg,admissible=true,transform=adapt_costs(1))', '--search', 'lazy(alt([type_based([g()]),single(hLM),single(hLM,pref_only=true),single(hFF),single(hFF,pref_only=true)], boost=0),preferred=[hLM],reopen_closed=false,cost_type=2,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 28.90 -> (29, 30) reading input... [t=2.0938e-05s] done reading input! [t=0.000568344s] packing state variables...done! [t=0.000576319s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000637265s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.2295e-05s done initializing global data [t=0.000667804s] Initializing Exploration... Initializing landmarks count heuristic... Generating landmarks using the RPG/SAS+ approach Removing all orderings. Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.000684359s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 0 edges Initializing LAMA-FF synergy object Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for : 16 New best heuristic value for : 15 [g=0, 1 evaluated, 0 expanded, t=0.00169776s, 4916 KB] Initial heuristic value for : 16 Initial heuristic value for : 15 New best heuristic value for : 14 [g=1, 2 evaluated, 1 expanded, t=0.00176171s, 4916 KB] New best heuristic value for : 13 [g=2, 3 evaluated, 2 expanded, t=0.00181244s, 4916 KB] New best heuristic value for : 12 [g=3, 4 evaluated, 3 expanded, t=0.00185972s, 4916 KB] New best heuristic value for : 11 [g=4, 5 evaluated, 4 expanded, t=0.00190819s, 4916 KB] New best heuristic value for : 10 [g=5, 6 evaluated, 5 expanded, t=0.0019544s, 4916 KB] New best heuristic value for : 9 [g=6, 7 evaluated, 6 expanded, t=0.00200068s, 4916 KB] New best heuristic value for : 8 [g=7, 8 evaluated, 7 expanded, t=0.00204644s, 4916 KB] New best heuristic value for : 7 [g=8, 9 evaluated, 8 expanded, t=0.00209459s, 4916 KB] New best heuristic value for : 13 New best heuristic value for : 6 [g=10, 12 evaluated, 11 expanded, t=0.00217417s, 4916 KB] New best heuristic value for : 11 New best heuristic value for : 5 [g=11, 13 evaluated, 12 expanded, t=0.0022205s, 4916 KB] New best heuristic value for : 4 [g=13, 14 evaluated, 13 expanded, t=0.00226651s, 4916 KB] New best heuristic value for : 3 [g=14, 15 evaluated, 14 expanded, t=0.00231922s, 4916 KB] New best heuristic value for : 10 [g=21, 23 evaluated, 22 expanded, t=0.00250369s, 4916 KB] New best heuristic value for : 9 [g=23, 25 evaluated, 24 expanded, t=0.00257213s, 4916 KB] New best heuristic value for : 2 [g=28, 29 evaluated, 28 expanded, t=0.00267231s, 4916 KB] New best heuristic value for : 1 [g=31, 32 evaluated, 31 expanded, t=0.00276017s, 4916 KB] New best heuristic value for : 8 [g=33, 37 evaluated, 36 expanded, t=0.00289071s, 5048 KB] New best heuristic value for : 5 [g=37, 48 evaluated, 47 expanded, t=0.00312579s, 5048 KB] New best heuristic value for : 4 [g=38, 49 evaluated, 48 expanded, t=0.00317672s, 5048 KB] New best heuristic value for : 3 [g=46, 58 evaluated, 57 expanded, t=0.00335442s, 5048 KB] New best heuristic value for : 2 [g=60, 74 evaluated, 73 expanded, t=0.00370058s, 5048 KB] New best heuristic value for : 1 [g=61, 75 evaluated, 74 expanded, t=0.00374759s, 5048 KB] Completely explored state space -- no solution! Actual search time: 0.00382071s [t=0.00549378s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.0038368s Total time: 0.00549662s Search stopped without finding a solution. Peak memory: 5048 KB exitcode: 5 remaining time: 1799.74 config 2: relative time 135, remaining 1532 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hlm,hff=lm_ff_syn(lm_rhw(reasonable_orders=true, lm_cost_type=one), transform=adapt_costs(one))', '--search', 'lazy(alt([single(hff), single(hff, pref_only=true), single(hlm), single(hlm, pref_only=true)], boost=1000), preferred=[hff,hlm], cost_type=one, reopen_closed=false, randomize_successors=False, preferred_successors_first=True, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 158.59 -> (159, 160) reading input... [t=1.976e-05s] done reading input! [t=0.000568934s] packing state variables...done! [t=0.000576751s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000671748s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.2456e-05s done initializing global data [t=0.000704388s] 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.000682787s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initializing LAMA-FF synergy object Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for : 16 New best heuristic value for : 16 [g=0, 1 evaluated, 0 expanded, t=0.0016785s, 4916 KB] Initial heuristic value for : 16 Initial heuristic value for : 16 New best heuristic value for : 15 [g=2, 3 evaluated, 2 expanded, t=0.00175495s, 4916 KB] New best heuristic value for : 14 [g=3, 4 evaluated, 3 expanded, t=0.00180273s, 4916 KB] New best heuristic value for : 13 [g=4, 5 evaluated, 4 expanded, t=0.00184973s, 4916 KB] New best heuristic value for : 12 [g=5, 6 evaluated, 5 expanded, t=0.00189545s, 4916 KB] New best heuristic value for : 11 [g=6, 7 evaluated, 6 expanded, t=0.00194198s, 4916 KB] New best heuristic value for : 10 [g=7, 8 evaluated, 7 expanded, t=0.00198576s, 4916 KB] New best heuristic value for : 9 [g=8, 9 evaluated, 8 expanded, t=0.00203153s, 4916 KB] New best heuristic value for : 8 [g=9, 11 evaluated, 10 expanded, t=0.00213094s, 4916 KB] New best heuristic value for : 13 [g=10, 12 evaluated, 11 expanded, t=0.00217736s, 4916 KB] New best heuristic value for : 7 New best heuristic value for : 11 [g=11, 13 evaluated, 12 expanded, t=0.00222195s, 4916 KB] New best heuristic value for : 5 [g=13, 15 evaluated, 14 expanded, t=0.00228936s, 4916 KB] New best heuristic value for : 10 [g=18, 20 evaluated, 19 expanded, t=0.00242098s, 4916 KB] New best heuristic value for : 9 [g=20, 23 evaluated, 22 expanded, t=0.00250745s, 4916 KB] New best heuristic value for : 4 [g=24, 27 evaluated, 26 expanded, t=0.00260654s, 4916 KB] New best heuristic value for : 2 [g=25, 28 evaluated, 27 expanded, t=0.00265782s, 4916 KB] New best heuristic value for : 5 [g=31, 36 evaluated, 35 expanded, t=0.00283753s, 5048 KB] New best heuristic value for : 4 [g=32, 37 evaluated, 36 expanded, t=0.00289151s, 5048 KB] New best heuristic value for : 3 [g=39, 44 evaluated, 43 expanded, t=0.00303101s, 5048 KB] New best heuristic value for : 1 [g=46, 52 evaluated, 51 expanded, t=0.00319223s, 5048 KB] New best heuristic value for : 2 [g=49, 55 evaluated, 54 expanded, t=0.00326404s, 5048 KB] New best heuristic value for : 1 [g=50, 56 evaluated, 55 expanded, t=0.00330861s, 5048 KB] Completely explored state space -- no solution! Actual search time: 0.00372525s [t=0.00538172s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.0037407s Total time: 0.00538462s Search stopped without finding a solution. Peak memory: 5048 KB exitcode: 5 remaining time: 1799.74 config 3: relative time 59, remaining 1397 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hff=ff(transform=adapt_costs(one))', '--heuristic', 'hlm=lmcount(lm_rhw(reasonable_orders=true, lm_cost_type=2), transform=adapt_costs(one))', '--search', 'eager_greedy([hff, hlm], preferred=[hff, hlm], cost_type=one, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 76.01 -> (77, 78) reading input... [t=1.9813e-05s] done reading input! [t=0.000569608s] packing state variables...done! [t=0.000577502s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000638388s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.2028e-05s done initializing global data [t=0.000668834s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... 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.000674492s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Conducting best first search without reopening closed nodes, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 New best heuristic value for ff(transform = adapt_costs(one)): 16 [g=0, 1 evaluated, 0 expanded, t=0.00174011s, 4920 KB] Initial heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 Initial heuristic value for ff(transform = adapt_costs(one)): 16 pruning method: none New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 18 [g=2, 3 evaluated, 2 expanded, t=0.0018163s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 17 [g=3, 4 evaluated, 3 expanded, t=0.00190059s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 16 [g=4, 5 evaluated, 4 expanded, t=0.00194437s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 15 [g=5, 6 evaluated, 5 expanded, t=0.00198674s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 14 [g=6, 8 evaluated, 6 expanded, t=0.0020376s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 13 [g=7, 9 evaluated, 7 expanded, t=0.00208083s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 12 [g=8, 10 evaluated, 8 expanded, t=0.00212075s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 11 [g=9, 12 evaluated, 9 expanded, t=0.00216842s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 13 [g=10, 13 evaluated, 10 expanded, t=0.00220792s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 10 New best heuristic value for ff(transform = adapt_costs(one)): 11 [g=11, 14 evaluated, 11 expanded, t=0.00224884s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 9 [g=12, 15 evaluated, 12 expanded, t=0.00229064s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 8 [g=13, 16 evaluated, 13 expanded, t=0.00232965s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 7 [g=13, 17 evaluated, 13 expanded, t=0.00236812s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 10 [g=18, 24 evaluated, 20 expanded, t=0.00247554s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 9 [g=20, 26 evaluated, 22 expanded, t=0.00252691s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 6 [g=23, 29 evaluated, 26 expanded, t=0.00259623s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 5 [g=24, 30 evaluated, 27 expanded, t=0.00263584s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 3 [g=25, 34 evaluated, 29 expanded, t=0.00271279s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 8 [g=27, 38 evaluated, 31 expanded, t=0.00277532s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 5 [g=31, 49 evaluated, 42 expanded, t=0.00292916s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 4 [g=32, 50 evaluated, 43 expanded, t=0.0029678s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 3 [g=39, 62 evaluated, 53 expanded, t=0.00310493s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 1 [g=46, 75 evaluated, 64 expanded, t=0.00328591s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 2 [g=49, 82 evaluated, 67 expanded, t=0.003366s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 1 [g=50, 83 evaluated, 68 expanded, t=0.00340339s, 5056 KB] Completely explored state space -- no solution! Actual search time: 0.00266042s [t=0.00444285s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 656 Generated 349 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.0027412s Total time: 0.00444586s Search stopped without finding a solution. Peak memory: 5056 KB exitcode: 5 remaining time: 1799.74 config 4: relative time 23, remaining 1338 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hlm,hff=lm_ff_syn(lm_rhw(reasonable_orders=true, lm_cost_type=one), transform=adapt_costs(one))', '--search', 'lazy(alt([single(hff), single(hff, pref_only=true), single(hlm), single(hlm, pref_only=true)], boost=1000), preferred=[hff,hlm], cost_type=one, reopen_closed=false, randomize_successors=True, preferred_successors_first=True, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 30.94 -> (31, 32) reading input... [t=2.851e-05s] done reading input! [t=0.000595383s] packing state variables...done! [t=0.000604388s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000665594s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.2379e-05s done initializing global data [t=0.000696274s] 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.000678951s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initializing LAMA-FF synergy object Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for : 16 New best heuristic value for : 16 [g=0, 1 evaluated, 0 expanded, t=0.00166764s, 4916 KB] Initial heuristic value for : 16 Initial heuristic value for : 16 New best heuristic value for : 15 [g=2, 3 evaluated, 2 expanded, t=0.00174758s, 4916 KB] New best heuristic value for : 14 [g=3, 4 evaluated, 3 expanded, t=0.00179588s, 4916 KB] New best heuristic value for : 13 [g=4, 5 evaluated, 4 expanded, t=0.00184258s, 4916 KB] New best heuristic value for : 12 [g=5, 6 evaluated, 5 expanded, t=0.00188861s, 4916 KB] New best heuristic value for : 11 [g=6, 7 evaluated, 6 expanded, t=0.00193196s, 4916 KB] New best heuristic value for : 10 [g=7, 8 evaluated, 7 expanded, t=0.00197482s, 4916 KB] New best heuristic value for : 9 [g=8, 9 evaluated, 8 expanded, t=0.00202333s, 4916 KB] New best heuristic value for : 8 [g=9, 11 evaluated, 10 expanded, t=0.00208342s, 4916 KB] New best heuristic value for : 13 [g=10, 12 evaluated, 11 expanded, t=0.0021262s, 4916 KB] New best heuristic value for : 7 New best heuristic value for : 11 [g=11, 13 evaluated, 12 expanded, t=0.00217059s, 4916 KB] New best heuristic value for : 6 [g=13, 15 evaluated, 14 expanded, t=0.0022382s, 4916 KB] New best heuristic value for : 5 [g=15, 17 evaluated, 16 expanded, t=0.00231653s, 4916 KB] New best heuristic value for : 10 [g=20, 23 evaluated, 22 expanded, t=0.00245589s, 4916 KB] New best heuristic value for : 9 [g=22, 26 evaluated, 25 expanded, t=0.00254202s, 4916 KB] New best heuristic value for : 4 [g=26, 30 evaluated, 29 expanded, t=0.00264193s, 4916 KB] New best heuristic value for : 2 [g=27, 31 evaluated, 30 expanded, t=0.00269147s, 5048 KB] New best heuristic value for : 5 [g=33, 40 evaluated, 39 expanded, t=0.00289489s, 5048 KB] New best heuristic value for : 4 [g=34, 41 evaluated, 40 expanded, t=0.00294471s, 5048 KB] New best heuristic value for : 3 [g=41, 48 evaluated, 47 expanded, t=0.00308268s, 5048 KB] New best heuristic value for : 1 [g=48, 56 evaluated, 55 expanded, t=0.00324667s, 5048 KB] New best heuristic value for : 2 [g=51, 59 evaluated, 58 expanded, t=0.00331879s, 5048 KB] New best heuristic value for : 1 [g=52, 60 evaluated, 59 expanded, t=0.00336135s, 5048 KB] Completely explored state space -- no solution! Actual search time: 0.00372187s [t=0.0053675s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00373736s Total time: 0.00537042s Search stopped without finding a solution. Peak memory: 5048 KB exitcode: 5 remaining time: 1799.73 config 5: relative time 57, remaining 1315 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_rhw(only_causal_landmarks=false,disjunctive_landmarks=true,conjunctive_landmarks=true,no_orders=true,lm_cost_type=1)', '--heuristic', 'hCg=cg(adapt_costs(2))', '--heuristic', 'hLM,hFF=lm_ff_syn(lmg,admissible=true,transform=adapt_costs(2))', '--search', 'lazy(alt([single(sum([g(),weight(hLM, 10)])),single(sum([g(),weight(hLM, 10)]),pref_only=true),single(sum([g(),weight(hFF, 10)])),single(sum([g(),weight(hFF, 10)]),pref_only=true),single(sum([g(),weight(hCg, 10)])),single(sum([g(),weight(hCg, 10)]),pref_only=true)], boost=1000),preferred=[hLM,hCg],reopen_closed=false,cost_type=2,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 78.01 -> (79, 80) reading input... [t=3.3149e-05s] done reading input! [t=0.000964337s] packing state variables...done! [t=0.000978396s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00113397s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 5.37e-05s done initializing global data [t=0.00121365s] Initializing heuristic cache... building causal graph...done! [t=0.000261903s] done! Initializing causal graph heuristic... Initializing Exploration... Initializing landmarks count heuristic... Generating landmarks using the RPG/SAS+ approach Removing all orderings. Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.00103545s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 0 edges Initializing LAMA-FF synergy object Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for cg(adapt_costs(2)): 7 New best heuristic value for : 18 New best heuristic value for : 19 [g=0, 1 evaluated, 0 expanded, t=0.00398951s, 5412 KB] Initial heuristic value for cg(adapt_costs(2)): 7 Initial heuristic value for : 18 Initial heuristic value for : 19 New best heuristic value for : 17 [g=1, 2 evaluated, 1 expanded, t=0.00406208s, 5412 KB] New best heuristic value for : 16 [g=2, 3 evaluated, 2 expanded, t=0.00416323s, 5412 KB] New best heuristic value for : 15 [g=3, 4 evaluated, 3 expanded, t=0.00432073s, 5412 KB] New best heuristic value for cg(adapt_costs(2)): 6 New best heuristic value for : 14 [g=4, 5 evaluated, 4 expanded, t=0.00446288s, 5412 KB] New best heuristic value for : 13 [g=5, 6 evaluated, 5 expanded, t=0.00460111s, 5412 KB] New best heuristic value for : 12 [g=6, 7 evaluated, 6 expanded, t=0.00473692s, 5412 KB] New best heuristic value for cg(adapt_costs(2)): 5 New best heuristic value for : 11 [g=7, 8 evaluated, 7 expanded, t=0.00487744s, 5412 KB] New best heuristic value for cg(adapt_costs(2)): 4 New best heuristic value for : 10 [g=8, 9 evaluated, 8 expanded, t=0.00504035s, 5412 KB] New best heuristic value for cg(adapt_costs(2)): 3 [g=9, 10 evaluated, 9 expanded, t=0.00518329s, 5412 KB] New best heuristic value for : 9 New best heuristic value for : 16 [g=10, 11 evaluated, 10 expanded, t=0.00532149s, 5412 KB] New best heuristic value for : 8 [g=11, 12 evaluated, 11 expanded, t=0.00545842s, 5412 KB] New best heuristic value for : 6 [g=13, 13 evaluated, 12 expanded, t=0.00559347s, 5412 KB] New best heuristic value for : 5 [g=14, 14 evaluated, 13 expanded, t=0.00574317s, 5412 KB] New best heuristic value for : 13 [g=19, 22 evaluated, 21 expanded, t=0.00631609s, 5412 KB] New best heuristic value for : 12 [g=21, 25 evaluated, 24 expanded, t=0.00658829s, 5412 KB] New best heuristic value for : 4 [g=26, 29 evaluated, 28 expanded, t=0.00690726s, 5412 KB] New best heuristic value for : 2 New best heuristic value for : 11 [g=29, 32 evaluated, 31 expanded, t=0.00718754s, 5412 KB] New best heuristic value for : 7 [g=35, 39 evaluated, 38 expanded, t=0.007659s, 5548 KB] New best heuristic value for : 6 [g=36, 40 evaluated, 39 expanded, t=0.00781394s, 5548 KB] New best heuristic value for : 5 [g=56, 79 evaluated, 78 expanded, t=0.0102553s, 5548 KB] New best heuristic value for : 4 [g=57, 80 evaluated, 79 expanded, t=0.0104019s, 5548 KB] New best heuristic value for : 3 [g=58, 81 evaluated, 80 expanded, t=0.010537s, 5548 KB] New best heuristic value for cg(adapt_costs(2)): 2 New best heuristic value for : 2 [g=59, 82 evaluated, 81 expanded, t=0.0106723s, 5548 KB] Completely explored state space -- no solution! Actual search time: 0.0116862s [t=0.0156377s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 492 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.01171s Total time: 0.0156438s Search stopped without finding a solution. Peak memory: 5548 KB exitcode: 5 remaining time: 1799.71 config 6: relative time 17, remaining 1258 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hcea=cea(transform=adapt_costs(one))', '--heuristic', 'hlm=lmcount(lm_rhw(reasonable_orders=true, lm_cost_type=2), transform=adapt_costs(one))', '--search', 'lazy_greedy([hcea, hlm], preferred=[hcea, hlm], cost_type=one, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 24.32 -> (25, 26) reading input... [t=2.5916e-05s] done reading input! [t=0.000740638s] packing state variables...done! [t=0.000751129s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000830654s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.8716e-05s done initializing global data [t=0.000870889s] Initializing context-enhanced additive heuristic... 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.000879387s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 New best heuristic value for cea(transform = adapt_costs(one)): 25 [g=0, 1 evaluated, 0 expanded, t=0.00244699s, 5048 KB] Initial heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 Initial heuristic value for cea(transform = adapt_costs(one)): 25 New best heuristic value for cea(transform = adapt_costs(one)): 24 [g=1, 2 evaluated, 1 expanded, t=0.00252338s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 18 New best heuristic value for cea(transform = adapt_costs(one)): 23 [g=2, 3 evaluated, 2 expanded, t=0.00258656s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 17 New best heuristic value for cea(transform = adapt_costs(one)): 22 [g=3, 4 evaluated, 3 expanded, t=0.0026536s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 16 New best heuristic value for cea(transform = adapt_costs(one)): 21 [g=4, 5 evaluated, 4 expanded, t=0.00271742s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 15 New best heuristic value for cea(transform = adapt_costs(one)): 20 [g=5, 6 evaluated, 5 expanded, t=0.00277736s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 14 New best heuristic value for cea(transform = adapt_costs(one)): 19 [g=6, 7 evaluated, 6 expanded, t=0.00283534s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 13 New best heuristic value for cea(transform = adapt_costs(one)): 18 [g=7, 8 evaluated, 7 expanded, t=0.00289469s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 12 New best heuristic value for cea(transform = adapt_costs(one)): 17 [g=8, 9 evaluated, 8 expanded, t=0.00295602s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 11 New best heuristic value for cea(transform = adapt_costs(one)): 16 [g=9, 10 evaluated, 9 expanded, t=0.0030117s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 10 [g=11, 13 evaluated, 12 expanded, t=0.00311209s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 9 [g=12, 14 evaluated, 13 expanded, t=0.00317672s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 8 [g=13, 15 evaluated, 14 expanded, t=0.00322906s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 7 [g=15, 17 evaluated, 16 expanded, t=0.00329775s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(one)): 15 [g=18, 20 evaluated, 19 expanded, t=0.00337447s, 5180 KB] New best heuristic value for cea(transform = adapt_costs(one)): 14 [g=19, 21 evaluated, 20 expanded, t=0.00343268s, 5180 KB] New best heuristic value for cea(transform = adapt_costs(one)): 13 [g=20, 22 evaluated, 21 expanded, t=0.00348314s, 5180 KB] New best heuristic value for cea(transform = adapt_costs(one)): 12 [g=23, 26 evaluated, 25 expanded, t=0.00358496s, 5180 KB] New best heuristic value for cea(transform = adapt_costs(one)): 11 [g=24, 27 evaluated, 26 expanded, t=0.0036592s, 5180 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 6 [g=25, 28 evaluated, 27 expanded, t=0.00371858s, 5180 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 5 [g=26, 29 evaluated, 28 expanded, t=0.00377553s, 5180 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 3 New best heuristic value for cea(transform = adapt_costs(one)): 9 [g=27, 33 evaluated, 32 expanded, t=0.00388764s, 5180 KB] New best heuristic value for cea(transform = adapt_costs(one)): 8 [g=40, 48 evaluated, 47 expanded, t=0.00408966s, 5180 KB] New best heuristic value for cea(transform = adapt_costs(one)): 7 [g=44, 52 evaluated, 51 expanded, t=0.00417961s, 5180 KB] New best heuristic value for cea(transform = adapt_costs(one)): 5 [g=45, 54 evaluated, 53 expanded, t=0.00424153s, 5180 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 1 [g=48, 58 evaluated, 57 expanded, t=0.00432321s, 5180 KB] New best heuristic value for cea(transform = adapt_costs(one)): 4 [g=49, 59 evaluated, 58 expanded, t=0.00437469s, 5180 KB] New best heuristic value for cea(transform = adapt_costs(one)): 3 [g=50, 60 evaluated, 59 expanded, t=0.00441822s, 5180 KB] New best heuristic value for cea(transform = adapt_costs(one)): 2 [g=51, 61 evaluated, 60 expanded, t=0.00446386s, 5180 KB] New best heuristic value for cea(transform = adapt_costs(one)): 1 [g=52, 62 evaluated, 61 expanded, t=0.00450718s, 5180 KB] Completely explored state space -- no solution! Actual search time: 0.00349333s [t=0.00588845s] Expanded 155 state(s). Reopened 0 state(s). Evaluated 155 state(s). Evaluations: 310 Generated 333 state(s). Dead ends: 0 state(s). Number of registered states: 155 Int hash set load factor: 155/256 = 0.605469 Int hash set resizes: 8 Search time: 0.00351304s Total time: 0.00589222s Search stopped without finding a solution. Peak memory: 5180 KB exitcode: 5 remaining time: 1799.71 config 7: relative time 12, remaining 1241 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hadd=add(transform=adapt_costs(one))', '--heuristic', 'hlm=lmcount(lm_rhw(reasonable_orders=true, lm_cost_type=2), transform=adapt_costs(one))', '--search', 'lazy(alt([type_based([g()]),single(hadd), single(hadd, pref_only=true), single(hlm), single(hlm, pref_only=true)]), preferred=[hadd, hlm], cost_type=one, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 17.40 -> (18, 19) reading input... [t=2.5804e-05s] done reading input! [t=0.000743073s] packing state variables...done! [t=0.000754765s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00083364s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.8706e-05s done initializing global data [t=0.000873862s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... 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.000879786s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 New best heuristic value for add(transform = adapt_costs(one)): 25 [g=0, 1 evaluated, 0 expanded, t=0.00237725s, 5048 KB] Initial heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 Initial heuristic value for add(transform = adapt_costs(one)): 25 New best heuristic value for add(transform = adapt_costs(one)): 24 [g=1, 2 evaluated, 1 expanded, t=0.00245041s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 18 New best heuristic value for add(transform = adapt_costs(one)): 23 [g=2, 3 evaluated, 2 expanded, t=0.00250709s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 17 New best heuristic value for add(transform = adapt_costs(one)): 22 [g=3, 4 evaluated, 3 expanded, t=0.00256143s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 16 New best heuristic value for add(transform = adapt_costs(one)): 21 [g=4, 5 evaluated, 4 expanded, t=0.0026173s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 15 New best heuristic value for add(transform = adapt_costs(one)): 20 [g=5, 6 evaluated, 5 expanded, t=0.00267234s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 14 New best heuristic value for add(transform = adapt_costs(one)): 19 [g=6, 7 evaluated, 6 expanded, t=0.00272931s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 13 New best heuristic value for add(transform = adapt_costs(one)): 18 [g=7, 8 evaluated, 7 expanded, t=0.00278242s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 12 New best heuristic value for add(transform = adapt_costs(one)): 17 [g=8, 9 evaluated, 8 expanded, t=0.00283999s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 11 New best heuristic value for add(transform = adapt_costs(one)): 16 [g=9, 12 evaluated, 11 expanded, t=0.00291677s, 5048 KB] New best heuristic value for add(transform = adapt_costs(one)): 15 [g=10, 13 evaluated, 12 expanded, t=0.00296976s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 10 New best heuristic value for add(transform = adapt_costs(one)): 14 [g=11, 14 evaluated, 13 expanded, t=0.00302037s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 9 [g=12, 15 evaluated, 14 expanded, t=0.00307157s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 7 [g=13, 16 evaluated, 15 expanded, t=0.00311875s, 5048 KB] New best heuristic value for add(transform = adapt_costs(one)): 11 [g=18, 24 evaluated, 23 expanded, t=0.00325903s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 6 [g=23, 29 evaluated, 28 expanded, t=0.00336698s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 5 [g=24, 30 evaluated, 29 expanded, t=0.00341764s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 3 New best heuristic value for add(transform = adapt_costs(one)): 9 [g=25, 36 evaluated, 35 expanded, t=0.0035473s, 5048 KB] New best heuristic value for add(transform = adapt_costs(one)): 7 [g=31, 46 evaluated, 45 expanded, t=0.00370825s, 5048 KB] New best heuristic value for add(transform = adapt_costs(one)): 5 [g=32, 47 evaluated, 46 expanded, t=0.00375793s, 5048 KB] New best heuristic value for add(transform = adapt_costs(one)): 4 [g=38, 55 evaluated, 54 expanded, t=0.00387649s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 1 [g=46, 69 evaluated, 68 expanded, t=0.00412116s, 5048 KB] New best heuristic value for add(transform = adapt_costs(one)): 3 [g=48, 72 evaluated, 71 expanded, t=0.00419251s, 5048 KB] New best heuristic value for add(transform = adapt_costs(one)): 2 [g=49, 74 evaluated, 73 expanded, t=0.00425042s, 5048 KB] New best heuristic value for add(transform = adapt_costs(one)): 1 [g=50, 76 evaluated, 75 expanded, t=0.0043046s, 5048 KB] Completely explored state space -- no solution! Actual search time: 0.00317561s [t=0.0055257s] Expanded 155 state(s). Reopened 0 state(s). Evaluated 155 state(s). Evaluations: 310 Generated 333 state(s). Dead ends: 0 state(s). Number of registered states: 155 Int hash set load factor: 155/256 = 0.605469 Int hash set resizes: 8 Search time: 0.00319658s Total time: 0.00552953s Search stopped without finding a solution. Peak memory: 5048 KB exitcode: 5 remaining time: 1799.7 config 8: relative time 26, remaining 1229 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hFF=ff(transform=adapt_costs(1))', '--search', 'lazy(alt([single(sum([g(),weight(hFF,10)])),single(sum([g(),weight(hFF,10)]),pref_only=true)],boost=2000),preferred=[hFF],reopen_closed=false,cost_type=1,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 38.07 -> (39, 40) reading input... [t=3.8676e-05s] done reading input! [t=0.00113197s] packing state variables...done! [t=0.00115048s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00126851s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.2593e-05s done initializing global data [t=0.00132896s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Conducting lazy best first search, (real) bound = 10 New best heuristic value for ff(transform = adapt_costs(1)): 16 [g=0, 1 evaluated, 0 expanded, t=0.0019871s, 4916 KB] Initial heuristic value for ff(transform = adapt_costs(1)): 16 New best heuristic value for ff(transform = adapt_costs(1)): 13 [g=10, 13 evaluated, 12 expanded, t=0.00226168s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 11 [g=11, 14 evaluated, 13 expanded, t=0.00233441s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 10 [g=18, 21 evaluated, 20 expanded, t=0.0025006s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 9 [g=20, 23 evaluated, 22 expanded, t=0.00258564s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 5 [g=29, 38 evaluated, 37 expanded, t=0.00286074s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 4 [g=30, 39 evaluated, 38 expanded, t=0.00292738s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 3 [g=39, 50 evaluated, 49 expanded, t=0.00311097s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 2 [g=49, 62 evaluated, 61 expanded, t=0.00331122s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 1 [g=50, 63 evaluated, 62 expanded, t=0.00337629s, 4916 KB] Completely explored state space -- no solution! Actual search time: 0.00289304s [t=0.00484846s] Expanded 155 state(s). Reopened 0 state(s). Evaluated 155 state(s). Evaluations: 155 Generated 333 state(s). Dead ends: 0 state(s). Number of registered states: 155 Int hash set load factor: 155/256 = 0.605469 Int hash set resizes: 8 Search time: 0.00291195s Total time: 0.00485347s Search stopped without finding a solution. Peak memory: 4916 KB exitcode: 5 remaining time: 1799.7 config 9: relative time 28, remaining 1203 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hcg=cg(transform=adapt_costs(one))', '--heuristic', 'hlm=lmcount(lm_rhw(reasonable_orders=true, lm_cost_type=2), transform=adapt_costs(one))', '--search', 'eager(alt([type_based([g()]),single(hcg), single(hcg, pref_only=true), single(hlm), single(hlm, pref_only=true)]), preferred=[hcg, hlm], cost_type=one, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 41.89 -> (42, 43) reading input... [t=2.5201e-05s] done reading input! [t=0.000716745s] packing state variables...done! [t=0.000726964s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000803146s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.7475e-05s done initializing global data [t=0.000842148s] Initializing heuristic cache... building causal graph...done! [t=0.000136725s] done! Initializing causal graph heuristic... 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.000858321s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Conducting best first search without reopening closed nodes, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 New best heuristic value for cg(transform = adapt_costs(one)): 5 [g=0, 1 evaluated, 0 expanded, t=0.00257455s, 5408 KB] Initial heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 Initial heuristic value for cg(transform = adapt_costs(one)): 5 pruning method: none New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 18 [g=2, 3 evaluated, 2 expanded, t=0.0026819s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 17 [g=3, 4 evaluated, 3 expanded, t=0.00273268s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 16 [g=4, 5 evaluated, 4 expanded, t=0.00279367s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 15 [g=5, 6 evaluated, 5 expanded, t=0.00284359s, 5408 KB] New best heuristic value for cg(transform = adapt_costs(one)): 4 [g=5, 7 evaluated, 5 expanded, t=0.00288668s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 14 [g=6, 8 evaluated, 7 expanded, t=0.0029398s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 13 [g=7, 9 evaluated, 8 expanded, t=0.0029943s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 12 New best heuristic value for cg(transform = adapt_costs(one)): 3 [g=8, 10 evaluated, 9 expanded, t=0.003045s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 11 New best heuristic value for cg(transform = adapt_costs(one)): 2 [g=9, 12 evaluated, 10 expanded, t=0.00310058s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 10 [g=11, 14 evaluated, 12 expanded, t=0.00316325s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 9 [g=12, 15 evaluated, 13 expanded, t=0.00321414s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 8 [g=13, 16 evaluated, 14 expanded, t=0.00326178s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 7 [g=13, 17 evaluated, 14 expanded, t=0.00330869s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 6 [g=23, 29 evaluated, 28 expanded, t=0.00349341s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 5 [g=24, 30 evaluated, 29 expanded, t=0.00354357s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 3 [g=25, 33 evaluated, 30 expanded, t=0.00361859s, 5408 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 1 [g=46, 100 evaluated, 91 expanded, t=0.00442631s, 5408 KB] New best heuristic value for cg(transform = adapt_costs(one)): 1 [g=50, 110 evaluated, 97 expanded, t=0.00455162s, 5408 KB] Completely explored state space -- no solution! Actual search time: 0.00261257s [t=0.00524295s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 656 Generated 349 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00271948s Total time: 0.00524742s Search stopped without finding a solution. Peak memory: 5408 KB exitcode: 5 remaining time: 1799.69 config 10: relative time 29, remaining 1175 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_rhw(only_causal_landmarks=false,disjunctive_landmarks=true,conjunctive_landmarks=true,no_orders=false,lm_cost_type=2)', '--heuristic', 'hCea=cea(adapt_costs(2))', '--heuristic', 'hLM,hFF=lm_ff_syn(lmg,admissible=true,transform=adapt_costs(2))', '--search', 'lazy(alt([single(hLM),single(hLM,pref_only=true),single(hFF),single(hFF,pref_only=true),single(hCea),single(hCea,pref_only=true)], boost=0),preferred=[hLM,hCea],reopen_closed=false,cost_type=2,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 44.42 -> (45, 46) reading input... [t=3.7942e-05s] done reading input! [t=0.001057s] packing state variables...done! [t=0.00107276s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00118872s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.2093e-05s done initializing global data [t=0.00124667s] Initializing context-enhanced additive heuristic... Initializing Exploration... Initializing landmarks count heuristic... Generating landmarks using the RPG/SAS+ approach Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.00127294s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initializing LAMA-FF synergy object Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for cea(adapt_costs(2)): 29 New best heuristic value for : 18 New best heuristic value for : 19 [g=0, 1 evaluated, 0 expanded, t=0.00367463s, 5052 KB] Initial heuristic value for cea(adapt_costs(2)): 29 Initial heuristic value for : 18 Initial heuristic value for : 19 New best heuristic value for cea(adapt_costs(2)): 27 New best heuristic value for : 17 [g=1, 2 evaluated, 1 expanded, t=0.0038132s, 5052 KB] New best heuristic value for cea(adapt_costs(2)): 26 New best heuristic value for : 16 [g=2, 3 evaluated, 2 expanded, t=0.00393174s, 5052 KB] New best heuristic value for cea(adapt_costs(2)): 25 New best heuristic value for : 15 [g=3, 4 evaluated, 3 expanded, t=0.00404874s, 5052 KB] New best heuristic value for cea(adapt_costs(2)): 24 New best heuristic value for : 14 [g=4, 5 evaluated, 4 expanded, t=0.00416592s, 5052 KB] New best heuristic value for cea(adapt_costs(2)): 23 New best heuristic value for : 13 [g=5, 6 evaluated, 5 expanded, t=0.0042772s, 5052 KB] New best heuristic value for cea(adapt_costs(2)): 22 New best heuristic value for : 12 [g=6, 7 evaluated, 6 expanded, t=0.00438717s, 5052 KB] New best heuristic value for cea(adapt_costs(2)): 21 New best heuristic value for : 11 [g=7, 8 evaluated, 7 expanded, t=0.00449741s, 5052 KB] New best heuristic value for cea(adapt_costs(2)): 20 New best heuristic value for : 10 [g=8, 9 evaluated, 8 expanded, t=0.00461155s, 5052 KB] New best heuristic value for cea(adapt_costs(2)): 19 [g=9, 11 evaluated, 10 expanded, t=0.0047593s, 5052 KB] New best heuristic value for : 9 New best heuristic value for : 16 [g=10, 12 evaluated, 11 expanded, t=0.00486687s, 5052 KB] New best heuristic value for : 8 [g=11, 13 evaluated, 12 expanded, t=0.00497166s, 5188 KB] New best heuristic value for : 7 [g=13, 14 evaluated, 13 expanded, t=0.00509933s, 5188 KB] New best heuristic value for cea(adapt_costs(2)): 18 [g=17, 20 evaluated, 19 expanded, t=0.00546552s, 5188 KB] New best heuristic value for cea(adapt_costs(2)): 17 [g=18, 21 evaluated, 20 expanded, t=0.00557494s, 5188 KB] New best heuristic value for cea(adapt_costs(2)): 16 New best heuristic value for : 13 [g=19, 23 evaluated, 22 expanded, t=0.00573292s, 5188 KB] New best heuristic value for : 6 [g=21, 25 evaluated, 24 expanded, t=0.00589177s, 5188 KB] New best heuristic value for : 12 [g=21, 26 evaluated, 25 expanded, t=0.00600531s, 5188 KB] New best heuristic value for : 5 [g=26, 30 evaluated, 29 expanded, t=0.00627883s, 5188 KB] New best heuristic value for cea(adapt_costs(2)): 15 [g=27, 33 evaluated, 32 expanded, t=0.00652971s, 5188 KB] New best heuristic value for cea(adapt_costs(2)): 11 New best heuristic value for : 4 New best heuristic value for : 11 [g=29, 34 evaluated, 33 expanded, t=0.00664085s, 5188 KB] New best heuristic value for : 7 [g=35, 44 evaluated, 43 expanded, t=0.00715808s, 5188 KB] New best heuristic value for : 6 [g=36, 45 evaluated, 44 expanded, t=0.00726806s, 5188 KB] New best heuristic value for : 3 [g=38, 46 evaluated, 45 expanded, t=0.00737336s, 5188 KB] New best heuristic value for cea(adapt_costs(2)): 10 [g=49, 60 evaluated, 59 expanded, t=0.0079976s, 5188 KB] New best heuristic value for cea(adapt_costs(2)): 6 New best heuristic value for : 2 [g=55, 75 evaluated, 74 expanded, t=0.0087863s, 5188 KB] New best heuristic value for cea(adapt_costs(2)): 5 New best heuristic value for : 5 [g=56, 76 evaluated, 75 expanded, t=0.00888563s, 5188 KB] New best heuristic value for cea(adapt_costs(2)): 4 New best heuristic value for : 4 [g=57, 77 evaluated, 76 expanded, t=0.00897682s, 5188 KB] New best heuristic value for cea(adapt_costs(2)): 3 New best heuristic value for : 3 [g=58, 79 evaluated, 78 expanded, t=0.00909847s, 5188 KB] New best heuristic value for cea(adapt_costs(2)): 2 New best heuristic value for : 2 [g=59, 80 evaluated, 79 expanded, t=0.00918625s, 5188 KB] Completely explored state space -- no solution! Actual search time: 0.00940419s [t=0.0129787s] Expanded 155 state(s). Reopened 0 state(s). Evaluated 155 state(s). Evaluations: 465 Generated 333 state(s). Dead ends: 0 state(s). Number of registered states: 155 Int hash set load factor: 155/256 = 0.605469 Int hash set resizes: 8 Search time: 0.00943404s Total time: 0.0129843s Search stopped without finding a solution. Peak memory: 5188 KB exitcode: 5 remaining time: 1799.68 config 11: relative time 88, remaining 1146 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hcea=cea(transform=adapt_costs(one))', '--heuristic', 'hlm=lmcount(lm_rhw(reasonable_orders=true, lm_cost_type=2), transform=adapt_costs(one))', '--search', 'lazy_wastar([hcea, hlm], w=3, preferred=[hcea, hlm], cost_type=one, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 138.20 -> (139, 140) reading input... [t=2.8094e-05s] done reading input! [t=0.000819995s] packing state variables...done! [t=0.000831449s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000919016s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 3.1528e-05s done initializing global data [t=0.00096352s] Initializing context-enhanced additive heuristic... 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.000976952s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 New best heuristic value for cea(transform = adapt_costs(one)): 25 [g=0, 1 evaluated, 0 expanded, t=0.00271469s, 5048 KB] Initial heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 Initial heuristic value for cea(transform = adapt_costs(one)): 25 New best heuristic value for cea(transform = adapt_costs(one)): 24 [g=1, 2 evaluated, 1 expanded, t=0.0028006s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 18 New best heuristic value for cea(transform = adapt_costs(one)): 23 [g=2, 3 evaluated, 2 expanded, t=0.00288099s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 17 New best heuristic value for cea(transform = adapt_costs(one)): 22 [g=3, 4 evaluated, 3 expanded, t=0.00295318s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 16 New best heuristic value for cea(transform = adapt_costs(one)): 21 [g=4, 5 evaluated, 4 expanded, t=0.00302576s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 15 New best heuristic value for cea(transform = adapt_costs(one)): 20 [g=5, 6 evaluated, 5 expanded, t=0.0030952s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 14 New best heuristic value for cea(transform = adapt_costs(one)): 19 [g=6, 7 evaluated, 6 expanded, t=0.00316204s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 13 New best heuristic value for cea(transform = adapt_costs(one)): 18 [g=7, 8 evaluated, 7 expanded, t=0.00323226s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 12 New best heuristic value for cea(transform = adapt_costs(one)): 17 [g=8, 9 evaluated, 8 expanded, t=0.00330392s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 11 New best heuristic value for cea(transform = adapt_costs(one)): 16 [g=9, 10 evaluated, 9 expanded, t=0.0033682s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 10 [g=11, 13 evaluated, 12 expanded, t=0.00348603s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 9 [g=12, 14 evaluated, 13 expanded, t=0.00355979s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 8 [g=13, 15 evaluated, 14 expanded, t=0.00362066s, 5048 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 7 [g=15, 17 evaluated, 16 expanded, t=0.00370413s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 15 [g=18, 20 evaluated, 19 expanded, t=0.00380499s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 14 [g=19, 21 evaluated, 20 expanded, t=0.0038832s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 13 [g=20, 23 evaluated, 22 expanded, 1 reopened, t=0.00394959s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 12 [g=23, 27 evaluated, 26 expanded, 1 reopened, t=0.00405746s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 11 [g=24, 28 evaluated, 27 expanded, 1 reopened, t=0.00412037s, 5184 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 6 [g=25, 29 evaluated, 28 expanded, 1 reopened, t=0.00419114s, 5184 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 5 [g=26, 30 evaluated, 29 expanded, 1 reopened, t=0.00425348s, 5184 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 3 New best heuristic value for cea(transform = adapt_costs(one)): 9 [g=27, 35 evaluated, 34 expanded, 2 reopened, t=0.00439138s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 8 [g=40, 55 evaluated, 54 expanded, 2 reopened, t=0.00473s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 7 [g=44, 73 evaluated, 72 expanded, 3 reopened, t=0.0050911s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 5 [g=45, 75 evaluated, 74 expanded, 3 reopened, t=0.00516493s, 5184 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 1 [g=48, 85 evaluated, 84 expanded, 3 reopened, t=0.005347s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 4 [g=49, 86 evaluated, 85 expanded, 3 reopened, t=0.00540341s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 3 [g=50, 87 evaluated, 86 expanded, 3 reopened, t=0.0054535s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 2 [g=51, 88 evaluated, 87 expanded, 3 reopened, t=0.00550365s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(one)): 1 [g=52, 89 evaluated, 88 expanded, 3 reopened, t=0.00555225s, 5184 KB] Completely explored state space -- no solution! Actual search time: 0.00516963s [t=0.00782877s] Expanded 309 state(s). Reopened 145 state(s). Evaluated 309 state(s). Evaluations: 473 Generated 667 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00519219s Total time: 0.00783297s Search stopped without finding a solution. Peak memory: 5184 KB exitcode: 5 remaining time: 1799.67 config 12: relative time 8, remaining 1058 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hCg=cg(adapt_costs(1))', '--heuristic', 'hFF=ff(adapt_costs(1))', '--search', 'lazy(alt([single(sum([g(),weight(hFF,10)])),single(sum([g(),weight(hFF,10)]),pref_only=true),single(sum([g(),weight(hCg, 10)])),single(sum([g(),weight(hCg,10)]),pref_only=true)],boost=100),preferred=[hCg],reopen_closed=false,cost_type=1,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 13.61 -> (14, 15) reading input... [t=2.7207e-05s] done reading input! [t=0.00078898s] packing state variables...done! [t=0.000800242s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000885062s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 3.0669e-05s done initializing global data [t=0.000927718s] Initializing heuristic cache... building causal graph...done! [t=0.000152757s] done! Initializing causal graph heuristic... Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Conducting lazy best first search, (real) bound = 10 New best heuristic value for cg(adapt_costs(1)): 5 New best heuristic value for ff(adapt_costs(1)): 16 [g=0, 1 evaluated, 0 expanded, t=0.00201013s, 5276 KB] Initial heuristic value for cg(adapt_costs(1)): 5 Initial heuristic value for ff(adapt_costs(1)): 16 New best heuristic value for cg(adapt_costs(1)): 4 [g=5, 7 evaluated, 6 expanded, t=0.00218165s, 5276 KB] New best heuristic value for cg(adapt_costs(1)): 3 [g=8, 10 evaluated, 9 expanded, t=0.00229341s, 5276 KB] New best heuristic value for cg(adapt_costs(1)): 2 [g=9, 11 evaluated, 10 expanded, t=0.00235428s, 5276 KB] New best heuristic value for ff(adapt_costs(1)): 13 [g=10, 12 evaluated, 11 expanded, t=0.00241297s, 5276 KB] New best heuristic value for ff(adapt_costs(1)): 11 [g=11, 14 evaluated, 13 expanded, t=0.00248749s, 5276 KB] New best heuristic value for ff(adapt_costs(1)): 10 [g=18, 24 evaluated, 23 expanded, t=0.00269272s, 5276 KB] New best heuristic value for ff(adapt_costs(1)): 9 [g=20, 26 evaluated, 25 expanded, t=0.0027676s, 5276 KB] New best heuristic value for ff(adapt_costs(1)): 8 [g=27, 35 evaluated, 34 expanded, t=0.00297036s, 5276 KB] New best heuristic value for ff(adapt_costs(1)): 5 [g=29, 47 evaluated, 46 expanded, t=0.00320511s, 5276 KB] New best heuristic value for ff(adapt_costs(1)): 4 [g=30, 48 evaluated, 47 expanded, t=0.00326414s, 5276 KB] New best heuristic value for ff(adapt_costs(1)): 3 [g=39, 66 evaluated, 65 expanded, t=0.00358886s, 5276 KB] New best heuristic value for ff(adapt_costs(1)): 2 [g=49, 79 evaluated, 78 expanded, t=0.00382454s, 5408 KB] New best heuristic value for cg(adapt_costs(1)): 1 New best heuristic value for ff(adapt_costs(1)): 1 [g=50, 80 evaluated, 79 expanded, t=0.00389005s, 5408 KB] Completely explored state space -- no solution! Actual search time: 0.0033116s [t=0.00528034s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00332579s Total time: 0.00528439s Search stopped without finding a solution. Peak memory: 5408 KB exitcode: 5 remaining time: 1799.67 config 13: relative time 54, remaining 1050 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hGoalCount=goalcount(transform=adapt_costs(2))', '--heuristic', 'hFF=ff(transform=adapt_costs(0))', '--search', 'lazy(alt([single(sum([g(),weight(hFF,10)])),single(sum([g(),weight(hFF,10)]),pref_only=true),single(sum([g(),weight(hGoalCount,10)])),single(sum([g(),weight(hGoalCount,10)]),pref_only=true)],boost=2000),preferred=[hFF,hGoalCount],reopen_closed=false,cost_type=1,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 92.55 -> (93, 94) reading input... [t=2.815e-05s] done reading input! [t=0.000823406s] packing state variables...done! [t=0.0008352s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000922824s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 3.185e-05s done initializing global data [t=0.000967106s] Initializing goal count heuristic... Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Conducting lazy best first search, (real) bound = 10 New best heuristic value for goalcount(transform = adapt_costs(2)): 1 New best heuristic value for ff(transform = adapt_costs(0)): 3 [g=0, 1 evaluated, 0 expanded, t=0.00158029s, 4920 KB] Initial heuristic value for goalcount(transform = adapt_costs(2)): 1 Initial heuristic value for ff(transform = adapt_costs(0)): 3 New best heuristic value for ff(transform = adapt_costs(0)): 2 [g=25, 34 evaluated, 33 expanded, t=0.00212432s, 4920 KB] New best heuristic value for ff(transform = adapt_costs(0)): 1 [g=46, 82 evaluated, 81 expanded, t=0.00278716s, 4920 KB] Completely explored state space -- no solution! Actual search time: 0.00249597s [t=0.00404726s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.0025106s Total time: 0.00405135s Search stopped without finding a solution. Peak memory: 4920 KB exitcode: 5 remaining time: 1799.67 config 14: relative time 24, remaining 996 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hff=ff(transform=adapt_costs(one))', '--heuristic', 'hlm=lmcount(lm_rhw(reasonable_orders=true, lm_cost_type=2), transform=adapt_costs(one))', '--search', 'eager(alt([type_based([g()]),single(sum([g(), weight(hff, 3)])), single(sum([g(), weight(hff, 3)]), pref_only=true), single(sum([g(), weight(hlm, 3)])), single(sum([g(), weight(hlm, 3)]), pref_only=true)]), preferred=[hff, hlm], cost_type=one, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 43.37 -> (44, 45) reading input... [t=2.6324e-05s] done reading input! [t=0.000761547s] packing state variables...done! [t=0.000772563s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00085423s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.9676e-05s done initializing global data [t=0.000900879s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... 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.000911342s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Conducting best first search without reopening closed nodes, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 New best heuristic value for ff(transform = adapt_costs(one)): 16 [g=0, 1 evaluated, 0 expanded, t=0.00260341s, 5056 KB] Initial heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 Initial heuristic value for ff(transform = adapt_costs(one)): 16 pruning method: none New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 18 [g=2, 3 evaluated, 2 expanded, t=0.0027169s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 17 [g=3, 4 evaluated, 3 expanded, t=0.00278446s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 16 [g=4, 5 evaluated, 4 expanded, t=0.00284765s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 15 [g=5, 6 evaluated, 5 expanded, t=0.00290764s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 14 [g=6, 8 evaluated, 6 expanded, t=0.00297917s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 13 [g=7, 9 evaluated, 7 expanded, t=0.00304246s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 12 [g=8, 10 evaluated, 8 expanded, t=0.00310454s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 11 [g=9, 12 evaluated, 9 expanded, t=0.0031746s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 13 [g=10, 13 evaluated, 10 expanded, t=0.00323544s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 10 New best heuristic value for ff(transform = adapt_costs(one)): 11 [g=11, 14 evaluated, 11 expanded, t=0.00329554s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 9 [g=12, 15 evaluated, 12 expanded, t=0.00335584s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 8 [g=13, 16 evaluated, 13 expanded, t=0.00341254s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 7 [g=13, 17 evaluated, 13 expanded, t=0.00346806s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 10 [g=18, 24 evaluated, 21 expanded, t=0.00364259s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 9 [g=20, 26 evaluated, 23 expanded, t=0.00371889s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 6 [g=23, 29 evaluated, 27 expanded, t=0.00382469s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 5 [g=24, 30 evaluated, 28 expanded, t=0.00388226s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 3 [g=25, 33 evaluated, 29 expanded, t=0.00398149s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 8 [g=27, 38 evaluated, 32 expanded, t=0.00409613s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 5 [g=31, 64 evaluated, 55 expanded, t=0.00457709s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 4 [g=30, 66 evaluated, 57 expanded, t=0.00468175s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 3 [g=39, 88 evaluated, 74 expanded, t=0.00505083s, 5056 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 1 [g=46, 117 evaluated, 109 expanded, t=0.00567327s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 2 [g=49, 131 evaluated, 119 expanded, t=0.00597191s, 5056 KB] New best heuristic value for ff(transform = adapt_costs(one)): 1 [g=50, 132 evaluated, 120 expanded, t=0.00602764s, 5056 KB] Completely explored state space -- no solution! Actual search time: 0.00406436s [t=0.00672392s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 656 Generated 349 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.004173s Total time: 0.00672756s Search stopped without finding a solution. Peak memory: 5056 KB exitcode: 5 remaining time: 1799.66 config 15: relative time 29, remaining 972 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_rhw(reasonable_orders=false, only_causal_landmarks=false, disjunctive_landmarks=false, conjunctive_landmarks=true, no_orders=false, lm_cost_type=2)', '--heuristic', 'hLM, hFF=lm_ff_syn(lmg, admissible=false, transform=adapt_costs(1))', '--heuristic', 'hBlind=blind()', '--search', 'lazy(alt([type_based([g()]),single(sum([g(), weight(hBlind, 2)])), single(sum([g(), weight(hBlind, 2)]), pref_only=true), single(sum([g(), weight(hLM, 2)])), single(sum([g(), weight(hLM, 2)]), pref_only=true), single(sum([g(), weight(hFF, 2)])), single(sum([g(), weight(hFF, 2)]), pref_only=true)], boost=4419), preferred=[hLM], reopen_closed=true, cost_type=1, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 53.69 -> (54, 55) reading input... [t=2.729e-05s] done reading input! [t=0.000791035s] packing state variables...done! [t=0.000802435s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000914632s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 3.1194e-05s done initializing global data [t=0.000959265s] Initializing Exploration... Initializing landmarks count heuristic... Generating landmarks using the RPG/SAS+ approach Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.000938165s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initializing LAMA-FF synergy object Initializing blind search heuristic... Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for : 16 New best heuristic value for : 19 New best heuristic value for blind: 0 [g=0, 1 evaluated, 0 expanded, t=0.00260614s, 5052 KB] Initial heuristic value for : 16 Initial heuristic value for : 19 Initial heuristic value for blind: 0 New best heuristic value for : 18 [g=2, 3 evaluated, 2 expanded, t=0.00273932s, 5052 KB] New best heuristic value for : 17 [g=3, 4 evaluated, 3 expanded, t=0.00281339s, 5052 KB] New best heuristic value for : 16 [g=4, 5 evaluated, 4 expanded, t=0.00288749s, 5052 KB] New best heuristic value for : 15 [g=5, 6 evaluated, 5 expanded, t=0.0029588s, 5052 KB] New best heuristic value for : 14 [g=6, 7 evaluated, 6 expanded, t=0.0030273s, 5052 KB] New best heuristic value for : 13 [g=7, 8 evaluated, 7 expanded, t=0.00310144s, 5052 KB] New best heuristic value for : 12 [g=8, 9 evaluated, 8 expanded, t=0.0031783s, 5052 KB] New best heuristic value for : 11 [g=9, 10 evaluated, 9 expanded, t=0.00325239s, 5052 KB] New best heuristic value for : 13 [g=10, 11 evaluated, 10 expanded, t=0.00332446s, 5052 KB] New best heuristic value for : 11 New best heuristic value for : 10 [g=11, 12 evaluated, 11 expanded, t=0.00339762s, 5052 KB] New best heuristic value for : 9 [g=12, 13 evaluated, 12 expanded, t=0.00346587s, 5052 KB] New best heuristic value for : 8 [g=13, 14 evaluated, 13 expanded, t=0.00354627s, 5052 KB] New best heuristic value for : 7 [g=13, 16 evaluated, 15 expanded, t=0.00366036s, 5052 KB] New best heuristic value for : 10 [g=18, 22 evaluated, 21 expanded, t=0.00390795s, 5052 KB] New best heuristic value for : 9 [g=20, 24 evaluated, 23 expanded, t=0.00401559s, 5052 KB] New best heuristic value for : 6 [g=23, 27 evaluated, 26 expanded, t=0.00413918s, 5052 KB] New best heuristic value for : 5 [g=24, 28 evaluated, 27 expanded, t=0.00422037s, 5052 KB] New best heuristic value for : 3 [g=25, 31 evaluated, 30 expanded, t=0.00436165s, 5052 KB] New best heuristic value for : 5 [g=29, 44 evaluated, 43 expanded, t=0.00483658s, 5052 KB] New best heuristic value for : 4 [g=30, 45 evaluated, 44 expanded, t=0.00492812s, 5052 KB] New best heuristic value for : 3 [g=39, 61 evaluated, 60 expanded, t=0.00543658s, 5052 KB] New best heuristic value for : 1 [g=46, 76 evaluated, 75 expanded, t=0.00593282s, 5052 KB] New best heuristic value for : 2 [g=49, 79 evaluated, 78 expanded, t=0.00605533s, 5052 KB] New best heuristic value for : 1 [g=50, 80 evaluated, 79 expanded, t=0.00612386s, 5052 KB] Completely explored state space -- no solution! Actual search time: 0.00706988s [t=0.00963598s] Expanded 184 state(s). Reopened 20 state(s). Evaluated 184 state(s). Evaluations: 512 Generated 391 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00709438s Total time: 0.00964001s Search stopped without finding a solution. Peak memory: 5052 KB exitcode: 5 remaining time: 1799.65 config 16: relative time 30, remaining 943 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hff=ff(transform=adapt_costs(one))', '--search', 'lazy_wastar([hff], w=3, preferred=[hff], cost_type=one, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 57.25 -> (58, 59) reading input... [t=2.6704e-05s] done reading input! [t=0.000764206s] packing state variables...done! [t=0.000775134s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000857267s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.9834e-05s done initializing global data [t=0.000898987s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Conducting lazy best first search, (real) bound = 10 New best heuristic value for ff(transform = adapt_costs(one)): 16 [g=0, 1 evaluated, 0 expanded, t=0.00125448s, 4916 KB] Initial heuristic value for ff(transform = adapt_costs(one)): 16 New best heuristic value for ff(transform = adapt_costs(one)): 13 [g=10, 13 evaluated, 12 expanded, t=0.00143242s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 11 [g=11, 14 evaluated, 13 expanded, t=0.00148328s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 10 [g=18, 21 evaluated, 20 expanded, t=0.00159118s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 9 [g=20, 23 evaluated, 22 expanded, t=0.0016833s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 5 [g=29, 40 evaluated, 39 expanded, t=0.00188635s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 4 [g=30, 41 evaluated, 40 expanded, t=0.00193489s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 3 [g=39, 54 evaluated, 53 expanded, t=0.00206932s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 2 [g=49, 73 evaluated, 72 expanded, t=0.00227497s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 1 [g=50, 74 evaluated, 73 expanded, t=0.00231926s, 4916 KB] Completely explored state space -- no solution! Actual search time: 0.00199982s [t=0.00323685s] Expanded 181 state(s). Reopened 17 state(s). Evaluated 181 state(s). Evaluations: 164 Generated 386 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00201227s Total time: 0.00324066s Search stopped without finding a solution. Peak memory: 4916 KB exitcode: 5 remaining time: 1799.65 config 17: relative time 28, remaining 913 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hCg=cg(transform=adapt_costs(2))', '--search', 'lazy(alt([type_based([g()]),single(hCg),single(hCg,pref_only=true)], boost=0),preferred=[hCg],reopen_closed=true,cost_type=2,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 55.19 -> (56, 57) reading input... [t=2.9486e-05s] done reading input! [t=0.000900378s] packing state variables...done! [t=0.000923879s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00107228s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 5.3785e-05s done initializing global data [t=0.00114851s] Initializing heuristic cache... building causal graph...done! [t=0.000261796s] done! Initializing causal graph heuristic... Conducting lazy best first search, (real) bound = 10 New best heuristic value for cg(transform = adapt_costs(2)): 7 [g=0, 1 evaluated, 0 expanded, t=0.00245142s, 5272 KB] Initial heuristic value for cg(transform = adapt_costs(2)): 7 New best heuristic value for cg(transform = adapt_costs(2)): 6 [g=4, 5 evaluated, 4 expanded, t=0.00262777s, 5272 KB] New best heuristic value for cg(transform = adapt_costs(2)): 5 [g=5, 7 evaluated, 6 expanded, t=0.00273394s, 5272 KB] New best heuristic value for cg(transform = adapt_costs(2)): 4 [g=8, 10 evaluated, 9 expanded, t=0.0028564s, 5272 KB] New best heuristic value for cg(transform = adapt_costs(2)): 3 [g=9, 11 evaluated, 10 expanded, t=0.00293775s, 5272 KB] New best heuristic value for cg(transform = adapt_costs(2)): 2 [g=59, 83 evaluated, 82 expanded, t=0.0040565s, 5272 KB] Completely explored state space -- no solution! Actual search time: 0.00307778s [t=0.00549396s] Expanded 178 state(s). Reopened 14 state(s). Evaluated 178 state(s). Evaluations: 164 Generated 381 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00310187s Total time: 0.00550064s Search stopped without finding a solution. Peak memory: 5272 KB exitcode: 5 remaining time: 1799.64 config 18: relative time 58, remaining 885 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hcg=cg(transform=adapt_costs(one))', '--heuristic', 'hlm=lmcount(lm_rhw(reasonable_orders=true, lm_cost_type=2), transform=adapt_costs(one))', '--search', 'lazy(alt([type_based([g()]),single(sum([g(), weight(hcg, 3)])), single(sum([g(), weight(hcg, 3)]), pref_only=true), single(sum([g(), weight(hlm, 3)])), single(sum([g(), weight(hlm, 3)]), pref_only=true)]), preferred=[hcg, hlm], cost_type=one, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 117.94 -> (118, 119) reading input... [t=4.7669e-05s] done reading input! [t=0.00142648s] packing state variables...done! [t=0.00144876s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00160668s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 5.4184e-05s done initializing global data [t=0.00168269s] Initializing heuristic cache... building causal graph...done! [t=0.0002614s] done! Initializing causal graph heuristic... 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.00164743s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 New best heuristic value for cg(transform = adapt_costs(one)): 5 [g=0, 1 evaluated, 0 expanded, t=0.00527688s, 5412 KB] Initial heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 19 Initial heuristic value for cg(transform = adapt_costs(one)): 5 New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 18 [g=2, 3 evaluated, 2 expanded, t=0.00544083s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 17 [g=3, 4 evaluated, 3 expanded, t=0.00554182s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 16 [g=4, 5 evaluated, 4 expanded, t=0.00563854s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 15 [g=5, 6 evaluated, 5 expanded, t=0.0057343s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 14 [g=6, 7 evaluated, 6 expanded, t=0.00582359s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 13 New best heuristic value for cg(transform = adapt_costs(one)): 4 [g=7, 8 evaluated, 7 expanded, t=0.00591716s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 12 New best heuristic value for cg(transform = adapt_costs(one)): 3 [g=8, 10 evaluated, 9 expanded, t=0.00603631s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 11 New best heuristic value for cg(transform = adapt_costs(one)): 2 [g=9, 11 evaluated, 10 expanded, t=0.00612649s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 10 [g=11, 14 evaluated, 13 expanded, t=0.00626452s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 9 [g=12, 15 evaluated, 14 expanded, t=0.00635539s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 7 [g=13, 16 evaluated, 15 expanded, t=0.00643972s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 6 [g=23, 29 evaluated, 28 expanded, t=0.0068383s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 5 [g=24, 30 evaluated, 29 expanded, t=0.00692925s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 3 [g=25, 31 evaluated, 30 expanded, t=0.00701542s, 5412 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = 2), transform = adapt_costs(one)): 1 [g=46, 106 evaluated, 105 expanded, t=0.00877352s, 5412 KB] New best heuristic value for cg(transform = adapt_costs(one)): 1 [g=50, 127 evaluated, 126 expanded, t=0.009321s, 5412 KB] Completely explored state space -- no solution! Actual search time: 0.00517701s [t=0.0104076s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00521794s Total time: 0.0104139s Search stopped without finding a solution. Peak memory: 5412 KB exitcode: 5 remaining time: 1799.63 config 19: relative time 26, remaining 827 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hCea=cea(transform=adapt_costs(1))', '--heuristic', 'hFF=ff(transform=adapt_costs(2))', '--heuristic', 'hBlind=blind()', '--search', 'eager(alt([single(sum([g(),weight(hBlind,10)])),single(sum([g(),weight(hBlind,10)]),pref_only=true),single(sum([g(),weight(hFF,10)])),single(sum([g(),weight(hFF,10)]),pref_only=true),single(sum([g(),weight(hCea,10)])),single(sum([g(),weight(hCea,10)]),pref_only=true)],boost=536),preferred=[hFF],reopen_closed=false,cost_type=0,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 56.58 -> (57, 58) reading input... [t=4.5079e-05s] done reading input! [t=0.00132516s] packing state variables...done! [t=0.00134654s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00148603s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 5.0609e-05s done initializing global data [t=0.00155717s] Initializing context-enhanced additive heuristic... Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Initializing blind search heuristic... Conducting best first search without reopening closed nodes, (real) bound = 10 New best heuristic value for cea(transform = adapt_costs(1)): 25 New best heuristic value for blind: 0 New best heuristic value for ff(transform = adapt_costs(2)): 19 [g=0, 1 evaluated, 0 expanded, t=0.00325084s, 4916 KB] Initial heuristic value for cea(transform = adapt_costs(1)): 25 Initial heuristic value for blind: 0 Initial heuristic value for ff(transform = adapt_costs(2)): 19 pruning method: none New best heuristic value for cea(transform = adapt_costs(1)): 24 [g=0, 2 evaluated, 1 expanded, t=0.00342128s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(1)): 23 [g=0, 3 evaluated, 2 expanded, t=0.00355889s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(1)): 22 [g=0, 4 evaluated, 3 expanded, t=0.00368878s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(1)): 21 [g=0, 5 evaluated, 4 expanded, t=0.00381449s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(1)): 20 [g=0, 6 evaluated, 5 expanded, t=0.00393583s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(1)): 19 [g=0, 8 evaluated, 6 expanded, t=0.00410052s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(1)): 18 [g=0, 9 evaluated, 7 expanded, t=0.0042263s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(1)): 17 [g=0, 10 evaluated, 8 expanded, t=0.00434168s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(1)): 16 [g=0, 12 evaluated, 9 expanded, t=0.00449399s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 16 [g=0, 13 evaluated, 10 expanded, t=0.004631s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(1)): 15 [g=1, 22 evaluated, 17 expanded, t=0.00506393s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(1)): 14 [g=1, 23 evaluated, 18 expanded, t=0.00516868s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(1)): 13 New best heuristic value for ff(transform = adapt_costs(2)): 13 [g=1, 24 evaluated, 19 expanded, t=0.00527675s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 12 [g=1, 26 evaluated, 21 expanded, t=0.00542659s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(1)): 12 [g=1, 27 evaluated, 22 expanded, t=0.00552909s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(1)): 11 [g=1, 28 evaluated, 23 expanded, t=0.00563219s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(1)): 9 New best heuristic value for ff(transform = adapt_costs(2)): 11 [g=4, 33 evaluated, 26 expanded, t=0.0059289s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 7 [g=4, 44 evaluated, 34 expanded, t=0.00635818s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 6 [g=4, 46 evaluated, 36 expanded, t=0.00650221s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(1)): 8 [g=5, 60 evaluated, 48 expanded, t=0.00703495s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(1)): 7 [g=6, 70 evaluated, 55 expanded, t=0.00748282s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(1)): 5 [g=6, 72 evaluated, 57 expanded, t=0.0076388s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(1)): 4 New best heuristic value for ff(transform = adapt_costs(2)): 5 [g=9, 83 evaluated, 64 expanded, t=0.0080649s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(1)): 3 New best heuristic value for ff(transform = adapt_costs(2)): 4 [g=9, 86 evaluated, 65 expanded, t=0.00819892s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(1)): 2 New best heuristic value for ff(transform = adapt_costs(2)): 3 [g=9, 88 evaluated, 66 expanded, t=0.00830732s, 5184 KB] New best heuristic value for cea(transform = adapt_costs(1)): 1 New best heuristic value for ff(transform = adapt_costs(2)): 2 [g=9, 89 evaluated, 67 expanded, t=0.00839295s, 5184 KB] Completely explored state space -- no solution! Actual search time: 0.00801695s [t=0.0113673s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 656 Generated 349 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00826484s Total time: 0.0113739s Search stopped without finding a solution. Peak memory: 5184 KB exitcode: 5 remaining time: 1799.61 config 20: relative time 27, remaining 801 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hcea=cea(transform=adapt_costs(one))', '--search', 'eager_greedy([hcea], preferred=[hcea], cost_type=one, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 60.66 -> (61, 62) reading input... [t=4.2574e-05s] done reading input! [t=0.00125159s] packing state variables...done! [t=0.00126929s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00140074s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.7387e-05s done initializing global data [t=0.0014677s] Initializing context-enhanced additive heuristic... Conducting best first search without reopening closed nodes, (real) bound = 10 New best heuristic value for cea(transform = adapt_costs(one)): 25 [g=0, 1 evaluated, 0 expanded, t=0.00225169s, 4916 KB] Initial heuristic value for cea(transform = adapt_costs(one)): 25 pruning method: none New best heuristic value for cea(transform = adapt_costs(one)): 24 [g=1, 2 evaluated, 1 expanded, t=0.00238932s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 23 [g=2, 3 evaluated, 2 expanded, t=0.00249636s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 22 [g=3, 4 evaluated, 3 expanded, t=0.00259424s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 21 [g=4, 5 evaluated, 4 expanded, t=0.00269576s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 20 [g=5, 6 evaluated, 5 expanded, t=0.00279171s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 19 [g=6, 8 evaluated, 6 expanded, t=0.00291376s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 18 [g=7, 9 evaluated, 7 expanded, t=0.00301638s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 17 [g=8, 10 evaluated, 8 expanded, t=0.00310401s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 16 [g=9, 12 evaluated, 9 expanded, t=0.00320787s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 15 [g=16, 22 evaluated, 17 expanded, t=0.00354416s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 14 [g=17, 23 evaluated, 18 expanded, t=0.00362905s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 13 [g=18, 24 evaluated, 19 expanded, t=0.00370919s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 12 [g=21, 27 evaluated, 22 expanded, t=0.00383963s, 4916 KB] New best heuristic value for cea(transform = adapt_costs(one)): 11 [g=22, 28 evaluated, 23 expanded, t=0.0039284s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(one)): 9 [g=25, 33 evaluated, 26 expanded, t=0.00414155s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(one)): 8 [g=38, 55 evaluated, 44 expanded, t=0.00458162s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(one)): 7 [g=42, 61 evaluated, 48 expanded, t=0.00474455s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(one)): 5 [g=43, 62 evaluated, 49 expanded, t=0.00482483s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(one)): 4 [g=47, 69 evaluated, 53 expanded, t=0.00501852s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(one)): 3 [g=48, 72 evaluated, 54 expanded, t=0.00510131s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(one)): 2 [g=49, 74 evaluated, 55 expanded, t=0.00517142s, 5048 KB] New best heuristic value for cea(transform = adapt_costs(one)): 1 [g=50, 75 evaluated, 56 expanded, t=0.00523408s, 5048 KB] Completely explored state space -- no solution! Actual search time: 0.004891s [t=0.00724253s] Expanded 155 state(s). Reopened 0 state(s). Evaluated 155 state(s). Evaluations: 310 Generated 329 state(s). Dead ends: 0 state(s). Number of registered states: 155 Int hash set load factor: 155/256 = 0.605469 Int hash set resizes: 8 Search time: 0.00508029s Total time: 0.00725044s Search stopped without finding a solution. Peak memory: 5048 KB exitcode: 5 remaining time: 1799.61 config 21: relative time 50, remaining 774 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hff=ff(transform=adapt_costs(one))', '--search', 'eager(alt([single(sum([g(), weight(hff, 3)])), single(sum([g(), weight(hff, 3)]), pref_only=true)]), preferred=[hff], cost_type=one, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 116.25 -> (117, 118) reading input... [t=4.0929e-05s] done reading input! [t=0.00116398s] packing state variables...done! [t=0.00118083s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00130553s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.5222e-05s done initializing global data [t=0.00136937s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Conducting best first search without reopening closed nodes, (real) bound = 10 New best heuristic value for ff(transform = adapt_costs(one)): 16 [g=0, 1 evaluated, 0 expanded, t=0.00204707s, 4916 KB] Initial heuristic value for ff(transform = adapt_costs(one)): 16 pruning method: none New best heuristic value for ff(transform = adapt_costs(one)): 13 [g=10, 13 evaluated, 11 expanded, t=0.002383s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 11 [g=11, 14 evaluated, 12 expanded, t=0.00246758s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 10 [g=18, 24 evaluated, 19 expanded, t=0.00270557s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 9 [g=20, 26 evaluated, 21 expanded, t=0.00280396s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 8 [g=27, 41 evaluated, 31 expanded, t=0.00312134s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 5 [g=29, 49 evaluated, 39 expanded, t=0.00332937s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 4 [g=30, 50 evaluated, 40 expanded, t=0.00340296s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 3 [g=39, 68 evaluated, 57 expanded, t=0.00380163s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 2 [g=49, 116 evaluated, 97 expanded, t=0.00462735s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(one)): 1 [g=50, 117 evaluated, 98 expanded, t=0.00469756s, 4916 KB] Completely explored state space -- no solution! Actual search time: 0.00368095s [t=0.00580226s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 349 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.0038316s Total time: 0.00580788s Search stopped without finding a solution. Peak memory: 4916 KB exitcode: 5 remaining time: 1799.6 config 22: relative time 28, remaining 724 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hGoalCount=goalcount(transform=adapt_costs(1))', '--heuristic', 'hFF=ff(transform=adapt_costs(2))', '--heuristic', 'hBlind=blind()', '--heuristic', 'hCg=cg(transform=adapt_costs(0))', '--search', 'lazy(alt([type_based([g()]),single(sum([weight(g(), 2), weight(hBlind, 3)])), single(sum([weight(g(), 2), weight(hBlind, 3)]), pref_only=true), single(sum([weight(g(), 2), weight(hFF, 3)])), single(sum([weight(g(), 2), weight(hFF, 3)]), pref_only=true), single(sum([weight(g(), 2), weight(hCg, 3)])), single(sum([weight(g(), 2), weight(hCg, 3)]), pref_only=true), single(sum([weight(g(), 2), weight(hGoalCount, 3)])), single(sum([weight(g(), 2), weight(hGoalCount, 3)]), pref_only=true)], boost=3662), preferred=[hFF], reopen_closed=true, cost_type=0, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 69.60 -> (70, 71) reading input... [t=2.6159e-05s] done reading input! [t=0.000767475s] packing state variables...done! [t=0.000778473s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000860516s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.9796e-05s done initializing global data [t=0.000901979s] Initializing goal count heuristic... Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Initializing blind search heuristic... Initializing heuristic cache... building causal graph...done! [t=0.000146389s] done! Initializing causal graph heuristic... Conducting lazy best first search, (real) bound = 10 New best heuristic value for ff(transform = adapt_costs(2)): 19 New best heuristic value for goalcount(transform = adapt_costs(1)): 1 New best heuristic value for blind: 0 New best heuristic value for cg(transform = adapt_costs(0)): 1 [g=0, 1 evaluated, 0 expanded, t=0.00227234s, 5372 KB] Initial heuristic value for ff(transform = adapt_costs(2)): 19 Initial heuristic value for goalcount(transform = adapt_costs(1)): 1 Initial heuristic value for blind: 0 Initial heuristic value for cg(transform = adapt_costs(0)): 1 New best heuristic value for ff(transform = adapt_costs(2)): 16 [g=0, 13 evaluated, 12 expanded, t=0.00266727s, 5372 KB] New best heuristic value for ff(transform = adapt_costs(2)): 13 [g=1, 21 evaluated, 20 expanded, t=0.00290668s, 5372 KB] New best heuristic value for ff(transform = adapt_costs(2)): 12 [g=1, 23 evaluated, 22 expanded, t=0.00299633s, 5372 KB] New best heuristic value for ff(transform = adapt_costs(2)): 11 [g=4, 29 evaluated, 28 expanded, t=0.00319278s, 5372 KB] New best heuristic value for ff(transform = adapt_costs(2)): 7 [g=4, 38 evaluated, 37 expanded, t=0.00345397s, 5372 KB] New best heuristic value for ff(transform = adapt_costs(2)): 6 [g=4, 40 evaluated, 39 expanded, t=0.00354237s, 5372 KB] New best heuristic value for ff(transform = adapt_costs(2)): 5 [g=9, 77 evaluated, 76 expanded, t=0.00444177s, 5372 KB] New best heuristic value for ff(transform = adapt_costs(2)): 4 [g=9, 78 evaluated, 77 expanded, t=0.00451015s, 5372 KB] New best heuristic value for ff(transform = adapt_costs(2)): 3 [g=9, 79 evaluated, 78 expanded, t=0.00457225s, 5372 KB] New best heuristic value for ff(transform = adapt_costs(2)): 2 [g=9, 80 evaluated, 79 expanded, t=0.00463068s, 5372 KB] Completely explored state space -- no solution! Actual search time: 0.00519671s [t=0.00739692s] Expanded 182 state(s). Reopened 18 state(s). Evaluated 182 state(s). Evaluations: 656 Generated 390 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.005212s Total time: 0.00740089s Search stopped without finding a solution. Peak memory: 5372 KB exitcode: 5 remaining time: 1799.6 config 23: relative time 29, remaining 696 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hGoalCount=goalcount(transform=adapt_costs(1))', '--heuristic', 'hFF=ff(transform=adapt_costs(2))', '--heuristic', 'hBlind=blind()', '--heuristic', 'hCg=cg(transform=adapt_costs(0))', '--search', 'lazy(alt([single(sum([weight(g(),2),weight(hBlind,3)])),single(sum([weight(g(),2),weight(hBlind,3)]),pref_only=true),single(sum([weight(g(),2),weight(hFF,3)])),single(sum([weight(g(),2),weight(hFF,3)]),pref_only=true),single(sum([weight(g(),2),weight(hCg,3)])),single(sum([weight(g(),2),weight(hCg,3)]),pref_only=true),single(sum([weight(g(),2),weight(hGoalCount,3)])),single(sum([weight(g(),2),weight(hGoalCount,3)]),pref_only=true)],boost=3662),preferred=[hFF],reopen_closed=true,cost_type=0,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 74.98 -> (75, 76) reading input... [t=3.6387e-05s] done reading input! [t=0.00107065s] packing state variables...done! [t=0.00108692s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00119481s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 3.9494e-05s done initializing global data [t=0.00124912s] Initializing goal count heuristic... Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Initializing blind search heuristic... Initializing heuristic cache... building causal graph...done! [t=0.000191998s] done! Initializing causal graph heuristic... Conducting lazy best first search, (real) bound = 10 New best heuristic value for cg(transform = adapt_costs(0)): 1 New best heuristic value for blind: 0 New best heuristic value for ff(transform = adapt_costs(2)): 19 New best heuristic value for goalcount(transform = adapt_costs(1)): 1 [g=0, 1 evaluated, 0 expanded, t=0.00298906s, 5368 KB] Initial heuristic value for cg(transform = adapt_costs(0)): 1 Initial heuristic value for blind: 0 Initial heuristic value for ff(transform = adapt_costs(2)): 19 Initial heuristic value for goalcount(transform = adapt_costs(1)): 1 New best heuristic value for ff(transform = adapt_costs(2)): 16 [g=0, 13 evaluated, 12 expanded, t=0.00346536s, 5368 KB] New best heuristic value for ff(transform = adapt_costs(2)): 13 [g=1, 21 evaluated, 20 expanded, t=0.003767s, 5368 KB] New best heuristic value for ff(transform = adapt_costs(2)): 12 [g=1, 23 evaluated, 22 expanded, t=0.00388115s, 5368 KB] New best heuristic value for ff(transform = adapt_costs(2)): 11 [g=4, 29 evaluated, 28 expanded, t=0.00412423s, 5368 KB] New best heuristic value for ff(transform = adapt_costs(2)): 7 [g=4, 38 evaluated, 37 expanded, t=0.00445725s, 5368 KB] New best heuristic value for ff(transform = adapt_costs(2)): 6 [g=4, 40 evaluated, 39 expanded, t=0.00456788s, 5368 KB] New best heuristic value for ff(transform = adapt_costs(2)): 5 [g=9, 77 evaluated, 76 expanded, t=0.00570036s, 5368 KB] New best heuristic value for ff(transform = adapt_costs(2)): 4 [g=9, 78 evaluated, 77 expanded, t=0.00578864s, 5368 KB] New best heuristic value for ff(transform = adapt_costs(2)): 3 [g=9, 79 evaluated, 78 expanded, t=0.00586884s, 5368 KB] New best heuristic value for ff(transform = adapt_costs(2)): 2 [g=9, 80 evaluated, 79 expanded, t=0.0059439s, 5368 KB] Completely explored state space -- no solution! Actual search time: 0.00605064s [t=0.00896553s] Expanded 171 state(s). Reopened 7 state(s). Evaluated 171 state(s). Evaluations: 656 Generated 364 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00606991s Total time: 0.00897066s Search stopped without finding a solution. Peak memory: 5368 KB exitcode: 5 remaining time: 1799.59 config 24: relative time 21, remaining 667 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hCg=cg(adapt_costs(2))', '--search', 'lazy(alt([single(sum([g(),weight(hCg, 10)])),single(sum([g(),weight(hCg, 10)]),pref_only=true)], boost=0),preferred=[hCg],reopen_closed=false,cost_type=2,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 56.66 -> (57, 58) reading input... [t=2.641e-05s] done reading input! [t=0.000778425s] packing state variables...done! [t=0.000789558s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000871381s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.9761e-05s done initializing global data [t=0.000912913s] Initializing heuristic cache... building causal graph...done! [t=0.000145011s] done! Initializing causal graph heuristic... Conducting lazy best first search, (real) bound = 10 New best heuristic value for cg(adapt_costs(2)): 7 [g=0, 1 evaluated, 0 expanded, t=0.00165269s, 5272 KB] Initial heuristic value for cg(adapt_costs(2)): 7 New best heuristic value for cg(adapt_costs(2)): 6 [g=4, 5 evaluated, 4 expanded, t=0.00174465s, 5272 KB] New best heuristic value for cg(adapt_costs(2)): 5 [g=5, 7 evaluated, 6 expanded, t=0.00180124s, 5272 KB] New best heuristic value for cg(adapt_costs(2)): 4 [g=8, 10 evaluated, 9 expanded, t=0.00186867s, 5272 KB] New best heuristic value for cg(adapt_costs(2)): 3 [g=9, 11 evaluated, 10 expanded, t=0.00191286s, 5272 KB] New best heuristic value for cg(adapt_costs(2)): 2 [g=59, 72 evaluated, 71 expanded, t=0.00246484s, 5272 KB] Completely explored state space -- no solution! Actual search time: 0.00157883s [t=0.00321073s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 164 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.0015916s Total time: 0.00321435s Search stopped without finding a solution. Peak memory: 5272 KB exitcode: 5 remaining time: 1799.58 config 25: relative time 21, remaining 646 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hcg=cg(transform=adapt_costs(one))', '--search', 'eager(alt([single(sum([g(), weight(hcg, 3)])), single(sum([g(), weight(hcg, 3)]), pref_only=true)]), preferred=[hcg], cost_type=one, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 58.50 -> (59, 60) reading input... [t=2.6447e-05s] done reading input! [t=0.000764899s] packing state variables...done! [t=0.000775942s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000867921s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 3.9455e-05s done initializing global data [t=0.000918666s] Initializing heuristic cache... building causal graph...done! [t=0.000144753s] done! Initializing causal graph heuristic... Conducting best first search without reopening closed nodes, (real) bound = 10 New best heuristic value for cg(transform = adapt_costs(one)): 5 [g=0, 1 evaluated, 0 expanded, t=0.001638s, 5272 KB] Initial heuristic value for cg(transform = adapt_costs(one)): 5 pruning method: none New best heuristic value for cg(transform = adapt_costs(one)): 4 [g=5, 7 evaluated, 5 expanded, t=0.00175479s, 5272 KB] New best heuristic value for cg(transform = adapt_costs(one)): 3 [g=8, 10 evaluated, 9 expanded, t=0.001835s, 5272 KB] New best heuristic value for cg(transform = adapt_costs(one)): 2 [g=9, 12 evaluated, 10 expanded, t=0.00188722s, 5272 KB] New best heuristic value for cg(transform = adapt_costs(one)): 1 [g=50, 126 evaluated, 116 expanded, t=0.00291293s, 5272 KB] Completely explored state space -- no solution! Actual search time: 0.00166846s [t=0.00335671s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 349 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00175608s Total time: 0.0033604s Search stopped without finding a solution. Peak memory: 5272 KB exitcode: 5 remaining time: 1799.58 config 26: relative time 24, remaining 625 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_rhw(reasonable_orders=true,only_causal_landmarks=true,disjunctive_landmarks=true,conjunctive_landmarks=true,no_orders=false)', '--heuristic', 'hBlind=blind()', '--heuristic', 'hAdd=add(transform=adapt_costs(0))', '--heuristic', 'hLM=lmcount(lmg,admissible=false,pref=true,transform=adapt_costs(2))', '--heuristic', 'hFF=ff(transform=adapt_costs(0))', '--search', 'lazy(alt([single(sum([weight(g(),2),weight(hBlind,3)])),single(sum([weight(g(),2),weight(hBlind,3)]),pref_only=true),single(sum([weight(g(),2),weight(hFF,3)])),single(sum([weight(g(),2),weight(hFF,3)]),pref_only=true),single(sum([weight(g(),2),weight(hLM,3)])),single(sum([weight(g(),2),weight(hLM,3)]),pref_only=true),single(sum([weight(g(),2),weight(hAdd,3)])),single(sum([weight(g(),2),weight(hAdd,3)]),pref_only=true)],boost=2474),preferred=[hAdd],reopen_closed=false,cost_type=1,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 69.10 -> (70, 71) reading input... [t=2.6088e-05s] done reading input! [t=0.000760314s] packing state variables...done! [t=0.000770846s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000852389s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.987e-05s done initializing global data [t=0.000893727s] Initializing blind search heuristic... Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing Exploration... Initializing landmarks count heuristic... Generating landmarks using the RPG/SAS+ approach Discarding non-causal landmark: LM -1 NegatedAtom at-goal(stone-01) (var20(20)->1) Achievers (0, 0) Discarding non-causal landmark: LM -1 NegatedAtom clear(pos-5-4) (var10(14)->1) Achievers (0, 0) Discarding non-causal landmark: LM -1 NegatedAtom clear(pos-4-4) (var18(18)->1) Achievers (0, 0) Discarded 3 non-causal landmarks approx. reasonable orders approx. obedient reasonable orders Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.00125018s Discovered 31 landmarks, of which 0 are disjunctive and 0 are conjunctive 138 edges Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Conducting lazy best first search, (real) bound = 10 15 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lmg, admissible = false, pref = true, transform = adapt_costs(2)): 3 New best heuristic value for blind: 0 New best heuristic value for add(transform = adapt_costs(0)): 3 New best heuristic value for ff(transform = adapt_costs(0)): 3 [g=0, 1 evaluated, 0 expanded, t=0.00337462s, 5048 KB] Initial heuristic value for lmcount(lmg, admissible = false, pref = true, transform = adapt_costs(2)): 3 Initial heuristic value for blind: 0 Initial heuristic value for add(transform = adapt_costs(0)): 3 Initial heuristic value for ff(transform = adapt_costs(0)): 3 New best heuristic value for lmcount(lmg, admissible = false, pref = true, transform = adapt_costs(2)): 2 New best heuristic value for add(transform = adapt_costs(0)): 2 New best heuristic value for ff(transform = adapt_costs(0)): 2 [g=25, 34 evaluated, 33 expanded, t=0.0047796s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = false, pref = true, transform = adapt_costs(2)): 1 [g=33, 57 evaluated, 56 expanded, t=0.00577771s, 5180 KB] New best heuristic value for add(transform = adapt_costs(0)): 1 New best heuristic value for ff(transform = adapt_costs(0)): 1 [g=46, 82 evaluated, 81 expanded, t=0.00685327s, 5180 KB] Completely explored state space -- no solution! Actual search time: 0.00719111s [t=0.0105102s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 656 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00721525s Total time: 0.0105143s Search stopped without finding a solution. Peak memory: 5180 KB exitcode: 5 remaining time: 1799.57 config 27: relative time 28, remaining 601 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hBlind=blind()', '--heuristic', 'hAdd=add(transform=adapt_costs(0))', '--heuristic', 'hCg=cg(transform=adapt_costs(1))', '--heuristic', 'hHMax=hmax()', '--search', 'eager(alt([tiebreaking([sum([g(),weight(hBlind,7)]),hBlind]),tiebreaking([sum([g(),weight(hHMax,7)]),hHMax]),tiebreaking([sum([g(),weight(hAdd,7)]),hAdd]),tiebreaking([sum([g(),weight(hCg,7)]),hCg])],boost=2142),preferred=[],reopen_closed=true,cost_type=0,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 83.84 -> (84, 85) reading input... [t=2.6343e-05s] done reading input! [t=0.000765493s] packing state variables...done! [t=0.000776139s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000857146s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.9386e-05s done initializing global data [t=0.000898497s] Initializing blind search heuristic... Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing heuristic cache... building causal graph...done! [t=0.000144514s] done! Initializing causal graph heuristic... Simplifying 179 unary operators... done! [179 unary operators] Initializing HSP max heuristic... Conducting best first search with reopening closed nodes, (real) bound = 10 New best heuristic value for add(transform = adapt_costs(0)): 3 New best heuristic value for hmax: 3 New best heuristic value for blind: 0 New best heuristic value for cg(transform = adapt_costs(1)): 5 [g=0, 1 evaluated, 0 expanded, t=0.00217197s, 5364 KB] Initial heuristic value for add(transform = adapt_costs(0)): 3 Initial heuristic value for hmax: 3 Initial heuristic value for blind: 0 Initial heuristic value for cg(transform = adapt_costs(1)): 5 pruning method: none New best heuristic value for cg(transform = adapt_costs(1)): 4 [g=0, 7 evaluated, 5 expanded, t=0.00235807s, 5364 KB] New best heuristic value for cg(transform = adapt_costs(1)): 3 [g=0, 10 evaluated, 9 expanded, t=0.00246419s, 5364 KB] New best heuristic value for cg(transform = adapt_costs(1)): 2 [g=0, 12 evaluated, 10 expanded, t=0.00253698s, 5364 KB] New best heuristic value for hmax: 2 [g=1, 15 evaluated, 14 expanded, t=0.00263424s, 5364 KB] New best heuristic value for add(transform = adapt_costs(0)): 2 [g=4, 33 evaluated, 30 expanded, t=0.0030041s, 5364 KB] New best heuristic value for add(transform = adapt_costs(0)): 1 New best heuristic value for hmax: 1 [g=9, 134 evaluated, 128 expanded, 1 reopened, t=0.00481981s, 5364 KB] New best heuristic value for cg(transform = adapt_costs(1)): 1 [g=9, 143 evaluated, 133 expanded, 1 reopened, t=0.00500386s, 5364 KB] Completely explored state space -- no solution! Actual search time: 0.00318357s [t=0.00541526s] Expanded 165 state(s). Reopened 1 state(s). Evaluated 164 state(s). Evaluations: 656 Generated 352 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00331668s Total time: 0.0054191s Search stopped without finding a solution. Peak memory: 5364 KB exitcode: 5 remaining time: 1799.56 config 28: relative time 28, remaining 573 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hAdd=add(transform=adapt_costs(2))', '--heuristic', 'hFF=ff(transform=adapt_costs(0))', '--search', 'lazy(alt([tiebreaking([sum([weight(g(),4),weight(hFF,5)]),hFF]),tiebreaking([sum([weight(g(),4),weight(hFF,5)]),hFF],pref_only=true),tiebreaking([sum([weight(g(),4),weight(hAdd,5)]),hAdd]),tiebreaking([sum([weight(g(),4),weight(hAdd,5)]),hAdd],pref_only=true)],boost=2537),preferred=[hFF,hAdd],reopen_closed=true,cost_type=0,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 87.94 -> (88, 89) reading input... [t=3.7955e-05s] done reading input! [t=0.00143632s] packing state variables...done! [t=0.0014597s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00160767s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 5.3775e-05s done initializing global data [t=0.00168261s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Conducting lazy best first search, (real) bound = 10 New best heuristic value for ff(transform = adapt_costs(0)): 3 New best heuristic value for add(transform = adapt_costs(2)): 29 [g=0, 1 evaluated, 0 expanded, t=0.00317289s, 4916 KB] Initial heuristic value for ff(transform = adapt_costs(0)): 3 Initial heuristic value for add(transform = adapt_costs(2)): 29 New best heuristic value for add(transform = adapt_costs(2)): 27 [g=0, 2 evaluated, 1 expanded, t=0.00331297s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 26 [g=0, 3 evaluated, 2 expanded, t=0.00343244s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 25 [g=0, 4 evaluated, 3 expanded, t=0.00354516s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 24 [g=0, 5 evaluated, 4 expanded, t=0.00365705s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 23 [g=0, 6 evaluated, 5 expanded, t=0.00376746s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 22 [g=0, 7 evaluated, 6 expanded, t=0.00387255s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 21 [g=0, 8 evaluated, 7 expanded, t=0.00397926s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 20 [g=0, 9 evaluated, 8 expanded, t=0.00410192s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 19 [g=0, 11 evaluated, 10 expanded, t=0.00424539s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 18 [g=0, 13 evaluated, 12 expanded, t=0.00438243s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 17 [g=1, 19 evaluated, 18 expanded, t=0.00467534s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 15 [g=1, 20 evaluated, 19 expanded, t=0.00478024s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(0)): 2 New best heuristic value for add(transform = adapt_costs(2)): 11 [g=4, 30 evaluated, 29 expanded, t=0.00520484s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 10 [g=4, 36 evaluated, 35 expanded, t=0.00550815s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 8 [g=4, 37 evaluated, 36 expanded, t=0.00561817s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 7 [g=5, 43 evaluated, 42 expanded, t=0.0058759s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 6 [g=5, 45 evaluated, 44 expanded, t=0.00601235s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(0)): 1 [g=9, 84 evaluated, 83 expanded, 2 reopened, t=0.00740959s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 5 [g=9, 85 evaluated, 84 expanded, 2 reopened, t=0.00752097s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 4 [g=9, 86 evaluated, 85 expanded, 2 reopened, t=0.0076197s, 4916 KB] New best heuristic value for add(transform = adapt_costs(2)): 3 [g=9, 87 evaluated, 86 expanded, 2 reopened, t=0.00772158s, 5048 KB] New best heuristic value for add(transform = adapt_costs(2)): 2 [g=9, 88 evaluated, 87 expanded, 2 reopened, t=0.00783267s, 5048 KB] Completely explored state space -- no solution! Actual search time: 0.00801148s [t=0.0111156s] Expanded 176 state(s). Reopened 12 state(s). Evaluated 176 state(s). Evaluations: 328 Generated 374 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00803726s Total time: 0.011123s Search stopped without finding a solution. Peak memory: 5048 KB exitcode: 5 remaining time: 1799.55 config 29: relative time 53, remaining 545 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_hm(only_causal_landmarks=false,disjunctive_landmarks=true,conjunctive_landmarks=false,no_orders=true,m=1,lm_cost_type=0)', '--heuristic', 'hLM,hFF=lm_ff_syn(lmg,admissible=true,transform=transform=adapt_costs(2))', '--search', 'lazy(alt([type_based([g()]),single(hLM),single(hLM,pref_only=true),single(hFF),single(hFF,pref_only=true)], boost=5000),preferred=[hLM],reopen_closed=false,cost_type=0,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 175.00 -> (176, 177) reading input... [t=2.6078e-05s] done reading input! [t=0.000760076s] packing state variables...done! [t=0.000770899s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.000852549s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.955e-05s done initializing global data [t=0.000893555s] Initializing Exploration... Initializing landmarks count heuristic... 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. Removing all orderings. Removed 0 reasonable or obedient reasonable orders Calculating achievers. Landmarks generation time: 0.000341183s Discovered 32 landmarks, of which 0 are disjunctive and 0 are conjunctive 0 edges Initializing LAMA-FF synergy object Conducting lazy best first search, (real) bound = 10 16 initial landmarks, 2 goal landmarks New best heuristic value for : 19 New best heuristic value for : 18 [g=0, 1 evaluated, 0 expanded, t=0.00169921s, 4920 KB] Initial heuristic value for : 19 Initial heuristic value for : 18 New best heuristic value for : 17 [g=0, 2 evaluated, 1 expanded, t=0.001786s, 4920 KB] New best heuristic value for : 16 [g=0, 3 evaluated, 2 expanded, t=0.00185291s, 4920 KB] New best heuristic value for : 15 [g=0, 4 evaluated, 3 expanded, t=0.0019157s, 4920 KB] New best heuristic value for : 14 [g=0, 5 evaluated, 4 expanded, t=0.00198519s, 4920 KB] New best heuristic value for : 13 [g=0, 6 evaluated, 5 expanded, t=0.00204765s, 4920 KB] New best heuristic value for : 12 [g=0, 7 evaluated, 6 expanded, t=0.00210685s, 4920 KB] New best heuristic value for : 11 [g=0, 8 evaluated, 7 expanded, t=0.00216525s, 4920 KB] New best heuristic value for : 10 [g=0, 9 evaluated, 8 expanded, t=0.002228s, 4920 KB] New best heuristic value for : 16 New best heuristic value for : 9 [g=0, 11 evaluated, 10 expanded, t=0.0023099s, 4920 KB] New best heuristic value for : 8 [g=0, 12 evaluated, 11 expanded, t=0.00237086s, 4920 KB] New best heuristic value for : 6 [g=1, 13 evaluated, 12 expanded, t=0.00242859s, 4920 KB] New best heuristic value for : 5 [g=1, 14 evaluated, 13 expanded, t=0.00249676s, 4920 KB] New best heuristic value for : 13 [g=1, 22 evaluated, 21 expanded, t=0.00273357s, 4920 KB] New best heuristic value for : 12 [g=1, 24 evaluated, 23 expanded, t=0.00282055s, 4920 KB] New best heuristic value for : 4 [g=2, 28 evaluated, 27 expanded, t=0.00295115s, 4920 KB] New best heuristic value for : 11 New best heuristic value for : 2 [g=4, 31 evaluated, 30 expanded, t=0.00308688s, 4920 KB] New best heuristic value for : 7 [g=4, 37 evaluated, 36 expanded, t=0.0032778s, 4920 KB] New best heuristic value for : 6 [g=4, 38 evaluated, 37 expanded, t=0.00334375s, 4920 KB] New best heuristic value for : 5 [g=9, 56 evaluated, 55 expanded, t=0.003756s, 4920 KB] New best heuristic value for : 4 [g=9, 57 evaluated, 56 expanded, t=0.00381937s, 4920 KB] New best heuristic value for : 3 [g=9, 58 evaluated, 57 expanded, t=0.00387797s, 4920 KB] New best heuristic value for : 2 [g=9, 59 evaluated, 58 expanded, t=0.00393518s, 4920 KB] Completely explored state space -- no solution! Actual search time: 0.00500365s [t=0.00666753s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.0050263s Total time: 0.00667144s Search stopped without finding a solution. Peak memory: 4920 KB exitcode: 5 remaining time: 1799.54 config 30: relative time 29, remaining 492 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hFF=ff(adapt_costs(1))', '--search', 'lazy(alt([single(sum([weight(g(), 2),weight(hFF, 3)])),single(sum([weight(g(), 2),weight(hFF, 3)]),pref_only=true)], boost=5000),preferred=[hFF],reopen_closed=true,cost_type=1,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 106.07 -> (107, 108) reading input... [t=4.0288e-05s] done reading input! [t=0.00116677s] packing state variables...done! [t=0.00118336s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00130755s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.5246e-05s done initializing global data [t=0.00137134s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Conducting lazy best first search, (real) bound = 10 New best heuristic value for ff(adapt_costs(1)): 16 [g=0, 1 evaluated, 0 expanded, t=0.00209596s, 4916 KB] Initial heuristic value for ff(adapt_costs(1)): 16 New best heuristic value for ff(adapt_costs(1)): 13 [g=10, 13 evaluated, 12 expanded, t=0.00241624s, 4916 KB] New best heuristic value for ff(adapt_costs(1)): 11 [g=11, 14 evaluated, 13 expanded, t=0.00252405s, 4916 KB] New best heuristic value for ff(adapt_costs(1)): 10 [g=18, 21 evaluated, 20 expanded, t=0.0027384s, 4916 KB] New best heuristic value for ff(adapt_costs(1)): 9 [g=20, 23 evaluated, 22 expanded, t=0.00284584s, 4916 KB] New best heuristic value for ff(adapt_costs(1)): 5 [g=29, 41 evaluated, 40 expanded, t=0.00325869s, 4916 KB] New best heuristic value for ff(adapt_costs(1)): 4 [g=30, 42 evaluated, 41 expanded, t=0.00334446s, 4916 KB] New best heuristic value for ff(adapt_costs(1)): 3 [g=39, 54 evaluated, 53 expanded, t=0.00359523s, 4916 KB] New best heuristic value for ff(adapt_costs(1)): 2 [g=49, 78 evaluated, 77 expanded, t=0.00409926s, 4916 KB] New best heuristic value for ff(adapt_costs(1)): 1 [g=50, 79 evaluated, 78 expanded, t=0.00418473s, 4916 KB] Completely explored state space -- no solution! Actual search time: 0.00391545s [t=0.00597742s] Expanded 182 state(s). Reopened 18 state(s). Evaluated 182 state(s). Evaluations: 164 Generated 388 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00393731s Total time: 0.0059842s Search stopped without finding a solution. Peak memory: 4916 KB exitcode: 5 remaining time: 1799.54 config 31: relative time 27, remaining 463 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hBlind=blind()', '--heuristic', 'hFF=ff(transform=adapt_costs(1))', '--search', 'eager(alt([single(sum([g(),weight(hBlind,2)])),single(sum([g(),weight(hFF,2)]))],boost=4480),preferred=[],reopen_closed=true,cost_type=0,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 104.94 -> (105, 106) reading input... [t=4.7676e-05s] done reading input! [t=0.00138847s] packing state variables...done! [t=0.00140818s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00155713s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 5.3757e-05s done initializing global data [t=0.00163262s] Initializing blind search heuristic... Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Conducting best first search with reopening closed nodes, (real) bound = 10 New best heuristic value for ff(transform = adapt_costs(1)): 16 New best heuristic value for blind: 0 [g=0, 1 evaluated, 0 expanded, t=0.00250562s, 4916 KB] Initial heuristic value for ff(transform = adapt_costs(1)): 16 Initial heuristic value for blind: 0 pruning method: none New best heuristic value for ff(transform = adapt_costs(1)): 13 [g=0, 13 evaluated, 11 expanded, t=0.00281799s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 11 [g=0, 14 evaluated, 13 expanded, t=0.00291211s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 10 [g=1, 24 evaluated, 22 expanded, t=0.00314144s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 9 [g=1, 26 evaluated, 24 expanded, t=0.00323933s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 5 [g=3, 40 evaluated, 36 expanded, t=0.00353907s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 4 [g=3, 42 evaluated, 38 expanded, t=0.00363538s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 3 [g=5, 81 evaluated, 77 expanded, t=0.00430117s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 2 [g=9, 119 evaluated, 106 expanded, t=0.0048609s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(1)): 1 [g=9, 120 evaluated, 107 expanded, t=0.00493764s, 4916 KB] Completely explored state space -- no solution! Actual search time: 0.00314468s [t=0.00574168s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 349 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00332136s Total time: 0.00574804s Search stopped without finding a solution. Peak memory: 4916 KB exitcode: 5 remaining time: 1799.53 config 32: relative time 29, remaining 436 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_hm(only_causal_landmarks=false,disjunctive_landmarks=true,conjunctive_landmarks=false,no_orders=true,m=1,lm_cost_type=1)', '--heuristic', 'hLM,hFF=lm_ff_syn(lmg,admissible=true,transform=adapt_costs(0))', '--search', 'lazy(alt([type_based([g()]),single(hLM),single(hLM,pref_only=true),single(hFF),single(hFF,pref_only=true)], boost=1000),preferred=[hLM,hFF],reopen_closed=false,cost_type=1,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 119.69 -> (120, 121) reading input... [t=4.5021e-05s] done reading input! [t=0.00130702s] packing state variables...done! [t=0.00132614s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00146562s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 5.0607e-05s done initializing global data [t=0.00153721s] Initializing Exploration... Initializing landmarks count heuristic... 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. Removing all orderings. Removed 0 reasonable or obedient reasonable orders Calculating achievers. Landmarks generation time: 0.000598732s Discovered 32 landmarks, of which 0 are disjunctive and 0 are conjunctive 0 edges Initializing LAMA-FF synergy object Conducting lazy best first search, (real) bound = 10 16 initial landmarks, 2 goal landmarks New best heuristic value for : 3 New best heuristic value for : 3 [g=0, 1 evaluated, 0 expanded, t=0.00293673s, 4920 KB] Initial heuristic value for : 3 Initial heuristic value for : 3 New best heuristic value for : 2 [g=12, 15 evaluated, 14 expanded, t=0.00357852s, 4920 KB] New best heuristic value for : 2 New best heuristic value for : 1 [g=25, 32 evaluated, 31 expanded, t=0.00435495s, 4920 KB] New best heuristic value for : 1 [g=46, 59 evaluated, 58 expanded, t=0.00543742s, 4920 KB] Completely explored state space -- no solution! Actual search time: 0.00712214s [t=0.0100045s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00716143s Total time: 0.0100113s Search stopped without finding a solution. Peak memory: 4920 KB exitcode: 5 remaining time: 1799.53 config 33: relative time 54, remaining 407 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_hm(only_causal_landmarks=false,disjunctive_landmarks=true,conjunctive_landmarks=true,no_orders=false,m=1,lm_cost_type=2)', '--heuristic', 'hLM,hFF=lm_ff_syn(lmg,admissible=true,transform=adapt_costs(0))', '--search', 'lazy(alt([tiebreaking([sum([g(),weight(hLM, 10)]),hLM]),tiebreaking([sum([g(),weight(hLM, 10)]),hLM],pref_only=true),tiebreaking([sum([g(),weight(hFF, 10)]),hFF]),tiebreaking([sum([g(),weight(hFF, 10)]),hFF],pref_only=true)], boost=200),preferred=[hLM],reopen_closed=true,cost_type=2,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 238.76 -> (239, 240) reading input... [t=4.2495e-05s] done reading input! [t=0.00123069s] packing state variables...done! [t=0.0012482s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00137972s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.7773e-05s done initializing global data [t=0.00144698s] Initializing Exploration... Initializing landmarks count heuristic... 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.000635305s Discovered 32 landmarks, of which 0 are disjunctive and 0 are conjunctive 63 edges Initializing LAMA-FF synergy object Conducting lazy best first search, (real) bound = 10 16 initial landmarks, 2 goal landmarks New best heuristic value for : 3 New best heuristic value for : 3 [g=0, 1 evaluated, 0 expanded, t=0.00304083s, 4920 KB] Initial heuristic value for : 3 Initial heuristic value for : 3 New best heuristic value for : 2 [g=25, 27 evaluated, 26 expanded, t=0.00422125s, 4920 KB] New best heuristic value for : 2 [g=29, 32 evaluated, 31 expanded, t=0.00454252s, 4920 KB] New best heuristic value for : 1 [g=38, 46 evaluated, 45 expanded, t=0.00524937s, 5056 KB] New best heuristic value for : 1 [g=55, 79 evaluated, 78 expanded, t=0.00680478s, 5056 KB] Completely explored state space -- no solution! Actual search time: 0.00814747s [t=0.0111305s] Expanded 175 state(s). Reopened 11 state(s). Evaluated 175 state(s). Evaluations: 339 Generated 374 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00818336s Total time: 0.0111366s Search stopped without finding a solution. Peak memory: 5056 KB exitcode: 5 remaining time: 1799.5 config 34: relative time 87, remaining 353 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_hm(only_causal_landmarks=false,disjunctive_landmarks=true,conjunctive_landmarks=false,no_orders=true,m=1)', '--heuristic', 'hCg=cg(adapt_costs(1))', '--heuristic', 'hLM=lmcount(lmg,admissible=true)', '--search', 'lazy(alt([single(hLM),single(hLM,pref_only=true),single(hCg),single(hCg,pref_only=true)], boost=0),preferred=[hCg],reopen_closed=false,cost_type=1,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 443.50 -> (444, 445) reading input... [t=3.9482e-05s] done reading input! [t=0.00119611s] packing state variables...done! [t=0.00121567s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.0013414s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.5283e-05s done initializing global data [t=0.00140504s] Initializing heuristic cache... building causal graph...done! [t=0.000221683s] done! Initializing causal graph heuristic... Initializing Exploration... Initializing landmarks count heuristic... 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. Removing all orderings. Removed 0 reasonable or obedient reasonable orders Calculating achievers. Landmarks generation time: 0.000510734s Discovered 32 landmarks, of which 0 are disjunctive and 0 are conjunctive 0 edges Conducting lazy best first search, (real) bound = 10 16 initial landmarks, 2 goal landmarks New best heuristic value for cg(adapt_costs(1)): 5 New best heuristic value for lmcount(lmg, admissible = true): 3 [g=0, 1 evaluated, 0 expanded, t=0.00329306s, 5412 KB] Initial heuristic value for cg(adapt_costs(1)): 5 Initial heuristic value for lmcount(lmg, admissible = true): 3 New best heuristic value for cg(adapt_costs(1)): 4 [g=5, 7 evaluated, 6 expanded, t=0.00348528s, 5412 KB] New best heuristic value for cg(adapt_costs(1)): 3 [g=8, 10 evaluated, 9 expanded, t=0.00361038s, 5412 KB] New best heuristic value for cg(adapt_costs(1)): 2 [g=9, 11 evaluated, 10 expanded, t=0.00368558s, 5412 KB] New best heuristic value for lmcount(lmg, admissible = true): 2 [g=12, 15 evaluated, 14 expanded, t=0.00381164s, 5412 KB] New best heuristic value for lmcount(lmg, admissible = true): 1 [g=25, 31 evaluated, 30 expanded, t=0.00410613s, 5412 KB] New best heuristic value for cg(adapt_costs(1)): 1 [g=50, 75 evaluated, 74 expanded, t=0.00480805s, 5412 KB] Completely explored state space -- no solution! Actual search time: 0.00294377s [t=0.00619683s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00297677s Total time: 0.00620238s Search stopped without finding a solution. Peak memory: 5412 KB exitcode: 5 remaining time: 1799.5 config 35: relative time 30, remaining 266 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_exhaust(reasonable_orders=false, only_causal_landmarks=false, disjunctive_landmarks=true, conjunctive_landmarks=true, no_orders=false)', '--heuristic', 'hFF=ff(transform=adapt_costs(2))', '--heuristic', 'hHMax=hmax()', '--heuristic', 'hBlind=blind()', '--heuristic', 'hLM=lmcount(lmg, admissible=true, pref=false, transform=adapt_costs(1))', '--search', 'lazy(alt([type_based([g()]),single(sum([g(), weight(hBlind, 3)])), single(sum([g(), weight(hBlind, 3)]), pref_only=true), single(sum([g(), weight(hFF, 3)])), single(sum([g(), weight(hFF, 3)]), pref_only=true), single(sum([g(), weight(hLM, 3)])), single(sum([g(), weight(hLM, 3)]), pref_only=true), single(sum([g(), weight(hHMax, 3)])), single(sum([g(), weight(hHMax, 3)]), pref_only=true)], boost=3052), preferred=[hFF], reopen_closed=true, cost_type=0, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 202.95 -> (203, 204) reading input... [t=3.9819e-05s] done reading input! [t=0.00118259s] packing state variables...done! [t=0.00120046s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.0013186s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.3004e-05s done initializing global data [t=0.0013791s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Simplifying 179 unary operators... done! [179 unary operators] Initializing HSP max heuristic... Initializing blind search heuristic... Initializing Exploration... Initializing landmarks count heuristic... Generating landmarks by testing all facts with RPG method Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.00139298s Discovered 54 landmarks, of which 0 are disjunctive and 0 are conjunctive 0 edges Conducting lazy best first search, (real) bound = 10 21 initial landmarks, 2 goal landmarks New best heuristic value for hmax: 3 New best heuristic value for blind: 0 New best heuristic value for ff(transform = adapt_costs(2)): 19 New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 15 [g=0, 1 evaluated, 0 expanded, t=0.00442371s, 5048 KB] Initial heuristic value for hmax: 3 Initial heuristic value for blind: 0 Initial heuristic value for ff(transform = adapt_costs(2)): 19 Initial heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 15 New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 14 [g=0, 2 evaluated, 1 expanded, t=0.00456548s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 13 [g=0, 3 evaluated, 2 expanded, t=0.00467981s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 12 [g=0, 4 evaluated, 3 expanded, t=0.00479582s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 11 [g=0, 5 evaluated, 4 expanded, t=0.0049179s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 10 [g=0, 6 evaluated, 5 expanded, t=0.00502308s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 9 [g=0, 7 evaluated, 6 expanded, t=0.00512113s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 8 [g=0, 8 evaluated, 7 expanded, t=0.00522033s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 7 [g=0, 9 evaluated, 8 expanded, t=0.00532509s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 16 New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 6 [g=0, 12 evaluated, 11 expanded, t=0.00550465s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 5 [g=0, 13 evaluated, 12 expanded, t=0.00560464s, 5048 KB] New best heuristic value for hmax: 2 New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 4 [g=1, 14 evaluated, 13 expanded, t=0.00570642s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 3 [g=1, 15 evaluated, 14 expanded, t=0.0058015s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 13 [g=1, 20 evaluated, 19 expanded, t=0.00605543s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 12 [g=1, 23 evaluated, 22 expanded, t=0.0062225s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 2 [g=2, 27 evaluated, 26 expanded, t=0.00643356s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 11 New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(1)): 1 [g=4, 30 evaluated, 29 expanded, t=0.0066048s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 7 [g=4, 37 evaluated, 36 expanded, t=0.00692541s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 6 [g=4, 39 evaluated, 38 expanded, t=0.00705199s, 5048 KB] New best heuristic value for hmax: 1 [g=9, 68 evaluated, 67 expanded, t=0.00814037s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 5 [g=9, 69 evaluated, 68 expanded, t=0.00824246s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 4 [g=9, 70 evaluated, 69 expanded, t=0.00833661s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 3 [g=9, 71 evaluated, 70 expanded, t=0.00842734s, 5048 KB] New best heuristic value for ff(transform = adapt_costs(2)): 2 [g=9, 72 evaluated, 71 expanded, t=0.00851797s, 5048 KB] Completely explored state space -- no solution! Actual search time: 0.0085816s [t=0.0129318s] Expanded 180 state(s). Reopened 16 state(s). Evaluated 180 state(s). Evaluations: 672 Generated 380 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00861889s Total time: 0.0129373s Search stopped without finding a solution. Peak memory: 5048 KB exitcode: 5 remaining time: 1799.49 config 36: relative time 56, remaining 236 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hFF=ff(transform=adapt_costs(2))', '--search', 'lazy(alt([tiebreaking([sum([g(),hFF]),hFF]),tiebreaking([sum([g(),hFF]),hFF],pref_only=true)],boost=432),preferred=[hFF],reopen_closed=true,cost_type=1,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 427.00 -> (427, 428) reading input... [t=3.6135e-05s] done reading input! [t=0.00106257s] packing state variables...done! [t=0.00108406s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00119748s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.0976e-05s done initializing global data [t=0.00125479s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Conducting lazy best first search, (real) bound = 10 New best heuristic value for ff(transform = adapt_costs(2)): 19 [g=0, 1 evaluated, 0 expanded, t=0.00187592s, 4916 KB] Initial heuristic value for ff(transform = adapt_costs(2)): 19 New best heuristic value for ff(transform = adapt_costs(2)): 16 [g=10, 13 evaluated, 12 expanded, t=0.00217983s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(2)): 13 [g=18, 21 evaluated, 20 expanded, t=0.00236441s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(2)): 12 [g=20, 23 evaluated, 22 expanded, t=0.00244781s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(2)): 11 [g=25, 29 evaluated, 28 expanded, t=0.00258436s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(2)): 8 [g=29, 41 evaluated, 40 expanded, t=0.00281698s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(2)): 7 [g=30, 42 evaluated, 41 expanded, t=0.00288433s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(2)): 6 [g=32, 46 evaluated, 45 expanded, t=0.00298822s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(2)): 5 [g=47, 77 evaluated, 76 expanded, t=0.00347682s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(2)): 4 [g=48, 78 evaluated, 77 expanded, t=0.00354336s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(2)): 3 [g=49, 79 evaluated, 78 expanded, t=0.00360408s, 4916 KB] New best heuristic value for ff(transform = adapt_costs(2)): 2 [g=50, 80 evaluated, 79 expanded, t=0.00366555s, 4916 KB] Completely explored state space -- no solution! Actual search time: 0.00325503s [t=0.00509818s] Expanded 190 state(s). Reopened 26 state(s). Evaluated 190 state(s). Evaluations: 164 Generated 406 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00327296s Total time: 0.00510346s Search stopped without finding a solution. Peak memory: 4916 KB exitcode: 5 remaining time: 1799.48 config 37: relative time 19, remaining 180 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_merged([lm_rhw(),lm_hm(m=1)],only_causal_landmarks=false,disjunctive_landmarks=false,conjunctive_landmarks=true,no_orders=false)', '--heuristic', 'hFF=ff(adapt_costs(0))', '--heuristic', 'hLM=lmcount(lmg,admissible=true)', '--search', 'lazy(alt([single(sum([g(),weight(hFF, 10)])),single(sum([g(),weight(hFF, 10)]),pref_only=true),single(sum([g(),weight(hLM, 10)])),single(sum([g(),weight(hLM, 10)]),pref_only=true)], boost=500),preferred=[hFF],reopen_closed=false,cost_type=2,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 189.95 -> (190, 191) reading input... [t=4.041e-05s] done reading input! [t=0.00116452s] packing state variables...done! [t=0.00118142s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00130632s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.567e-05s done initializing global data [t=0.00136928s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF 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.00155253s 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.00068229s 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.00308747s Discovered 35 landmarks, of which 0 are disjunctive and 0 are conjunctive 160 edges Conducting lazy best first search, (real) bound = 10 19 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lmg, admissible = true): 3 New best heuristic value for ff(adapt_costs(0)): 3 [g=0, 1 evaluated, 0 expanded, t=0.00573665s, 5048 KB] Initial heuristic value for lmcount(lmg, admissible = true): 3 Initial heuristic value for ff(adapt_costs(0)): 3 New best heuristic value for lmcount(lmg, admissible = true): 2 [g=25, 29 evaluated, 28 expanded, t=0.00670482s, 5048 KB] New best heuristic value for ff(adapt_costs(0)): 2 [g=29, 34 evaluated, 33 expanded, t=0.00695977s, 5048 KB] New best heuristic value for lmcount(lmg, admissible = true): 1 [g=38, 48 evaluated, 47 expanded, t=0.00739423s, 5048 KB] New best heuristic value for ff(adapt_costs(0)): 1 [g=55, 82 evaluated, 81 expanded, t=0.00839566s, 5184 KB] Completely explored state space -- no solution! Actual search time: 0.00522633s [t=0.0109119s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.0052664s Total time: 0.0109191s Search stopped without finding a solution. Peak memory: 5184 KB exitcode: 5 remaining time: 1799.47 config 38: relative time 56, remaining 161 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_exhaust(reasonable_orders=false,only_causal_landmarks=false,disjunctive_landmarks=true,conjunctive_landmarks=true,no_orders=false,lm_cost_type=1)', '--heuristic', 'hGoalCount=goalcount(transform=adapt_costs(2))', '--heuristic', 'hLM,hFF=lm_ff_syn(lmg,admissible=false,transform=adapt_costs(0))', '--heuristic', 'hBlind=blind()', '--search', 'eager(alt([tiebreaking([sum([weight(g(),8),weight(hBlind,9)]),hBlind]),tiebreaking([sum([weight(g(),8),weight(hLM,9)]),hLM]),tiebreaking([sum([weight(g(),8),weight(hFF,9)]),hFF]),tiebreaking([sum([weight(g(),8),weight(hGoalCount,9)]),hGoalCount])],boost=2005),preferred=[],reopen_closed=true,cost_type=0,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 625.90 -> (626, 627) reading input... [t=4.727e-05s] done reading input! [t=0.00141588s] packing state variables...done! [t=0.00145382s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00160502s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 5.0551e-05s done initializing global data [t=0.0016761s] Initializing goal count heuristic... Initializing Exploration... Initializing landmarks count heuristic... Generating landmarks by testing all facts with RPG method Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.00164162s Discovered 54 landmarks, of which 0 are disjunctive and 0 are conjunctive 0 edges Initializing LAMA-FF synergy object Initializing blind search heuristic... Conducting best first search with reopening closed nodes, (real) bound = 10 21 initial landmarks, 2 goal landmarks New best heuristic value for blind: 0 New best heuristic value for : 33 New best heuristic value for goalcount(transform = adapt_costs(2)): 1 New best heuristic value for : 3 [g=0, 1 evaluated, 0 expanded, t=0.00446914s, 4916 KB] Initial heuristic value for blind: 0 Initial heuristic value for : 33 Initial heuristic value for goalcount(transform = adapt_costs(2)): 1 Initial heuristic value for : 3 pruning method: none New best heuristic value for : 30 [g=0, 2 evaluated, 1 expanded, t=0.0046255s, 5048 KB] New best heuristic value for : 28 [g=0, 3 evaluated, 2 expanded, t=0.00475908s, 5048 KB] New best heuristic value for : 26 [g=0, 4 evaluated, 3 expanded, t=0.00487328s, 5048 KB] New best heuristic value for : 24 [g=0, 5 evaluated, 4 expanded, t=0.00498885s, 5048 KB] New best heuristic value for : 22 [g=0, 6 evaluated, 5 expanded, t=0.00509932s, 5048 KB] New best heuristic value for : 20 [g=0, 8 evaluated, 6 expanded, t=0.0052672s, 5048 KB] New best heuristic value for : 18 [g=0, 9 evaluated, 7 expanded, t=0.00538308s, 5048 KB] New best heuristic value for : 16 [g=0, 10 evaluated, 9 expanded, t=0.00550437s, 5048 KB] New best heuristic value for : 14 [g=0, 12 evaluated, 10 expanded, t=0.00564633s, 5048 KB] New best heuristic value for : 12 [g=0, 13 evaluated, 11 expanded, t=0.00575206s, 5048 KB] New best heuristic value for : 10 [g=0, 14 evaluated, 12 expanded, t=0.00585739s, 5048 KB] New best heuristic value for : 7 [g=1, 15 evaluated, 14 expanded, t=0.00596744s, 5048 KB] New best heuristic value for : 6 [g=1, 16 evaluated, 15 expanded, t=0.00609773s, 5048 KB] New best heuristic value for : 4 [g=2, 29 evaluated, 28 expanded, t=0.00679105s, 5048 KB] New best heuristic value for : 3 [g=2, 30 evaluated, 29 expanded, t=0.00692295s, 5048 KB] New best heuristic value for : 2 New best heuristic value for : 2 [g=4, 45 evaluated, 43 expanded, t=0.00777674s, 5048 KB] New best heuristic value for : 1 New best heuristic value for : 1 [g=9, 142 evaluated, 136 expanded, t=0.0125952s, 5048 KB] Completely explored state space -- no solution! Actual search time: 0.00915269s [t=0.0137218s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 656 Generated 349 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00938157s Total time: 0.013728s Search stopped without finding a solution. Peak memory: 5048 KB exitcode: 5 remaining time: 1799.46 config 39: relative time 24, remaining 105 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_zg(reasonable_orders=false,only_causal_landmarks=false,disjunctive_landmarks=true,conjunctive_landmarks=true,no_orders=true)', '--heuristic', 'hLM=lmcount(lmg,admissible=true,pref=false,transform=adapt_costs(0))', '--search', 'eager(single(sum([g(),weight(hLM,3)])),preferred=[],reopen_closed=true,cost_type=1,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 411.31 -> (412, 413) reading input... [t=4.2046e-05s] done reading input! [t=0.00126497s] packing state variables...done! [t=0.00128377s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00142783s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 6.024e-05s done initializing global data [t=0.00149847s] Initializing Exploration... Initializing landmarks count heuristic... Generating landmarks using Zhu/Givan label propagation Removing all orderings. Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.00201012s Discovered 32 landmarks, of which 0 are disjunctive and 0 are conjunctive 0 edges Conducting best first search with reopening closed nodes, (real) bound = 10 16 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(0)): 3 [g=0, 1 evaluated, 0 expanded, t=0.0040874s, 4916 KB] Initial heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(0)): 3 pruning method: none New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(0)): 2 [g=12, 15 evaluated, 14 expanded, t=0.00431337s, 4916 KB] New best heuristic value for lmcount(lmg, admissible = true, pref = false, transform = adapt_costs(0)): 1 [g=25, 34 evaluated, 31 expanded, t=0.00454474s, 4916 KB] Completely explored state space -- no solution! Actual search time: 0.00137832s [t=0.00555415s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 164 Generated 349 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00155994s Total time: 0.00556004s Search stopped without finding a solution. Peak memory: 4916 KB exitcode: 5 remaining time: 1799.46 config 40: relative time 81, remaining 81 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--landmarks', 'lmg=lm_hm(only_causal_landmarks=false,disjunctive_landmarks=true,conjunctive_landmarks=true,no_orders=true,m=1)', '--heuristic', 'hLM=lmcount(lmg,admissible=true)', '--search', 'eager(single(sum([g(),weight(hLM, 5)])),preferred=[],reopen_closed=true,cost_type=1,bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 1799.46 -> (1800, 1801) reading input... [t=4.2176e-05s] done reading input! [t=0.00122247s] packing state variables...done! [t=0.00123998s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00137078s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.7702e-05s done initializing global data [t=0.00143873s] Initializing Exploration... Initializing landmarks count heuristic... 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. Removing all orderings. Removed 0 reasonable or obedient reasonable orders Calculating achievers. Landmarks generation time: 0.000514479s Discovered 32 landmarks, of which 0 are disjunctive and 0 are conjunctive 0 edges Conducting best first search with reopening closed nodes, (real) bound = 10 16 initial landmarks, 2 goal landmarks New best heuristic value for lmcount(lmg, admissible = true): 3 [g=0, 1 evaluated, 0 expanded, t=0.00250074s, 4920 KB] Initial heuristic value for lmcount(lmg, admissible = true): 3 pruning method: none New best heuristic value for lmcount(lmg, admissible = true): 2 [g=12, 15 evaluated, 14 expanded, t=0.00269407s, 4920 KB] New best heuristic value for lmcount(lmg, admissible = true): 1 [g=25, 34 evaluated, 31 expanded, t=0.00290682s, 4920 KB] Completely explored state space -- no solution! Actual search time: 0.00126631s [t=0.00384003s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 164 Generated 349 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00140815s Total time: 0.00384573s Search stopped without finding a solution. Peak memory: 4920 KB exitcode: 5 remaining time: 1799.45 config 0: relative time 26, remaining 26 g bound: 10 next plan number: 2 args: ['/planner/builds/release64/bin/downward', '--heuristic', 'hlm,hff=lm_ff_syn(lm_rhw(reasonable_orders=true, lm_cost_type=one), transform=adapt_costs(one))', '--search', 'lazy(alt([single(hff), single(hff, pref_only=true), single(hlm), single(hlm, pref_only=true), type_based([hff, g()])], boost=1000), preferred=[hff,hlm], cost_type=one, reopen_closed=false, randomize_successors=True, preferred_successors_first=False, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] time limit 1799.45 -> (1800, 1801) reading input... [t=3.9787e-05s] done reading input! [t=0.00117254s] packing state variables...done! [t=0.00118927s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00131388s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 4.5149e-05s done initializing global data [t=0.00137678s] 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.00139439s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initializing LAMA-FF synergy object Conducting lazy best first search, (real) bound = 10 18 initial landmarks, 2 goal landmarks New best heuristic value for : 16 New best heuristic value for : 16 [g=0, 1 evaluated, 0 expanded, t=0.00345626s, 4916 KB] Initial heuristic value for : 16 Initial heuristic value for : 16 New best heuristic value for : 15 [g=2, 3 evaluated, 2 expanded, t=0.00362611s, 4916 KB] New best heuristic value for : 14 [g=3, 4 evaluated, 3 expanded, t=0.00372959s, 4916 KB] New best heuristic value for : 13 [g=4, 5 evaluated, 4 expanded, t=0.0038312s, 4916 KB] New best heuristic value for : 12 [g=5, 6 evaluated, 5 expanded, t=0.00396222s, 4916 KB] New best heuristic value for : 11 [g=6, 7 evaluated, 6 expanded, t=0.00405844s, 4916 KB] New best heuristic value for : 10 [g=7, 8 evaluated, 7 expanded, t=0.0041555s, 4916 KB] New best heuristic value for : 9 [g=8, 9 evaluated, 8 expanded, t=0.00425534s, 4916 KB] New best heuristic value for : 8 [g=9, 11 evaluated, 10 expanded, t=0.00438453s, 4916 KB] New best heuristic value for : 13 [g=10, 12 evaluated, 11 expanded, t=0.00447955s, 4916 KB] New best heuristic value for : 11 New best heuristic value for : 7 [g=11, 13 evaluated, 12 expanded, t=0.0045759s, 4916 KB] New best heuristic value for : 5 [g=13, 15 evaluated, 14 expanded, t=0.00471848s, 4916 KB] New best heuristic value for : 10 [g=18, 20 evaluated, 19 expanded, t=0.00501007s, 5048 KB] New best heuristic value for : 9 [g=20, 23 evaluated, 22 expanded, t=0.00521588s, 5048 KB] New best heuristic value for : 4 [g=24, 27 evaluated, 26 expanded, t=0.00543351s, 5048 KB] New best heuristic value for : 2 [g=25, 29 evaluated, 28 expanded, t=0.00558082s, 5048 KB] New best heuristic value for : 5 [g=31, 38 evaluated, 37 expanded, t=0.00601241s, 5048 KB] New best heuristic value for : 4 [g=32, 39 evaluated, 38 expanded, t=0.00611812s, 5048 KB] New best heuristic value for : 3 [g=39, 46 evaluated, 45 expanded, t=0.00641645s, 5048 KB] New best heuristic value for : 1 [g=46, 54 evaluated, 53 expanded, t=0.00675902s, 5048 KB] New best heuristic value for : 2 [g=49, 57 evaluated, 56 expanded, t=0.00691663s, 5048 KB] New best heuristic value for : 1 [g=50, 58 evaluated, 57 expanded, t=0.00700964s, 5048 KB] Completely explored state space -- no solution! Actual search time: 0.00800552s [t=0.0114016s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Int hash set load factor: 164/256 = 0.640625 Int hash set resizes: 8 Search time: 0.00803842s Total time: 0.0114074s Search stopped without finding a solution. Peak memory: 5048 KB exitcode: 5 Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmp9rikWY/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/tmp9rikWY/sas_plan.1 10