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/GtsPoland_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/GtsPoland_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.014s 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.013s wall-clock]
Preparing model... [0.020s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.460s CPU, 0.468s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.480s CPU, 0.484s wall-clock]
Instantiating: [0.990s CPU, 0.990s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.020s CPU, 0.015s 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.030s CPU, 0.026s 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.047s wall-clock]
Translating task: [0.640s CPU, 0.638s 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.087s 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: 49200 KB
Writing output... [0.100s CPU, 0.101s wall-clock]
Done! [1.880s CPU, 1.885s 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.30476 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.7404s
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.000295779s]
Simplifying transitions... done!
done reading input! [t=0.225571s]
building causal graph...done! [t=0.230928s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.231062s]
done initalizing global data [t=0.231067s]
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 376 375 381 374 388 377 387 382 379 383 364 334 361 343 340 328 331 390 346 367 349 386 389 385 373 370 337 380 352 384 355 0 358 378 348 342 345 369 360 333 366 391 357 351 327 354 336 339 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.568s
Starting Stackelberg bounded search...
 opt: 0.008 reg: 0 solved: 1 total time: 4.05073
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 4.05088
 opt: 0.004 reg: 0 solved: 1 total time: 4.09113
 opt: 0.016 reg: 0 solved: 1 total time: 4.10765
 opt: 0.009 reg: 0 solved: 1 total time: 4.11749
 opt: 0.009 reg: 0 solved: 1 total time: 4.12692
 opt: 0.014 reg: 0 solved: 1 total time: 4.14158
 opt: 0.009 reg: 0 solved: 1 total time: 4.15096
 opt: 0.011 reg: 0 solved: 1 total time: 4.16246
 opt: 0.016 reg: 0 solved: 1 total time: 4.17893
 opt: 0.012 reg: 0 solved: 1 total time: 4.19119
 opt: 0.017 reg: 0 solved: 1 total time: 4.20924
 opt: 0.012 reg: 0 solved: 1 total time: 4.22227
 opt: 0.015 reg: 0 solved: 1 total time: 4.23822
 opt: 0.015 reg: 0 solved: 1 total time: 4.25368
 opt: 0.013 reg: 0 solved: 1 total time: 4.26723
 opt: 0.016 reg: 0 solved: 1 total time: 4.28434
 opt: 0.014 reg: 0 solved: 1 total time: 4.29884
 opt: 0.019 reg: 0 solved: 2 total time: 4.31857
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.31874
 opt: 0.076 reg: 0 solved: 2 total time: 4.42927
 opt: 0.053 reg: 0 solved: 2 total time: 4.48327
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.48351
 opt: 0.082 reg: 0 solved: 3 total time: 4.61221
 opt: 0.218 reg: 0 solved: 3 total time: 4.83171
 opt: 0.057 reg: 0 solved: 2 total time: 4.88959
 opt: 0.08 reg: 0.001 solved: 3 total time: 4.9714
 opt: 0.067 reg: 0.001 solved: 4 total time: 5.04079
 opt: 0.162 reg: 0.001 solved: 4 total time: 5.20543
 opt: 0.059 reg: 0.003 solved: 5 total time: 5.26829
 opt: 0.187 reg: 0.004 solved: 5 total time: 5.46056
 opt: 0.091 reg: 0.006 solved: 6 total time: 5.5588
 opt: 0.107 reg: 0.007 solved: 6 total time: 5.67449
 opt: 0.086 reg: 0.013 solved: 7 total time: 5.77516
 opt: 0.06 reg: 0.028 solved: 8 total time: 5.86373
 opt: 0.11 reg: 0.031 solved: 7 total time: 6.00618
 opt: 0.084 reg: 0.017 solved: 10 total time: 6.1088
 opt: 0.091 reg: 0.006 solved: 9 total time: 6.20734
 opt: 0.657 reg: 0.007 solved: 10 total time: 6.87139
 opt: 0.275 reg: 0.015 solved: 8 total time: 7.16264
 opt: 0.124 reg: 0.018 solved: 9 total time: 7.30603
 opt: 0.053 reg: 0.035 solved: 11 total time: 7.39481
 opt: 0.383 reg: 0.01 solved: 11 total time: 7.78908
 opt: 0.091 reg: 0.018 solved: 12 total time: 7.89849
 opt: 0.126 reg: 0.026 solved: 12 total time: 8.05109
 opt: 0.064 reg: 0.054 solved: 13 total time: 8.17014
 opt: 0.043 solved: 2147483647 total time: 8.21376
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 8.27774
Search time: 4.287s
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 s99 blaststepdone
				 fix_switch t1 s93 blaststepdone
				 fix_switch t1 s66 blaststepdone
				 fix_switch t1 s60 blaststepdone
				 fix_switch t1 s33 blaststepdone
				 fix_switch t1 s27 blaststepdone
				 fix_switch t1 s258 blaststepdone
				 fix_switch t1 s231 blaststepdone
				 fix_switch t1 s225 blaststepdone
				 fix_switch t1 s198 blaststepdone
				 fix_switch t1 s192 blaststepdone
				 fix_switch t1 s165 blaststepdone
				 fix_switch t1 s159 blaststepdone
				 fix_switch t1 s132 blaststepdone
				 fix_switch t1 s126 blaststepdone
				 fix_switch t1 s0 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 44
Solved by optimal solver: 44
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 44
Solved follower subproblems: 44
Optimal solver time: 3.715s
Cost-bounded solver time: 0s
Follower search time: 3.715s
Total time: 8.32584s
Optimal engine:
Peak memory: 680608 KB
@@@T14164@@@
Done!
real 14.49
user 13.49
sys 0.74
