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/Arpanet19728_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/Arpanet19728_2.pddl
Parsing...
Parsing: [0.020s CPU, 0.144s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.010s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.070s CPU, 0.065s wall-clock]
1160 relevant atoms
2192 auxiliary atoms
3352 final queue length
4159 total queue pushes
Completing instantiation... [0.050s CPU, 0.048s wall-clock]
Instantiating: [0.140s CPU, 0.135s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.000s CPU, 0.007s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
96 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.010s CPU, 0.011s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.005s wall-clock]
Translating task: [0.060s CPU, 0.062s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.009s wall-clock]
Translator variables: 98
Translator derived variables: 0
Translator facts: 216
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 25
Translator operators: 771
Translator axioms: 0
Translator task size: 4433
Translator peak memory: 20688 KB
Writing output... [0.010s CPU, 0.011s wall-clock]
Done! [0.250s CPU, 0.376s 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.
98 variables of 98 necessary
0 of 3 mutex groups necessary.
771 of 771 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 216 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=9604, notReached=36658, spurious=394
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=44394, notReached=1868, spurious=394
7 operators are spurious because were not triggered
H^2 mutexes added fw: 1868, unreachable: 0
0 of 764 operators detected as spurious
Total mutex and disambiguation time: 0.050729 iterations: 2
934 of 934 mutex groups necessary.
764 of 771 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 764
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 98
934 of 934 mutex groups necessary.
764 of 764 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
98 variables of 98 of 98 necessary
The causal graph is not acyclic.
98 variables of 98 necessary
934 of 934 mutex groups necessary.
764 of 764 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 98
Preprocessor facts: 216
Preprocessor derived variables: 0
Preprocessor operators: 764
Preprocessor mutex groups: 934
Preprocessor task size: 6240
Writing output...
Preprocessor time: 0.0877084s
Preprocessor peak memory: 4076 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.000253006s]
Simplifying transitions... done!
done reading input! [t=0.0211992s]
building causal graph...done! [t=0.0220218s]
packing state variables...Variables: 98
Bytes per state: 16
done! [t=0.0221062s]
done initalizing global data [t=0.0221124s]
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() = 71
leader_vars_follower_preconditioned.size() = 70
follower_operators.size() = 693
leader_operators.size() = 71
Initializing Symbolic Variables
Sym variable order: 1 14 9 11 15 43 31 19 49 61 4 55 37 70 25 28 40 82 58 52 7 64 46 22 34 17 35 29 23 53 86 8 41 65 47 59 2 20 50 74 32 5 26 44 38 62 56 36 42 24 30 60 3 66 48 54 18 16 10 13 39 33 45 63 6 78 57 51 21 27 12 94 80 88 85 72 73 90 95 93 96 81 76 68 77 0 92 69 97 89 84 91 87 79 83 75 71 67 
Num variables: 98 => 106
Initialize Symbolic Manager(212, 75471, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 89 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.015s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.922676
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.922703
 opt: 0 reg: 0 solved: 1 total time: 0.925709
 opt: 0.001 reg: 0 solved: 1 total time: 0.927145
 opt: 0.001 reg: 0 solved: 1 total time: 0.928384
 opt: 0.002 reg: 0 solved: 1 total time: 0.930723
 opt: 0.001 reg: 0 solved: 1 total time: 0.932696
 opt: 0.004 reg: 0 solved: 2 total time: 0.937441
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.937485
 opt: 0.006 reg: 0 solved: 2 total time: 0.947116
 opt: 0.005 reg: 0 solved: 2 total time: 0.953079
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.95314
 opt: 0.003 reg: 0 solved: 1 total time: 0.959076
 opt: 0.006 reg: 0 solved: 2 total time: 0.96568
 opt: 0.009 reg: 0 solved: 4 total time: 0.976094
 opt: 0.008 reg: 0 solved: 3 total time: 0.985332
 opt: 0.011 reg: 0.001 solved: 4 total time: 0.997702
 opt: 0.007 reg: 0.001 solved: 3 total time: 1.00699
 opt: 0.01 reg: 0.002 solved: 4 total time: 1.02089
 opt: 0.017 reg: 0.002 solved: 4 total time: 1.04144
L = 3, leader states: 8192, follower subproblems: 8192, F:100000, total time: 1.04158
 opt: 0.01 reg: 0.003 solved: 3 total time: 1.05823
 opt: 0.011 reg: 0.006 solved: 4 total time: 1.07673
 opt: 0.012 reg: 0.006 solved: 4 total time: 1.09562
 opt: 0.014 reg: 0.008 solved: 4 total time: 1.11862
 opt: 0.013 reg: 0.007 solved: 4 total time: 1.13974
 opt: 0.016 reg: 0.006 solved: 4 total time: 1.16266
 opt: 0.01 reg: 0.007 solved: 4 total time: 1.18067
 opt: 0.018 reg: 0.007 solved: 4 total time: 1.20682
 opt: 0.009 reg: 0.006 solved: 4 total time: 1.22221
 opt: 0.013 reg: 0.006 solved: 4 total time: 1.24241
 opt: 0.01 reg: 0.014 solved: 4 total time: 1.26768
 opt: 0.006 reg: 0.009 solved: 2 total time: 1.28406
 opt: 0.015 reg: 0.015 solved: 4 total time: 1.31507
 opt: 0.019 reg: 0.009 solved: 4 total time: 1.3435
 opt: 0.012 reg: 0.016 solved: 5 total time: 1.37191
 opt: 0.012 reg: 0.014 solved: 5 total time: 1.39989
 opt: 0.011 reg: 0.005 solved: 4 total time: 1.41689
 opt: 0.02 reg: 0.013 solved: 5 total time: 1.45036
 opt: 0.014 reg: 0.019 solved: 6 total time: 1.48397
 opt: 0.031 reg: 0.02 solved: 4 total time: 1.53577
 opt: 0.028 reg: 0.017 solved: 5 total time: 1.58176
 opt: 0.012 reg: 0.012 solved: 5 total time: 1.60706
 opt: 0.012 reg: 0.012 solved: 5 total time: 1.63214
 opt: 0.013 reg: 0.003 solved: 6 total time: 1.65008
 opt: 0.015 reg: 0.005 solved: 5 total time: 1.67124
 opt: 0.022 reg: 0.008 solved: 5 total time: 1.70216
 opt: 0.02 reg: 0.017 solved: 5 total time: 1.74022
 opt: 0.024 reg: 0.031 solved: 6 total time: 1.79652
 opt: 0.019 reg: 0.021 solved: 5 total time: 1.83767
 opt: 0.022 reg: 0.009 solved: 5 total time: 1.87063
 opt: 0.012 reg: 0.016 solved: 6 total time: 1.90018
 opt: 0.024 reg: 0.003 solved: 6 total time: 1.92841
 opt: 0.021 reg: 0.002 solved: 6 total time: 1.95297
 opt: 0.017 reg: 0.002 solved: 6 total time: 1.97271
 opt: 0.018 reg: 0.002 solved: 6 total time: 1.99337
 opt: 0.159 reg: 0.01 solved: 5 total time: 2.16302
 opt: 0.026 reg: 0.01 solved: 6 total time: 2.20039
 opt: 0.024 reg: 0.005 solved: 6 total time: 2.23088
 opt: 0.027 reg: 0.016 solved: 5 total time: 2.27529
 opt: 0.016 reg: 0.018 solved: 6 total time: 2.30978
 opt: 0.025 reg: 0.01 solved: 6 total time: 2.3461
 opt: 0.023 reg: 0.014 solved: 6 total time: 2.38387
 opt: 0.016 reg: 0.01 solved: 6 total time: 2.41117
 opt: 0.022 reg: 0.01 solved: 6 total time: 2.4442
 opt: 0.023 reg: 0.008 solved: 6 total time: 2.47631
 opt: 0.023 reg: 0.008 solved: 6 total time: 2.50906
 opt: 0.107 reg: 0.016 solved: 6 total time: 2.63285
 opt: 0.071 reg: 0.01 solved: 6 total time: 2.71504
L = 4, leader states: 31250, follower subproblems: 31250, F:100000, total time: 2.71542
 opt: 0.05 reg: 0.035 solved: 4 total time: 2.82618
 opt: 0.026 reg: 0.021 solved: 4 total time: 2.87463
 opt: 0.014 reg: 0.004 solved: 2 total time: 2.89462
 opt: 0.025 reg: 0.011 solved: 4 total time: 2.93069
 opt: 0.024 reg: 0.01 solved: 4 total time: 2.96501
 opt: 0.016 reg: 0.014 solved: 6 total time: 2.99595
 opt: 0.026 reg: 0.009 solved: 4 total time: 3.03174
 opt: 0.014 reg: 0.012 solved: 4 total time: 3.05872
 opt: 0.017 reg: 0.023 solved: 5 total time: 3.09931
 opt: 0.023 reg: 0.002 solved: 4 total time: 3.12559
 opt: 0.019 reg: 0.003 solved: 4 total time: 3.14866
 opt: 0.019 reg: 0.003 solved: 4 total time: 3.17191
 opt: 0.027 reg: 0.011 solved: 7 total time: 3.21107
 opt: 0.016 reg: 0.027 solved: 5 total time: 3.25528
 opt: 0.013 reg: 0.005 solved: 3 total time: 3.27491
 opt: 0.02 reg: 0.012 solved: 5 total time: 3.3082
 opt: 0.025 reg: 0.009 solved: 6 total time: 3.34324
 opt: 0.019 reg: 0.011 solved: 4 total time: 3.37414
 opt: 0.014 reg: 0.027 solved: 6 total time: 3.4169
 opt: 0.016 reg: 0.003 solved: 4 total time: 3.43653
 opt: 0.014 reg: 0.002 solved: 4 total time: 3.45343
 opt: 0.014 reg: 0.012 solved: 6 total time: 3.48127
 opt: 0.016 reg: 0.008 solved: 4 total time: 3.5062
 opt: 0.014 reg: 0.025 solved: 5 total time: 3.54703
 opt: 0.025 reg: 0.011 solved: 6 total time: 3.58427
 opt: 0.019 reg: 0.008 solved: 5 total time: 3.61251
 opt: 0.023 reg: 0.002 solved: 6 total time: 3.63818
 opt: 0.014 reg: 0.005 solved: 6 total time: 3.65859
 opt: 0.013 reg: 0.012 solved: 5 total time: 3.68483
 opt: 0.02 reg: 0.013 solved: 6 total time: 3.71893
 opt: 0.022 reg: 0.021 solved: 5 total time: 3.76337
 opt: 0.027 reg: 0.016 solved: 6 total time: 3.80781
 opt: 0.021 reg: 0.003 solved: 6 total time: 3.83247
 opt: 0.018 reg: 0.002 solved: 6 total time: 3.85343
 opt: 0.019 reg: 0.003 solved: 7 total time: 3.87659
 opt: 0.012 reg: 0.003 solved: 5 total time: 3.89222
 opt: 0.024 reg: 0.008 solved: 6 total time: 3.92514
 opt: 0.023 reg: 0.017 solved: 5 total time: 3.96642
 opt: 0.025 reg: 0.029 solved: 7 total time: 4.02139
 opt: 0.012 reg: 0.017 solved: 6 total time: 4.0516
 opt: 0.013 reg: 0.004 solved: 5 total time: 4.07021
 opt: 0.018 reg: 0.007 solved: 6 total time: 4.09622
 opt: 0.014 reg: 0.008 solved: 7 total time: 4.11901
 opt: 0.018 reg: 0.012 solved: 4 total time: 4.15075
 opt: 0.022 reg: 0.032 solved: 6 total time: 4.205
 opt: 0.021 reg: 0.024 solved: 5 total time: 4.25112
 opt: 0.02 reg: 0.008 solved: 5 total time: 4.28044
 opt: 0.02 reg: 0.007 solved: 6 total time: 4.30918
 opt: 0.017 reg: 0.012 solved: 6 total time: 4.33878
 opt: 0.022 reg: 0.008 solved: 6 total time: 4.37052
 opt: 0.021 reg: 0.016 solved: 6 total time: 4.40826
 opt: 0.013 reg: 0.018 solved: 5 total time: 4.44101
 opt: 0.013 reg: 0.037 solved: 6 total time: 4.49266
 opt: 0.021 reg: 0.021 solved: 5 total time: 4.53495
 opt: 0.025 reg: 0.009 solved: 6 total time: 4.57024
 opt: 0.027 reg: 0.006 solved: 6 total time: 4.60417
 opt: 0.024 reg: 0.006 solved: 6 total time: 4.63486
 opt: 0.024 reg: 0.008 solved: 6 total time: 4.66814
 opt: 0.029 reg: 0.009 solved: 7 total time: 4.70691
 opt: 0.025 reg: 0.01 solved: 5 total time: 4.74304
 opt: 0.013 reg: 0.014 solved: 5 total time: 4.77134
 opt: 0.022 reg: 0.021 solved: 5 total time: 4.81533
 opt: 0.021 reg: 0.008 solved: 4 total time: 4.84535
 opt: 0.022 reg: 0.013 solved: 6 total time: 4.8807
 opt: 0.02 reg: 0.011 solved: 5 total time: 4.91284
 opt: 0.021 reg: 0.022 solved: 6 total time: 4.95706
 opt: 0.014 solved: 2147483647 total time: 4.97209
L = 5, leader states: 93312, follower subproblems: 93312, F:2147483647, total time: 4.98255
Search time: 4.074s
Total number of leader states: 487287
Total number of follower subproblems: 302468
Pareto-frontier size: 1
Pareto-frontier: (5,2147483647) 
	 fix ops costs: 5, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s42 blaststepdone
				 fix_switch t1 s23 blaststepdone
				 fix_switch t1 s16 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s49 blaststepdone
				 fix_switch t2 s13 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s39 blaststepdone
				 fix_next-step t3 t4 blaststepdone
				 fix_last-step t4 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 132
Solved by optimal solver: 132
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 132
Solved follower subproblems: 132
Optimal solver time: 2.547s
Cost-bounded solver time: 0s
Follower search time: 2.547s
Total time: 4.99192s
Optimal engine:
Peak memory: 579940 KB
@@@T5636@@@
Done!
real 6.15
user 4.68
sys 0.91
