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/Cesnet200511_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/Cesnet200511_4.pddl
Parsing...
Parsing: [0.020s CPU, 0.030s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.090s CPU, 0.093s wall-clock]
1688 relevant atoms
3099 auxiliary atoms
4787 final queue length
6037 total queue pushes
Completing instantiation... [0.080s CPU, 0.072s wall-clock]
Instantiating: [0.190s CPU, 0.188s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s 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...
125 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.010s CPU, 0.007s wall-clock]
Translating task: [0.100s CPU, 0.094s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
1 operators removed
4 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.014s wall-clock]
Translator variables: 127
Translator derived variables: 0
Translator facts: 278
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 29
Translator operators: 1189
Translator axioms: 0
Translator task size: 6773
Translator peak memory: 22632 KB
Writing output... [0.020s CPU, 0.016s wall-clock]
Done! [0.350s CPU, 0.359s 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.
127 variables of 127 necessary
0 of 3 mutex groups necessary.
1189 of 1189 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 278 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=16129, notReached=60635, spurious=520
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=73714, notReached=3050, spurious=520
7 operators are spurious because were not triggered
H^2 mutexes added fw: 3050, unreachable: 0
0 of 1182 operators detected as spurious
Total mutex and disambiguation time: 0.101015 iterations: 2
1525 of 1525 mutex groups necessary.
1182 of 1189 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 1182
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 127
1525 of 1525 mutex groups necessary.
1182 of 1182 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
127 variables of 127 of 127 necessary
The causal graph is not acyclic.
127 variables of 127 necessary
1525 of 1525 mutex groups necessary.
1182 of 1182 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 127
Preprocessor facts: 278
Preprocessor derived variables: 0
Preprocessor operators: 1182
Preprocessor mutex groups: 1525
Preprocessor task size: 9759
Writing output...
Preprocessor time: 0.155655s
Preprocessor peak memory: 5248 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.000290581s]
Simplifying transitions... done!
done reading input! [t=0.0309327s]
building causal graph...done! [t=0.032033s]
packing state variables...Variables: 127
Bytes per state: 20
done! [t=0.0321354s]
done initalizing global data [t=0.0321398s]
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() = 100
leader_vars_follower_preconditioned.size() = 99
follower_operators.size() = 1083
leader_operators.size() = 99
Initializing Symbolic Variables
Sym variable order: 1 12 20 66 26 90 74 58 8 34 108 42 82 50 15 64 40 32 24 88 6 102 72 56 80 48 89 57 73 41 25 7 65 33 81 105 49 16 17 59 27 83 35 67 9 91 75 111 51 43 2 78 86 22 96 46 4 70 54 38 30 62 47 31 71 55 99 5 23 87 39 63 79 19 77 93 53 29 85 3 21 69 45 37 61 13 11 14 84 92 36 28 60 10 68 44 76 52 114 18 120 118 119 124 121 110 116 113 101 125 107 117 122 95 98 123 104 0 115 112 109 126 100 94 106 97 103 
Num variables: 127 => 136
Initialize Symbolic Manager(272, 58823, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 204 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.027s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.985299
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.985331
 opt: 0.001 reg: 0 solved: 1 total time: 0.990035
 opt: 0.001 reg: 0 solved: 1 total time: 0.991142
 opt: 0.002 reg: 0 solved: 1 total time: 0.994137
 opt: 0.002 reg: 0 solved: 1 total time: 0.996423
 opt: 0.002 reg: 0 solved: 1 total time: 0.999453
 opt: 0.002 reg: 0 solved: 1 total time: 1.00192
 opt: 0.002 reg: 0 solved: 1 total time: 1.00443
 opt: 0.002 reg: 0 solved: 1 total time: 1.00718
 opt: 0.004 reg: 0 solved: 2 total time: 1.01136
L = 1, leader states: 512, follower subproblems: 512, F:100000, total time: 1.01142
 opt: 0.009 reg: 0 solved: 3 total time: 1.026
 opt: 0.008 reg: 0 solved: 5 total time: 1.03463
 opt: 0.017 reg: 0 solved: 3 total time: 1.05246
 opt: 0.007 reg: 0 solved: 2 total time: 1.06041
 opt: 0.008 reg: 0.001 solved: 7 total time: 1.07062
 opt: 0.005 solved: 2147483647 total time: 1.07604
L = 2, leader states: 13122, follower subproblems: 13122, F:2147483647, total time: 1.0808
Search time: 0.102s
Total number of leader states: 210242
Total number of follower subproblems: 137889
Pareto-frontier size: 1
Pareto-frontier: (2,2147483647) 
	 fix ops costs: 2, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s78 blaststepdone
				 fix_switch t0 s6 blaststepdone
				 fix_switch t0 s54 blaststepdone
				 fix_switch t0 s30 blaststepdone
				 fix_switch t0 s174 blaststepdone
				 fix_switch t0 s150 blaststepdone
				 fix_switch t0 s126 blaststepdone
				 fix_switch t0 s102 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_last-step t1 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 16
Solved by optimal solver: 16
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 16
Solved follower subproblems: 16
Optimal solver time: 0.073s
Cost-bounded solver time: 0s
Follower search time: 0.073s
Total time: 1.08646s
Optimal engine:
Peak memory: 428708 KB
@@@T1749@@@
Done!
real 1.97
user 1.51
sys 0.29
