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/Intranetwork_2.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/Intranetwork_2.pddl
Parsing...
Parsing: [0.020s CPU, 0.017s 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.320s CPU, 0.319s wall-clock]
6224 relevant atoms
10128 auxiliary atoms
16352 final queue length
21687 total queue pushes
Completing instantiation... [0.370s CPU, 0.360s wall-clock]
Instantiating: [0.710s CPU, 0.710s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.012s 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...
314 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.020s CPU, 0.021s 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.040s CPU, 0.034s wall-clock]
Translating task: [0.420s CPU, 0.423s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.060s CPU, 0.058s wall-clock]
Translator variables: 316
Translator derived variables: 0
Translator facts: 676
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 49
Translator operators: 5125
Translator axioms: 0
Translator task size: 28743
Translator peak memory: 40720 KB
Writing output... [0.070s CPU, 0.070s wall-clock]
Done! [1.320s CPU, 1.319s 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.
316 variables of 316 necessary
0 of 3 mutex groups necessary.
5125 of 5125 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 676 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=99856, notReached=355706, spurious=1414
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=441746, notReached=13816, spurious=1414
14 operators are spurious because were not triggered
H^2 mutexes added fw: 13816, unreachable: 0
0 of 5111 operators detected as spurious
Total mutex and disambiguation time: 1.83616 iterations: 2
6908 of 6908 mutex groups necessary.
5111 of 5125 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 5111
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 316
6908 of 6908 mutex groups necessary.
5111 of 5111 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
316 variables of 316 of 316 necessary
The causal graph is not acyclic.
316 variables of 316 necessary
6908 of 6908 mutex groups necessary.
5111 of 5111 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 316
Preprocessor facts: 676
Preprocessor derived variables: 0
Preprocessor operators: 5111
Preprocessor mutex groups: 6908
Preprocessor task size: 42440
Writing output...
Preprocessor time: 2.1336s
Preprocessor peak memory: 19180 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.000322283s]
Simplifying transitions... done!
done reading input! [t=0.144821s]
building causal graph...done! [t=0.14854s]
packing state variables...Variables: 316
Bytes per state: 44
done! [t=0.148639s]
done initalizing global data [t=0.148647s]
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() = 271
leader_vars_follower_preconditioned.size() = 270
follower_operators.size() = 4840
leader_operators.size() = 271
Initializing Symbolic Variables
Sym variable order: 1 31 181 26 30 237 195 251 111 209 279 97 83 41 10 125 69 139 167 223 153 150 108 55 220 248 66 234 52 178 7 164 38 206 94 80 122 136 270 24 115 101 87 192 171 255 129 199 185 157 14 73 45 241 143 213 59 227 253 285 43 169 17 71 291 57 197 12 113 211 85 99 141 127 225 51 183 233 155 239 219 191 65 205 107 79 177 135 6 247 37 163 224 140 112 267 93 121 149 238 182 84 168 210 11 98 42 56 252 70 110 126 154 282 208 196 152 222 194 54 9 180 124 68 236 250 82 96 40 276 166 138 28 19 53 2 29 95 109 39 33 193 221 235 137 165 8 207 81 179 151 123 273 174 118 132 67 90 188 230 216 76 3 249 34 258 104 160 62 146 114 48 202 44 244 198 58 240 254 100 128 72 13 156 86 212 170 226 130 25 142 184 23 74 288 242 214 116 18 88 158 200 15 102 294 228 60 46 172 186 256 144 117 215 243 159 103 257 21 187 47 89 22 16 201 75 145 173 229 61 131 63 49 189 91 20 133 231 175 261 147 297 35 4 77 105 245 119 161 217 120 203 134 92 190 50 246 162 218 106 5 148 176 64 78 204 232 27 264 32 36 286 271 262 280 268 292 274 298 306 301 275 281 315 310 266 313 265 277 260 0 296 278 290 309 312 308 283 314 259 284 289 295 263 299 287 269 311 272 293 307 303 302 305 304 300 
Num variables: 316 => 327
Initialize Symbolic Manager(654, 24464, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 491 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.613s
Starting Stackelberg bounded search...
 opt: 0.379 reg: 0 solved: 1 total time: 4.45813
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 4.45822
 opt: 0.102 reg: 0 solved: 1 total time: 4.58732
 opt: 0.108 reg: 0 solved: 1 total time: 4.69595
 opt: 0.107 reg: 0 solved: 1 total time: 4.80353
 opt: 0.101 reg: 0 solved: 1 total time: 4.90463
 opt: 0.101 reg: 0 solved: 1 total time: 5.00657
 opt: 0.104 reg: 0 solved: 1 total time: 5.1111
 opt: 0.232 reg: 0 solved: 1 total time: 5.34292
 opt: 0.099 reg: 0 solved: 1 total time: 5.44277
 opt: 0.102 reg: 0 solved: 1 total time: 5.54493
 opt: 0.101 reg: 0 solved: 1 total time: 5.64604
 opt: 0.158 reg: 0 solved: 1 total time: 5.80446
 opt: 0.092 reg: 0 solved: 1 total time: 5.89709
 opt: 0.103 reg: 0 solved: 1 total time: 6.00081
 opt: 0.162 reg: 0 solved: 2 total time: 6.16386
L = 1, leader states: 32768, follower subproblems: 32768, F:100000, total time: 6.16401
 opt: 0.104 reg: 0 solved: 1 total time: 6.29981
 opt: 0.141 reg: 0 solved: 2 total time: 6.44099
 opt: 0.133 reg: 0 solved: 2 total time: 6.57468
L = 2, leader states: 9.56594e+06, follower subproblems: 9.56594e+06, F:100000, total time: 6.57489
 opt: 0.176 reg: 0.001 solved: 8 total time: 6.78325
 opt: 0.149 reg: 0.001 solved: 3 total time: 6.93476
 opt: 0.161 reg: 0.003 solved: 4 total time: 7.1001
 opt: 0.154 reg: 0.002 solved: 2 total time: 7.25711
 opt: 0.267 reg: 0.014 solved: 8 total time: 7.53923
 opt: 0.146 reg: 0 solved: 3 total time: 7.68696
 opt: 0.209 reg: 0.001 solved: 4 total time: 7.89814
 opt: 0.165 reg: 0.007 solved: 9 total time: 8.07069
 opt: 0.207 reg: 0.022 solved: 8 total time: 8.30104
 opt: 0.162 reg: 0.042 solved: 8 total time: 8.5068
 opt: 0.331 reg: 0.036 solved: 8 total time: 8.8745
 opt: 0.342 reg: 0.004 solved: 8 total time: 9.22148
 opt: 0.169 reg: 0.003 solved: 5 total time: 9.39466
 opt: 0.171 reg: 0.015 solved: 8 total time: 9.58175
 opt: 0.273 reg: 0.028 solved: 8 total time: 9.88352
 opt: 0.315 reg: 0.036 solved: 8 total time: 10.2357
 opt: 0.175 reg: 0.028 solved: 8 total time: 10.4401
 opt: 0.247 reg: 0.011 solved: 9 total time: 10.6993
 opt: 0.322 reg: 0.007 solved: 8 total time: 11.0296
 opt: 0.531 reg: 0.013 solved: 8 total time: 11.5748
 opt: 0.266 reg: 0.034 solved: 9 total time: 11.8755
 opt: 0.365 reg: 0.025 solved: 9 total time: 12.2667
 opt: 0.405 reg: 0.007 solved: 8 total time: 12.6802
 opt: 0.565 reg: 0.007 solved: 8 total time: 13.2528
 opt: 0.932 reg: 0.012 solved: 8 total time: 14.1974
 opt: 0.845 reg: 0.02 solved: 8 total time: 15.0635
 opt: 0.344 reg: 0.031 solved: 8 total time: 15.4394
 opt: 0.195 reg: 0.022 solved: 10 total time: 15.6576
 opt: 0.225 reg: 0.009 solved: 8 total time: 15.893
 opt: 0.318 reg: 0.022 solved: 8 total time: 16.2344
 opt: 0.426 reg: 0.041 solved: 8 total time: 16.7018
 opt: 0.416 reg: 0.034 solved: 8 total time: 17.1528
 opt: 0.381 reg: 0.008 solved: 8 total time: 17.5435
 opt: 0.393 reg: 0.01 solved: 8 total time: 17.9469
 opt: 0.413 reg: 0.035 solved: 10 total time: 18.3955
 opt: 0.399 reg: 0.025 solved: 9 total time: 18.8205
 opt: 0.32 reg: 0.042 solved: 8 total time: 19.1836
 opt: 0.378 reg: 0.008 solved: 9 total time: 19.5709
 opt: 0.361 reg: 0.012 solved: 8 total time: 19.9446
 opt: 0.254 reg: 0.063 solved: 10 total time: 20.2628
 opt: 0.298 reg: 0.008 solved: 8 total time: 20.5698
 opt: 0.429 reg: 0.015 solved: 8 total time: 21.0153
 opt: 0.451 reg: 0.022 solved: 9 total time: 21.4894
 opt: 0.441 reg: 0.035 solved: 11 total time: 21.9662
 opt: 0.209 reg: 0.029 solved: 14 total time: 22.2051
 opt: 0.374 reg: 0.029 solved: 9 total time: 22.6086
 opt: 0.474 reg: 0.057 solved: 8 total time: 23.1404
 opt: 0.451 reg: 0.017 solved: 8 total time: 23.6091
 opt: 0.212 reg: 0.036 solved: 13 total time: 23.8582
 opt: 0.268 reg: 0.575 solved: 11 total time: 24.7019
 opt: 0.701 reg: 0.018 solved: 9 total time: 25.4217
 opt: 0.329 reg: 0.021 solved: 13 total time: 25.7721
 opt: 0.255 reg: 0.031 solved: 10 total time: 26.0591
 opt: 0.201 reg: 0.058 solved: 13 total time: 26.3201
 opt: 0.413 reg: 0.011 solved: 9 total time: 26.7445
 opt: 0.569 reg: 0.038 solved: 13 total time: 27.3516
 opt: 0.439 reg: 0.005 solved: 10 total time: 27.7964
 opt: 0.209 solved: 2147483647 total time: 28.0061
L = 3, leader states: 5.36871e+08, follower subproblems: 5.36871e+08, F:2147483647, total time: 28.0976
Search time: 24.074s
Total number of leader states: 1.8857e+10
Total number of follower subproblems: 1.24803e+10
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s2 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s77 blaststepdone
				 fix_switch t1 s76 blaststepdone
				 fix_switch t1 s67 blaststepdone
				 fix_switch t1 s55 blaststepdone
				 fix_switch t1 s43 blaststepdone
				 fix_switch t1 s41 blaststepdone
				 fix_switch t1 s4 blaststepdone
				 fix_switch t1 s29 blaststepdone
				 fix_switch t1 s28 blaststepdone
				 fix_switch t1 s16 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s68 blaststepdone
				 fix_switch t2 s38 blaststepdone
				 fix_switch t2 s37 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 76
Solved by optimal solver: 76
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 76
Solved follower subproblems: 76
Optimal solver time: 22.025s
Cost-bounded solver time: 0s
Follower search time: 22.025s
Total time: 28.131s
Optimal engine:
Peak memory: 650808 KB
@@@T31811@@@
Done!
real 32.00
user 30.71
sys 1.14
