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/Esnet_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/Esnet_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.076s 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.011s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.020s CPU, 0.024s wall-clock]
409 relevant atoms
797 auxiliary atoms
1206 final queue length
1425 total queue pushes
Completing instantiation... [0.010s CPU, 0.013s wall-clock]
Instantiating: [0.050s CPU, 0.057s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.006s 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...
39 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s 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.001s wall-clock]
Translating task: [0.020s CPU, 0.016s 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.003s wall-clock]
Translator variables: 41
Translator derived variables: 0
Translator facts: 93
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 16
Translator operators: 213
Translator axioms: 0
Translator task size: 1255
Translator peak memory: 17900 KB
Writing output... [0.000s CPU, 0.003s wall-clock]
Done! [0.090s CPU, 0.166s 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.
41 variables of 41 necessary
0 of 3 mutex groups necessary.
213 of 213 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 93 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=1681, notReached=6808, spurious=160
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=7997, notReached=492, spurious=160
3 operators are spurious because were not triggered
H^2 mutexes added fw: 492, unreachable: 0
0 of 210 operators detected as spurious
Total mutex and disambiguation time: 0.006763 iterations: 2
246 of 246 mutex groups necessary.
210 of 213 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 210
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 41
246 of 246 mutex groups necessary.
210 of 210 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
41 variables of 41 of 41 necessary
The causal graph is not acyclic.
41 variables of 41 necessary
246 of 246 mutex groups necessary.
210 of 210 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 41
Preprocessor facts: 93
Preprocessor derived variables: 0
Preprocessor operators: 210
Preprocessor mutex groups: 246
Preprocessor task size: 1715
Writing output...
Preprocessor time: 0.0160616s
Preprocessor peak memory: 2640 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.000365596s]
Simplifying transitions... done!
done reading input! [t=0.00861201s]
building causal graph...done! [t=0.0088359s]
packing state variables...Variables: 41
Bytes per state: 8
done! [t=0.00885984s]
done initalizing global data [t=0.00886527s]
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() = 29
leader_vars_follower_preconditioned.size() = 28
follower_operators.size() = 181
leader_operators.size() = 29
Initializing Symbolic Variables
Sym variable order: 1 14 26 23 5 17 20 33 18 12 27 3 21 15 24 2 9 30 16 25 4 22 13 19 8 11 10 6 7 31 34 40 28 0 32 38 39 35 29 37 36 
Num variables: 41 => 46
Initialize Symbolic Manager(92, 173913, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 39 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.001s
Starting Stackelberg bounded search...
 opt: 0 reg: 0 solved: 1 total time: 0.496265
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.496291
 opt: 0 reg: 0 solved: 1 total time: 0.497013
 opt: 0 reg: 0 solved: 1 total time: 0.497352
 opt: 0.001 reg: 0 solved: 2 total time: 0.498498
 opt: 0 reg: 0 solved: 1 total time: 0.499026
L = 1, leader states: 16, follower subproblems: 16, F:100000, total time: 0.499065
 opt: 0.001 reg: 0 solved: 2 total time: 0.50083
 opt: 0.001 reg: 0 solved: 2 total time: 0.502197
L = 2, leader states: 54, follower subproblems: 54, F:100000, total time: 0.502257
 opt: 0.001 reg: 0 solved: 2 total time: 0.504052
 opt: 0.001 reg: 0 solved: 3 total time: 0.505847
 opt: 0.001 reg: 0 solved: 4 total time: 0.508132
 opt: 0.001 reg: 0 solved: 3 total time: 0.51087
 opt: 0 solved: 2147483647 total time: 0.511733
L = 3, leader states: 128, follower subproblems: 128, F:2147483647, total time: 0.512409
Search time: 0.017s
Total number of leader states: 573
Total number of follower subproblems: 349
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 s62 blaststepdone
				 fix_switch t1 s6 blaststepdone
				 fix_switch t1 s52 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 12
Solved by optimal solver: 12
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 12
Solved follower subproblems: 12
Optimal solver time: 0.007s
Cost-bounded solver time: 0s
Follower search time: 0.007s
Total time: 0.513279s
Optimal engine:
Peak memory: 466304 KB
@@@T846@@@
Done!
real 1.10
user 0.55
sys 0.30
