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/HiberniaGlobal_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/HiberniaGlobal_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.011s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.014s wall-clock]
Preparing model... [0.000s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.050s CPU, 0.050s wall-clock]
844 relevant atoms
1611 auxiliary atoms
2455 final queue length
3008 total queue pushes
Completing instantiation... [0.030s CPU, 0.032s wall-clock]
Instantiating: [0.110s CPU, 0.108s 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...
71 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.003s wall-clock]
Translating task: [0.040s CPU, 0.044s 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.007s wall-clock]
Translator variables: 73
Translator derived variables: 0
Translator facts: 163
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 22
Translator operators: 529
Translator axioms: 0
Translator task size: 3050
Translator peak memory: 19604 KB
Writing output... [0.010s CPU, 0.008s wall-clock]
Done! [0.190s CPU, 0.191s 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.
73 variables of 73 necessary
0 of 3 mutex groups necessary.
529 of 529 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 163 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=5329, notReached=20942, spurious=298
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=24977, notReached=1294, spurious=298
5 operators are spurious because were not triggered
H^2 mutexes added fw: 1294, unreachable: 0
0 of 524 operators detected as spurious
Total mutex and disambiguation time: 0.027023 iterations: 2
647 of 647 mutex groups necessary.
524 of 529 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 524
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 73
647 of 647 mutex groups necessary.
524 of 524 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
73 variables of 73 of 73 necessary
The causal graph is not acyclic.
73 variables of 73 necessary
647 of 647 mutex groups necessary.
524 of 524 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 73
Preprocessor facts: 163
Preprocessor derived variables: 0
Preprocessor operators: 524
Preprocessor mutex groups: 647
Preprocessor task size: 4296
Writing output...
Preprocessor time: 0.052836s
Preprocessor peak memory: 3532 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.000350017s]
Simplifying transitions... done!
done reading input! [t=0.0174185s]
building causal graph...done! [t=0.0179781s]
packing state variables...Variables: 73
Bytes per state: 12
done! [t=0.0180436s]
done initalizing global data [t=0.0180478s]
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() = 55
leader_vars_follower_preconditioned.size() = 54
follower_operators.size() = 469
leader_operators.size() = 55
Initializing Symbolic Variables
Sym variable order: 1 51 31 21 46 3 16 26 41 36 9 29 39 19 49 6 34 60 24 44 57 28 33 23 5 38 43 48 2 18 11 50 25 45 40 7 35 63 20 30 22 32 17 37 4 54 47 42 27 8 15 12 13 10 14 69 70 66 65 62 56 71 67 53 68 59 0 64 52 72 58 55 61 
Num variables: 73 => 80
Initialize Symbolic Manager(160, 100000, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 90 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.007s
Starting Stackelberg bounded search...
 opt: 0 reg: 0 solved: 1 total time: 0.726637
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.726667
 opt: 0 reg: 0 solved: 1 total time: 0.728509
 opt: 0.001 reg: 0 solved: 1 total time: 0.729774
 opt: 0 reg: 0 solved: 1 total time: 0.730594
 opt: 0.001 reg: 0 solved: 1 total time: 0.73165
 opt: 0.001 reg: 0 solved: 1 total time: 0.733073
 opt: 0.002 reg: 0 solved: 2 total time: 0.735466
L = 1, leader states: 64, follower subproblems: 64, F:100000, total time: 0.735509
 opt: 0.004 reg: 0 solved: 2 total time: 0.741959
 opt: 0.003 reg: 0 solved: 2 total time: 0.745514
L = 2, leader states: 486, follower subproblems: 486, F:100000, total time: 0.745577
 opt: 0.003 reg: 0 solved: 2 total time: 0.751093
 opt: 0.003 reg: 0 solved: 3 total time: 0.754927
 opt: 0.005 reg: 0 solved: 3 total time: 0.761
 opt: 0.004 reg: 0 solved: 4 total time: 0.765881
 opt: 0.003 reg: 0.001 solved: 4 total time: 0.770902
 opt: 0.005 reg: 0.003 solved: 6 total time: 0.779791
 opt: 0.003 reg: 0.006 solved: 5 total time: 0.790786
 opt: 0.004 reg: 0.01 solved: 5 total time: 0.805343
 opt: 0.002 solved: 2147483647 total time: 0.8081
L = 3, leader states: 2048, follower subproblems: 2048, F:2147483647, total time: 0.81062
Search time: 0.087s
Total number of leader states: 11973
Total number of follower subproblems: 7549
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 s38 blaststepdone
				 fix_switch t1 s25 blaststepdone
				 fix_switch t1 s21 blaststepdone
				 fix_switch t1 s16 blaststepdone
				 fix_switch t1 s13 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 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.044s
Cost-bounded solver time: 0s
Follower search time: 0.044s
Total time: 0.813061s
Optimal engine:
Peak memory: 446280 KB
@@@T1208@@@
Done!
real 1.44
user 0.98
sys 0.31
