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/HostwayInternational_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/HostwayInternational_4.pddl
Parsing...
Parsing: [0.020s 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.012s wall-clock]
Preparing model... [0.010s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.450s CPU, 0.451s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.480s CPU, 0.482s wall-clock]
Instantiating: [0.960s CPU, 0.968s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.020s 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.010s CPU, 0.003s wall-clock]
Computing fact groups: [0.030s 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.050s CPU, 0.049s wall-clock]
Translating task: [0.720s CPU, 0.716s 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.093s 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.110s CPU, 0.106s wall-clock]
Done! [1.960s CPU, 1.950s 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=674192, notReached=19592, spurious=1772
16 operators are spurious because were not triggered
H^2 mutexes added fw: 19592, unreachable: 0
0 of 7113 operators detected as spurious
Total mutex and disambiguation time: 3.22875 iterations: 2
9796 of 9796 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
9796 of 9796 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
9796 of 9796 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: 9796
Preprocessor task size: 59334
Writing output...
Preprocessor time: 3.69624s
Preprocessor peak memory: 27792 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.000278445s]
Simplifying transitions... done!
done reading input! [t=0.224552s]
building causal graph...done! [t=0.229898s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.230028s]
done initalizing global data [t=0.230033s]
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 381 383 380 376 377 389 384 387 388 386 349 340 343 367 364 337 361 390 346 328 334 375 385 378 331 352 373 374 370 382 358 0 355 379 351 366 348 357 336 363 360 391 369 345 327 339 354 342 330 372 333 
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: 0.601s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 4.14329
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 4.14338
 opt: 0.003 reg: 0 solved: 1 total time: 4.17641
 opt: 0.013 reg: 0 solved: 1 total time: 4.19052
 opt: 0.008 reg: 0 solved: 1 total time: 4.19917
 opt: 0.007 reg: 0 solved: 1 total time: 4.20641
 opt: 0.013 reg: 0 solved: 1 total time: 4.2197
 opt: 0.008 reg: 0 solved: 1 total time: 4.22867
 opt: 0.01 reg: 0 solved: 1 total time: 4.23973
 opt: 0.015 reg: 0 solved: 1 total time: 4.25543
 opt: 0.012 reg: 0 solved: 1 total time: 4.26786
 opt: 0.019 reg: 0 solved: 1 total time: 4.28785
 opt: 0.016 reg: 0 solved: 1 total time: 4.30457
 opt: 0.02 reg: 0 solved: 1 total time: 4.32566
 opt: 0.02 reg: 0 solved: 1 total time: 4.34668
 opt: 0.018 reg: 0 solved: 1 total time: 4.36595
 opt: 0.02 reg: 0 solved: 1 total time: 4.38731
 opt: 0.019 reg: 0 solved: 1 total time: 4.40702
 opt: 0.027 reg: 0 solved: 2 total time: 4.43516
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.43534
 opt: 0.074 reg: 0 solved: 2 total time: 4.55209
 opt: 0.09 reg: 0 solved: 2 total time: 4.64294
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.64316
 opt: 0.057 reg: 0 solved: 4 total time: 4.7541
 opt: 0.061 reg: 0.001 solved: 3 total time: 4.81645
 opt: 0.058 reg: 0.001 solved: 2 total time: 4.87626
 opt: 0.175 reg: 0.001 solved: 4 total time: 5.0537
 opt: 0.062 reg: 0.003 solved: 5 total time: 5.1193
 opt: 0.164 reg: 0.003 solved: 4 total time: 5.28747
 opt: 0.056 reg: 0.007 solved: 7 total time: 5.35114
 opt: 0.261 reg: 0.004 solved: 3 total time: 5.61673
 opt: 0.057 reg: 0.009 solved: 6 total time: 5.6846
 opt: 0.075 reg: 0.013 solved: 8 total time: 5.77319
 opt: 0.063 reg: 0.022 solved: 9 total time: 5.85936
 opt: 0.26 reg: 0.02 solved: 6 total time: 6.13998
 opt: 0.438 reg: 0.028 solved: 6 total time: 6.60682
 opt: 0.14 reg: 0.032 solved: 10 total time: 6.7799
 opt: 0.339 reg: 0.006 solved: 8 total time: 7.12623
 opt: 0.058 reg: 0.015 solved: 11 total time: 7.20049
 opt: 0.643 reg: 0.024 solved: 12 total time: 7.86795
 opt: 0.387 reg: 0.032 solved: 10 total time: 8.28824
 opt: 0.49 reg: 0.039 solved: 8 total time: 8.81767
 opt: 0.389 reg: 0.016 solved: 8 total time: 9.2233
 opt: 0.451 reg: 0.033 solved: 10 total time: 9.70777
 opt: 0.619 reg: 0.022 solved: 10 total time: 10.3492
 opt: 0.533 reg: 0.02 solved: 10 total time: 10.9033
 opt: 0.431 reg: 0.028 solved: 8 total time: 11.3627
 opt: 0.41 reg: 0.035 solved: 12 total time: 11.8085
 opt: 0.461 reg: 0.006 solved: 10 total time: 12.2767
 opt: 0.21 reg: 0.009 solved: 6 total time: 12.4963
 opt: 0.493 reg: 0.007 solved: 10 total time: 12.997
 opt: 0.537 reg: 0.007 solved: 8 total time: 13.5412
 opt: 0.431 reg: 0.007 solved: 10 total time: 13.9808
 opt: 0.55 reg: 0.014 solved: 12 total time: 14.5452
 opt: 0.299 reg: 0.011 solved: 8 total time: 14.8558
 opt: 0.102 reg: 0.025 solved: 14 total time: 14.9841
 opt: 0.073 reg: 0.031 solved: 13 total time: 15.0894
 opt: 0.742 reg: 0.018 solved: 12 total time: 15.8495
 opt: 0.467 reg: 0.016 solved: 12 total time: 16.3326
 opt: 0.703 reg: 0.024 solved: 10 total time: 17.0602
 opt: 0.528 reg: 0.016 solved: 10 total time: 17.605
 opt: 0.43 reg: 0.01 solved: 10 total time: 18.0457
 opt: 0.505 reg: 0.02 solved: 12 total time: 18.5716
 opt: 0.498 reg: 0.012 solved: 10 total time: 19.0823
 opt: 0.574 reg: 0.011 solved: 10 total time: 19.6681
 opt: 0.456 reg: 0.015 solved: 12 total time: 20.1391
 opt: 0.371 reg: 0.012 solved: 10 total time: 20.5229
 opt: 0.23 reg: 0.01 solved: 10 total time: 20.7644
 opt: 0.062 reg: 0.053 solved: 17 total time: 20.8805
 opt: 0.534 reg: 0.022 solved: 14 total time: 21.4372
 opt: 0.559 reg: 0.042 solved: 12 total time: 22.0382
 opt: 0.5 reg: 0.035 solved: 12 total time: 22.5749
 opt: 0.546 reg: 0.022 solved: 12 total time: 23.1431
 opt: 0.353 reg: 0.04 solved: 8 total time: 23.5363
 opt: 0.286 reg: 0.042 solved: 6 total time: 23.8653
 opt: 0.316 reg: 0.034 solved: 8 total time: 24.2167
 opt: 0.515 reg: 0.009 solved: 14 total time: 24.7415
 opt: 0.426 reg: 0.02 solved: 10 total time: 25.1877
 opt: 0.544 reg: 0.009 solved: 10 total time: 25.7418
 opt: 0.908 reg: 0.017 solved: 12 total time: 26.6663
 opt: 0.747 reg: 0.013 solved: 12 total time: 27.4263
 opt: 0.45 reg: 0.014 solved: 14 total time: 27.8913
 opt: 0.145 reg: 0.02 solved: 14 total time: 28.0569
 opt: 0.064 reg: 0.023 solved: 16 total time: 28.1449
 opt: 0.691 reg: 0.023 solved: 12 total time: 28.8591
 opt: 0.521 reg: 0.055 solved: 14 total time: 29.4358
 opt: 0.071 reg: 0.024 solved: 15 total time: 29.5322
 opt: 0.399 reg: 0.037 solved: 14 total time: 29.9693
 opt: 0.447 reg: 0.037 solved: 14 total time: 30.4535
 opt: 0.5 reg: 0.069 solved: 16 total time: 31.0224
 opt: 0.618 reg: 0.018 solved: 12 total time: 31.6594
 opt: 0.34 reg: 0.01 solved: 12 total time: 32.011
 opt: 0.377 reg: 0.019 solved: 14 total time: 32.4074
 opt: 0.456 reg: 0.016 solved: 14 total time: 32.8804
 opt: 0.052 solved: 2147483647 total time: 32.9329
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 33.0189
Search time: 28.961s
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_switch t0 s86 blaststepdone
				 fix_switch t0 s6 blaststepdone
				 fix_switch t0 s54 blaststepdone
				 fix_switch t0 s38 blaststepdone
				 fix_switch t0 s118 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s94 blaststepdone
				 fix_switch t1 s78 blaststepdone
				 fix_switch t1 s70 blaststepdone
				 fix_switch t1 s62 blaststepdone
				 fix_switch t1 s46 blaststepdone
				 fix_switch t1 s30 blaststepdone
				 fix_switch t1 s22 blaststepdone
				 fix_switch t1 s14 blaststepdone
				 fix_switch t1 s126 blaststepdone
				 fix_switch t1 s110 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: 92
Solved by optimal solver: 92
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 92
Solved follower subproblems: 92
Optimal solver time: 27.182s
Cost-bounded solver time: 0s
Follower search time: 27.182s
Total time: 33.0689s
Optimal engine:
Peak memory: 701196 KB
@@@T38983@@@
Done!
real 39.16
user 38.08
sys 0.94
