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/Compuserve_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/Compuserve_3.pddl
Parsing...
Parsing: [0.010s CPU, 0.026s wall-clock]
Normalizing task... [0.000s CPU, 0.000s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.010s CPU, 0.009s wall-clock]
Generated 173 rules.
Computing model... [0.240s CPU, 0.238s wall-clock]
4451 relevant atoms
7520 auxiliary atoms
11971 final queue length
15670 total queue pushes
Completing instantiation... [0.250s CPU, 0.244s wall-clock]
Instantiating: [0.510s CPU, 0.510s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.011s 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...
258 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.019s 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.020s CPU, 0.023s wall-clock]
Translating task: [0.290s CPU, 0.294s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.050s CPU, 0.042s wall-clock]
Translator variables: 260
Translator derived variables: 0
Translator facts: 558
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 43
Translator operators: 3549
Translator axioms: 0
Translator task size: 19991
Translator peak memory: 33516 KB
Writing output... [0.050s CPU, 0.048s wall-clock]
Done! [0.940s CPU, 0.954s 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.
260 variables of 260 necessary
0 of 3 mutex groups necessary.
3549 of 3549 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 558 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=67600, notReached=242644, spurious=1120
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=300956, notReached=9288, spurious=1120
16 operators are spurious because were not triggered
H^2 mutexes added fw: 9288, unreachable: 0
0 of 3533 operators detected as spurious
Total mutex and disambiguation time: 1.03322 iterations: 2
4644 of 4644 mutex groups necessary.
3533 of 3549 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 3533
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 260
4644 of 4644 mutex groups necessary.
3533 of 3533 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
260 variables of 260 of 260 necessary
The causal graph is not acyclic.
260 variables of 260 necessary
4644 of 4644 mutex groups necessary.
3533 of 3533 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 260
Preprocessor facts: 558
Preprocessor derived variables: 0
Preprocessor operators: 3533
Preprocessor mutex groups: 4644
Preprocessor task size: 29154
Writing output...
Preprocessor time: 1.22353s
Preprocessor peak memory: 13416 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.000335815s]
Simplifying transitions... done!
done reading input! [t=0.0932124s]
building causal graph...done! [t=0.095898s]
packing state variables...Variables: 260
Bytes per state: 36
done! [t=0.0959297s]
done initalizing global data [t=0.0959336s]
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() = 209
leader_vars_follower_preconditioned.size() = 208
follower_operators.size() = 3324
leader_operators.size() = 209
Initializing Symbolic Variables
Sym variable order: 1 20 23 29 174 126 198 54 138 66 78 90 3 150 186 162 42 114 30 102 118 166 106 154 142 46 82 70 7 178 190 214 130 58 34 94 28 40 172 148 196 112 52 136 124 64 88 13 160 76 206 238 184 92 164 100 188 152 104 140 5 176 80 32 68 128 56 116 44 108 16 192 132 168 156 180 144 9 96 120 222 84 36 60 48 72 39 123 87 22 159 195 183 147 234 12 51 111 171 99 74 63 75 135 2 230 86 110 146 182 11 50 170 194 122 158 38 134 98 193 62 19 15 61 226 157 85 169 121 109 10 49 181 133 145 97 37 35 73 27 83 107 218 179 59 155 191 8 143 95 119 47 167 131 71 77 101 242 53 197 173 185 161 14 41 149 202 125 113 89 137 139 25 31 187 65 127 55 91 115 175 4 151 103 43 163 79 67 24 21 69 177 93 129 45 210 117 6 141 153 189 81 57 105 165 33 26 17 18 252 255 256 249 224 236 200 209 212 220 232 240 245 217 244 204 246 251 258 248 257 228 233 213 241 208 250 229 0 237 247 225 216 221 259 253 201 205 254 207 235 203 243 199 227 219 239 215 211 231 223 
Num variables: 260 => 269
Initialize Symbolic Manager(538, 29739, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 278 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.167s
Starting Stackelberg bounded search...
 opt: 0.003 reg: 0 solved: 1 total time: 2.20412
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.20415
 opt: 0.002 reg: 0 solved: 1 total time: 2.21742
 opt: 0.004 reg: 0 solved: 1 total time: 2.22159
 opt: 0.005 reg: 0 solved: 1 total time: 2.22684
 opt: 0.003 reg: 0 solved: 1 total time: 2.23044
 opt: 0.003 reg: 0 solved: 1 total time: 2.23415
 opt: 0.005 reg: 0 solved: 1 total time: 2.23952
 opt: 0.005 reg: 0 solved: 1 total time: 2.24474
 opt: 0.005 reg: 0 solved: 1 total time: 2.24997
 opt: 0.005 reg: 0 solved: 1 total time: 2.25568
 opt: 0.004 reg: 0 solved: 1 total time: 2.26063
 opt: 0.004 reg: 0 solved: 1 total time: 2.26562
 opt: 0.005 reg: 0 solved: 1 total time: 2.27158
 opt: 0.011 reg: 0 solved: 2 total time: 2.28333
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.2834
 opt: 0.022 reg: 0 solved: 2 total time: 2.31935
 opt: 0.03 reg: 0 solved: 2 total time: 2.35053
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.35068
 opt: 0.026 reg: 0 solved: 3 total time: 2.39316
 opt: 0.028 reg: 0 solved: 2 total time: 2.42246
 opt: 0.039 reg: 0 solved: 4 total time: 2.46259
 opt: 0.039 reg: 0.001 solved: 4 total time: 2.50433
 opt: 0.108 reg: 0.001 solved: 4 total time: 2.61451
 opt: 0.027 reg: 0.002 solved: 3 total time: 2.6446
 opt: 0.13 reg: 0.003 solved: 4 total time: 2.77844
 opt: 0.093 reg: 0.002 solved: 4 total time: 2.87422
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:100000, total time: 2.87448
 opt: 0.025 reg: 0.002 solved: 2 total time: 2.92123
 opt: 0.035 reg: 0.004 solved: 3 total time: 2.96123
 opt: 0.056 reg: 0.018 solved: 5 total time: 3.03548
 opt: 0.044 reg: 0.022 solved: 4 total time: 3.10291
 opt: 0.045 reg: 0.007 solved: 4 total time: 3.15663
 opt: 0.067 reg: 0.015 solved: 6 total time: 3.23961
 opt: 0.041 reg: 0.003 solved: 4 total time: 3.28492
 opt: 0.138 reg: 0.002 solved: 4 total time: 3.42581
 opt: 0.038 reg: 0.002 solved: 4 total time: 3.46751
 opt: 0.068 reg: 0.002 solved: 4 total time: 3.53863
 opt: 0.101 reg: 0.002 solved: 4 total time: 3.64296
 opt: 0.086 reg: 0.002 solved: 4 total time: 3.73239
 opt: 0.066 reg: 0.002 solved: 4 total time: 3.80116
 opt: 0.103 reg: 0.002 solved: 4 total time: 3.90794
 opt: 0.099 reg: 0.002 solved: 4 total time: 4.0098
 opt: 0.049 reg: 0.005 solved: 5 total time: 4.06529
 opt: 0.054 reg: 0.019 solved: 6 total time: 4.13967
 opt: 0.056 reg: 0.004 solved: 6 total time: 4.20057
 opt: 0.068 reg: 0.004 solved: 6 total time: 4.27358
 opt: 0.171 reg: 0.007 solved: 6 total time: 4.45254
 opt: 0.105 reg: 0.011 solved: 4 total time: 4.57037
 opt: 0.078 reg: 0.022 solved: 6 total time: 4.67098
 opt: 0.059 reg: 0.026 solved: 6 total time: 4.75656
 opt: 0.166 reg: 0.013 solved: 6 total time: 4.93709
 opt: 0.198 reg: 0.025 solved: 6 total time: 5.16162
 opt: 0.113 reg: 0.025 solved: 8 total time: 5.301
 opt: 0.226 reg: 0.007 solved: 6 total time: 5.53582
 opt: 0.224 reg: 0.005 solved: 6 total time: 5.76636
 opt: 0.172 reg: 0.011 solved: 6 total time: 5.9514
 opt: 0.156 reg: 0.015 solved: 6 total time: 6.12295
 opt: 0.196 reg: 0.024 solved: 8 total time: 6.3439
 opt: 0.175 reg: 0.015 solved: 6 total time: 6.53486
 opt: 0.06 reg: 0.012 solved: 6 total time: 6.6071
 opt: 0.104 reg: 0.025 solved: 4 total time: 6.73731
 opt: 0.047 reg: 0.032 solved: 6 total time: 6.81733
 opt: 0.063 reg: 0.009 solved: 6 total time: 6.89005
 opt: 0.217 reg: 0.008 solved: 6 total time: 7.11648
 opt: 0.224 reg: 0.01 solved: 6 total time: 7.35206
 opt: 0.062 reg: 0.035 solved: 8 total time: 7.45054
 opt: 0.18 reg: 0.033 solved: 6 total time: 7.66499
 opt: 0.174 reg: 0.003 solved: 6 total time: 7.84277
 opt: 0.126 reg: 0.003 solved: 6 total time: 7.97312
 opt: 0.236 reg: 0.009 solved: 6 total time: 8.21897
 opt: 0.182 reg: 0.006 solved: 6 total time: 8.40794
 opt: 0.085 reg: 0.013 solved: 6 total time: 8.5075
 opt: 0.189 reg: 0.007 solved: 6 total time: 8.70471
 opt: 0.106 reg: 0.004 solved: 6 total time: 8.81678
 opt: 0.14 reg: 0.004 solved: 6 total time: 8.96215
 opt: 0.064 reg: 0.004 solved: 6 total time: 9.03111
 opt: 0.217 reg: 0.004 solved: 6 total time: 9.25309
 opt: 0.205 reg: 0.003 solved: 6 total time: 9.46232
 opt: 0.194 reg: 0.003 solved: 6 total time: 9.66064
 opt: 0.275 reg: 0.003 solved: 6 total time: 9.93941
 opt: 0.058 reg: 0.004 solved: 6 total time: 10.0029
 opt: 0.097 reg: 0.023 solved: 8 total time: 10.1246
 opt: 0.143 reg: 0.029 solved: 6 total time: 10.2983
 opt: 0.239 reg: 0.019 solved: 6 total time: 10.5571
 opt: 0.189 reg: 0.016 solved: 6 total time: 10.7623
 opt: 0.215 reg: 0.012 solved: 6 total time: 10.9902
 opt: 0.083 reg: 0.028 solved: 8 total time: 11.1024
 opt: 0.086 reg: 0.01 solved: 8 total time: 11.2004
 opt: 0.134 reg: 0.013 solved: 8 total time: 11.3485
 opt: 0.359 reg: 0.012 solved: 8 total time: 11.7206
 opt: 0.251 reg: 0.013 solved: 8 total time: 11.9853
 opt: 0.091 reg: 0.031 solved: 9 total time: 12.1087
 opt: 0.077 reg: 0.008 solved: 8 total time: 12.1952
 opt: 0.189 reg: 0.025 solved: 8 total time: 12.4097
 opt: 0.081 reg: 0.006 solved: 8 total time: 12.4978
 opt: 0.092 reg: 0.007 solved: 8 total time: 12.5987
 opt: 0.278 reg: 0.004 solved: 8 total time: 12.8819
 opt: 0.278 reg: 0.006 solved: 8 total time: 13.1672
 opt: 0.095 reg: 0.016 solved: 9 total time: 13.2798
 opt: 0.14 reg: 0.594 solved: 8 total time: 14.014
 opt: 0.123 reg: 0.01 solved: 12 total time: 14.1482
 opt: 0.323 reg: 0.021 solved: 8 total time: 14.4941
 opt: 0.089 reg: 0.028 solved: 8 total time: 14.6118
 opt: 0.103 reg: 0.012 solved: 8 total time: 14.7279
 opt: 0.293 reg: 0.011 solved: 8 total time: 15.0334
 opt: 0.264 reg: 0.014 solved: 8 total time: 15.3123
 opt: 0.084 reg: 0.037 solved: 10 total time: 15.4346
 opt: 0.13 reg: 0.014 solved: 8 total time: 15.5794
 opt: 0.27 reg: 0.017 solved: 8 total time: 15.868
 opt: 0.348 reg: 0.023 solved: 8 total time: 16.2401
 opt: 0.106 reg: 0.027 solved: 11 total time: 16.3747
 opt: 0.294 reg: 0.005 solved: 8 total time: 16.675
 opt: 0.328 reg: 0.006 solved: 8 total time: 17.0105
 opt: 0.118 reg: 0.012 solved: 8 total time: 17.1414
 opt: 0.29 reg: 0.024 solved: 8 total time: 17.4568
 opt: 0.242 reg: 0.028 solved: 8 total time: 17.7279
 opt: 0.211 reg: 0.046 solved: 8 total time: 17.9868
 opt: 0.125 reg: 0.014 solved: 8 total time: 18.1265
 opt: 0.327 reg: 0.012 solved: 8 total time: 18.4663
 opt: 0.108 reg: 0.014 solved: 8 total time: 18.5894
 opt: 0.094 reg: 0.026 solved: 8 total time: 18.7115
 opt: 0.231 reg: 0.037 solved: 8 total time: 18.9797
 opt: 0.105 reg: 0.038 solved: 8 total time: 19.124
 opt: 0.274 reg: 0.036 solved: 8 total time: 19.4347
 opt: 0.301 reg: 0.041 solved: 8 total time: 19.7778
 opt: 0.187 reg: 0.074 solved: 8 total time: 20.0402
 opt: 0.295 reg: 0.013 solved: 8 total time: 20.3487
 opt: 0.238 reg: 0.014 solved: 8 total time: 20.6018
 opt: 0.224 reg: 0.028 solved: 8 total time: 20.8552
 opt: 0.337 reg: 0.022 solved: 8 total time: 21.2149
 opt: 0.325 reg: 0.026 solved: 8 total time: 21.5667
 opt: 0.116 reg: 0.035 solved: 8 total time: 21.7195
 opt: 0.198 reg: 0.042 solved: 8 total time: 21.9604
 opt: 0.293 reg: 0.045 solved: 8 total time: 22.2992
 opt: 0.279 reg: 0.04 solved: 8 total time: 22.6197
 opt: 0.325 reg: 0.007 solved: 8 total time: 22.9522
 opt: 0.356 reg: 0.012 solved: 8 total time: 23.3218
 opt: 0.326 reg: 0.011 solved: 8 total time: 23.6601
 opt: 0.361 reg: 0.038 solved: 10 total time: 24.0605
 opt: 0.289 reg: 0.039 solved: 8 total time: 24.3898
 opt: 0.361 reg: 0.013 solved: 8 total time: 24.7647
 opt: 0.348 reg: 0.014 solved: 8 total time: 25.1272
 opt: 0.19 reg: 0.016 solved: 8 total time: 25.3343
 opt: 0.287 reg: 0.019 solved: 8 total time: 25.6419
 opt: 0.348 reg: 0.02 solved: 8 total time: 26.011
 opt: 0.235 reg: 0.023 solved: 8 total time: 26.2693
 opt: 0.306 reg: 0.03 solved: 8 total time: 26.6056
 opt: 0.264 reg: 0.048 solved: 8 total time: 26.9185
 opt: 0.362 reg: 0.024 solved: 8 total time: 27.3059
 opt: 0.354 reg: 0.02 solved: 8 total time: 27.6808
 opt: 0.192 reg: 0.501 solved: 10 total time: 28.3745
 opt: 0.293 reg: 0.01 solved: 10 total time: 28.6789
 opt: 0.197 reg: 0.017 solved: 10 total time: 28.8948
 opt: 0.108 reg: 0.026 solved: 10 total time: 29.0301
 opt: 0.302 reg: 0.046 solved: 8 total time: 29.3785
 opt: 0.367 reg: 0.021 solved: 8 total time: 29.768
 opt: 0.091 reg: 0.013 solved: 10 total time: 29.8737
 opt: 0.407 reg: 0.022 solved: 8 total time: 30.3026
 opt: 0.423 reg: 0.029 solved: 8 total time: 30.7564
 opt: 0.218 reg: 0.051 solved: 10 total time: 31.0276
 opt: 0.406 reg: 0.006 solved: 8 total time: 31.4403
 opt: 0.106 reg: 0.042 solved: 11 total time: 31.5901
 opt: 0.194 solved: 2147483647 total time: 31.7843
L = 4, leader states: 4.88281e+08, follower subproblems: 4.88281e+08, F:2147483647, total time: 31.8488
Search time: 29.707s
Total number of leader states: 7.05325e+09
Total number of follower subproblems: 4.61502e+09
Pareto-frontier size: 1
Pareto-frontier: (4,2147483647) 
	 fix ops costs: 4, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s44 blaststepdone
				 fix_switch t1 s30 blaststepdone
				 fix_switch t1 s24 blaststepdone
				 fix_switch t1 s2 blaststepdone
				 fix_switch t1 s16 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s54 blaststepdone
				 fix_switch t2 s52 blaststepdone
				 fix_switch t2 s40 blaststepdone
				 fix_switch t2 s38 blaststepdone
				 fix_switch t2 s26 blaststepdone
				 fix_switch t2 s12 blaststepdone
				 fix_switch t2 s10 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 160
Solved by optimal solver: 160
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 160
Solved follower subproblems: 160
Optimal solver time: 25.898s
Cost-bounded solver time: 0s
Follower search time: 25.898s
Total time: 31.8716s
Optimal engine:
Peak memory: 633528 KB
@@@T34275@@@
Done!
real 34.54
user 33.67
sys 0.64
