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/Napnet_4.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/Napnet_4.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.010s CPU, 0.012s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.100s CPU, 0.104s wall-clock]
1688 relevant atoms
3099 auxiliary atoms
4787 final queue length
6037 total queue pushes
Completing instantiation... [0.090s CPU, 0.088s wall-clock]
Instantiating: [0.210s CPU, 0.218s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.020s CPU, 0.013s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
125 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.020s CPU, 0.020s 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.008s wall-clock]
Translating task: [0.100s CPU, 0.096s 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: 127
Translator derived variables: 0
Translator facts: 278
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 29
Translator operators: 1190
Translator axioms: 0
Translator task size: 6779
Translator peak memory: 22632 KB
Writing output... [0.010s CPU, 0.015s wall-clock]
Done! [0.370s CPU, 0.380s 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.
127 variables of 127 necessary
0 of 3 mutex groups necessary.
1190 of 1190 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 278 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=16129, notReached=60635, spurious=520
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=73426, notReached=3338, spurious=520
8 operators are spurious because were not triggered
H^2 mutexes added fw: 3338, unreachable: 0
0 of 1182 operators detected as spurious
Total mutex and disambiguation time: 0.110814 iterations: 2
1669 of 1669 mutex groups necessary.
1182 of 1190 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 1182
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 127
1669 of 1669 mutex groups necessary.
1182 of 1182 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
127 variables of 127 of 127 necessary
The causal graph is not acyclic.
127 variables of 127 necessary
1669 of 1669 mutex groups necessary.
1182 of 1182 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 127
Preprocessor facts: 278
Preprocessor derived variables: 0
Preprocessor operators: 1182
Preprocessor mutex groups: 1669
Preprocessor task size: 10047
Writing output...
Preprocessor time: 0.163628s
Preprocessor peak memory: 5484 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.000344178s]
Simplifying transitions... done!
done reading input! [t=0.0328315s]
building causal graph...done! [t=0.0336391s]
packing state variables...Variables: 127
Bytes per state: 20
done! [t=0.0337086s]
done initalizing global data [t=0.0337119s]
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() = 1083
leader_operators.size() = 99
Initializing Symbolic Variables
Sym variable order: 1 63 39 87 79 71 5 55 47 31 23 99 83 111 91 67 43 9 27 75 35 51 59 18 29 37 21 69 45 3 61 93 85 77 53 11 76 84 60 36 44 10 68 92 114 28 52 19 14 12 2 20 15 17 13 48 56 72 80 32 6 88 24 102 40 64 22 78 70 46 62 4 30 86 38 96 54 16 108 82 58 26 50 8 74 66 90 34 42 73 105 81 41 65 7 33 89 49 57 25 115 100 97 106 109 126 112 103 94 122 0 101 107 95 121 117 116 125 104 98 113 110 118 123 124 119 120 
Num variables: 127 => 136
Initialize Symbolic Manager(272, 58823, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 276 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.003 reg: 0 solved: 1 total time: 0.960593
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.960624
 opt: 0.001 reg: 0 solved: 1 total time: 0.965131
 opt: 0 reg: 0 solved: 1 total time: 0.966027
 opt: 0.002 reg: 0 solved: 1 total time: 0.968497
 opt: 0.001 reg: 0 solved: 1 total time: 0.97037
 opt: 0.002 reg: 0 solved: 1 total time: 0.972959
 opt: 0.002 reg: 0 solved: 1 total time: 0.975562
 opt: 0.002 reg: 0 solved: 1 total time: 0.977804
 opt: 0.001 reg: 0 solved: 1 total time: 0.979755
 opt: 0.007 reg: 0 solved: 2 total time: 0.987078
L = 1, leader states: 512, follower subproblems: 512, F:100000, total time: 0.987142
 opt: 0.006 reg: 0 solved: 2 total time: 0.998097
 opt: 0.008 reg: 0 solved: 4 total time: 1.00775
 opt: 0.02 reg: 0 solved: 3 total time: 1.02907
 opt: 0.023 reg: 0 solved: 3 total time: 1.053
 opt: 0.01 reg: 0.001 solved: 5 total time: 1.0643
 opt: 0.013 reg: 0.004 solved: 8 total time: 1.08233
 opt: 0.012 reg: 0.007 solved: 7 total time: 1.10256
 opt: 0.014 reg: 0.021 solved: 9 total time: 1.1388
 opt: 0.005 solved: 2147483647 total time: 1.14397
L = 2, leader states: 13122, follower subproblems: 13122, F:2147483647, total time: 1.15168
Search time: 0.2s
Total number of leader states: 210242
Total number of follower subproblems: 137889
Pareto-frontier size: 1
Pareto-frontier: (2,2147483647) 
	 fix ops costs: 2, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s9 blaststepdone
				 fix_switch t1 s4 blaststepdone
				 fix_switch t1 s39 blaststepdone
				 fix_switch t1 s34 blaststepdone
				 fix_switch t1 s29 blaststepdone
				 fix_switch t1 s24 blaststepdone
				 fix_switch t1 s19 blaststepdone
				 fix_switch t1 s14 blaststepdone
				 fix_last-step t1 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 19
Solved by optimal solver: 19
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 19
Solved follower subproblems: 19
Optimal solver time: 0.132s
Cost-bounded solver time: 0s
Follower search time: 0.132s
Total time: 1.15758s
Optimal engine:
Peak memory: 431568 KB
@@@T1857@@@
Done!
real 2.03
user 1.62
sys 0.31
