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/SwitchL3_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/SwitchL3_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.000s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.009s wall-clock]
Generated 173 rules.
Computing model... [0.220s CPU, 0.224s wall-clock]
4414 relevant atoms
7421 auxiliary atoms
11835 final queue length
15510 total queue pushes
Completing instantiation... [0.240s CPU, 0.242s wall-clock]
Instantiating: [0.490s CPU, 0.494s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.010s 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...
246 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.020s CPU, 0.018s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.022s wall-clock]
Translating task: [0.280s CPU, 0.282s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.040s CPU, 0.040s wall-clock]
Translator variables: 248
Translator derived variables: 0
Translator facts: 534
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 43
Translator operators: 3525
Translator axioms: 0
Translator task size: 19822
Translator peak memory: 33272 KB
Writing output... [0.040s CPU, 0.047s wall-clock]
Done! [0.900s CPU, 0.908s 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.
248 variables of 248 necessary
0 of 3 mutex groups necessary.
3525 of 3525 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 534 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=61504, notReached=222556, spurious=1096
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=274364, notReached=9696, spurious=1096
12 operators are spurious because were not triggered
H^2 mutexes added fw: 9696, unreachable: 0
0 of 3513 operators detected as spurious
Total mutex and disambiguation time: 0.811996 iterations: 2
4848 of 4848 mutex groups necessary.
3513 of 3525 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 3513
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 248
4848 of 4848 mutex groups necessary.
3513 of 3513 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
248 variables of 248 of 248 necessary
The causal graph is not acyclic.
248 variables of 248 necessary
4848 of 4848 mutex groups necessary.
3513 of 3513 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 248
Preprocessor facts: 534
Preprocessor derived variables: 0
Preprocessor operators: 3513
Preprocessor mutex groups: 4848
Preprocessor task size: 29414
Writing output...
Preprocessor time: 0.999022s
Preprocessor peak memory: 13156 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.000262358s]
Simplifying transitions... done!
done reading input! [t=0.0931988s]
building causal graph...done! [t=0.0955415s]
packing state variables...Variables: 248
Bytes per state: 36
done! [t=0.0957328s]
done initalizing global data [t=0.0957373s]
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() = 209
leader_vars_follower_preconditioned.size() = 208
follower_operators.size() = 3304
leader_operators.size() = 209
Initializing Symbolic Variables
Sym variable order: 1 33 207 153 177 69 57 81 93 6 117 141 105 45 165 129 189 17 25 21 16 143 179 20 35 95 213 59 155 167 8 191 83 47 71 107 119 41 131 24 125 29 185 173 161 14 149 231 89 101 137 65 77 197 113 53 18 15 68 104 19 176 188 92 44 32 128 5 140 164 56 204 80 115 152 22 116 187 127 175 55 151 139 67 4 201 79 163 43 91 122 31 222 103 194 98 158 146 86 182 170 11 50 110 2 38 62 74 49 97 193 133 134 85 169 145 37 10 181 73 61 121 157 219 192 84 109 216 180 48 120 60 9 168 96 144 132 156 108 160 36 72 184 228 88 172 148 52 13 64 76 196 40 100 124 99 87 136 39 112 135 111 225 12 183 171 159 63 123 147 195 51 78 75 42 90 150 198 66 162 114 3 30 126 186 174 102 54 138 28 34 178 82 142 94 154 106 7 130 58 190 210 166 70 46 23 118 26 27 243 244 238 234 242 239 237 241 215 233 200 212 206 246 209 227 218 236 235 230 224 240 221 245 0 203 220 229 199 226 223 247 232 205 217 202 208 211 214 
Num variables: 248 => 257
Initialize Symbolic Manager(514, 31128, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 482 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.171s
Starting Stackelberg bounded search...
 opt: 0.003 reg: 0 solved: 1 total time: 2.12687
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.12692
 opt: 0.002 reg: 0 solved: 1 total time: 2.14045
 opt: 0.004 reg: 0 solved: 1 total time: 2.1451
 opt: 0.005 reg: 0 solved: 1 total time: 2.15096
 opt: 0.003 reg: 0 solved: 1 total time: 2.15428
 opt: 0.004 reg: 0 solved: 1 total time: 2.15911
 opt: 0.005 reg: 0 solved: 1 total time: 2.165
 opt: 0.006 reg: 0 solved: 1 total time: 2.17193
 opt: 0.005 reg: 0 solved: 1 total time: 2.17726
 opt: 0.006 reg: 0 solved: 1 total time: 2.18435
 opt: 0.006 reg: 0 solved: 1 total time: 2.19065
 opt: 0.005 reg: 0 solved: 1 total time: 2.19645
 opt: 0.006 reg: 0 solved: 1 total time: 2.20283
 opt: 0.01 reg: 0 solved: 2 total time: 2.21339
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.21349
 opt: 0.025 reg: 0 solved: 2 total time: 2.25482
 opt: 0.028 reg: 0 solved: 2 total time: 2.28408
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.28422
 opt: 0.022 reg: 0.001 solved: 9 total time: 2.32425
 opt: 0.027 reg: 0.001 solved: 2 total time: 2.35328
 opt: 0.034 reg: 0.005 solved: 5 total time: 2.39373
 opt: 0.031 reg: 0.01 solved: 4 total time: 2.43537
 opt: 0.033 reg: 0.012 solved: 3 total time: 2.48088
 opt: 0.024 reg: 0.017 solved: 11 total time: 2.52353
 opt: 0.094 reg: 0.002 solved: 5 total time: 2.6199
 opt: 0.098 reg: 0.003 solved: 4 total time: 2.72206
 opt: 0.049 reg: 0.004 solved: 5 total time: 2.77633
 opt: 0.076 reg: 0.004 solved: 3 total time: 2.85756
 opt: 0.123 reg: 0.013 solved: 9 total time: 2.99517
 opt: 0.027 reg: 0.017 solved: 6 total time: 3.04066
 opt: 0.034 reg: 0.024 solved: 8 total time: 3.10001
 opt: 0.087 reg: 0.023 solved: 8 total time: 3.21163
 opt: 0.053 reg: 0.018 solved: 6 total time: 3.28458
 opt: 0.05 reg: 0.016 solved: 5 total time: 3.35208
 opt: 0.047 reg: 0.024 solved: 7 total time: 3.42392
 opt: 0.117 reg: 0.024 solved: 7 total time: 3.56648
 opt: 0.058 reg: 0.025 solved: 8 total time: 3.65099
 opt: 0.103 reg: 0.016 solved: 8 total time: 3.77081
 opt: 0.115 reg: 0.017 solved: 8 total time: 3.90352
 opt: 0.097 reg: 0.017 solved: 8 total time: 4.01855
 opt: 0.103 reg: 0.016 solved: 7 total time: 4.13915
 opt: 0.138 reg: 0.026 solved: 11 total time: 4.30465
 opt: 0.085 reg: 0.003 solved: 8 total time: 4.39373
 opt: 0.041 reg: 0.017 solved: 10 total time: 4.45295
 opt: 0.138 reg: 0.019 solved: 7 total time: 4.61167
 opt: 0.06 reg: 0.032 solved: 11 total time: 4.70529
 opt: 0.118 reg: 0.025 solved: 8 total time: 4.85016
 opt: 0.048 reg: 0.048 solved: 13 total time: 4.94814
 opt: 0.127 reg: 0.007 solved: 10 total time: 5.08329
 opt: 0.101 reg: 0.007 solved: 9 total time: 5.19247
 opt: 0.174 reg: 0.008 solved: 10 total time: 5.37511
 opt: 0.094 reg: 0.007 solved: 9 total time: 5.47738
 opt: 0.113 reg: 0.015 solved: 11 total time: 5.60615
 opt: 0.147 reg: 0.021 solved: 11 total time: 5.77561
 opt: 0.167 reg: 0.025 solved: 10 total time: 5.96848
 opt: 0.088 reg: 0.022 solved: 11 total time: 6.07976
 opt: 0.159 reg: 0.02 solved: 11 total time: 6.26046
 opt: 0.154 reg: 0.016 solved: 10 total time: 6.43101
 opt: 0.174 reg: 0.053 solved: 13 total time: 6.65908
 opt: 0.027 solved: 2147483647 total time: 6.68662
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:2147483647, total time: 6.74685
Search time: 4.646s
Total number of leader states: 7.67047e+08
Total number of follower subproblems: 5.05594e+08
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s89 blaststepdone
				 fix_switch t0 s131 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s76 blaststepdone
				 fix_switch t1 s50 blaststepdone
				 fix_switch t1 s5 blaststepdone
				 fix_switch t1 s47 blaststepdone
				 fix_switch t1 s34 blaststepdone
				 fix_switch t1 s160 blaststepdone
				 fix_switch t1 s118 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s92 blaststepdone
				 fix_switch t2 s8 blaststepdone
				 fix_switch t2 s134 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 58
Solved by optimal solver: 58
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 58
Solved follower subproblems: 58
Optimal solver time: 3.778s
Cost-bounded solver time: 0s
Follower search time: 3.778s
Total time: 6.76673s
Optimal engine:
Peak memory: 560352 KB
@@@T8852@@@
Done!
real 9.07
user 8.48
sys 0.44
