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/Sprint_2.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/Sprint_2.pddl
Parsing...
Parsing: [0.010s CPU, 0.011s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.060s CPU, 0.063s wall-clock]
1000 relevant atoms
1910 auxiliary atoms
2910 final queue length
3584 total queue pushes
Completing instantiation... [0.050s CPU, 0.047s wall-clock]
Instantiating: [0.150s CPU, 0.144s 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...
87 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.010s 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.004s wall-clock]
Translating task: [0.050s CPU, 0.050s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
2 operators removed
4 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.008s wall-clock]
Translator variables: 89
Translator derived variables: 0
Translator facts: 196
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 23
Translator operators: 638
Translator axioms: 0
Translator task size: 3686
Translator peak memory: 20180 KB
Writing output... [0.010s CPU, 0.009s wall-clock]
Done! [0.240s CPU, 0.235s 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.
89 variables of 89 necessary
0 of 3 mutex groups necessary.
638 of 638 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 196 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=7921, notReached=30153, spurious=342
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=36500, notReached=1574, spurious=342
6 operators are spurious because were not triggered
H^2 mutexes added fw: 1574, unreachable: 0
0 of 632 operators detected as spurious
Total mutex and disambiguation time: 0.039794 iterations: 2
787 of 787 mutex groups necessary.
632 of 638 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 632
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 89
787 of 787 mutex groups necessary.
632 of 632 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
89 variables of 89 of 89 necessary
The causal graph is not acyclic.
89 variables of 89 necessary
787 of 787 mutex groups necessary.
632 of 632 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 89
Preprocessor facts: 196
Preprocessor derived variables: 0
Preprocessor operators: 632
Preprocessor mutex groups: 787
Preprocessor task size: 5207
Writing output...
Preprocessor time: 0.0727007s
Preprocessor peak memory: 3772 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.000352509s]
Simplifying transitions... done!
done reading input! [t=0.0201948s]
building causal graph...done! [t=0.0209147s]
packing state variables...Variables: 89
Bytes per state: 12
done! [t=0.0209888s]
done initalizing global data [t=0.020994s]
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() = 64
leader_vars_follower_preconditioned.size() = 63
follower_operators.size() = 569
leader_operators.size() = 63
Initializing Symbolic Variables
Sym variable order: 1 10 56 20 26 44 6 32 70 50 38 16 13 34 22 52 77 8 46 40 28 58 21 51 39 45 7 33 57 27 74 15 2 14 48 30 36 54 4 63 42 18 24 53 35 47 29 3 17 23 59 41 12 43 55 31 19 5 49 37 66 25 11 9 83 82 65 69 61 76 79 72 86 87 85 75 68 0 73 64 84 88 62 80 81 78 71 60 67 
Num variables: 89 => 96
Initialize Symbolic Manager(192, 83333, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 107 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.01s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.823051
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.823081
 opt: 0 reg: 0 solved: 1 total time: 0.825851
 opt: 0.001 reg: 0 solved: 1 total time: 0.827267
 opt: 0.001 reg: 0 solved: 1 total time: 0.828419
 opt: 0.002 reg: 0 solved: 1 total time: 0.830834
 opt: 0.002 reg: 0 solved: 1 total time: 0.832972
 opt: 0.004 reg: 0 solved: 2 total time: 0.837118
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.837166
 opt: 0.002 reg: 0 solved: 1 total time: 0.842271
 opt: 0.005 reg: 0 solved: 2 total time: 0.84824
 opt: 0.006 reg: 0 solved: 4 total time: 0.855092
 opt: 0.005 reg: 0 solved: 3 total time: 0.861482
 opt: 0.01 reg: 0 solved: 4 total time: 0.87279
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.87287
 opt: 0.007 reg: 0 solved: 4 total time: 0.882923
 opt: 0.006 reg: 0 solved: 4 total time: 0.889813
 opt: 0.011 reg: 0 solved: 4 total time: 0.902426
 opt: 0.005 reg: 0.001 solved: 4 total time: 0.9094
 opt: 0.01 reg: 0.001 solved: 4 total time: 0.92208
 opt: 0.009 reg: 0.004 solved: 6 total time: 0.937075
 opt: 0.006 reg: 0.009 solved: 5 total time: 0.953433
 opt: 0.008 reg: 0.02 solved: 6 total time: 0.982418
 opt: 0.012 reg: 0.002 solved: 4 total time: 0.997552
 opt: 0.008 reg: 0.002 solved: 6 total time: 1.00878
 opt: 0.006 reg: 0.003 solved: 6 total time: 1.01879
 opt: 0.01 reg: 0.003 solved: 4 total time: 1.03309
 opt: 0.007 reg: 0.007 solved: 6 total time: 1.04886
 opt: 0.006 reg: 0.017 solved: 6 total time: 1.07298
 opt: 0.012 solved: 2147483647 total time: 1.0857
L = 3, leader states: 8192, follower subproblems: 8192, F:2147483647, total time: 1.09034
Search time: 0.271s
Total number of leader states: 56653
Total number of follower subproblems: 36139
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s4 blaststepdone
				 fix_switch t1 s15 blaststepdone
				 fix_switch t1 s11 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s21 blaststepdone
				 fix_switch t2 s10 blaststepdone
				 fix_switch t2 s0 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 27
Solved by optimal solver: 27
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 27
Solved follower subproblems: 27
Optimal solver time: 0.162s
Cost-bounded solver time: 0s
Follower search time: 0.162s
Total time: 1.09331s
Optimal engine:
Peak memory: 486388 KB
@@@T1555@@@
Done!
real 1.75
user 1.32
sys 0.31
