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/Cesnet200706_1.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/Cesnet200706_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.009s 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.020s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.020s CPU, 0.021s wall-clock]
343 relevant atoms
669 auxiliary atoms
1012 final queue length
1182 total queue pushes
Completing instantiation... [0.010s CPU, 0.010s wall-clock]
Instantiating: [0.060s CPU, 0.052s 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...
35 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.010s CPU, 0.008s 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.001s wall-clock]
Translating task: [0.010s CPU, 0.012s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
1 operators removed
4 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.002s wall-clock]
Translator variables: 37
Translator derived variables: 0
Translator facts: 83
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 14
Translator operators: 164
Translator axioms: 0
Translator task size: 978
Translator peak memory: 17516 KB
Writing output... [0.010s CPU, 0.002s wall-clock]
Done! [0.100s CPU, 0.088s 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.
37 variables of 37 necessary
0 of 3 mutex groups necessary.
164 of 164 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 83 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=1369, notReached=5390, spurious=130
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=6341, notReached=418, spurious=130
2 operators are spurious because were not triggered
H^2 mutexes added fw: 418, unreachable: 0
0 of 162 operators detected as spurious
Total mutex and disambiguation time: 0.005916 iterations: 2
209 of 209 mutex groups necessary.
162 of 164 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 162
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 37
209 of 209 mutex groups necessary.
162 of 162 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
37 variables of 37 of 37 necessary
The causal graph is not acyclic.
37 variables of 37 necessary
209 of 209 mutex groups necessary.
162 of 162 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 37
Preprocessor facts: 83
Preprocessor derived variables: 0
Preprocessor operators: 162
Preprocessor mutex groups: 209
Preprocessor task size: 1372
Writing output...
Preprocessor time: 0.013611s
Preprocessor peak memory: 2624 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.000308821s]
Simplifying transitions... done!
done reading input! [t=0.00666207s]
building causal graph...done! [t=0.0069845s]
packing state variables...Variables: 37
Bytes per state: 8
done! [t=0.00700651s]
done initalizing global data [t=0.00701321s]
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() = 25
leader_vars_follower_preconditioned.size() = 24
follower_operators.size() = 138
leader_operators.size() = 24
Initializing Symbolic Variables
Sym variable order: 1 9 6 15 21 4 12 18 26 8 10 7 2 16 29 5 22 19 13 14 20 3 17 11 23 27 24 36 30 0 25 32 35 31 28 33 34 
Num variables: 37 => 42
Initialize Symbolic Manager(84, 190476, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 51 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.001s
Starting Stackelberg bounded search...
 opt: 0 reg: 0 solved: 1 total time: 0.45143
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.451456
 opt: 0 reg: 0 solved: 1 total time: 0.452246
 opt: 0 reg: 0 solved: 1 total time: 0.452657
 opt: 0.001 reg: 0 solved: 2 total time: 0.45387
 opt: 0 reg: 0 solved: 1 total time: 0.45436
L = 1, leader states: 16, follower subproblems: 16, F:100000, total time: 0.45439
 opt: 0 reg: 0 solved: 2 total time: 0.455911
 opt: 0.001 reg: 0 solved: 3 total time: 0.457508
 opt: 0.001 reg: 0 solved: 4 total time: 0.459327
 opt: 0 solved: 2147483647 total time: 0.460193
L = 2, leader states: 54, follower subproblems: 54, F:2147483647, total time: 0.460792
Search time: 0.01s
Total number of leader states: 262
Total number of follower subproblems: 163
Pareto-frontier size: 1
Pareto-frontier: (2,2147483647) 
	 fix ops costs: 2, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s7 blaststepdone
				 fix_switch t1 s40 blaststepdone
				 fix_switch t1 s39 blaststepdone
				 fix_last-step t1 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 9
Solved by optimal solver: 9
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 9
Solved follower subproblems: 9
Optimal solver time: 0.003s
Cost-bounded solver time: 0s
Follower search time: 0.003s
Total time: 0.461575s
Optimal engine:
Peak memory: 449396 KB
@@@T716@@@
Done!
real 0.94
user 0.51
sys 0.26
