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/Garr201001_2.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/Garr201001_2.pddl
Parsing...
Parsing: [0.010s CPU, 0.011s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.090s CPU, 0.089s wall-clock]
1701 relevant atoms
3118 auxiliary atoms
4819 final queue length
6085 total queue pushes
Completing instantiation... [0.060s CPU, 0.069s wall-clock]
Instantiating: [0.180s CPU, 0.181s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.000s 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...
127 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.011s 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.007s wall-clock]
Translating task: [0.090s CPU, 0.089s 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.013s wall-clock]
Translator variables: 129
Translator derived variables: 0
Translator facts: 282
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 29
Translator operators: 1200
Translator axioms: 0
Translator task size: 6850
Translator peak memory: 22888 KB
Writing output... [0.020s CPU, 0.016s wall-clock]
Done! [0.320s CPU, 0.326s 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.
129 variables of 129 necessary
0 of 3 mutex groups necessary.
1200 of 1200 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 282 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=16641, notReached=62359, spurious=524
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=76222, notReached=2778, spurious=524
8 operators are spurious because were not triggered
H^2 mutexes added fw: 2778, unreachable: 0
0 of 1192 operators detected as spurious
Total mutex and disambiguation time: 0.097861 iterations: 2
1389 of 1389 mutex groups necessary.
1192 of 1200 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 1192
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 129
1389 of 1389 mutex groups necessary.
1192 of 1192 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
129 variables of 129 of 129 necessary
The causal graph is not acyclic.
129 variables of 129 necessary
1389 of 1389 mutex groups necessary.
1192 of 1192 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 129
Preprocessor facts: 282
Preprocessor derived variables: 0
Preprocessor operators: 1192
Preprocessor mutex groups: 1389
Preprocessor task size: 9557
Writing output...
Preprocessor time: 0.149583s
Preprocessor peak memory: 5252 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.000349869s]
Simplifying transitions... done!
done reading input! [t=0.0314416s]
building causal graph...done! [t=0.0324115s]
packing state variables...Variables: 129
Bytes per state: 20
done! [t=0.0325184s]
done initalizing global data [t=0.0325233s]
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() = 100
leader_vars_follower_preconditioned.size() = 99
follower_operators.size() = 1093
leader_operators.size() = 99
Initializing Symbolic Variables
Sym variable order: 1 17 16 82 50 74 34 42 8 58 90 109 26 66 13 20 18 21 53 61 77 37 3 69 45 85 29 93 62 86 96 70 78 4 38 22 46 54 30 65 73 89 41 106 7 33 81 57 25 49 2 19 52 92 44 60 115 10 28 76 36 68 84 72 64 80 88 40 6 48 102 32 24 56 83 51 35 75 112 9 59 43 67 91 27 12 14 15 23 79 87 31 55 5 99 63 71 47 39 11 126 122 100 117 105 108 95 111 110 121 119 98 124 127 0 114 113 118 101 128 120 104 107 97 125 94 123 116 103 
Num variables: 129 => 138
Initialize Symbolic Manager(276, 57971, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 80 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.024s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.957102
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.957129
 opt: 0.001 reg: 0 solved: 1 total time: 0.961419
 opt: 0.001 reg: 0 solved: 1 total time: 0.962547
 opt: 0.002 reg: 0 solved: 1 total time: 0.964892
 opt: 0.001 reg: 0 solved: 1 total time: 0.966871
 opt: 0.002 reg: 0 solved: 1 total time: 0.969393
 opt: 0.002 reg: 0 solved: 1 total time: 0.971834
 opt: 0.001 reg: 0 solved: 1 total time: 0.973751
 opt: 0.001 reg: 0 solved: 1 total time: 0.975828
 opt: 0.005 reg: 0 solved: 3 total time: 0.981588
L = 1, leader states: 512, follower subproblems: 512, F:100000, total time: 0.981649
 opt: 0.008 reg: 0 solved: 4 total time: 0.994032
 opt: 0.007 reg: 0 solved: 4 total time: 1.00252
 opt: 0.006 reg: 0 solved: 3 total time: 1.00922
 opt: 0.005 reg: 0 solved: 4 total time: 1.01571
 opt: 0.007 reg: 0.001 solved: 4 total time: 1.02462
 opt: 0.015 reg: 0.001 solved: 4 total time: 1.04171
 opt: 0.018 reg: 0.001 solved: 4 total time: 1.0613
 opt: 0.022 reg: 0 solved: 4 total time: 1.08485
 opt: 0.013 reg: 0 solved: 3 total time: 1.09933
L = 2, leader states: 13122, follower subproblems: 13122, F:100000, total time: 1.0994
 opt: 0.009 reg: 0 solved: 4 total time: 1.11435
 opt: 0.006 reg: 0.001 solved: 3 total time: 1.12217
 opt: 0.019 reg: 0.003 solved: 4 total time: 1.14508
 opt: 0.008 reg: 0.003 solved: 4 total time: 1.15722
 opt: 0.007 reg: 0.004 solved: 4 total time: 1.1691
 opt: 0.016 reg: 0.004 solved: 4 total time: 1.18971
 opt: 0.014 reg: 0.003 solved: 3 total time: 1.20766
 opt: 0.021 reg: 0.002 solved: 4 total time: 1.23168
 opt: 0.016 reg: 0.003 solved: 4 total time: 1.25207
 opt: 0.023 reg: 0.002 solved: 4 total time: 1.27841
 opt: 0.018 reg: 0.002 solved: 4 total time: 1.29941
 opt: 0.01 reg: 0.007 solved: 5 total time: 1.31802
 opt: 0.011 reg: 0.015 solved: 5 total time: 1.3451
 opt: 0.015 reg: 0.005 solved: 6 total time: 1.36665
 opt: 0.017 reg: 0.01 solved: 6 total time: 1.39453
 opt: 0.013 reg: 0.003 solved: 6 total time: 1.41168
 opt: 0.02 reg: 0.006 solved: 4 total time: 1.43853
 opt: 0.016 reg: 0.012 solved: 6 total time: 1.46748
 opt: 0.01 reg: 0.017 solved: 5 total time: 1.49573
 opt: 0.013 reg: 0.021 solved: 6 total time: 1.53126
 opt: 0.014 reg: 0.023 solved: 6 total time: 1.569
 opt: 0.014 reg: 0.004 solved: 6 total time: 1.58759
 opt: 0.016 reg: 0.006 solved: 6 total time: 1.60988
 opt: 0.014 reg: 0.006 solved: 6 total time: 1.63161
 opt: 0.035 reg: 0.004 solved: 6 total time: 1.67123
 opt: 0.014 reg: 0.008 solved: 6 total time: 1.6938
 opt: 0.017 solved: 2147483647 total time: 1.71189
L = 3, leader states: 131072, follower subproblems: 131072, F:2147483647, total time: 1.7228
Search time: 0.773s
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_switch t0 s8 blaststepdone
				 fix_switch t0 s57 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s88 blaststepdone
				 fix_switch t1 s61 blaststepdone
				 fix_switch t1 s39 blaststepdone
				 fix_switch t1 s12 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s97 blaststepdone
				 fix_switch t2 s48 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 46
Solved by optimal solver: 46
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 46
Solved follower subproblems: 46
Optimal solver time: 0.524s
Cost-bounded solver time: 0s
Follower search time: 0.524s
Total time: 1.72801s
Optimal engine:
Peak memory: 448364 KB
@@@T2345@@@
Done!
real 2.61
user 2.10
sys 0.31
