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/Canerie_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/Canerie_2.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.010s CPU, 0.012s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.070s CPU, 0.071s wall-clock]
1141 relevant atoms
2141 auxiliary atoms
3282 final queue length
4077 total queue pushes
Completing instantiation... [0.050s CPU, 0.050s wall-clock]
Instantiating: [0.140s CPU, 0.144s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.008s 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...
90 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.011s 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.010s CPU, 0.005s wall-clock]
Translating task: [0.070s CPU, 0.066s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.010s wall-clock]
Translator variables: 92
Translator derived variables: 0
Translator facts: 204
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 25
Translator operators: 759
Translator axioms: 0
Translator task size: 4348
Translator peak memory: 20692 KB
Writing output... [0.010s CPU, 0.011s wall-clock]
Done! [0.250s CPU, 0.256s 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.
92 variables of 92 necessary
0 of 3 mutex groups necessary.
759 of 759 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 204 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=8464, notReached=32770, spurious=382
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=39270, notReached=1964, spurious=382
6 operators are spurious because were not triggered
H^2 mutexes added fw: 1964, unreachable: 0
0 of 753 operators detected as spurious
Total mutex and disambiguation time: 0.055497 iterations: 2
982 of 982 mutex groups necessary.
753 of 759 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 753
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 92
982 of 982 mutex groups necessary.
753 of 753 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
92 variables of 92 of 92 necessary
The causal graph is not acyclic.
92 variables of 92 necessary
982 of 982 mutex groups necessary.
753 of 753 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 92
Preprocessor facts: 204
Preprocessor derived variables: 0
Preprocessor operators: 753
Preprocessor mutex groups: 982
Preprocessor task size: 6256
Writing output...
Preprocessor time: 0.0911089s
Preprocessor peak memory: 4048 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.00028261s]
Simplifying transitions... done!
done reading input! [t=0.0213156s]
building causal graph...done! [t=0.0220341s]
packing state variables...Variables: 92
Bytes per state: 16
done! [t=0.0221039s]
done initalizing global data [t=0.0221085s]
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() = 71
leader_vars_follower_preconditioned.size() = 70
follower_operators.size() = 682
leader_operators.size() = 71
Initializing Symbolic Variables
Sym variable order: 1 11 16 15 25 61 43 49 55 4 19 31 69 37 50 56 38 44 62 5 32 20 26 72 29 23 41 35 8 59 81 65 53 47 14 2 57 63 45 33 6 75 51 27 39 21 30 24 36 54 60 3 48 18 66 42 64 58 78 52 46 7 22 40 34 28 17 10 12 9 13 84 86 85 88 83 77 71 90 68 87 74 89 80 0 67 79 91 73 70 82 76 
Num variables: 92 => 100
Initialize Symbolic Manager(200, 80000, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 139 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.014s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.848766
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.848812
 opt: 0 reg: 0 solved: 1 total time: 0.851747
 opt: 0.001 reg: 0 solved: 1 total time: 0.85284
 opt: 0 reg: 0 solved: 1 total time: 0.853834
 opt: 0.002 reg: 0 solved: 1 total time: 0.85608
 opt: 0.001 reg: 0 solved: 1 total time: 0.858092
 opt: 0.003 reg: 0 solved: 2 total time: 0.861558
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.861607
 opt: 0.005 reg: 0 solved: 2 total time: 0.869554
 opt: 0.005 reg: 0 solved: 2 total time: 0.875535
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.875578
 opt: 0.003 reg: 0 solved: 1 total time: 0.881328
 opt: 0.007 reg: 0 solved: 3 total time: 0.888974
 opt: 0.005 reg: 0 solved: 4 total time: 0.895298
 opt: 0.006 reg: 0 solved: 6 total time: 0.902639
 opt: 0.011 reg: 0 solved: 3 total time: 0.914855
 opt: 0.005 reg: 0.001 solved: 5 total time: 0.922073
 opt: 0.005 reg: 0.001 solved: 2 total time: 0.929394
 opt: 0.007 reg: 0.003 solved: 4 total time: 0.940704
 opt: 0.012 reg: 0.002 solved: 4 total time: 0.955945
 opt: 0.005 reg: 0.009 solved: 7 total time: 0.971284
 opt: 0.011 reg: 0.01 solved: 5 total time: 0.99331
 opt: 0.017 reg: 0.011 solved: 7 total time: 1.02254
 opt: 0.014 reg: 0.009 solved: 7 total time: 1.04666
 opt: 0.013 reg: 0.007 solved: 5 total time: 1.06765
 opt: 0.003 solved: 2147483647 total time: 1.07163
L = 3, leader states: 8192, follower subproblems: 8192, F:2147483647, total time: 1.0772
Search time: 0.233s
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 s7 blaststepdone
				 fix_switch t1 s61 blaststepdone
				 fix_switch t1 s39 blaststepdone
				 fix_switch t1 s29 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s35 blaststepdone
				 fix_switch t2 s3 blaststepdone
				 fix_last-step t2 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.142s
Cost-bounded solver time: 0s
Follower search time: 0.142s
Total time: 1.08046s
Optimal engine:
Peak memory: 492664 KB
@@@T1582@@@
Done!
real 1.82
user 1.30
sys 0.36
