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/Kdl_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/Kdl_3.pddl
Parsing...
Parsing: [0.010s CPU, 0.012s wall-clock]
Normalizing task... [0.000s 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.010s 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.460s CPU, 0.458s wall-clock]
Instantiating: [0.920s CPU, 0.920s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.020s CPU, 0.019s 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.006s wall-clock]
Computing fact groups: [0.040s CPU, 0.034s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.050s CPU, 0.052s wall-clock]
Translating task: [0.680s CPU, 0.681s 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: 48944 KB
Writing output... [0.090s CPU, 0.094s wall-clock]
Done! [1.840s CPU, 1.849s 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=674208, notReached=19576, spurious=1772
16 operators are spurious because were not triggered
H^2 mutexes added fw: 19576, unreachable: 0
0 of 7113 operators detected as spurious
Total mutex and disambiguation time: 2.86861 iterations: 2
9788 of 9788 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
9788 of 9788 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
9788 of 9788 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: 9788
Preprocessor task size: 59318
Writing output...
Preprocessor time: 3.31375s
Preprocessor peak memory: 27740 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.000339717s]
Simplifying transitions... done!
done reading input! [t=0.195435s]
building causal graph...done! [t=0.200299s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.200425s]
done initalizing global data [t=0.20043s]
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 382 376 386 381 375 389 388 383 387 385 343 370 340 361 328 337 334 390 352 331 349 384 377 380 346 373 358 379 364 374 367 0 355 378 348 351 366 357 336 339 360 391 369 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: 728 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.668s
Starting Stackelberg bounded search...
 opt: 0.007 reg: 0 solved: 1 total time: 3.97631
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.97638
 opt: 0.004 reg: 0 solved: 1 total time: 4.01057
 opt: 0.067 reg: 0.002 solved: 1 total time: 4.0805
 opt: 0.037 reg: 0.002 solved: 1 total time: 4.1203
 opt: 0.016 reg: 0 solved: 1 total time: 4.13753
 opt: 0.021 reg: 0.001 solved: 1 total time: 4.1603
 opt: 0.013 reg: 0.002 solved: 1 total time: 4.17635
 opt: 0.014 reg: 0 solved: 1 total time: 4.19137
 opt: 0.023 reg: 0 solved: 1 total time: 4.21491
 opt: 0.016 reg: 0.001 solved: 1 total time: 4.23244
 opt: 0.019 reg: 0 solved: 1 total time: 4.25248
 opt: 0.015 reg: 0.002 solved: 1 total time: 4.26991
 opt: 0.016 reg: 0 solved: 1 total time: 4.28766
 opt: 0.018 reg: 0.001 solved: 1 total time: 4.30742
 opt: 0.015 reg: 0.002 solved: 1 total time: 4.32536
 opt: 0.02 reg: 0 solved: 1 total time: 4.34694
 opt: 0.015 reg: 0 solved: 1 total time: 4.36294
 opt: 0.025 reg: 0 solved: 2 total time: 4.38932
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.3895
 opt: 0.128 reg: 0 solved: 2 total time: 4.6737
 opt: 0.086 reg: 0 solved: 2 total time: 4.76125
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.76153
 opt: 0.083 reg: 0 solved: 2 total time: 4.95497
 opt: 0.084 reg: 0.001 solved: 3 total time: 5.04157
 opt: 0.075 reg: 0.002 solved: 4 total time: 5.11984
 opt: 0.297 reg: 0.001 solved: 3 total time: 5.41916
 opt: 0.095 reg: 0.004 solved: 5 total time: 5.51885
 opt: 0.131 reg: 0.005 solved: 4 total time: 5.65508
 opt: 0.139 reg: 0.004 solved: 3 total time: 5.79913
 opt: 0.082 reg: 0.014 solved: 6 total time: 5.89589
 opt: 0.122 reg: 0.015 solved: 5 total time: 6.03407
 opt: 0.248 reg: 0.047 solved: 7 total time: 6.32874
 opt: 0.133 reg: 0.07 solved: 9 total time: 6.5326
 opt: 0.222 reg: 0.004 solved: 6 total time: 6.7593
 opt: 0.319 reg: 0.007 solved: 7 total time: 7.08656
 opt: 0.109 reg: 0.013 solved: 8 total time: 7.2097
 opt: 0.432 reg: 0.013 solved: 8 total time: 7.65618
 opt: 0.193 reg: 0.02 solved: 9 total time: 7.87098
 opt: 0.101 reg: 0.028 solved: 10 total time: 8.00081
 opt: 0.186 reg: 0.03 solved: 10 total time: 8.21725
 opt: 1.008 reg: 0.04 solved: 12 total time: 9.26462
 opt: 0.095 reg: 0.055 solved: 11 total time: 9.41564
 opt: 0.165 reg: 0.049 solved: 11 total time: 9.6306
 opt: 0.103 reg: 0.014 solved: 13 total time: 9.74895
 opt: 0.193 reg: 0.027 solved: 13 total time: 9.9699
 opt: 0.148 reg: 0.058 solved: 12 total time: 10.1767
 opt: 0.105 reg: 0.053 solved: 14 total time: 10.3362
 opt: 0.11 reg: 0.027 solved: 15 total time: 10.4745
 opt: 0.176 reg: 0.036 solved: 14 total time: 10.6881
 opt: 0.179 reg: 0.077 solved: 15 total time: 10.9456
 opt: 0.105 reg: 0.04 solved: 16 total time: 11.0914
 opt: 0.169 reg: 0.061 solved: 16 total time: 11.3226
 opt: 0.057 reg: 0.084 solved: 17 total time: 11.4647
 opt: 0.702 reg: 0.044 solved: 17 total time: 12.2108
 opt: 0.042 solved: 2147483647 total time: 12.2535
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 12.3243
Search time: 8.421s
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_next-step t0 t1 blaststepdone
				 fix_switch t1 s512 blaststepdone
				 fix_switch t1 s428 blaststepdone
				 fix_switch t1 s426 blaststepdone
				 fix_switch t1 s321 blaststepdone
				 fix_switch t1 s2702 blaststepdone
				 fix_switch t1 s2618 blaststepdone
				 fix_switch t1 s2616 blaststepdone
				 fix_switch t1 s2511 blaststepdone
				 fix_switch t1 s1972 blaststepdone
				 fix_switch t1 s1888 blaststepdone
				 fix_switch t1 s1886 blaststepdone
				 fix_switch t1 s1781 blaststepdone
				 fix_switch t1 s1242 blaststepdone
				 fix_switch t1 s1158 blaststepdone
				 fix_switch t1 s1156 blaststepdone
				 fix_switch t1 s1051 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 53
Solved by optimal solver: 53
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 53
Solved follower subproblems: 53
Optimal solver time: 6.983s
Cost-bounded solver time: 0s
Follower search time: 6.983s
Total time: 12.3787s
Optimal engine:
Peak memory: 694140 KB
@@@T17777@@@
Done!
real 17.99
user 15.86
sys 1.98
