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/Missouri_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/Missouri_1.pddl
Parsing...
Parsing: [0.020s CPU, 0.018s 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.011s 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
1187 auxiliary atoms
1796 final queue length
2164 total queue pushes
Completing instantiation... [0.020s CPU, 0.021s wall-clock]
Instantiating: [0.080s CPU, 0.079s 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...
57 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.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.002s wall-clock]
Translating task: [0.020s CPU, 0.027s 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.004s wall-clock]
Translator variables: 59
Translator derived variables: 0
Translator facts: 132
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 19
Translator operators: 354
Translator axioms: 0
Translator task size: 2066
Translator peak memory: 18572 KB
Writing output... [0.010s CPU, 0.005s wall-clock]
Done! [0.160s 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.
59 variables of 59 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 132 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=3481, notReached=13713, spurious=230
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=16352, notReached=842, spurious=230
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.013035 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: 59
421 of 421 mutex groups necessary.
350 of 350 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
59 variables of 59 of 59 necessary
The causal graph is not acyclic.
59 variables of 59 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: 59
Preprocessor facts: 132
Preprocessor derived variables: 0
Preprocessor operators: 350
Preprocessor mutex groups: 421
Preprocessor task size: 2869
Writing output...
Preprocessor time: 0.0298784s
Preprocessor peak memory: 3056 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.000335012s]
Simplifying transitions... done!
done reading input! [t=0.0119945s]
building causal graph...done! [t=0.0124084s]
packing state variables...Variables: 59
Bytes per state: 12
done! [t=0.0124646s]
done initalizing global data [t=0.0124691s]
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 46 24 32 23 31 35 19 4 15 42 27 8 9 10 7 53 54 48 45 41 51 57 56 52 44 0 55 40 58 47 43 39 50 
Num variables: 59 => 65
Initialize Symbolic Manager(130, 123076, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 51 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.530928
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.530948
 opt: 0 reg: 0 solved: 1 total time: 0.532028
 opt: 0 reg: 0 solved: 1 total time: 0.532856
 opt: 0 reg: 0 solved: 1 total time: 0.533826
 opt: 0 reg: 0 solved: 1 total time: 0.534757
 opt: 0.002 reg: 0 solved: 2 total time: 0.537016
L = 1, leader states: 32, follower subproblems: 32, F:100000, total time: 0.537046
 opt: 0.002 reg: 0 solved: 2 total time: 0.540428
 opt: 0.002 reg: 0 solved: 3 total time: 0.543568
 opt: 0.002 reg: 0 solved: 3 total time: 0.546736
 opt: 0.003 reg: 0 solved: 4 total time: 0.550859
L = 2, leader states: 162, follower subproblems: 162, F:100000, total time: 0.550898
 opt: 0.003 reg: 0 solved: 4 total time: 0.556205
 opt: 0.004 reg: 0 solved: 3 total time: 0.561454
 opt: 0.005 reg: 0 solved: 4 total time: 0.567645
 opt: 0.002 reg: 0.001 solved: 4 total time: 0.571768
 opt: 0.002 reg: 0.001 solved: 2 total time: 0.575774
 opt: 0.006 reg: 0.001 solved: 4 total time: 0.584532
 opt: 0.003 reg: 0.001 solved: 3 total time: 0.590452
L = 3, leader states: 512, follower subproblems: 512, F:100000, total time: 0.590501
 opt: 0.003 solved: 2147483647 total time: 0.595481
L = 4, leader states: 1250, follower subproblems: 1250, F:2147483647, total time: 0.598117
Search time: 0.069s
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_next-step t0 t1 blaststepdone
				 fix_switch t1 s65 blaststepdone
				 fix_switch t1 s2 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s58 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s41 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 18
Solved by optimal solver: 18
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 18
Solved follower subproblems: 18
Optimal solver time: 0.039s
Cost-bounded solver time: 0s
Follower search time: 0.039s
Total time: 0.599481s
Optimal engine:
Peak memory: 412904 KB
@@@T925@@@
Done!
real 1.12
user 0.73
sys 0.27
