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/Cernet_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/Cernet_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.014s 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.012s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.040s CPU, 0.037s wall-clock]
609 relevant atoms
1181 auxiliary atoms
1790 final queue length
2159 total queue pushes
Completing instantiation... [0.020s CPU, 0.022s wall-clock]
Instantiating: [0.080s CPU, 0.081s 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.010s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
56 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.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.028s 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.005s wall-clock]
Translator variables: 58
Translator derived variables: 0
Translator facts: 130
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 19
Translator operators: 354
Translator axioms: 0
Translator task size: 2065
Translator peak memory: 18584 KB
Writing output... [0.010s CPU, 0.005s wall-clock]
Done! [0.140s CPU, 0.145s 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.
58 variables of 58 necessary
0 of 3 mutex groups necessary.
354 of 354 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 130 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=3364, notReached=13308, spurious=228
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=15830, notReached=842, spurious=228
4 operators are spurious because were not triggered
H^2 mutexes added fw: 842, unreachable: 0
0 of 350 operators detected as spurious
Total mutex and disambiguation time: 0.014127 iterations: 2
421 of 421 mutex groups necessary.
350 of 354 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 350
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 58
421 of 421 mutex groups necessary.
350 of 350 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
58 variables of 58 of 58 necessary
The causal graph is not acyclic.
58 variables of 58 necessary
421 of 421 mutex groups necessary.
350 of 350 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 58
Preprocessor facts: 130
Preprocessor derived variables: 0
Preprocessor operators: 350
Preprocessor mutex groups: 421
Preprocessor task size: 2868
Writing output...
Preprocessor time: 0.0311362s
Preprocessor peak memory: 3052 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.000329196s]
Simplifying transitions... done!
done reading input! [t=0.0129392s]
building causal graph...done! [t=0.0134186s]
packing state variables...Variables: 58
Bytes per state: 8
done! [t=0.0134736s]
done initalizing global data [t=0.013478s]
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() = 309
leader_operators.size() = 41
Initializing Symbolic Variables
Sym variable order: 1 12 13 21 25 49 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 55 50 47 43 54 44 56 51 53 0 48 57 40 52 42 39 46 
Num variables: 58 => 64
Initialize Symbolic Manager(128, 125000, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 53 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.561545
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.561566
 opt: 0 reg: 0 solved: 1 total time: 0.562643
 opt: 0 reg: 0 solved: 1 total time: 0.563528
 opt: 0.001 reg: 0 solved: 1 total time: 0.564681
 opt: 0 reg: 0 solved: 1 total time: 0.56559
 opt: 0.002 reg: 0 solved: 2 total time: 0.567682
L = 1, leader states: 32, follower subproblems: 32, F:100000, total time: 0.567727
 opt: 0.002 reg: 0 solved: 2 total time: 0.57154
 opt: 0.005 reg: 0 solved: 4 total time: 0.57712
 opt: 0.003 reg: 0 solved: 4 total time: 0.580873
 opt: 0.002 reg: 0 solved: 3 total time: 0.584144
 opt: 0.006 reg: 0 solved: 4 total time: 0.590673
L = 2, leader states: 162, follower subproblems: 162, F:100000, total time: 0.590723
 opt: 0.003 reg: 0.001 solved: 4 total time: 0.596637
 opt: 0.004 reg: 0.001 solved: 4 total time: 0.602671
 opt: 0.004 reg: 0.001 solved: 4 total time: 0.609015
 opt: 0.004 reg: 0 solved: 4 total time: 0.613864
 opt: 0.003 reg: 0.001 solved: 4 total time: 0.619484
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.627758
 opt: 0.003 reg: 0.005 solved: 4 total time: 0.637051
 opt: 0.004 reg: 0.009 solved: 4 total time: 0.651597
 opt: 0.005 reg: 0.01 solved: 4 total time: 0.667664
 opt: 0.003 reg: 0.011 solved: 4 total time: 0.683174
 opt: 0.005 reg: 0.013 solved: 4 total time: 0.702009
 opt: 0.006 reg: 0.006 solved: 4 total time: 0.715647
 opt: 0.003 reg: 0.015 solved: 4 total time: 0.735021
 opt: 0.002 reg: 0.018 solved: 4 total time: 0.756722
L = 3, leader states: 512, follower subproblems: 512, F:100000, total time: 0.756809
 opt: 0.003 reg: 0.009 solved: 4 total time: 0.771638
 opt: 0.003 reg: 0.015 solved: 4 total time: 0.790526
 opt: 0.006 reg: 0.003 solved: 4 total time: 0.80084
 opt: 0.004 reg: 0.006 solved: 4 total time: 0.81212
 opt: 0.004 reg: 0.002 solved: 4 total time: 0.819825
 opt: 0.006 reg: 0.002 solved: 4 total time: 0.828733
 opt: 0.004 reg: 0.001 solved: 4 total time: 0.834666
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.843538
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.851815
 opt: 0.004 reg: 0.002 solved: 4 total time: 0.857966
 opt: 0.004 reg: 0.001 solved: 4 total time: 0.864632
 opt: 0.002 reg: 0.003 solved: 4 total time: 0.87072
 opt: 0.003 reg: 0.003 solved: 4 total time: 0.878176
 opt: 0.004 reg: 0.003 solved: 4 total time: 0.885627
 opt: 0.004 reg: 0.002 solved: 4 total time: 0.892796
 opt: 0.006 reg: 0.005 solved: 4 total time: 0.904733
 opt: 0.003 reg: 0.004 solved: 4 total time: 0.912943
 opt: 0.004 reg: 0.002 solved: 4 total time: 0.919989
 opt: 0.004 reg: 0.007 solved: 4 total time: 0.931917
 opt: 0.003 reg: 0.009 solved: 4 total time: 0.945392
 opt: 0.004 reg: 0.008 solved: 4 total time: 0.959132
 opt: 0.005 reg: 0.009 solved: 4 total time: 0.974041
 opt: 0.005 reg: 0.01 solved: 4 total time: 0.990562
 opt: 0.004 solved: 2147483647 total time: 0.994892
L = 4, leader states: 1250, follower subproblems: 1250, F:2147483647, total time: 0.997664
Search time: 0.438s
Total number of leader states: 5844
Total number of follower subproblems: 3570
Pareto-frontier size: 1
Pareto-frontier: (4,2147483647) 
	 fix ops costs: 4, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s37 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s29 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s28 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s21 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 49
Solved by optimal solver: 49
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 49
Solved follower subproblems: 49
Optimal solver time: 0.174s
Cost-bounded solver time: 0s
Follower search time: 0.174s
Total time: 0.999198s
Optimal engine:
Peak memory: 419620 KB
@@@T1324@@@
Done!
real 1.56
user 1.11
sys 0.28
