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/Bellcanada_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/Bellcanada_3.pddl
Parsing...
Parsing: [0.010s CPU, 0.015s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.020s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.410s CPU, 0.414s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.440s CPU, 0.447s wall-clock]
Instantiating: [0.900s CPU, 0.895s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.013s 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.000s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.020s CPU, 0.024s 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.045s wall-clock]
Translating task: [0.620s CPU, 0.615s 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.077s 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.090s CPU, 0.090s wall-clock]
Done! [1.740s CPU, 1.741s 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=673608, notReached=20176, spurious=1772
16 operators are spurious because were not triggered
H^2 mutexes added fw: 20176, unreachable: 0
0 of 7113 operators detected as spurious
Total mutex and disambiguation time: 3.24987 iterations: 2
10088 of 10088 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
10088 of 10088 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
10088 of 10088 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: 10088
Preprocessor task size: 59918
Writing output...
Preprocessor time: 3.69142s
Preprocessor peak memory: 29716 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.000326511s]
Simplifying transitions... done!
done reading input! [t=0.19895s]
building causal graph...done! [t=0.204057s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.204176s]
done initalizing global data [t=0.204181s]
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 388 383 381 385 375 382 387 379 380 340 349 364 346 373 343 337 352 390 358 389 377 376 378 334 355 328 370 386 331 374 367 0 361 384 351 357 348 369 336 339 360 391 366 345 327 333 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: 872 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.527s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 3.86914
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.8692
 opt: 0.003 reg: 0 solved: 1 total time: 3.89771
 opt: 0.012 reg: 0 solved: 1 total time: 3.9102
 opt: 0.006 reg: 0 solved: 1 total time: 3.91704
 opt: 0.006 reg: 0 solved: 1 total time: 3.92373
 opt: 0.01 reg: 0 solved: 1 total time: 3.93486
 opt: 0.006 reg: 0 solved: 1 total time: 3.94155
 opt: 0.008 reg: 0 solved: 1 total time: 3.94971
 opt: 0.011 reg: 0 solved: 1 total time: 3.96178
 opt: 0.009 reg: 0 solved: 1 total time: 3.97109
 opt: 0.014 reg: 0 solved: 1 total time: 3.98546
 opt: 0.009 reg: 0 solved: 1 total time: 3.99539
 opt: 0.011 reg: 0 solved: 1 total time: 4.00745
 opt: 0.016 reg: 0 solved: 1 total time: 4.02402
 opt: 0.01 reg: 0 solved: 1 total time: 4.03477
 opt: 0.013 reg: 0 solved: 1 total time: 4.04845
 opt: 0.011 reg: 0 solved: 1 total time: 4.06029
 opt: 0.019 reg: 0 solved: 2 total time: 4.0796
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.07975
 opt: 0.062 reg: 0 solved: 3 total time: 4.17547
 opt: 0.043 reg: 0 solved: 5 total time: 4.21967
 opt: 0.047 reg: 0.001 solved: 4 total time: 4.2686
 opt: 0.065 reg: 0.001 solved: 2 total time: 4.33568
 opt: 0.206 reg: 0 solved: 3 total time: 4.5431
 opt: 0.164 reg: 0.001 solved: 5 total time: 4.70946
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.7097
 opt: 0.255 reg: 0.001 solved: 5 total time: 5.01049
 opt: 0.079 reg: 0.002 solved: 4 total time: 5.09352
 opt: 0.256 reg: 0.004 solved: 4 total time: 5.35494
 opt: 0.085 reg: 0.004 solved: 5 total time: 5.44505
 opt: 0.091 reg: 0.006 solved: 5 total time: 5.54255
 opt: 0.326 reg: 0.007 solved: 5 total time: 5.87602
 opt: 0.374 reg: 0.005 solved: 5 total time: 6.2559
 opt: 0.111 reg: 0.005 solved: 4 total time: 6.37354
 opt: 0.322 reg: 0.004 solved: 4 total time: 6.70034
 opt: 0.07 reg: 0.008 solved: 6 total time: 6.77977
 opt: 0.071 reg: 0.025 solved: 9 total time: 6.8772
 opt: 0.068 reg: 0.039 solved: 7 total time: 6.9852
 opt: 0.075 reg: 0.043 solved: 10 total time: 7.10457
 opt: 0.382 reg: 0.004 solved: 9 total time: 7.49119
 opt: 0.277 reg: 0.004 solved: 7 total time: 7.77287
 opt: 0.625 reg: 0.004 solved: 9 total time: 8.4028
 opt: 0.051 reg: 0.023 solved: 12 total time: 8.4776
 opt: 0.088 reg: 0.038 solved: 13 total time: 8.60419
 opt: 0.422 reg: 0.009 solved: 9 total time: 9.03585
 opt: 0.295 reg: 0.01 solved: 6 total time: 9.34138
 opt: 0.063 reg: 0.015 solved: 8 total time: 9.42082
 opt: 0.063 reg: 0.02 solved: 8 total time: 9.50509
 opt: 0.609 reg: 0.019 solved: 9 total time: 10.1339
 opt: 0.12 reg: 0.019 solved: 8 total time: 10.2747
 opt: 0.124 reg: 0.022 solved: 9 total time: 10.4221
 opt: 0.686 reg: 0.017 solved: 9 total time: 11.1264
 opt: 0.296 reg: 0.015 solved: 9 total time: 11.4379
 opt: 0.431 reg: 0.043 solved: 13 total time: 11.9123
 opt: 0.342 reg: 0.033 solved: 13 total time: 12.2886
 opt: 0.458 reg: 0.028 solved: 9 total time: 12.7753
 opt: 0.402 reg: 0.016 solved: 9 total time: 13.1942
 opt: 0.098 reg: 0.05 solved: 11 total time: 13.3432
 opt: 0.477 reg: 0.008 solved: 8 total time: 13.8283
 opt: 0.417 reg: 0.012 solved: 10 total time: 14.2586
 opt: 0.391 reg: 0.025 solved: 13 total time: 14.6753
 opt: 0.545 reg: 0.031 solved: 9 total time: 15.252
 opt: 0.302 reg: 0.03 solved: 10 total time: 15.5853
 opt: 0.419 reg: 0.015 solved: 10 total time: 16.0198
 opt: 0.456 reg: 0.032 solved: 9 total time: 16.5082
 opt: 0.361 reg: 0.021 solved: 9 total time: 16.8916
 opt: 0.345 reg: 0.065 solved: 11 total time: 17.3025
 opt: 0.83 reg: 0.03 solved: 8 total time: 18.1625
 opt: 0.293 reg: 0.03 solved: 11 total time: 18.4867
 opt: 0.135 reg: 0.047 solved: 12 total time: 18.6696
 opt: 0.467 reg: 0.004 solved: 9 total time: 19.1419
 opt: 0.159 reg: 0.004 solved: 8 total time: 19.3051
 opt: 0.397 reg: 0.004 solved: 8 total time: 19.7063
 opt: 0.15 reg: 0.009 solved: 13 total time: 19.867
 opt: 0.648 reg: 0.005 solved: 8 total time: 20.5213
 opt: 0.531 reg: 0.004 solved: 8 total time: 21.0568
 opt: 0.669 reg: 0.008 solved: 9 total time: 21.7348
 opt: 0.745 reg: 0.005 solved: 9 total time: 22.485
 opt: 0.623 reg: 0.004 solved: 8 total time: 23.113
 opt: 0.638 reg: 0.005 solved: 8 total time: 23.7571
 opt: 0.33 reg: 0.004 solved: 8 total time: 24.0924
 opt: 0.536 reg: 0.004 solved: 8 total time: 24.6331
 opt: 0.598 reg: 0.003 solved: 8 total time: 25.2356
 opt: 0.273 reg: 0.013 solved: 12 total time: 25.5228
 opt: 0.524 reg: 0.007 solved: 9 total time: 26.0543
 opt: 0.589 reg: 0.005 solved: 9 total time: 26.6485
 opt: 0.279 reg: 0.021 solved: 13 total time: 26.9493
 opt: 0.192 reg: 0.04 solved: 12 total time: 27.1829
 opt: 0.665 reg: 0.028 solved: 9 total time: 27.8763
 opt: 0.588 reg: 0.045 solved: 13 total time: 28.5101
 opt: 0.606 reg: 0.019 solved: 9 total time: 29.1353
 opt: 0.465 reg: 0.031 solved: 8 total time: 29.6324
 opt: 0.426 reg: 0.039 solved: 12 total time: 30.0983
 opt: 0.658 reg: 0.028 solved: 12 total time: 30.7848
 opt: 0.935 reg: 0.017 solved: 8 total time: 31.7372
 opt: 0.567 reg: 0.014 solved: 8 total time: 32.3191
 opt: 0.475 reg: 0.05 solved: 13 total time: 32.845
 opt: 0.228 reg: 0.007 solved: 13 total time: 33.0816
 opt: 0.104 reg: 0.02 solved: 15 total time: 33.207
 opt: 0.124 reg: 0.063 solved: 14 total time: 33.3959
 opt: 0.487 reg: 0.058 solved: 12 total time: 33.9422
 opt: 0.356 reg: 0.02 solved: 13 total time: 34.3187
 opt: 0.166 reg: 0.014 solved: 13 total time: 34.4999
 opt: 0.213 reg: 0.02 solved: 11 total time: 34.734
 opt: 0.336 reg: 0.044 solved: 13 total time: 35.1148
 opt: 0.546 reg: 0.04 solved: 13 total time: 35.702
 opt: 0.425 reg: 0.04 solved: 15 total time: 36.1673
 opt: 0.079 reg: 0.029 solved: 16 total time: 36.2767
 opt: 0.317 reg: 0.057 solved: 15 total time: 36.6516
 opt: 0.188 reg: 0.045 solved: 16 total time: 36.8858
 opt: 0.399 reg: 0.035 solved: 15 total time: 37.3206
 opt: 0.093 reg: 0.055 solved: 17 total time: 37.4696
 opt: 0.341 reg: 0.014 solved: 12 total time: 37.8256
 opt: 0.542 reg: 0.011 solved: 12 total time: 38.3784
 opt: 0.423 reg: 0.008 solved: 12 total time: 38.8109
 opt: 0.754 reg: 0.009 solved: 12 total time: 39.5743
 opt: 0.796 reg: 0.009 solved: 12 total time: 40.3789
 opt: 0.734 reg: 0.007 solved: 12 total time: 41.1206
 opt: 0.682 reg: 0.019 solved: 13 total time: 41.822
 opt: 0.454 reg: 0.039 solved: 14 total time: 42.3152
 opt: 0.477 reg: 0.006 solved: 13 total time: 42.799
 opt: 0.58 reg: 0.031 solved: 14 total time: 43.4103
 opt: 0.287 reg: 0.047 solved: 16 total time: 43.7458
 opt: 0.342 reg: 0.012 solved: 17 total time: 44.1011
 opt: 0.071 solved: 2147483647 total time: 44.1731
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 44.3316
Search time: 40.558s
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 s31 blaststepdone
				 fix_switch t0 s113 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s96 blaststepdone
				 fix_switch t1 s74 blaststepdone
				 fix_switch t1 s72 blaststepdone
				 fix_switch t1 s35 blaststepdone
				 fix_switch t1 s33 blaststepdone
				 fix_switch t1 s156 blaststepdone
				 fix_switch t1 s154 blaststepdone
				 fix_switch t1 s14 blaststepdone
				 fix_switch t1 s137 blaststepdone
				 fix_switch t1 s117 blaststepdone
				 fix_switch t1 s115 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s76 blaststepdone
				 fix_switch t2 s55 blaststepdone
				 fix_switch t2 s158 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: 38.03s
Cost-bounded solver time: 0s
Follower search time: 38.03s
Total time: 44.3819s
Optimal engine:
Peak memory: 722276 KB
@@@T50128@@@
Done!
real 51.43
user 49.25
sys 0.89
