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/Garr200902_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/Garr200902_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.013s 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.012s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 173 rules.
Computing model... [0.480s CPU, 0.480s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.490s CPU, 0.482s wall-clock]
Instantiating: [1.000s CPU, 0.997s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.020s CPU, 0.016s 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.028s 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.050s CPU, 0.049s wall-clock]
Translating task: [0.650s CPU, 0.652s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.080s CPU, 0.079s 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: 49204 KB
Writing output... [0.100s CPU, 0.099s wall-clock]
Done! [1.890s CPU, 1.893s 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.01499 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.46172s
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.000294919s]
Simplifying transitions... done!
done reading input! [t=0.214017s]
building causal graph...done! [t=0.218584s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.218689s]
done initalizing global data [t=0.218694s]
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 380 388 375 384 377 383 387 343 370 358 334 373 337 367 346 390 349 382 386 374 381 352 340 328 355 378 364 379 361 0 331 389 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: 0.561s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 3.97387
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.97394
 opt: 0.003 reg: 0 solved: 1 total time: 4.00501
 opt: 0.017 reg: 0 solved: 1 total time: 4.02263
 opt: 0.007 reg: 0 solved: 1 total time: 4.03043
 opt: 0.006 reg: 0 solved: 1 total time: 4.03709
 opt: 0.011 reg: 0 solved: 1 total time: 4.04876
 opt: 0.007 reg: 0 solved: 1 total time: 4.05604
 opt: 0.009 reg: 0 solved: 1 total time: 4.06519
 opt: 0.013 reg: 0 solved: 1 total time: 4.07902
 opt: 0.01 reg: 0 solved: 1 total time: 4.08929
 opt: 0.015 reg: 0 solved: 1 total time: 4.10479
 opt: 0.011 reg: 0 solved: 1 total time: 4.11647
 opt: 0.013 reg: 0 solved: 1 total time: 4.1299
 opt: 0.012 reg: 0 solved: 1 total time: 4.14252
 opt: 0.011 reg: 0 solved: 1 total time: 4.15445
 opt: 0.013 reg: 0 solved: 1 total time: 4.16844
 opt: 0.012 reg: 0 solved: 1 total time: 4.18146
 opt: 0.018 reg: 0 solved: 2 total time: 4.2001
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.20024
 opt: 0.053 reg: 0 solved: 2 total time: 4.2882
 opt: 0.057 reg: 0 solved: 3 total time: 4.34651
 opt: 0.07 reg: 0 solved: 3 total time: 4.41727
 opt: 0.106 reg: 0 solved: 3 total time: 4.52404
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.52431
 opt: 0.061 reg: 0 solved: 3 total time: 4.63267
 opt: 0.223 reg: 0.001 solved: 3 total time: 4.85719
 opt: 0.055 reg: 0.002 solved: 5 total time: 4.9153
 opt: 0.072 reg: 0.006 solved: 7 total time: 4.99493
 opt: 0.056 reg: 0.005 solved: 2 total time: 5.0568
 opt: 0.157 reg: 0.008 solved: 5 total time: 5.22306
 opt: 0.079 reg: 0.024 solved: 11 total time: 5.32646
 opt: 0.058 reg: 0.001 solved: 4 total time: 5.38703
 opt: 0.31 reg: 0.003 solved: 5 total time: 5.70031
 opt: 0.055 reg: 0.007 solved: 8 total time: 5.76299
 opt: 0.054 reg: 0.012 solved: 6 total time: 5.82999
 opt: 0.11 reg: 0.014 solved: 7 total time: 5.95546
 opt: 0.207 reg: 0.012 solved: 7 total time: 6.17586
 opt: 0.419 reg: 0.01 solved: 7 total time: 6.60561
 opt: 0.272 reg: 0.006 solved: 7 total time: 6.88441
 opt: 0.507 reg: 0.008 solved: 7 total time: 7.40076
 opt: 0.06 reg: 0.02 solved: 9 total time: 7.48222
 opt: 0.311 reg: 0.021 solved: 9 total time: 7.81461
 opt: 0.377 reg: 0.018 solved: 7 total time: 8.21018
 opt: 0.881 reg: 0.028 solved: 11 total time: 9.11904
 opt: 0.065 reg: 0.035 solved: 10 total time: 9.21968
 opt: 0.056 reg: 0.018 solved: 12 total time: 9.29514
 opt: 0.247 reg: 0.008 solved: 5 total time: 9.55112
 opt: 0.364 reg: 0.005 solved: 5 total time: 9.92108
 opt: 0.135 reg: 0.018 solved: 11 total time: 10.0751
 opt: 0.056 reg: 0.022 solved: 13 total time: 10.1543
 opt: 0.498 reg: 0.023 solved: 9 total time: 10.6759
 opt: 0.457 reg: 0.04 solved: 13 total time: 11.1742
 opt: 0.393 reg: 0.007 solved: 7 total time: 11.5761
 opt: 0.423 reg: 0.017 solved: 11 total time: 12.017
 opt: 0.435 reg: 0.014 solved: 13 total time: 12.4665
 opt: 0.261 reg: 0.006 solved: 7 total time: 12.7353
 opt: 0.752 reg: 0.014 solved: 11 total time: 13.502
 opt: 0.281 reg: 0.011 solved: 9 total time: 13.7956
 opt: 0.429 reg: 0.011 solved: 9 total time: 14.2362
 opt: 0.442 reg: 0.018 solved: 13 total time: 14.6966
 opt: 0.103 reg: 0.03 solved: 15 total time: 14.83
 opt: 0.568 reg: 0.038 solved: 11 total time: 15.4365
 opt: 0.109 reg: 0.052 solved: 17 total time: 15.5985
 opt: 0.412 reg: 0.041 solved: 9 total time: 16.0527
 opt: 0.563 reg: 0.072 solved: 13 total time: 16.6884
 opt: 0.516 reg: 0.02 solved: 9 total time: 17.2253
 opt: 0.621 reg: 0.034 solved: 13 total time: 17.8817
 opt: 0.426 reg: 0.064 solved: 11 total time: 18.373
 opt: 0.072 reg: 0.051 solved: 16 total time: 18.4969
 opt: 0.436 reg: 0.028 solved: 11 total time: 18.9611
 opt: 0.441 reg: 0.025 solved: 11 total time: 19.4271
 opt: 0.583 reg: 0.063 solved: 13 total time: 20.0741
 opt: 0.509 reg: 0.046 solved: 13 total time: 20.6301
 opt: 0.345 reg: 0.046 solved: 9 total time: 21.0223
 opt: 0.384 reg: 0.035 solved: 9 total time: 21.4413
 opt: 0.395 reg: 0.023 solved: 9 total time: 21.8603
 opt: 0.526 reg: 0.018 solved: 9 total time: 22.4049
 opt: 0.625 reg: 0.054 solved: 11 total time: 23.0848
 opt: 0.503 reg: 0.023 solved: 9 total time: 23.6119
 opt: 0.289 reg: 0.018 solved: 9 total time: 23.92
 opt: 0.398 reg: 0.018 solved: 9 total time: 24.3377
 opt: 0.35 reg: 0.037 solved: 11 total time: 24.7252
 opt: 0.62 reg: 0.052 solved: 17 total time: 25.3982
 opt: 0.531 reg: 0.019 solved: 11 total time: 25.949
 opt: 0.644 reg: 0.016 solved: 9 total time: 26.6088
 opt: 0.563 reg: 0.037 solved: 15 total time: 27.2094
 opt: 0.518 reg: 0.014 solved: 9 total time: 27.7421
 opt: 0.279 reg: 0.011 solved: 9 total time: 28.0336
 opt: 0.53 reg: 0.034 solved: 11 total time: 28.5981
 opt: 0.5 reg: 0.017 solved: 11 total time: 29.116
 opt: 0.503 reg: 0.05 solved: 13 total time: 29.67
 opt: 0.668 reg: 0.024 solved: 11 total time: 30.3627
 opt: 0.546 reg: 0.017 solved: 11 total time: 30.9265
 opt: 0.606 reg: 0.018 solved: 11 total time: 31.5513
 opt: 1.091 reg: 0.028 solved: 13 total time: 32.6703
 opt: 0.469 reg: 0.017 solved: 11 total time: 33.1563
 opt: 0.414 reg: 0.016 solved: 11 total time: 33.587
 opt: 0.526 reg: 0.022 solved: 13 total time: 34.1363
 opt: 0.516 reg: 0.017 solved: 11 total time: 34.6693
 opt: 0.444 reg: 0.02 solved: 13 total time: 35.134
 opt: 0.506 reg: 0.029 solved: 15 total time: 35.6691
 opt: 0.172 reg: 0.022 solved: 15 total time: 35.8637
 opt: 0.294 reg: 0.012 solved: 11 total time: 36.171
 opt: 0.075 reg: 0.043 solved: 14 total time: 36.2902
 opt: 0.411 reg: 0.042 solved: 11 total time: 36.7445
 opt: 0.37 reg: 0.054 solved: 13 total time: 37.1687
 opt: 0.43 reg: 0.045 solved: 13 total time: 37.6443
 opt: 0.622 reg: 0.051 solved: 15 total time: 38.3179
 opt: 0.512 reg: 0.015 solved: 11 total time: 38.8456
 opt: 0.712 reg: 0.023 solved: 13 total time: 39.5807
 opt: 0.389 reg: 0.016 solved: 11 total time: 39.9862
 opt: 0.522 reg: 0.012 solved: 11 total time: 40.5211
 opt: 0.606 reg: 0.022 solved: 13 total time: 41.1499
 opt: 0.614 reg: 0.014 solved: 11 total time: 41.7787
 opt: 0.493 reg: 0.015 solved: 11 total time: 42.2872
 opt: 0.256 reg: 0.011 solved: 11 total time: 42.5552
 opt: 0.63 reg: 0.022 solved: 13 total time: 43.2076
 opt: 0.489 reg: 0.013 solved: 11 total time: 43.7101
 opt: 0.567 reg: 0.011 solved: 11 total time: 44.2886
 opt: 0.588 reg: 0.012 solved: 11 total time: 44.8892
 opt: 0.474 reg: 0.01 solved: 11 total time: 45.3742
 opt: 0.51 reg: 0.027 solved: 13 total time: 45.9122
 opt: 0.172 reg: 0.037 solved: 17 total time: 46.1221
 opt: 0.5 reg: 0.017 solved: 11 total time: 46.64
 opt: 0.052 solved: 2147483647 total time: 46.6925
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 46.7701
Search time: 42.887s
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 s80 blaststepdone
				 fix_switch t0 s374 blaststepdone
				 fix_switch t0 s325 blaststepdone
				 fix_switch t0 s31 blaststepdone
				 fix_switch t0 s276 blaststepdone
				 fix_switch t0 s227 blaststepdone
				 fix_switch t0 s129 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s97 blaststepdone
				 fix_switch t1 s48 blaststepdone
				 fix_switch t1 s391 blaststepdone
				 fix_switch t1 s342 blaststepdone
				 fix_switch t1 s293 blaststepdone
				 fix_switch t1 s244 blaststepdone
				 fix_switch t1 s195 blaststepdone
				 fix_switch t1 s178 blaststepdone
				 fix_switch t1 s146 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 123
Solved by optimal solver: 123
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 123
Solved follower subproblems: 123
Optimal solver time: 40.206s
Cost-bounded solver time: 0s
Follower search time: 40.206s
Total time: 46.8169s
Optimal engine:
Peak memory: 770220 KB
@@@T52415@@@
Done!
real 52.59
user 51.65
sys 0.80
