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/LambdaNet_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/LambdaNet_2.pddl
Parsing...
Parsing: [0.010s CPU, 0.025s 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.010s CPU, 0.010s wall-clock]
Preparing model... [0.000s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.070s CPU, 0.063s wall-clock]
1160 relevant atoms
2192 auxiliary atoms
3352 final queue length
4159 total queue pushes
Completing instantiation... [0.040s CPU, 0.044s wall-clock]
Instantiating: [0.130s CPU, 0.129s 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...
96 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.010s CPU, 0.004s wall-clock]
Translating task: [0.060s CPU, 0.057s 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.009s wall-clock]
Translator variables: 98
Translator derived variables: 0
Translator facts: 216
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 25
Translator operators: 771
Translator axioms: 0
Translator task size: 4433
Translator peak memory: 20688 KB
Writing output... [0.010s CPU, 0.010s wall-clock]
Done! [0.230s CPU, 0.243s 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.
98 variables of 98 necessary
0 of 3 mutex groups necessary.
771 of 771 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 216 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=9604, notReached=36658, spurious=394
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=44394, notReached=1868, spurious=394
8 operators are spurious because were not triggered
H^2 mutexes added fw: 1868, unreachable: 0
0 of 763 operators detected as spurious
Total mutex and disambiguation time: 0.047032 iterations: 2
934 of 934 mutex groups necessary.
763 of 771 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 763
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 98
934 of 934 mutex groups necessary.
763 of 763 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
98 variables of 98 of 98 necessary
The causal graph is not acyclic.
98 variables of 98 necessary
934 of 934 mutex groups necessary.
763 of 763 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 98
Preprocessor facts: 216
Preprocessor derived variables: 0
Preprocessor operators: 763
Preprocessor mutex groups: 934
Preprocessor task size: 6234
Writing output...
Preprocessor time: 0.0794555s
Preprocessor peak memory: 4076 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.000358909s]
Simplifying transitions... done!
done reading input! [t=0.0220476s]
building causal graph...done! [t=0.0227226s]
packing state variables...Variables: 98
Bytes per state: 16
done! [t=0.02279s]
done initalizing global data [t=0.0227937s]
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() = 71
leader_vars_follower_preconditioned.size() = 70
follower_operators.size() = 692
leader_operators.size() = 71
Initializing Symbolic Variables
Sym variable order: 1 12 11 16 26 20 50 74 44 5 62 38 32 56 34 46 58 22 7 52 28 64 82 40 10 61 31 55 49 4 37 25 19 70 43 14 2 23 59 29 47 8 53 35 41 65 86 42 60 66 24 18 3 36 54 48 30 17 51 21 78 63 6 45 57 39 27 33 13 15 9 94 92 88 80 69 77 73 85 93 96 90 68 84 81 0 91 89 72 97 76 95 83 79 75 87 71 67 
Num variables: 98 => 106
Initialize Symbolic Manager(212, 75471, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 89 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.012s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.834931
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.83496
 opt: 0 reg: 0 solved: 1 total time: 0.837754
 opt: 0 reg: 0 solved: 1 total time: 0.83879
 opt: 0.001 reg: 0 solved: 1 total time: 0.839937
 opt: 0.001 reg: 0 solved: 1 total time: 0.841898
 opt: 0.001 reg: 0 solved: 1 total time: 0.843477
 opt: 0.004 reg: 0 solved: 2 total time: 0.84766
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.847714
 opt: 0.005 reg: 0 solved: 2 total time: 0.855773
 opt: 0.005 reg: 0 solved: 2 total time: 0.861899
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.861946
 opt: 0.002 reg: 0 solved: 1 total time: 0.867561
 opt: 0.006 reg: 0 solved: 2 total time: 0.873744
 opt: 0.011 reg: 0 solved: 4 total time: 0.885308
 opt: 0.006 reg: 0 solved: 3 total time: 0.892145
 opt: 0.006 reg: 0.001 solved: 3 total time: 0.899684
 opt: 0.009 reg: 0.001 solved: 4 total time: 0.91077
 opt: 0.016 reg: 0.001 solved: 4 total time: 0.928643
 opt: 0.014 reg: 0.001 solved: 4 total time: 0.94491
 opt: 0.012 reg: 0 solved: 4 total time: 0.95864
 opt: 0.009 reg: 0.001 solved: 4 total time: 0.97049
L = 3, leader states: 8192, follower subproblems: 8192, F:100000, total time: 0.970592
 opt: 0.008 reg: 0.004 solved: 3 total time: 0.985769
 opt: 0.009 reg: 0.007 solved: 4 total time: 1.00272
 opt: 0.005 reg: 0.005 solved: 2 total time: 1.0135
 opt: 0.013 reg: 0.007 solved: 4 total time: 1.03408
 opt: 0.009 reg: 0.005 solved: 4 total time: 1.04949
 opt: 0.013 reg: 0.006 solved: 4 total time: 1.06958
 opt: 0.015 reg: 0.004 solved: 4 total time: 1.09004
 opt: 0.011 reg: 0.009 solved: 6 total time: 1.11107
 opt: 0.011 reg: 0.004 solved: 4 total time: 1.12739
 opt: 0.013 reg: 0.002 solved: 4 total time: 1.14371
 opt: 0.01 reg: 0.006 solved: 6 total time: 1.16138
 opt: 0.01 reg: 0.01 solved: 4 total time: 1.18181
 opt: 0.012 reg: 0.005 solved: 4 total time: 1.20016
 opt: 0.01 reg: 0.015 solved: 4 total time: 1.22612
 opt: 0.01 reg: 0.026 solved: 5 total time: 1.26332
 opt: 0.017 reg: 0.003 solved: 4 total time: 1.28459
 opt: 0.011 reg: 0.009 solved: 6 total time: 1.30587
 opt: 0.012 reg: 0.007 solved: 5 total time: 1.32616
 opt: 0.009 reg: 0.006 solved: 6 total time: 1.3423
 opt: 0.01 reg: 0.018 solved: 6 total time: 1.37118
 opt: 0.011 reg: 0.025 solved: 6 total time: 1.40883
 opt: 0.018 reg: 0.003 solved: 6 total time: 1.43069
 opt: 0.016 reg: 0.003 solved: 6 total time: 1.45082
 opt: 0.021 reg: 0.004 solved: 6 total time: 1.47731
 opt: 0.019 reg: 0.003 solved: 6 total time: 1.50027
 opt: 0.014 reg: 0.003 solved: 6 total time: 1.51853
 opt: 0.019 reg: 0.003 solved: 6 total time: 1.54148
 opt: 0.018 reg: 0.006 solved: 6 total time: 1.56592
 opt: 0.016 reg: 0.005 solved: 6 total time: 1.58852
 opt: 0.009 reg: 0.01 solved: 6 total time: 1.60818
 opt: 0.014 reg: 0.011 solved: 6 total time: 1.63439
 opt: 0.021 reg: 0.01 solved: 6 total time: 1.66666
 opt: 0.017 reg: 0.006 solved: 6 total time: 1.691
 opt: 0.019 reg: 0.006 solved: 6 total time: 1.71786
 opt: 0.015 reg: 0.006 solved: 6 total time: 1.73981
 opt: 0.009 reg: 0.011 solved: 6 total time: 1.76076
 opt: 0.014 reg: 0.007 solved: 6 total time: 1.78326
 opt: 0.012 reg: 0.005 solved: 6 total time: 1.80185
 opt: 0.019 reg: 0.005 solved: 6 total time: 1.82714
 opt: 0.016 reg: 0.005 solved: 6 total time: 1.84939
 opt: 0.012 reg: 0.009 solved: 6 total time: 1.87128
 opt: 0.009 solved: 2147483647 total time: 1.88118
L = 4, leader states: 31250, follower subproblems: 31250, F:2147483647, total time: 1.88691
Search time: 1.057s
Total number of leader states: 180996
Total number of follower subproblems: 113826
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 s66 blaststepdone
				 fix_switch t1 s53 blaststepdone
				 fix_switch t1 s24 blaststepdone
				 fix_switch t1 s11 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s83 blaststepdone
				 fix_switch t2 s41 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 61
Solved by optimal solver: 61
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 61
Solved follower subproblems: 61
Optimal solver time: 0.665s
Cost-bounded solver time: 0s
Follower search time: 0.665s
Total time: 1.89024s
Optimal engine:
Peak memory: 527300 KB
@@@T2379@@@
Done!
real 2.63
user 2.08
sys 0.35
