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/Marwan_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/Marwan_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.010s 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.000s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.020s CPU, 0.022s wall-clock]
351 relevant atoms
688 auxiliary atoms
1039 final queue length
1215 total queue pushes
Completing instantiation... [0.010s CPU, 0.011s wall-clock]
Instantiating: [0.060s CPU, 0.053s 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...
37 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.000s 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.020s CPU, 0.014s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.003s wall-clock]
Translator variables: 39
Translator derived variables: 0
Translator facts: 87
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 14
Translator operators: 170
Translator axioms: 0
Translator task size: 1020
Translator peak memory: 17516 KB
Writing output... [0.000s CPU, 0.003s wall-clock]
Done! [0.090s CPU, 0.093s 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.
39 variables of 39 necessary
0 of 3 mutex groups necessary.
170 of 170 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 87 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=1521, notReached=5914, spurious=134
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=7059, notReached=376, spurious=134
3 operators are spurious because were not triggered
H^2 mutexes added fw: 376, unreachable: 0
0 of 167 operators detected as spurious
Total mutex and disambiguation time: 0.00461 iterations: 2
188 of 188 mutex groups necessary.
167 of 170 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 167
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 39
188 of 188 mutex groups necessary.
167 of 167 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
39 variables of 39 of 39 necessary
The causal graph is not acyclic.
39 variables of 39 necessary
188 of 188 mutex groups necessary.
167 of 167 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 39
Preprocessor facts: 87
Preprocessor derived variables: 0
Preprocessor operators: 167
Preprocessor mutex groups: 188
Preprocessor task size: 1366
Writing output...
Preprocessor time: 0.0135202s
Preprocessor peak memory: 2628 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.000360023s]
Simplifying transitions... done!
done reading input! [t=0.00727883s]
building causal graph...done! [t=0.00759229s]
packing state variables...Variables: 39
Bytes per state: 8
done! [t=0.00761208s]
done initalizing global data [t=0.00761899s]
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() = 143
leader_operators.size() = 24
Initializing Symbolic Variables
Sym variable order: 1 27 12 18 4 21 15 13 19 5 31 16 22 2 10 14 17 3 11 20 23 6 9 7 8 33 29 34 36 26 37 32 0 38 25 35 30 28 24 
Num variables: 39 => 44
Initialize Symbolic Manager(88, 181818, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 36 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.500198
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.500221
 opt: 0 reg: 0 solved: 1 total time: 0.501101
 opt: 0 reg: 0 solved: 1 total time: 0.501648
 opt: 0.001 reg: 0 solved: 2 total time: 0.503601
L = 1, leader states: 16, follower subproblems: 16, F:100000, total time: 0.503632
 opt: 0.002 reg: 0 solved: 3 total time: 0.507043
 opt: 0 reg: 0 solved: 1 total time: 0.507975
 opt: 0.002 reg: 0 solved: 3 total time: 0.510614
 opt: 0.001 reg: 0 solved: 2 total time: 0.512653
L = 2, leader states: 54, follower subproblems: 54, F:100000, total time: 0.512694
 opt: 0.002 reg: 0 solved: 3 total time: 0.51631
 opt: 0.002 reg: 0 solved: 3 total time: 0.519374
 opt: 0.001 reg: 0 solved: 3 total time: 0.521741
 opt: 0.002 reg: 0.001 solved: 4 total time: 0.525347
 opt: 0.002 reg: 0.002 solved: 4 total time: 0.53008
 opt: 0.003 reg: 0.002 solved: 4 total time: 0.536169
L = 3, leader states: 128, follower subproblems: 128, F:100000, total time: 0.536223
 opt: 0.002 reg: 0.001 solved: 3 total time: 0.541194
 opt: 0.003 reg: 0.001 solved: 3 total time: 0.545921
 opt: 0.003 reg: 0.004 solved: 4 total time: 0.55393
 opt: 0.002 reg: 0.008 solved: 3 total time: 0.564557
 opt: 0.003 reg: 0.01 solved: 4 total time: 0.579074
 opt: 0.003 reg: 0.003 solved: 3 total time: 0.585923
 opt: 0.002 reg: 0.003 solved: 3 total time: 0.592232
 opt: 0.001 reg: 0.005 solved: 4 total time: 0.599501
 opt: 0.003 reg: 0.007 solved: 4 total time: 0.610437
 opt: 0.002 solved: 2147483647 total time: 0.612804
L = 4, leader states: 250, follower subproblems: 250, F:2147483647, total time: 0.614175
Search time: 0.115s
Total number of leader states: 880
Total number of follower subproblems: 656
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 s4 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s7 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s2 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 24
Solved by optimal solver: 24
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 24
Solved follower subproblems: 24
Optimal solver time: 0.042s
Cost-bounded solver time: 0s
Follower search time: 0.042s
Total time: 0.615105s
Optimal engine:
Peak memory: 460152 KB
@@@T876@@@
Done!
real 1.12
user 0.62
sys 0.32
