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_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/Sprint_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.010s CPU, 0.012s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.030s CPU, 0.037s wall-clock]
606 relevant atoms
1173 auxiliary atoms
1779 final queue length
2148 total queue pushes
Completing instantiation... [0.020s CPU, 0.020s wall-clock]
Instantiating: [0.070s CPU, 0.080s 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...
55 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.027s 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.004s wall-clock]
Translator variables: 57
Translator derived variables: 0
Translator facts: 128
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 19
Translator operators: 352
Translator axioms: 0
Translator task size: 2054
Translator peak memory: 18584 KB
Writing output... [0.010s CPU, 0.005s wall-clock]
Done! [0.130s CPU, 0.138s 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.
57 variables of 57 necessary
0 of 3 mutex groups necessary.
352 of 352 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 128 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=3249, notReached=12909, spurious=226
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=15398, notReached=760, spurious=226
2 operators are spurious because were not triggered
H^2 mutexes added fw: 760, unreachable: 0
0 of 350 operators detected as spurious
Total mutex and disambiguation time: 0.01463 iterations: 2
380 of 380 mutex groups necessary.
350 of 352 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: 57
380 of 380 mutex groups necessary.
350 of 350 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
57 variables of 57 of 57 necessary
The causal graph is not acyclic.
57 variables of 57 necessary
380 of 380 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: 57
Preprocessor facts: 128
Preprocessor derived variables: 0
Preprocessor operators: 350
Preprocessor mutex groups: 380
Preprocessor task size: 2785
Writing output...
Preprocessor time: 0.0297537s
Preprocessor peak memory: 3048 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.000324688s]
Simplifying transitions... done!
done reading input! [t=0.0122907s]
building causal graph...done! [t=0.0127027s]
packing state variables...Variables: 57
Bytes per state: 8
done! [t=0.0127593s]
done initalizing global data [t=0.0127635s]
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 47 37 6 29 17 33 26 38 18 14 3 22 30 34 11 2 28 16 20 5 36 44 24 32 23 31 35 19 4 15 41 27 8 9 10 7 51 43 46 50 52 49 40 55 0 53 39 56 45 42 54 48 
Num variables: 57 => 63
Initialize Symbolic Manager(126, 126984, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 29 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.537191
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.537211
 opt: 0 reg: 0 solved: 1 total time: 0.53835
 opt: 0 reg: 0 solved: 1 total time: 0.53915
 opt: 0 reg: 0 solved: 1 total time: 0.540165
 opt: 0 reg: 0 solved: 1 total time: 0.541075
 opt: 0.001 reg: 0 solved: 2 total time: 0.542954
L = 1, leader states: 32, follower subproblems: 32, F:100000, total time: 0.543002
 opt: 0.002 reg: 0 solved: 2 total time: 0.54607
 opt: 0.002 reg: 0 solved: 2 total time: 0.548738
L = 2, leader states: 162, follower subproblems: 162, F:100000, total time: 0.548781
 opt: 0.004 reg: 0 solved: 4 total time: 0.554245
 opt: 0.002 reg: 0 solved: 2 total time: 0.557127
 opt: 0.003 reg: 0 solved: 4 total time: 0.561136
 opt: 0.003 reg: 0.001 solved: 4 total time: 0.565517
 opt: 0.005 reg: 0.001 solved: 4 total time: 0.572714
 opt: 0.003 solved: 2147483647 total time: 0.576462
L = 3, leader states: 512, follower subproblems: 512, F:2147483647, total time: 0.57869
Search time: 0.043s
Total number of leader states: 2581
Total number of follower subproblems: 1603
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s4 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s8 blaststepdone
				 fix_switch t1 s1 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s7 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 14
Solved by optimal solver: 14
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 14
Solved follower subproblems: 14
Optimal solver time: 0.025s
Cost-bounded solver time: 0s
Follower search time: 0.025s
Total time: 0.57999s
Optimal engine:
Peak memory: 407920 KB
@@@T892@@@
Done!
real 1.09
user 0.71
sys 0.25
