INFO     Running translator.
INFO     translator input: ['/nfs/home/student.aau.dk/rtollu18/dat7/netstack/pddl-domains/domain-cc.pddl', '/nfs/home/student.aau.dk/rtollu18/dat7/netstack/zoo_pddl/RedBestel_3.pddl']
INFO     translator arguments: []
INFO     translator time limit: None
INFO     translator memory limit: 25600 MB
INFO     callstring: /usr/bin/python2 /nfs/home/student.aau.dk/rtollu18/dat7/netstack/stackelberg-planner-sls/translate/translate.py /nfs/home/student.aau.dk/rtollu18/dat7/netstack/pddl-domains/domain-cc.pddl /nfs/home/student.aau.dk/rtollu18/dat7/netstack/zoo_pddl/RedBestel_3.pddl
Parsing...
Parsing: [0.010s CPU, 0.014s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.018s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 173 rules.
Computing model... [0.110s CPU, 0.113s wall-clock]
1924 relevant atoms
3477 auxiliary atoms
5401 final queue length
6860 total queue pushes
Completing instantiation... [0.090s CPU, 0.087s wall-clock]
Instantiating: [0.230s CPU, 0.233s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.008s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
134 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.010s CPU, 0.012s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.009s wall-clock]
Translating task: [0.110s CPU, 0.111s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.016s wall-clock]
Translator variables: 136
Translator derived variables: 0
Translator facts: 298
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 31
Translator operators: 1393
Translator axioms: 0
Translator task size: 7910
Translator peak memory: 23792 KB
Writing output... [0.020s CPU, 0.018s wall-clock]
Done! [0.410s CPU, 0.411s wall-clock]
INFO     Running preprocessor (release).
INFO     preprocessor input: output.sas
INFO     preprocessor arguments: []
INFO     preprocessor time limit: None
INFO     preprocessor memory limit: 25600 MB
INFO     callstring: /nfs/home/student.aau.dk/rtollu18/dat7/netstack/stackelberg-planner-sls/preprocess/preprocess < output.sas
Building causal graph...
The causal graph is not acyclic.
136 variables of 136 necessary
0 of 3 mutex groups necessary.
1393 of 1393 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 298 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=18496, notReached=69728, spurious=580
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=84632, notReached=3592, spurious=580
8 operators are spurious because were not triggered
H^2 mutexes added fw: 3592, unreachable: 0
0 of 1385 operators detected as spurious
Total mutex and disambiguation time: 0.133928 iterations: 2
1796 of 1796 mutex groups necessary.
1385 of 1393 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 1385
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 136
1796 of 1796 mutex groups necessary.
1385 of 1385 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
136 variables of 136 of 136 necessary
The causal graph is not acyclic.
136 variables of 136 necessary
1796 of 1796 mutex groups necessary.
1385 of 1385 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 136
Preprocessor facts: 298
Preprocessor derived variables: 0
Preprocessor operators: 1385
Preprocessor mutex groups: 1796
Preprocessor task size: 11430
Writing output...
Preprocessor time: 0.199777s
Preprocessor peak memory: 5868 KB
done
INFO     Running search (release).
INFO     search input: output
INFO     search arguments: ['--search', 'sym_stackelberg(optimal_engine=symbolic(plan_reuse_minimal_task_upper_bound=true,plan_reuse_upper_bound=true),upper_bound_pruning=false,min_relevant_follower_cost=100000)']
INFO     search time limit: None
INFO     search memory limit: 25600 MB
INFO     search executable: /nfs/home/student.aau.dk/rtollu18/dat7/netstack/stackelberg-planner-sls/search/downward
INFO     callstring: /nfs/home/student.aau.dk/rtollu18/dat7/netstack/stackelberg-planner-sls/search/downward --search 'sym_stackelberg(optimal_engine=symbolic(plan_reuse_minimal_task_upper_bound=true,plan_reuse_upper_bound=true),upper_bound_pruning=false,min_relevant_follower_cost=100000)' --plan-file sas_plan < output
reading input... [t=0.000330925s]
Simplifying transitions... done!
done reading input! [t=0.0373113s]
building causal graph...done! [t=0.0385149s]
packing state variables...Variables: 136
Bytes per state: 20
done! [t=0.0386261s]
done initalizing global data [t=0.0386308s]
Begin sort_operators()...
Begin divide_ariables()...
Begin clean_follower_actions()...
Begin create_new_variable_indices()...
Begin check_leader_vars_follower_preconditioned()...
Begin compute_leader_facts_ops_sets()...
leader_variable_domain.size() = 109
leader_vars_follower_preconditioned.size() = 108
follower_operators.size() = 1276
leader_operators.size() = 109
Initializing Symbolic Variables
Sym variable order: 1 18 14 87 71 105 79 31 55 4 63 47 23 95 39 123 45 69 77 61 10 85 37 53 29 101 93 49 111 57 25 41 73 6 89 65 97 81 33 52 28 44 76 120 9 100 84 92 36 68 60 13 21 20 2 51 83 59 35 91 8 43 99 117 75 27 67 66 114 58 42 74 7 90 34 98 50 26 82 15 16 56 108 72 80 32 48 5 40 88 96 24 64 17 54 70 38 46 22 30 3 62 94 86 78 102 19 12 11 127 129 133 132 126 119 113 110 116 134 122 128 130 104 125 131 107 0 118 124 103 135 106 112 115 121 109 
Num variables: 136 => 145
Initialize Symbolic Manager(290, 55172, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 204 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.032s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 1.05445
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 1.05449
 opt: 0.001 reg: 0 solved: 1 total time: 1.05956
 opt: 0.001 reg: 0 solved: 1 total time: 1.06067
 opt: 0.003 reg: 0 solved: 1 total time: 1.06392
 opt: 0.001 reg: 0 solved: 1 total time: 1.06602
 opt: 0.003 reg: 0 solved: 1 total time: 1.06993
 opt: 0.002 reg: 0 solved: 1 total time: 1.07296
 opt: 0.002 reg: 0 solved: 1 total time: 1.07549
 opt: 0.002 reg: 0 solved: 1 total time: 1.07836
 opt: 0.005 reg: 0 solved: 2 total time: 1.08372
L = 1, leader states: 512, follower subproblems: 512, F:100000, total time: 1.08378
 opt: 0.009 reg: 0 solved: 2 total time: 1.09821
 opt: 0.011 reg: 0 solved: 2 total time: 1.11037
L = 2, leader states: 13122, follower subproblems: 13122, F:100000, total time: 1.11045
 opt: 0.01 reg: 0 solved: 2 total time: 1.12632
 opt: 0.01 reg: 0 solved: 3 total time: 1.13716
 opt: 0.019 reg: 0 solved: 3 total time: 1.15729
 opt: 0.017 reg: 0 solved: 3 total time: 1.17513
 opt: 0.015 reg: 0 solved: 4 total time: 1.19169
 opt: 0.025 reg: 0 solved: 4 total time: 1.21849
 opt: 0.014 reg: 0.001 solved: 5 total time: 1.23391
 opt: 0.014 reg: 0.001 solved: 4 total time: 1.24984
 opt: 0.01 reg: 0.003 solved: 6 total time: 1.26354
 opt: 0.015 reg: 0.003 solved: 5 total time: 1.28256
 opt: 0.03 reg: 0.003 solved: 6 total time: 1.31718
 opt: 0.011 reg: 0.01 solved: 8 total time: 1.33883
 opt: 0.015 reg: 0.016 solved: 7 total time: 1.37056
 opt: 0.015 reg: 0.023 solved: 9 total time: 1.40906
 opt: 0.022 reg: 0.023 solved: 9 total time: 1.45511
 opt: 0.021 reg: 0.022 solved: 7 total time: 1.49921
 opt: 0.006 solved: 2147483647 total time: 1.50627
L = 3, leader states: 131072, follower subproblems: 131072, F:2147483647, total time: 1.51382
Search time: 0.467s
Total number of leader states: 1.31658e+06
Total number of follower subproblems: 853603
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s78 blaststepdone
				 fix_switch t1 s330 blaststepdone
				 fix_switch t1 s270 blaststepdone
				 fix_switch t1 s246 blaststepdone
				 fix_switch t1 s186 blaststepdone
				 fix_switch t1 s18 blaststepdone
				 fix_switch t1 s162 blaststepdone
				 fix_switch t1 s102 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 29
Solved by optimal solver: 29
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 29
Solved follower subproblems: 29
Optimal solver time: 0.31s
Cost-bounded solver time: 0s
Follower search time: 0.31s
Total time: 1.52017s
Optimal engine:
Peak memory: 453748 KB
@@@T2285@@@
Done!
real 2.53
user 2.03
sys 0.33
