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/AttMpls_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/AttMpls_4.pddl
Parsing...
Parsing: [0.020s CPU, 0.072s 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.020s CPU, 0.018s wall-clock]
Preparing model... [0.010s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.460s CPU, 0.460s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.470s CPU, 0.468s wall-clock]
Instantiating: [0.970s CPU, 0.973s 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.025s 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.051s wall-clock]
Translating task: [0.660s CPU, 0.658s 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.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: 7129
Translator axioms: 0
Translator task size: 39878
Translator peak memory: 49204 KB
Writing output... [0.090s CPU, 0.095s wall-clock]
Done! [1.880s CPU, 1.937s 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: 2.75685 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.16929s
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.000335714s]
Simplifying transitions... done!
done reading input! [t=0.193438s]
building causal graph...done! [t=0.198274s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.198406s]
done initalizing global data [t=0.198411s]
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 380 385 376 384 388 387 377 382 383 379 358 343 367 355 334 337 364 390 349 346 373 386 389 375 340 331 370 381 352 374 328 0 361 378 339 366 345 354 360 333 357 391 369 351 327 348 336 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.565s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 3.84174
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.84182
 opt: 0.003 reg: 0 solved: 1 total time: 3.87208
 opt: 0.013 reg: 0 solved: 1 total time: 3.88573
 opt: 0.007 reg: 0 solved: 1 total time: 3.89381
 opt: 0.007 reg: 0 solved: 1 total time: 3.90104
 opt: 0.012 reg: 0 solved: 1 total time: 3.91371
 opt: 0.007 reg: 0 solved: 1 total time: 3.92153
 opt: 0.01 reg: 0 solved: 1 total time: 3.93188
 opt: 0.014 reg: 0 solved: 1 total time: 3.94626
 opt: 0.01 reg: 0 solved: 1 total time: 3.95689
 opt: 0.015 reg: 0 solved: 1 total time: 3.97283
 opt: 0.011 reg: 0 solved: 1 total time: 3.98484
 opt: 0.013 reg: 0 solved: 1 total time: 3.99866
 opt: 0.012 reg: 0 solved: 1 total time: 4.0113
 opt: 0.015 reg: 0 solved: 1 total time: 4.02719
 opt: 0.014 reg: 0 solved: 1 total time: 4.04158
 opt: 0.013 reg: 0 solved: 1 total time: 4.05511
 opt: 0.022 reg: 0 solved: 2 total time: 4.07803
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.07817
 opt: 0.077 reg: 0 solved: 2 total time: 4.19001
 opt: 0.066 reg: 0 solved: 2 total time: 4.25689
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.25711
 opt: 0.054 reg: 0 solved: 3 total time: 4.35715
 opt: 0.05 reg: 0 solved: 4 total time: 4.40887
 opt: 0.064 reg: 0.001 solved: 2 total time: 4.47457
 opt: 0.272 reg: 0.001 solved: 3 total time: 4.74786
 opt: 0.183 reg: 0.001 solved: 4 total time: 4.93263
 opt: 0.084 reg: 0.003 solved: 6 total time: 5.02067
 opt: 0.078 reg: 0.005 solved: 5 total time: 5.10513
 opt: 0.377 reg: 0.005 solved: 6 total time: 5.48841
 opt: 0.428 reg: 0.002 solved: 6 total time: 5.91955
 opt: 0.093 reg: 0.013 solved: 8 total time: 6.0264
 opt: 0.113 reg: 0.013 solved: 6 total time: 6.15324
 opt: 0.389 reg: 0.013 solved: 6 total time: 6.55643
 opt: 0.313 reg: 0.008 solved: 4 total time: 6.87771
 opt: 0.108 reg: 0.015 solved: 8 total time: 7.00155
 opt: 0.336 reg: 0.012 solved: 8 total time: 7.35041
 opt: 0.386 reg: 0.008 solved: 8 total time: 7.74528
 opt: 0.055 reg: 0.021 solved: 7 total time: 7.82203
 opt: 0.397 reg: 0.02 solved: 8 total time: 8.23966
 opt: 0.573 reg: 0.029 solved: 11 total time: 8.84198
 opt: 0.295 reg: 0.003 solved: 8 total time: 9.14003
 opt: 0.059 reg: 0.004 solved: 9 total time: 9.2042
 opt: 0.072 reg: 0.009 solved: 10 total time: 9.28635
 opt: 0.542 reg: 0.009 solved: 8 total time: 9.83737
 opt: 0.322 reg: 0.011 solved: 10 total time: 10.1711
 opt: 0.387 reg: 0.006 solved: 10 total time: 10.5645
 opt: 0.049 reg: 0.028 solved: 14 total time: 10.6421
 opt: 0.468 reg: 0.008 solved: 14 total time: 11.1191
 opt: 0.268 reg: 0.015 solved: 10 total time: 11.4028
 opt: 0.46 reg: 0.023 solved: 14 total time: 11.8863
 opt: 0.065 reg: 0.036 solved: 13 total time: 11.9878
 opt: 0.417 reg: 0.011 solved: 14 total time: 12.4173
 opt: 0.126 reg: 0.017 solved: 10 total time: 12.5612
 opt: 0.488 reg: 0.024 solved: 10 total time: 13.0744
 opt: 0.456 reg: 0.035 solved: 8 total time: 13.5664
 opt: 0.58 reg: 0.046 solved: 10 total time: 14.1923
 opt: 0.454 reg: 0.027 solved: 10 total time: 14.6735
 opt: 0.416 reg: 0.003 solved: 8 total time: 15.0938
 opt: 0.334 reg: 0.012 solved: 14 total time: 15.4409
 opt: 0.318 reg: 0.009 solved: 10 total time: 15.7683
 opt: 0.434 reg: 0.008 solved: 10 total time: 16.2107
 opt: 0.066 reg: 0.028 solved: 15 total time: 16.3065
 opt: 0.224 reg: 0.017 solved: 10 total time: 16.5483
 opt: 0.071 reg: 0.029 solved: 12 total time: 16.6497
 opt: 0.289 reg: 0.034 solved: 10 total time: 16.9742
 opt: 0.05 solved: 2147483647 total time: 17.0246
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 17.1118
Search time: 13.344s
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 s191 blaststepdone
				 fix_switch t0 s166 blaststepdone
				 fix_switch t0 s16 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s91 blaststepdone
				 fix_switch t1 s76 blaststepdone
				 fix_switch t1 s66 blaststepdone
				 fix_switch t1 s51 blaststepdone
				 fix_switch t1 s41 blaststepdone
				 fix_switch t1 s26 blaststepdone
				 fix_switch t1 s176 blaststepdone
				 fix_switch t1 s151 blaststepdone
				 fix_switch t1 s141 blaststepdone
				 fix_switch t1 s126 blaststepdone
				 fix_switch t1 s116 blaststepdone
				 fix_switch t1 s101 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: 65
Solved by optimal solver: 65
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 65
Solved follower subproblems: 65
Optimal solver time: 12.41s
Cost-bounded solver time: 0s
Follower search time: 12.41s
Total time: 17.1659s
Optimal engine:
Peak memory: 687512 KB
@@@T22648@@@
Done!
real 23.64
user 21.72
sys 0.80
