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/Shentel_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/Shentel_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.013s 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.011s wall-clock]
Preparing model... [0.010s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.430s CPU, 0.429s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.480s CPU, 0.478s wall-clock]
Instantiating: [0.930s CPU, 0.940s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.020s CPU, 0.014s 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.026s 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.048s wall-clock]
Translating task: [0.670s CPU, 0.673s 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.087s 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.104s wall-clock]
Done! [1.870s CPU, 1.870s 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.01813 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.46096s
Preprocessor peak memory: 27788 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.000327277s]
Simplifying transitions... done!
done reading input! [t=0.196864s]
building causal graph...done! [t=0.201695s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.201822s]
done initalizing global data [t=0.201827s]
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 388 381 375 387 383 386 377 382 343 370 334 349 373 337 361 390 340 367 352 384 389 380 346 331 355 374 328 378 364 0 358 379 369 339 348 357 360 336 345 391 333 351 327 366 354 342 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.557s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 3.98109
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.98116
 opt: 0.007 reg: 0 solved: 1 total time: 4.01551
 opt: 0.012 reg: 0 solved: 1 total time: 4.02842
 opt: 0.007 reg: 0 solved: 1 total time: 4.03596
 opt: 0.006 reg: 0 solved: 1 total time: 4.04283
 opt: 0.012 reg: 0 solved: 1 total time: 4.05498
 opt: 0.007 reg: 0 solved: 1 total time: 4.06255
 opt: 0.01 reg: 0 solved: 1 total time: 4.07285
 opt: 0.014 reg: 0 solved: 1 total time: 4.08706
 opt: 0.01 reg: 0 solved: 1 total time: 4.09786
 opt: 0.015 reg: 0 solved: 1 total time: 4.11373
 opt: 0.012 reg: 0 solved: 1 total time: 4.12631
 opt: 0.014 reg: 0 solved: 1 total time: 4.14065
 opt: 0.013 reg: 0 solved: 1 total time: 4.15486
 opt: 0.013 reg: 0 solved: 1 total time: 4.16818
 opt: 0.015 reg: 0 solved: 1 total time: 4.18385
 opt: 0.013 reg: 0 solved: 1 total time: 4.19769
 opt: 0.021 reg: 0 solved: 2 total time: 4.21989
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.22007
 opt: 0.058 reg: 0 solved: 2 total time: 4.31641
 opt: 0.044 reg: 0 solved: 3 total time: 4.36122
 opt: 0.08 reg: 0 solved: 3 total time: 4.44265
 opt: 0.117 reg: 0 solved: 3 total time: 4.56023
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.56048
 opt: 0.047 reg: 0.001 solved: 4 total time: 4.65473
 opt: 0.063 reg: 0.001 solved: 2 total time: 4.71934
 opt: 0.232 reg: 0.001 solved: 3 total time: 4.95357
 opt: 0.056 reg: 0.004 solved: 7 total time: 5.0146
 opt: 0.066 reg: 0.009 solved: 5 total time: 5.09026
 opt: 0.071 reg: 0.01 solved: 3 total time: 5.17275
 opt: 0.09 reg: 0.014 solved: 5 total time: 5.2772
 opt: 0.292 reg: 0.008 solved: 5 total time: 5.57837
 opt: 0.247 reg: 0.016 solved: 7 total time: 5.84211
 opt: 0.057 reg: 0.032 solved: 6 total time: 5.9324
 opt: 0.048 reg: 0.029 solved: 10 total time: 6.01117
 opt: 0.317 reg: 0.004 solved: 7 total time: 6.33306
 opt: 0.389 reg: 0.005 solved: 7 total time: 6.7275
 opt: 0.25 reg: 0.004 solved: 5 total time: 6.98276
 opt: 0.291 reg: 0.005 solved: 7 total time: 7.27939
 opt: 0.58 reg: 0.008 solved: 9 total time: 7.86809
 opt: 0.366 reg: 0.007 solved: 5 total time: 8.24202
 opt: 0.254 reg: 0.008 solved: 7 total time: 8.50491
 opt: 0.426 reg: 0.004 solved: 7 total time: 8.93618
 opt: 0.077 reg: 0.019 solved: 11 total time: 9.03329
 opt: 0.492 reg: 0.019 solved: 7 total time: 9.54536
 opt: 0.39 reg: 0.008 solved: 7 total time: 9.94421
 opt: 0.054 reg: 0.024 solved: 16 total time: 10.0234
 opt: 0.054 reg: 0.01 solved: 12 total time: 10.0879
 opt: 0.105 reg: 0.013 solved: 9 total time: 10.2068
 opt: 0.383 reg: 0.016 solved: 9 total time: 10.6061
 opt: 0.488 reg: 0.043 solved: 11 total time: 11.1384
 opt: 0.116 reg: 0.009 solved: 11 total time: 11.2642
 opt: 0.07 reg: 0.018 solved: 8 total time: 11.353
 opt: 0.339 reg: 0.024 solved: 9 total time: 11.7175
 opt: 0.103 reg: 0.033 solved: 13 total time: 11.8549
 opt: 0.531 reg: 0.012 solved: 9 total time: 12.3987
 opt: 0.762 reg: 0.019 solved: 11 total time: 13.1796
 opt: 0.113 reg: 0.028 solved: 17 total time: 13.3222
 opt: 0.414 reg: 0.023 solved: 9 total time: 13.7601
 opt: 0.405 reg: 0.011 solved: 9 total time: 14.1772
 opt: 0.341 reg: 0.024 solved: 11 total time: 14.5432
 opt: 0.553 reg: 0.017 solved: 11 total time: 15.1141
 opt: 0.48 reg: 0.012 solved: 9 total time: 15.6068
 opt: 0.182 reg: 0.033 solved: 13 total time: 15.8235
 opt: 0.431 reg: 0.008 solved: 9 total time: 16.2629
 opt: 0.318 reg: 0.017 solved: 11 total time: 16.5985
 opt: 0.674 reg: 0.019 solved: 11 total time: 17.2921
 opt: 0.395 reg: 0.014 solved: 11 total time: 17.7012
 opt: 0.072 reg: 0.044 solved: 14 total time: 17.8184
 opt: 0.538 reg: 0.018 solved: 11 total time: 18.3749
 opt: 0.316 reg: 0.016 solved: 9 total time: 18.7083
 opt: 0.642 reg: 0.01 solved: 9 total time: 19.3609
 opt: 0.369 reg: 0.013 solved: 11 total time: 19.7435
 opt: 0.401 reg: 0.007 solved: 9 total time: 20.1531
 opt: 0.193 reg: 0.041 solved: 17 total time: 20.388
 opt: 0.079 reg: 0.02 solved: 15 total time: 20.4882
 opt: 0.684 reg: 0.029 solved: 13 total time: 21.2013
 opt: 0.75 reg: 0.033 solved: 9 total time: 21.9849
 opt: 0.571 reg: 0.057 solved: 11 total time: 22.6137
 opt: 0.498 reg: 0.02 solved: 15 total time: 23.1327
 opt: 0.516 reg: 0.009 solved: 9 total time: 23.6584
 opt: 0.434 reg: 0.021 solved: 13 total time: 24.1143
 opt: 0.375 reg: 0.019 solved: 13 total time: 24.5087
 opt: 0.857 reg: 0.03 solved: 17 total time: 25.3964
 opt: 0.523 reg: 0.026 solved: 13 total time: 25.9469
 opt: 0.524 reg: 0.016 solved: 9 total time: 26.4884
 opt: 0.369 reg: 0.028 solved: 11 total time: 26.8863
 opt: 0.321 reg: 0.018 solved: 9 total time: 27.2263
 opt: 0.523 reg: 0.025 solved: 17 total time: 27.7752
 opt: 0.479 reg: 0.032 solved: 13 total time: 28.2867
 opt: 0.695 reg: 0.047 solved: 15 total time: 29.0297
 opt: 0.432 reg: 0.027 solved: 11 total time: 29.4891
 opt: 0.424 reg: 0.018 solved: 11 total time: 29.9319
 opt: 0.567 reg: 0.03 solved: 13 total time: 30.529
 opt: 0.723 reg: 0.026 solved: 13 total time: 31.2782
 opt: 0.617 reg: 0.035 solved: 17 total time: 31.9309
 opt: 0.438 reg: 0.028 solved: 13 total time: 32.3977
 opt: 0.473 reg: 0.041 solved: 15 total time: 32.9129
 opt: 0.649 reg: 0.03 solved: 11 total time: 33.593
 opt: 0.426 reg: 0.019 solved: 11 total time: 34.0394
 opt: 0.518 reg: 0.019 solved: 11 total time: 34.5773
 opt: 0.555 reg: 0.019 solved: 11 total time: 35.152
 opt: 0.568 reg: 0.035 solved: 17 total time: 35.7558
 opt: 0.521 reg: 0.023 solved: 11 total time: 36.3005
 opt: 0.5 reg: 0.019 solved: 11 total time: 36.8205
 opt: 0.334 reg: 0.038 solved: 13 total time: 37.1943
 opt: 0.518 reg: 0.021 solved: 11 total time: 37.7343
 opt: 0.576 reg: 0.027 solved: 17 total time: 38.3375
 opt: 0.306 reg: 0.027 solved: 13 total time: 38.6714
 opt: 0.521 reg: 0.022 solved: 11 total time: 39.2151
 opt: 0.411 reg: 0.017 solved: 11 total time: 39.6441
 opt: 0.645 reg: 0.019 solved: 11 total time: 40.3089
 opt: 0.637 reg: 0.017 solved: 11 total time: 40.9638
 opt: 0.529 reg: 0.027 solved: 9 total time: 41.5205
 opt: 0.575 reg: 0.045 solved: 15 total time: 42.1407
 opt: 0.559 reg: 0.019 solved: 15 total time: 42.7196
 opt: 0.059 solved: 2147483647 total time: 42.7795
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 42.8675
Search time: 38.977s
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 s90 blaststepdone
				 fix_switch t0 s165 blaststepdone
				 fix_switch t0 s15 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s97 blaststepdone
				 fix_switch t1 s72 blaststepdone
				 fix_switch t1 s65 blaststepdone
				 fix_switch t1 s47 blaststepdone
				 fix_switch t1 s40 blaststepdone
				 fix_switch t1 s22 blaststepdone
				 fix_switch t1 s197 blaststepdone
				 fix_switch t1 s190 blaststepdone
				 fix_switch t1 s172 blaststepdone
				 fix_switch t1 s147 blaststepdone
				 fix_switch t1 s140 blaststepdone
				 fix_switch t1 s122 blaststepdone
				 fix_switch t1 s115 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 115
Solved by optimal solver: 115
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 115
Solved follower subproblems: 115
Optimal solver time: 36.728s
Cost-bounded solver time: 0s
Follower search time: 36.728s
Total time: 42.9175s
Optimal engine:
Peak memory: 734640 KB
@@@T48487@@@
Done!
real 48.74
user 47.72
sys 0.80
