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/Oteglobe_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/Oteglobe_1.pddl
Parsing...
Parsing: [0.000s CPU, 0.011s wall-clock]
Normalizing task... [0.010s 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.013s wall-clock]
Preparing model... [0.000s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.040s CPU, 0.039s wall-clock]
608 relevant atoms
1176 auxiliary atoms
1784 final queue length
2153 total queue pushes
Completing instantiation... [0.030s CPU, 0.023s wall-clock]
Instantiating: [0.080s CPU, 0.085s 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...
55 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.010s CPU, 0.001s wall-clock]
Computing fact groups: [0.010s CPU, 0.009s 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.002s wall-clock]
Translating task: [0.030s CPU, 0.030s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
2 operators removed
4 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.005s wall-clock]
Translator variables: 57
Translator derived variables: 0
Translator facts: 128
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 19
Translator operators: 351
Translator axioms: 0
Translator task size: 2047
Translator peak memory: 18584 KB
Writing output... [0.010s CPU, 0.005s wall-clock]
Done! [0.140s CPU, 0.149s 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.
57 variables of 57 necessary
0 of 3 mutex groups necessary.
351 of 351 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 128 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=3249, notReached=12909, spurious=226
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=15364, notReached=794, spurious=226
3 operators are spurious because were not triggered
H^2 mutexes added fw: 794, unreachable: 0
0 of 348 operators detected as spurious
Total mutex and disambiguation time: 0.014656 iterations: 2
397 of 397 mutex groups necessary.
348 of 351 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 348
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 57
397 of 397 mutex groups necessary.
348 of 348 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
57 variables of 57 of 57 necessary
The causal graph is not acyclic.
57 variables of 57 necessary
397 of 397 mutex groups necessary.
348 of 348 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 57
Preprocessor facts: 128
Preprocessor derived variables: 0
Preprocessor operators: 348
Preprocessor mutex groups: 397
Preprocessor task size: 2807
Writing output...
Preprocessor time: 0.0319154s
Preprocessor peak memory: 3048 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.000302022s]
Simplifying transitions... done!
done reading input! [t=0.0123249s]
building causal graph...done! [t=0.0127427s]
packing state variables...Variables: 57
Bytes per state: 8
done! [t=0.0127967s]
done initalizing global data [t=0.0128008s]
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() = 41
leader_vars_follower_preconditioned.size() = 40
follower_operators.size() = 307
leader_operators.size() = 41
Initializing Symbolic Variables
Sym variable order: 1 12 13 21 25 48 37 6 29 17 33 26 38 18 14 3 22 30 34 11 2 28 16 20 5 36 45 24 32 23 31 35 19 4 15 41 27 8 9 10 7 39 42 53 56 46 44 49 0 54 55 43 50 47 40 52 51 
Num variables: 57 => 63
Initialize Symbolic Manager(126, 126984, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 45 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.003s
Starting Stackelberg bounded search...
 opt: 0 reg: 0 solved: 1 total time: 0.571479
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.571504
 opt: 0 reg: 0 solved: 1 total time: 0.572766
 opt: 0 reg: 0 solved: 1 total time: 0.573633
 opt: 0 reg: 0 solved: 1 total time: 0.57456
 opt: 0 reg: 0 solved: 1 total time: 0.575462
 opt: 0.001 reg: 0 solved: 2 total time: 0.577358
L = 1, leader states: 32, follower subproblems: 32, F:100000, total time: 0.577402
 opt: 0.002 reg: 0 solved: 2 total time: 0.580591
 opt: 0.002 reg: 0 solved: 2 total time: 0.582834
L = 2, leader states: 162, follower subproblems: 162, F:100000, total time: 0.582878
 opt: 0.002 reg: 0 solved: 3 total time: 0.586758
 opt: 0.003 reg: 0 solved: 5 total time: 0.591252
 opt: 0.002 reg: 0 solved: 2 total time: 0.594144
 opt: 0.003 reg: 0.003 solved: 5 total time: 0.601122
 opt: 0.002 reg: 0.002 solved: 3 total time: 0.606594
 opt: 0.003 reg: 0.005 solved: 5 total time: 0.615395
 opt: 0.002 solved: 2147483647 total time: 0.618133
L = 3, leader states: 512, follower subproblems: 512, F:2147483647, total time: 0.62055
Search time: 0.051s
Total number of leader states: 2581
Total number of follower subproblems: 1603
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s15 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s77 blaststepdone
				 fix_switch t1 s28 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s17 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 15
Solved by optimal solver: 15
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 15
Solved follower subproblems: 15
Optimal solver time: 0.022s
Cost-bounded solver time: 0s
Follower search time: 0.022s
Total time: 0.622018s
Optimal engine:
Peak memory: 408204 KB
@@@T957@@@
Done!
real 1.11
user 0.77
sys 0.26
