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/UsSignal_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/UsSignal_2.pddl
Parsing...
Parsing: [0.020s CPU, 0.019s 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.350s CPU, 0.351s wall-clock]
6237 relevant atoms
10173 auxiliary atoms
16410 final queue length
21749 total queue pushes
Completing instantiation... [0.360s CPU, 0.352s wall-clock]
Instantiating: [0.730s CPU, 0.735s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.012s wall-clock]
Checking invariant weight... [0.010s 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...
320 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.002s 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.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.030s CPU, 0.032s wall-clock]
Translating task: [0.390s CPU, 0.398s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.070s CPU, 0.069s wall-clock]
Translator variables: 322
Translator derived variables: 0
Translator facts: 688
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 49
Translator operators: 5133
Translator axioms: 0
Translator task size: 28798
Translator peak memory: 40720 KB
Writing output... [0.070s CPU, 0.071s wall-clock]
Done! [1.330s CPU, 1.335s 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.
322 variables of 322 necessary
0 of 3 mutex groups necessary.
5133 of 5133 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 688 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=103684, notReached=368234, spurious=1426
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=458294, notReached=13624, spurious=1426
14 operators are spurious because were not triggered
H^2 mutexes added fw: 13624, unreachable: 0
0 of 5119 operators detected as spurious
Total mutex and disambiguation time: 1.73758 iterations: 2
6812 of 6812 mutex groups necessary.
5119 of 5133 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 5119
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 322
6812 of 6812 mutex groups necessary.
5119 of 5119 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
322 variables of 322 of 322 necessary
The causal graph is not acyclic.
322 variables of 322 necessary
6812 of 6812 mutex groups necessary.
5119 of 5119 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 322
Preprocessor facts: 688
Preprocessor derived variables: 0
Preprocessor operators: 5119
Preprocessor mutex groups: 6812
Preprocessor task size: 42302
Writing output...
Preprocessor time: 2.02671s
Preprocessor peak memory: 19256 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.000265219s]
Simplifying transitions... done!
done reading input! [t=0.140652s]
building causal graph...done! [t=0.144491s]
packing state variables...Variables: 322
Bytes per state: 44
done! [t=0.144598s]
done initalizing global data [t=0.144602s]
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() = 4848
leader_operators.size() = 271
Initializing Symbolic Variables
Sym variable order: 1 27 21 26 23 22 24 31 242 116 298 32 158 172 200 88 130 102 214 15 144 46 228 60 165 186 67 74 249 256 95 39 221 8 137 109 235 207 151 53 274 123 103 179 193 243 145 302 215 257 75 16 187 81 201 159 229 117 47 89 52 192 173 61 131 234 206 136 248 80 108 271 7 66 150 220 40 122 110 94 178 38 164 208 138 236 222 82 180 9 177 54 68 166 96 194 250 124 79 278 152 135 247 268 121 163 107 6 51 93 219 191 205 65 149 233 104 37 160 34 48 132 62 244 146 3 258 76 230 216 90 118 202 44 198 2 174 128 254 291 142 240 188 184 58 13 72 212 100 170 226 156 86 71 99 141 33 169 239 114 225 253 183 288 12 43 57 127 113 85 55 83 155 97 211 209 251 237 167 197 153 10 139 281 111 69 181 41 78 195 176 223 162 125 190 232 148 120 134 106 5 50 92 36 246 264 56 98 18 19 25 204 64 218 112 210 140 182 126 84 70 11 154 196 168 261 42 285 17 252 224 161 238 30 91 77 147 245 133 63 217 4 49 203 231 28 119 105 189 35 175 73 20 29 101 185 157 255 227 295 129 14 45 59 213 87 199 115 241 171 143 292 303 269 289 282 286 299 259 265 272 275 262 317 321 283 293 313 301 267 280 297 0 296 314 279 312 318 316 305 277 276 304 320 300 266 294 284 260 273 319 287 270 290 263 315 310 308 307 306 309 311 
Num variables: 322 => 333
Initialize Symbolic Manager(666, 24024, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 387 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.457s
Starting Stackelberg bounded search...
 opt: 2.069 reg: 0 solved: 1 total time: 5.35045
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 5.35057
 opt: 0.371 reg: 0 solved: 1 total time: 5.82978
 opt: 0.151 reg: 0 solved: 1 total time: 5.98123
 opt: 0.147 reg: 0 solved: 1 total time: 6.12836
 opt: 0.139 reg: 0 solved: 1 total time: 6.26837
 opt: 0.144 reg: 0 solved: 1 total time: 6.41321
 opt: 0.144 reg: 0 solved: 1 total time: 6.55759
 opt: 0.14 reg: 0 solved: 1 total time: 6.69855
 opt: 0.142 reg: 0 solved: 1 total time: 6.84132
 opt: 0.142 reg: 0 solved: 1 total time: 6.98399
 opt: 0.144 reg: 0 solved: 1 total time: 7.12861
 opt: 0.357 reg: 0 solved: 1 total time: 7.48588
 opt: 0.141 reg: 0 solved: 1 total time: 7.62754
 opt: 0.142 reg: 0 solved: 1 total time: 7.76955
 opt: 0.465 reg: 0 solved: 2 total time: 8.23528
L = 1, leader states: 32768, follower subproblems: 32768, F:100000, total time: 8.23543
 opt: 2.26 reg: 0 solved: 2 total time: 10.5417
 opt: 0.215 reg: 0 solved: 2 total time: 10.757
L = 2, leader states: 9.56594e+06, follower subproblems: 9.56594e+06, F:100000, total time: 10.7572
 opt: 0.194 reg: 0 solved: 2 total time: 10.9729
 opt: 0.25 reg: 0 solved: 5 total time: 11.2246
 opt: 0.22 reg: 0.012 solved: 3 total time: 11.4601
 opt: 0.224 reg: 0.006 solved: 5 total time: 11.6935
 opt: 0.29 reg: 0.004 solved: 3 total time: 11.9904
 opt: 0.306 reg: 0.008 solved: 5 total time: 12.3076
 opt: 0.23 reg: 0.008 solved: 4 total time: 12.5486
 opt: 0.227 reg: 0.012 solved: 4 total time: 12.7906
 opt: 0.308 reg: 0.002 solved: 5 total time: 13.1038
 opt: 0.349 reg: 0 solved: 1 total time: 13.4563
 opt: 0.354 reg: 0.002 solved: 5 total time: 13.8125
 opt: 0.325 reg: 0.005 solved: 5 total time: 14.1453
 opt: 0.367 reg: 0.004 solved: 4 total time: 14.5191
 opt: 0.33 reg: 0.007 solved: 5 total time: 14.86
 opt: 0.988 reg: 0.007 solved: 5 total time: 15.8567
L = 3, leader states: 5.36871e+08, follower subproblems: 5.36871e+08, F:100000, total time: 15.8592
 opt: 2.759 reg: 0.004 solved: 2 total time: 18.644
 opt: 0.355 reg: 0.018 solved: 4 total time: 19.0173
 opt: 0.322 reg: 0.002 solved: 5 total time: 19.3447
 opt: 0.456 reg: 0.003 solved: 5 total time: 19.8066
 opt: 0.401 reg: 0.003 solved: 5 total time: 20.2137
 opt: 0.343 reg: 0.005 solved: 5 total time: 20.564
 opt: 0.272 reg: 0.006 solved: 3 total time: 20.846
 opt: 0.326 reg: 0.021 solved: 5 total time: 21.1957
 opt: 0.403 reg: 0.003 solved: 5 total time: 21.6046
 opt: 0.407 reg: 0.002 solved: 5 total time: 22.0165
 opt: 0.458 reg: 0.002 solved: 5 total time: 22.479
 opt: 0.433 reg: 0.002 solved: 5 total time: 22.9172
 opt: 0.518 reg: 0.002 solved: 5 total time: 23.4406
 opt: 0.448 reg: 0.002 solved: 5 total time: 23.8938
 opt: 0.325 reg: 0.011 solved: 10 total time: 24.2331
 opt: 0.313 reg: 0.014 solved: 5 total time: 24.5628
 opt: 1.082 reg: 0.012 solved: 5 total time: 25.6587
 opt: 3.732 reg: 0.009 solved: 5 total time: 29.4
 opt: 0.776 reg: 0.012 solved: 5 total time: 30.1898
 opt: 0.646 reg: 0.033 solved: 5 total time: 30.8709
 opt: 0.692 reg: 0.003 solved: 5 total time: 31.5688
 opt: 0.597 reg: 0.008 solved: 5 total time: 32.1758
 opt: 0.508 reg: 0.731 solved: 7 total time: 33.4157
 opt: 3.596 reg: 0.014 solved: 5 total time: 37.0252
 opt: 0.738 reg: 0.018 solved: 5 total time: 37.7828
 opt: 0.681 reg: 0.014 solved: 5 total time: 38.48
 opt: 0.678 reg: 0.002 solved: 5 total time: 39.1628
 opt: 0.629 reg: 0.002 solved: 5 total time: 39.796
 opt: 4.298 reg: 0.002 solved: 5 total time: 44.0952
 opt: 0.792 reg: 0.002 solved: 5 total time: 44.8913
 opt: 0.637 reg: 0.002 solved: 5 total time: 45.5329
 opt: 0.648 reg: 0.006 solved: 5 total time: 46.1889
 opt: 0.685 reg: 0.006 solved: 5 total time: 46.8822
 opt: 0.617 reg: 0.712 solved: 5 total time: 48.2138
 opt: 3.64 reg: 0.009 solved: 5 total time: 51.8628
 opt: 0.6 reg: 0.043 solved: 11 total time: 52.5087
 opt: 4.189 reg: 0.016 solved: 5 total time: 56.7133
 opt: 0.709 reg: 0.007 solved: 5 total time: 57.4313
 opt: 0.707 reg: 0.013 solved: 5 total time: 58.1546
 opt: 0.707 reg: 0.012 solved: 5 total time: 58.8768
 opt: 0.532 reg: 0.034 solved: 5 total time: 59.4461
 opt: 4.288 reg: 0.003 solved: 5 total time: 63.7363
 opt: 0.581 reg: 0.014 solved: 6 total time: 64.3333
 opt: 0.739 reg: 0.01 solved: 6 total time: 65.085
 opt: 0.671 reg: 0.032 solved: 10 total time: 65.7912
 opt: 4.176 reg: 0.04 solved: 7 total time: 70.0064
 opt: 0.574 reg: 0.006 solved: 9 total time: 70.5891
 opt: 0.523 reg: 0.735 solved: 6 total time: 71.8484
 opt: 3.486 reg: 0.023 solved: 9 total time: 75.3569
 opt: 0.563 reg: 0.755 solved: 6 total time: 76.677
 opt: 4.4 reg: 0.012 solved: 10 total time: 81.0879
 opt: 3.478 reg: 0.017 solved: 8 total time: 84.5832
 opt: 4.316 reg: 0.032 solved: 10 total time: 88.9306
 opt: 0.594 reg: 0.767 solved: 10 total time: 90.2935
 opt: 4.34 reg: 0.019 solved: 9 total time: 94.6513
 opt: 3.558 reg: 0.027 solved: 10 total time: 98.2366
 opt: 4.538 reg: 0.024 solved: 10 total time: 102.797
 opt: 1.475 reg: 0.023 solved: 10 total time: 104.296
 opt: 4.321 reg: 0.013 solved: 10 total time: 108.629
 opt: 4.096 reg: 0.025 solved: 10 total time: 112.749
 opt: 4.299 reg: 0.022 solved: 10 total time: 117.07
 opt: 3.617 reg: 0.015 solved: 10 total time: 120.702
 opt: 4.243 reg: 0.027 solved: 10 total time: 124.971
 opt: 0.891 reg: 0.015 solved: 10 total time: 125.879
 opt: 4.276 reg: 0.017 solved: 10 total time: 130.171
 opt: 1.432 reg: 0.029 solved: 10 total time: 131.634
 opt: 3.682 reg: 0.757 solved: 10 total time: 136.072
 opt: 3.6 reg: 0.039 solved: 10 total time: 139.71
 opt: 4.132 solved: 2147483647 total time: 143.841
L = 4, leader states: 1.2207e+10, follower subproblems: 1.2207e+10, F:2147483647, total time: 143.945
Search time: 140.851s
Total number of leader states: 2.47846e+11
Total number of follower subproblems: 1.63105e+11
Pareto-frontier size: 1
Pareto-frontier: (4,2147483647) 
	 fix ops costs: 4, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s53 blaststepdone
				 fix_switch t0 s0 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s65 blaststepdone
				 fix_switch t1 s48 blaststepdone
				 fix_switch t1 s47 blaststepdone
				 fix_switch t1 s12 blaststepdone
				 fix_switch t1 s101 blaststepdone
				 fix_switch t1 s100 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s98 blaststepdone
				 fix_switch t2 s64 blaststepdone
				 fix_switch t2 s6 blaststepdone
				 fix_switch t2 s59 blaststepdone
				 fix_switch t2 s45 blaststepdone
				 fix_switch t2 s11 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 101
Solved by optimal solver: 101
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 101
Solved follower subproblems: 101
Optimal solver time: 134.819s
Cost-bounded solver time: 0s
Follower search time: 134.819s
Total time: 143.973s
Optimal engine:
Peak memory: 719816 KB
@@@T147709@@@
Done!
real 147.94
user 146.33
sys 1.29
