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/Digex_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/Digex_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.008s wall-clock]
Generated 173 rules.
Computing model... [0.040s CPU, 0.039s wall-clock]
611 relevant atoms
1189 auxiliary atoms
1800 final queue length
2169 total queue pushes
Completing instantiation... [0.020s CPU, 0.023s wall-clock]
Instantiating: [0.080s CPU, 0.085s 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...
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.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.031s 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.005s 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: 355
Translator axioms: 0
Translator task size: 2072
Translator peak memory: 18572 KB
Writing output... [0.000s CPU, 0.005s wall-clock]
Done! [0.140s CPU, 0.147s 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.
355 of 355 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=16378, notReached=816, spurious=230
5 operators are spurious because were not triggered
H^2 mutexes added fw: 816, unreachable: 0
0 of 350 operators detected as spurious
Total mutex and disambiguation time: 0.016748 iterations: 2
408 of 408 mutex groups necessary.
350 of 355 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
408 of 408 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
408 of 408 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: 408
Preprocessor task size: 2843
Writing output...
Preprocessor time: 0.0337716s
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.000261093s]
Simplifying transitions... done!
done reading input! [t=0.0117951s]
building causal graph...done! [t=0.0123267s]
packing state variables...Variables: 59
Bytes per state: 12
done! [t=0.0123946s]
done initalizing global data [t=0.0123999s]
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 45 24 32 23 31 35 19 4 15 41 27 8 9 10 7 53 56 40 51 43 48 57 54 47 44 0 55 52 58 42 46 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: 46 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.591267
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.591292
 opt: 0 reg: 0 solved: 1 total time: 0.592592
 opt: 0 reg: 0 solved: 1 total time: 0.593457
 opt: 0.001 reg: 0 solved: 1 total time: 0.594529
 opt: 0 reg: 0 solved: 1 total time: 0.595441
 opt: 0.002 reg: 0 solved: 2 total time: 0.597574
L = 1, leader states: 32, follower subproblems: 32, F:100000, total time: 0.597619
 opt: 0.003 reg: 0 solved: 2 total time: 0.601882
 opt: 0.003 reg: 0 solved: 2 total time: 0.605111
L = 2, leader states: 162, follower subproblems: 162, F:100000, total time: 0.605156
 opt: 0.004 reg: 0 solved: 4 total time: 0.611258
 opt: 0.003 reg: 0 solved: 3 total time: 0.614851
 opt: 0.003 reg: 0.001 solved: 3 total time: 0.61898
 opt: 0.002 reg: 0 solved: 2 total time: 0.622784
 opt: 0.005 reg: 0.001 solved: 4 total time: 0.629906
 opt: 0.003 reg: 0.001 solved: 4 total time: 0.635035
 opt: 0.006 reg: 0 solved: 4 total time: 0.641993
 opt: 0.003 reg: 0 solved: 4 total time: 0.646221
L = 3, leader states: 512, follower subproblems: 512, F:100000, total time: 0.646277
 opt: 0.002 reg: 0.001 solved: 2 total time: 0.651606
 opt: 0.004 reg: 0.002 solved: 3 total time: 0.658672
 opt: 0.004 reg: 0.009 solved: 5 total time: 0.672572
 opt: 0.005 reg: 0.014 solved: 4 total time: 0.69271
 opt: 0.004 reg: 0.01 solved: 4 total time: 0.707933
 opt: 0.004 reg: 0.013 solved: 4 total time: 0.725538
 opt: 0.005 reg: 0.011 solved: 4 total time: 0.743265
 opt: 0.003 reg: 0.011 solved: 4 total time: 0.758519
 opt: 0.006 reg: 0.012 solved: 4 total time: 0.77709
 opt: 0.003 reg: 0.008 solved: 4 total time: 0.78952
 opt: 0.003 reg: 0.019 solved: 4 total time: 0.813197
 opt: 0.005 reg: 0.005 solved: 4 total time: 0.824577
 opt: 0.004 reg: 0.008 solved: 5 total time: 0.837559
 opt: 0.003 solved: 2147483647 total time: 0.840832
L = 4, leader states: 1250, follower subproblems: 1250, F:2147483647, total time: 0.842742
Search time: 0.254s
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 s29 blaststepdone
				 fix_switch t1 s19 blaststepdone
				 fix_switch t1 s17 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s13 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 30
Solved by optimal solver: 30
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 30
Solved follower subproblems: 30
Optimal solver time: 0.093s
Cost-bounded solver time: 0s
Follower search time: 0.093s
Total time: 0.844445s
Optimal engine:
Peak memory: 417976 KB
@@@T1169@@@
Done!
real 1.50
user 0.99
sys 0.25
