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/Quest_3.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/Quest_3.pddl
Parsing...
Parsing: [0.010s CPU, 0.022s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.110s CPU, 0.104s wall-clock]
1924 relevant atoms
3477 auxiliary atoms
5401 final queue length
6860 total queue pushes
Completing instantiation... [0.080s CPU, 0.085s wall-clock]
Instantiating: [0.220s CPU, 0.213s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.008s 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...
134 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.010s CPU, 0.001s wall-clock]
Computing fact groups: [0.020s CPU, 0.012s 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.010s CPU, 0.009s wall-clock]
Translating task: [0.110s CPU, 0.114s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.016s wall-clock]
Translator variables: 136
Translator derived variables: 0
Translator facts: 298
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 31
Translator operators: 1393
Translator axioms: 0
Translator task size: 7910
Translator peak memory: 23788 KB
Writing output... [0.020s CPU, 0.019s wall-clock]
Done! [0.400s CPU, 0.402s 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.
136 variables of 136 necessary
0 of 3 mutex groups necessary.
1393 of 1393 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 298 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=18496, notReached=69728, spurious=580
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=84632, notReached=3592, spurious=580
8 operators are spurious because were not triggered
H^2 mutexes added fw: 3592, unreachable: 0
0 of 1385 operators detected as spurious
Total mutex and disambiguation time: 0.133213 iterations: 2
1796 of 1796 mutex groups necessary.
1385 of 1393 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 1385
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 136
1796 of 1796 mutex groups necessary.
1385 of 1385 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
136 variables of 136 of 136 necessary
The causal graph is not acyclic.
136 variables of 136 necessary
1796 of 1796 mutex groups necessary.
1385 of 1385 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 136
Preprocessor facts: 298
Preprocessor derived variables: 0
Preprocessor operators: 1385
Preprocessor mutex groups: 1796
Preprocessor task size: 11430
Writing output...
Preprocessor time: 0.199765s
Preprocessor peak memory: 5868 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.000335213s]
Simplifying transitions... done!
done reading input! [t=0.0386418s]
building causal graph...done! [t=0.0398697s]
packing state variables...Variables: 136
Bytes per state: 20
done! [t=0.0399812s]
done initalizing global data [t=0.039986s]
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() = 109
leader_vars_follower_preconditioned.size() = 108
follower_operators.size() = 1276
leader_operators.size() = 109
Initializing Symbolic Variables
Sym variable order: 1 15 20 12 51 27 59 35 117 8 99 91 83 43 75 67 74 26 98 90 66 7 34 58 42 114 50 82 84 76 92 28 120 36 9 68 44 60 52 100 14 16 17 86 22 70 78 30 3 38 62 102 54 94 46 2 57 33 65 81 41 97 6 25 73 111 89 49 87 95 79 47 71 55 4 39 105 23 63 31 69 123 61 29 77 45 10 101 93 37 53 85 11 96 40 88 48 24 56 5 64 32 80 72 108 18 21 19 13 127 129 126 128 132 125 119 104 122 134 113 130 131 116 107 133 110 0 109 118 106 135 103 121 115 112 124 
Num variables: 136 => 145
Initialize Symbolic Manager(290, 55172, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 204 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.032s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 1.02025
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 1.02028
 opt: 0.001 reg: 0 solved: 1 total time: 1.02528
 opt: 0 reg: 0 solved: 1 total time: 1.02625
 opt: 0.002 reg: 0 solved: 1 total time: 1.02919
 opt: 0.002 reg: 0 solved: 1 total time: 1.03139
 opt: 0.003 reg: 0 solved: 1 total time: 1.03486
 opt: 0.002 reg: 0 solved: 1 total time: 1.03773
 opt: 0.002 reg: 0 solved: 1 total time: 1.03997
 opt: 0.002 reg: 0 solved: 1 total time: 1.04249
 opt: 0.003 reg: 0 solved: 2 total time: 1.04653
L = 1, leader states: 512, follower subproblems: 512, F:100000, total time: 1.04659
 opt: 0.008 reg: 0 solved: 2 total time: 1.05991
 opt: 0.009 reg: 0 solved: 2 total time: 1.06948
L = 2, leader states: 13122, follower subproblems: 13122, F:100000, total time: 1.06954
 opt: 0.012 reg: 0 solved: 3 total time: 1.08788
 opt: 0.013 reg: 0 solved: 3 total time: 1.10145
 opt: 0.011 reg: 0 solved: 4 total time: 1.11368
 opt: 0.022 reg: 0 solved: 3 total time: 1.13668
 opt: 0.008 reg: 0 solved: 2 total time: 1.14596
 opt: 0.014 reg: 0.001 solved: 4 total time: 1.16122
 opt: 0.01 reg: 0.002 solved: 5 total time: 1.17443
 opt: 0.011 reg: 0.004 solved: 6 total time: 1.18981
 opt: 0.018 reg: 0.004 solved: 5 total time: 1.21244
 opt: 0.015 reg: 0.005 solved: 6 total time: 1.23347
 opt: 0.008 reg: 0.01 solved: 7 total time: 1.25221
 opt: 0.009 reg: 0.015 solved: 8 total time: 1.2777
 opt: 0.033 reg: 0.015 solved: 7 total time: 1.32643
 opt: 0.005 solved: 2147483647 total time: 1.33209
L = 3, leader states: 131072, follower subproblems: 131072, F:2147483647, total time: 1.33972
Search time: 0.327s
Total number of leader states: 1.31658e+06
Total number of follower subproblems: 853603
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 s8 blaststepdone
				 fix_switch t1 s68 blaststepdone
				 fix_switch t1 s62 blaststepdone
				 fix_switch t1 s50 blaststepdone
				 fix_switch t1 s44 blaststepdone
				 fix_switch t1 s32 blaststepdone
				 fix_switch t1 s26 blaststepdone
				 fix_switch t1 s14 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 26
Solved by optimal solver: 26
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 26
Solved follower subproblems: 26
Optimal solver time: 0.224s
Cost-bounded solver time: 0s
Follower search time: 0.224s
Total time: 1.34548s
Optimal engine:
Peak memory: 448856 KB
@@@T2100@@@
Done!
real 2.26
user 1.84
sys 0.32
