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/Uninett2010_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/Uninett2010_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.014s 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.013s wall-clock]
Preparing model... [0.010s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.480s CPU, 0.476s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.500s CPU, 0.503s wall-clock]
Instantiating: [1.020s CPU, 1.017s 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.000s 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.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s 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.040s CPU, 0.047s wall-clock]
Translating task: [0.670s CPU, 0.677s 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.083s 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.094s wall-clock]
Done! [1.940s CPU, 1.942s 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: 3.07609 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.51803s
Preprocessor peak memory: 27736 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.000288324s]
Simplifying transitions... done!
done reading input! [t=0.213711s]
building causal graph...done! [t=0.218989s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.21912s]
done initalizing global data [t=0.219125s]
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 385 377 380 388 383 375 384 387 334 343 367 358 337 349 373 346 390 340 376 382 374 378 370 352 328 364 389 331 379 361 0 355 381 339 369 348 345 360 336 357 391 333 351 327 354 342 366 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.525s
Starting Stackelberg bounded search...
 opt: 0.005 reg: 0 solved: 1 total time: 3.73311
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.73317
 opt: 0.003 reg: 0 solved: 1 total time: 3.76119
 opt: 0.011 reg: 0 solved: 1 total time: 3.77265
 opt: 0.006 reg: 0 solved: 1 total time: 3.77912
 opt: 0.006 reg: 0 solved: 1 total time: 3.7854
 opt: 0.01 reg: 0 solved: 1 total time: 3.79599
 opt: 0.006 reg: 0 solved: 1 total time: 3.80247
 opt: 0.007 reg: 0 solved: 1 total time: 3.81057
 opt: 0.011 reg: 0 solved: 1 total time: 3.82243
 opt: 0.008 reg: 0 solved: 1 total time: 3.83108
 opt: 0.012 reg: 0 solved: 1 total time: 3.84367
 opt: 0.009 reg: 0 solved: 1 total time: 3.8535
 opt: 0.011 reg: 0 solved: 1 total time: 3.86509
 opt: 0.01 reg: 0 solved: 1 total time: 3.87622
 opt: 0.009 reg: 0 solved: 1 total time: 3.88608
 opt: 0.011 reg: 0 solved: 1 total time: 3.89793
 opt: 0.01 reg: 0 solved: 1 total time: 3.90829
 opt: 0.015 reg: 0 solved: 2 total time: 3.92406
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 3.92417
 opt: 0.049 reg: 0 solved: 2 total time: 4.00602
 opt: 0.066 reg: 0 solved: 2 total time: 4.07302
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.0732
 opt: 0.055 reg: 0 solved: 3 total time: 4.17214
 opt: 0.047 reg: 0 solved: 2 total time: 4.22052
 opt: 0.06 reg: 0.001 solved: 5 total time: 4.28251
 opt: 0.076 reg: 0.002 solved: 5 total time: 4.36198
 opt: 0.049 reg: 0.005 solved: 6 total time: 4.41712
 opt: 0.064 reg: 0.004 solved: 4 total time: 4.4862
 opt: 0.104 reg: 0.003 solved: 3 total time: 4.59402
 opt: 0.217 reg: 0.006 solved: 6 total time: 4.8174
 opt: 0.187 reg: 0.003 solved: 3 total time: 5.00872
 opt: 0.088 reg: 0.004 solved: 4 total time: 5.10205
 opt: 0.08 reg: 0.011 solved: 8 total time: 5.19457
 opt: 0.06 reg: 0.015 solved: 7 total time: 5.27046
 opt: 0.118 reg: 0.017 solved: 8 total time: 5.40682
 opt: 0.25 reg: 0.016 solved: 7 total time: 5.67392
 opt: 0.059 reg: 0.032 solved: 11 total time: 5.76595
 opt: 0.094 reg: 0.01 solved: 14 total time: 5.87088
 opt: 0.604 reg: 0.016 solved: 9 total time: 6.49142
 opt: 0.382 reg: 0.028 solved: 11 total time: 6.90291
 opt: 0.059 reg: 0.031 solved: 10 total time: 6.99474
 opt: 0.35 reg: 0.009 solved: 10 total time: 7.35493
 opt: 0.057 reg: 0.017 solved: 12 total time: 7.42985
 opt: 0.123 reg: 0.022 solved: 9 total time: 7.5765
 opt: 0.059 reg: 0.038 solved: 13 total time: 7.6753
 opt: 0.454 reg: 0.048 solved: 12 total time: 8.17774
 opt: 0.486 reg: 0.022 solved: 13 total time: 8.68631
 opt: 0.058 reg: 0.029 solved: 15 total time: 8.77515
 opt: 0.156 reg: 0.073 solved: 14 total time: 9.00534
 opt: 0.523 reg: 0.03 solved: 15 total time: 9.55977
 opt: 0.095 reg: 0.048 solved: 16 total time: 9.70407
 opt: 0.153 reg: 0.044 solved: 16 total time: 9.90246
 opt: 0.102 reg: 0.034 solved: 17 total time: 10.0399
 opt: 0.158 reg: 0.039 solved: 17 total time: 10.238
 opt: 0.03 solved: 2147483647 total time: 10.2682
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 10.3293
Search time: 6.652s
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 s67 blaststepdone
				 fix_switch t1 s64 blaststepdone
				 fix_switch t1 s578 blaststepdone
				 fix_switch t1 s575 blaststepdone
				 fix_switch t1 s505 blaststepdone
				 fix_switch t1 s502 blaststepdone
				 fix_switch t1 s432 blaststepdone
				 fix_switch t1 s429 blaststepdone
				 fix_switch t1 s359 blaststepdone
				 fix_switch t1 s356 blaststepdone
				 fix_switch t1 s286 blaststepdone
				 fix_switch t1 s283 blaststepdone
				 fix_switch t1 s213 blaststepdone
				 fix_switch t1 s210 blaststepdone
				 fix_switch t1 s140 blaststepdone
				 fix_switch t1 s137 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: 5.732s
Cost-bounded solver time: 0s
Follower search time: 5.732s
Total time: 10.3745s
Optimal engine:
Peak memory: 684824 KB
@@@T16039@@@
Done!
real 16.33
user 15.44
sys 0.66
