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/HurricaneElectric_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/HurricaneElectric_4.pddl
Parsing...
Parsing: [0.020s CPU, 0.030s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s 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.500s CPU, 0.512s wall-clock]
Instantiating: [1.030s CPU, 1.030s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s 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.010s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.020s CPU, 0.028s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.050s wall-clock]
Translating task: [0.660s CPU, 0.658s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
1 operators removed
4 propositions removed
Detecting unreachable propositions: [0.080s CPU, 0.081s 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: 7128
Translator axioms: 0
Translator task size: 39872
Translator peak memory: 49208 KB
Writing output... [0.090s CPU, 0.096s wall-clock]
Done! [1.930s 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.
7128 of 7128 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
15 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: 2.89533 iterations: 2
9796 of 9796 mutex groups necessary.
7113 of 7128 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.3311s
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.000350462s]
Simplifying transitions... done!
done reading input! [t=0.192921s]
building causal graph...done! [t=0.197896s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.198024s]
done initalizing global data [t=0.198028s]
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 386 389 385 376 382 384 383 387 377 340 334 343 367 331 346 349 337 390 364 374 380 379 381 328 355 358 352 388 373 375 370 0 361 378 339 351 366 357 360 336 369 391 333 345 327 348 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.6s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 3.93392
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.93399
 opt: 0.003 reg: 0 solved: 1 total time: 3.96558
 opt: 0.013 reg: 0 solved: 1 total time: 3.97928
 opt: 0.007 reg: 0 solved: 1 total time: 3.98726
 opt: 0.007 reg: 0 solved: 1 total time: 3.99466
 opt: 0.012 reg: 0 solved: 1 total time: 4.00707
 opt: 0.007 reg: 0 solved: 1 total time: 4.01468
 opt: 0.013 reg: 0 solved: 1 total time: 4.028
 opt: 0.014 reg: 0 solved: 1 total time: 4.04309
 opt: 0.01 reg: 0 solved: 1 total time: 4.05379
 opt: 0.015 reg: 0 solved: 1 total time: 4.0693
 opt: 0.011 reg: 0 solved: 1 total time: 4.08124
 opt: 0.014 reg: 0 solved: 1 total time: 4.09557
 opt: 0.013 reg: 0 solved: 1 total time: 4.10889
 opt: 0.011 reg: 0 solved: 1 total time: 4.12069
 opt: 0.014 reg: 0 solved: 1 total time: 4.13506
 opt: 0.013 reg: 0 solved: 1 total time: 4.14869
 opt: 0.022 reg: 0 solved: 2 total time: 4.1713
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.17143
 opt: 0.076 reg: 0 solved: 2 total time: 4.28301
 opt: 0.065 reg: 0 solved: 2 total time: 4.34867
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.34887
 opt: 0.051 reg: 0 solved: 3 total time: 4.44761
 opt: 0.052 reg: 0.001 solved: 6 total time: 4.50184
 opt: 0.054 reg: 0.001 solved: 2 total time: 4.55764
 opt: 0.204 reg: 0.001 solved: 3 total time: 4.76383
 opt: 0.222 reg: 0.003 solved: 6 total time: 4.98933
 opt: 0.062 reg: 0.006 solved: 4 total time: 5.05833
 opt: 0.149 reg: 0.005 solved: 4 total time: 5.21381
 opt: 0.066 reg: 0.017 solved: 8 total time: 5.29721
 opt: 0.154 reg: 0.012 solved: 4 total time: 5.46466
 opt: 0.054 reg: 0.022 solved: 5 total time: 5.54218
 opt: 0.279 reg: 0.023 solved: 8 total time: 5.84539
 opt: 0.211 reg: 0.02 solved: 6 total time: 6.07711
 opt: 0.342 reg: 0.009 solved: 6 total time: 6.42928
 opt: 0.055 reg: 0.028 solved: 7 total time: 6.51412
 opt: 0.438 reg: 0.026 solved: 6 total time: 6.97825
 opt: 0.594 reg: 0.021 solved: 8 total time: 7.5936
 opt: 0.08 reg: 0.025 solved: 12 total time: 7.70057
 opt: 0.124 reg: 0.007 solved: 8 total time: 7.83237
 opt: 0.055 reg: 0.018 solved: 9 total time: 7.90596
 opt: 0.095 reg: 0.023 solved: 10 total time: 8.02485
 opt: 0.455 reg: 0.025 solved: 8 total time: 8.5061
 opt: 0.375 reg: 0.019 solved: 8 total time: 8.90111
 opt: 0.522 reg: 0.013 solved: 8 total time: 9.43676
 opt: 0.433 reg: 0.015 solved: 8 total time: 9.88586
 opt: 0.413 reg: 0.025 solved: 10 total time: 10.3242
 opt: 0.141 reg: 0.046 solved: 12 total time: 10.5125
 opt: 0.676 reg: 0.005 solved: 10 total time: 11.1941
 opt: 0.589 reg: 0.008 solved: 10 total time: 11.7922
 opt: 0.446 reg: 0.019 solved: 12 total time: 12.2576
 opt: 0.525 reg: 0.018 solved: 10 total time: 12.8009
 opt: 0.333 reg: 0.021 solved: 8 total time: 13.1557
 opt: 0.053 reg: 0.042 solved: 14 total time: 13.2514
 opt: 0.462 reg: 0.017 solved: 10 total time: 13.7313
 opt: 0.063 reg: 0.046 solved: 13 total time: 13.8418
 opt: 0.65 reg: 0.033 solved: 10 total time: 14.5256
 opt: 0.065 reg: 0.056 solved: 11 total time: 14.6472
 opt: 0.406 reg: 0.056 solved: 12 total time: 15.1102
 opt: 0.594 reg: 0.012 solved: 10 total time: 15.7165
 opt: 0.113 reg: 0.017 solved: 16 total time: 15.8468
 opt: 0.436 reg: 0.021 solved: 14 total time: 16.3051
 opt: 0.377 reg: 0.027 solved: 12 total time: 16.7106
 opt: 0.574 reg: 0.02 solved: 14 total time: 17.3059
 opt: 0.376 reg: 0.017 solved: 12 total time: 17.6989
 opt: 0.428 reg: 0.014 solved: 12 total time: 18.1426
 opt: 0.062 reg: 0.033 solved: 15 total time: 18.2385
 opt: 0.045 solved: 2147483647 total time: 18.2846
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 18.3714
Search time: 14.504s
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 s9 blaststepdone
				 fix_switch t0 s81 blaststepdone
				 fix_switch t0 s177 blaststepdone
				 fix_switch t0 s153 blaststepdone
				 fix_switch t0 s105 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s97 blaststepdone
				 fix_switch t1 s73 blaststepdone
				 fix_switch t1 s57 blaststepdone
				 fix_switch t1 s49 blaststepdone
				 fix_switch t1 s33 blaststepdone
				 fix_switch t1 s25 blaststepdone
				 fix_switch t1 s169 blaststepdone
				 fix_switch t1 s145 blaststepdone
				 fix_switch t1 s129 blaststepdone
				 fix_switch t1 s121 blaststepdone
				 fix_switch t1 s1 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 66
Solved by optimal solver: 66
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 66
Solved follower subproblems: 66
Optimal solver time: 13.299s
Cost-bounded solver time: 0s
Follower search time: 13.299s
Total time: 18.4216s
Optimal engine:
Peak memory: 724124 KB
@@@T23908@@@
Done!
real 24.18
user 23.24
sys 0.71
