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/Garr201112_4.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/Garr201112_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.016s wall-clock]
Normalizing task... [0.010s 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.012s wall-clock]
Preparing model... [0.010s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.440s CPU, 0.445s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.470s CPU, 0.471s wall-clock]
Instantiating: [0.950s CPU, 0.951s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.015s 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...
390 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.020s CPU, 0.027s 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.010s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.040s CPU, 0.048s wall-clock]
Translating task: [0.630s CPU, 0.638s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.090s CPU, 0.085s wall-clock]
Translator variables: 392
Translator derived variables: 0
Translator facts: 834
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 55
Translator operators: 7129
Translator axioms: 0
Translator task size: 39878
Translator peak memory: 49200 KB
Writing output... [0.100s CPU, 0.096s wall-clock]
Done! [1.840s CPU, 1.840s 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.
392 variables of 392 necessary
0 of 3 mutex groups necessary.
7129 of 7129 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 834 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=153664, notReached=540120, spurious=1772
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=674208, notReached=19576, spurious=1772
16 operators are spurious because were not triggered
H^2 mutexes added fw: 19576, unreachable: 0
0 of 7113 operators detected as spurious
Total mutex and disambiguation time: 3.11623 iterations: 2
9788 of 9788 mutex groups necessary.
7113 of 7129 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 7113
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 392
9788 of 9788 mutex groups necessary.
7113 of 7113 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
392 variables of 392 of 392 necessary
The causal graph is not acyclic.
392 variables of 392 necessary
9788 of 9788 mutex groups necessary.
7113 of 7113 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 392
Preprocessor facts: 834
Preprocessor derived variables: 0
Preprocessor operators: 7113
Preprocessor mutex groups: 9788
Preprocessor task size: 59318
Writing output...
Preprocessor time: 3.57081s
Preprocessor peak memory: 27736 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.000349876s]
Simplifying transitions... done!
done reading input! [t=0.236983s]
building causal graph...done! [t=0.242378s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.242509s]
done initalizing global data [t=0.242514s]
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() = 341
leader_vars_follower_preconditioned.size() = 340
follower_operators.size() = 6772
leader_operators.size() = 341
Initializing Symbolic Variables
Sym variable order: 1 36 56 232 120 37 280 184 264 200 25 248 88 40 332 5 136 300 312 296 20 152 168 22 72 60 124 104 140 216 76 268 284 204 236 9 188 139 108 344 92 43 252 44 341 107 172 220 316 156 123 219 203 235 155 315 171 8 267 75 283 48 91 80 112 299 251 240 224 59 304 187 13 356 96 208 288 320 64 144 160 192 23 322 128 242 176 258 210 256 306 114 50 178 162 272 98 15 290 274 109 130 285 194 66 61 226 362 77 205 82 146 253 33 301 269 317 347 10 237 157 221 93 45 189 302 174 125 173 141 222 126 142 94 286 350 11 190 270 254 46 318 292 276 206 110 62 238 196 212 132 158 29 78 68 180 368 17 148 228 100 52 217 84 116 324 308 137 335 57 89 2 265 260 249 201 164 244 6 121 297 129 153 313 185 113 24 73 35 41 27 241 289 233 169 305 105 81 359 321 225 177 14 281 193 65 138 257 49 234 154 282 161 273 209 74 218 122 250 7 58 97 186 42 90 338 145 266 298 170 314 202 279 167 231 329 263 71 151 39 215 103 199 4 106 135 87 21 83 119 247 295 311 55 163 31 183 115 99 211 275 179 147 259 16 307 323 131 195 111 143 47 291 191 227 207 51 319 243 67 127 353 365 255 326 271 287 12 95 63 223 310 70 303 214 182 159 86 166 294 3 246 134 79 175 102 150 278 239 38 371 118 230 32 198 261 133 101 85 262 69 26 53 181 229 18 54 293 213 277 325 197 309 149 117 34 245 165 19 28 30 385 376 384 387 375 386 382 379 377 388 334 370 343 337 373 340 352 390 361 367 346 381 378 383 355 364 349 380 358 389 331 0 328 374 348 342 345 369 360 333 357 391 366 351 327 354 336 339 330 372 363 
Num variables: 392 => 404
Initialize Symbolic Manager(808, 19801, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 728 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 1.183s
Starting Stackelberg bounded search...
 opt: 0.048 reg: 0 solved: 1 total time: 4.69898
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 4.69909
 opt: 0.006 reg: 0 solved: 1 total time: 4.74143
 opt: 0.028 reg: 0 solved: 1 total time: 4.76996
 opt: 0.147 reg: 0 solved: 1 total time: 4.91697
 opt: 0.009 reg: 0 solved: 1 total time: 4.92633
 opt: 0.014 reg: 0 solved: 1 total time: 4.94109
 opt: 0.008 reg: 0 solved: 1 total time: 4.95003
 opt: 0.011 reg: 0 solved: 1 total time: 4.96138
 opt: 0.014 reg: 0 solved: 1 total time: 4.97632
 opt: 0.01 reg: 0 solved: 1 total time: 4.9873
 opt: 0.015 reg: 0 solved: 1 total time: 5.00276
 opt: 0.011 reg: 0 solved: 1 total time: 5.01447
 opt: 0.013 reg: 0 solved: 1 total time: 5.02797
 opt: 0.013 reg: 0 solved: 1 total time: 5.04151
 opt: 0.011 reg: 0 solved: 1 total time: 5.05357
 opt: 0.013 reg: 0 solved: 1 total time: 5.06749
 opt: 0.012 reg: 0 solved: 1 total time: 5.08012
 opt: 0.02 reg: 0 solved: 2 total time: 5.101
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 5.10117
 opt: 0.096 reg: 0 solved: 2 total time: 5.28331
 opt: 0.061 reg: 0 solved: 2 total time: 5.34484
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 5.34507
 opt: 0.067 reg: 0 solved: 2 total time: 5.46754
 opt: 0.07 reg: 0.001 solved: 3 total time: 5.53905
 opt: 0.063 reg: 0.003 solved: 6 total time: 5.60631
 opt: 0.13 reg: 0.002 solved: 3 total time: 5.739
 opt: 0.08 reg: 0.002 solved: 4 total time: 5.82252
 opt: 0.09 reg: 0.002 solved: 3 total time: 5.91606
 opt: 0.101 reg: 0.004 solved: 4 total time: 6.02167
 opt: 0.072 reg: 0.006 solved: 5 total time: 6.10107
 opt: 0.219 reg: 0.008 solved: 6 total time: 6.32826
 opt: 0.101 reg: 0.009 solved: 5 total time: 6.43878
 opt: 0.065 reg: 0.017 solved: 7 total time: 6.52199
 opt: 0.085 reg: 0.027 solved: 8 total time: 6.63526
 opt: 0.637 reg: 0.002 solved: 8 total time: 7.27502
 opt: 0.25 reg: 0.004 solved: 7 total time: 7.52987
 opt: 0.087 reg: 0.008 solved: 9 total time: 7.62572
 opt: 0.095 reg: 0.013 solved: 10 total time: 7.73517
 opt: 0.147 reg: 0.017 solved: 9 total time: 7.89953
 opt: 0.123 reg: 0.022 solved: 10 total time: 8.04562
 opt: 0.062 reg: 0.038 solved: 12 total time: 8.14586
 opt: 0.096 reg: 0.047 solved: 11 total time: 8.28929
 opt: 0.152 reg: 0.052 solved: 11 total time: 8.49474
 opt: 0.436 reg: 0.055 solved: 12 total time: 8.98657
 opt: 0.064 reg: 0.018 solved: 13 total time: 9.06965
 opt: 0.053 reg: 0.034 solved: 14 total time: 9.15863
 opt: 0.485 reg: 0.041 solved: 13 total time: 9.6854
 opt: 0.515 reg: 0.063 solved: 14 total time: 10.2643
 opt: 0.111 reg: 0.03 solved: 15 total time: 10.407
 opt: 0.158 reg: 0.039 solved: 15 total time: 10.6056
 opt: 0.052 reg: 0.079 solved: 16 total time: 10.738
 opt: 0.055 reg: 0.032 solved: 17 total time: 10.826
 opt: 0.596 reg: 0.039 solved: 16 total time: 11.4612
 opt: 0.034 solved: 2147483647 total time: 11.4963
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 11.5612
Search time: 6.966s
Total number of leader states: 4.6644e+11
Total number of follower subproblems: 3.09514e+11
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 s90 blaststepdone
				 fix_switch t1 s55 blaststepdone
				 fix_switch t1 s447 blaststepdone
				 fix_switch t1 s426 blaststepdone
				 fix_switch t1 s391 blaststepdone
				 fix_switch t1 s370 blaststepdone
				 fix_switch t1 s34 blaststepdone
				 fix_switch t1 s335 blaststepdone
				 fix_switch t1 s314 blaststepdone
				 fix_switch t1 s279 blaststepdone
				 fix_switch t1 s258 blaststepdone
				 fix_switch t1 s223 blaststepdone
				 fix_switch t1 s202 blaststepdone
				 fix_switch t1 s167 blaststepdone
				 fix_switch t1 s146 blaststepdone
				 fix_switch t1 s111 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 52
Solved by optimal solver: 52
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 52
Solved follower subproblems: 52
Optimal solver time: 5.911s
Cost-bounded solver time: 0s
Follower search time: 5.911s
Total time: 11.61s
Optimal engine:
Peak memory: 668948 KB
@@@T17241@@@
Done!
real 17.49
user 15.89
sys 1.41
