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/Abvt_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/Abvt_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.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
Preparing model... [0.010s CPU, 0.009s wall-clock]
Generated 173 rules.
Computing model... [0.110s CPU, 0.106s wall-clock]
1156 relevant atoms
2176 auxiliary atoms
3332 final queue length
4139 total queue pushes
Completing instantiation... [0.080s CPU, 0.085s wall-clock]
Instantiating: [0.230s CPU, 0.217s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.012s 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...
94 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.017s 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.091s 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.010s wall-clock]
Translator variables: 96
Translator derived variables: 0
Translator facts: 212
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 25
Translator operators: 769
Translator axioms: 0
Translator task size: 4419
Translator peak memory: 20688 KB
Writing output... [0.010s CPU, 0.012s wall-clock]
Done! [0.370s CPU, 0.364s 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.
96 variables of 96 necessary
0 of 3 mutex groups necessary.
769 of 769 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 212 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=9216, notReached=35338, spurious=390
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=42706, notReached=1848, spurious=390
8 operators are spurious because were not triggered
H^2 mutexes added fw: 1848, unreachable: 0
0 of 761 operators detected as spurious
Total mutex and disambiguation time: 0.052545 iterations: 2
924 of 924 mutex groups necessary.
761 of 769 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 761
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 96
924 of 924 mutex groups necessary.
761 of 761 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
96 variables of 96 of 96 necessary
The causal graph is not acyclic.
96 variables of 96 necessary
924 of 924 mutex groups necessary.
761 of 761 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 96
Preprocessor facts: 212
Preprocessor derived variables: 0
Preprocessor operators: 761
Preprocessor mutex groups: 924
Preprocessor task size: 6200
Writing output...
Preprocessor time: 0.0899579s
Preprocessor peak memory: 4068 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.000304102s]
Simplifying transitions... done!
done reading input! [t=0.0238884s]
building causal graph...done! [t=0.0246755s]
packing state variables...Variables: 96
Bytes per state: 16
done! [t=0.0247532s]
done initalizing global data [t=0.0247571s]
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() = 690
leader_operators.size() = 71
Initializing Symbolic Variables
Sym variable order: 1 24 30 60 42 66 3 18 36 48 54 12 10 32 20 62 26 5 56 44 38 50 73 15 19 37 69 49 4 61 25 31 43 55 14 2 9 76 57 27 33 6 63 39 45 51 21 59 84 35 65 23 8 53 47 29 41 16 17 58 34 52 22 64 7 28 46 40 80 11 13 91 92 87 71 78 82 75 67 89 94 93 79 86 0 74 83 90 95 72 68 88 77 70 81 85 
Num variables: 96 => 104
Initialize Symbolic Manager(208, 76923, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 81 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.013s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.840683
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.840708
 opt: 0 reg: 0 solved: 1 total time: 0.843506
 opt: 0.001 reg: 0 solved: 1 total time: 0.844843
 opt: 0.001 reg: 0 solved: 1 total time: 0.846022
 opt: 0.001 reg: 0 solved: 1 total time: 0.848026
 opt: 0.002 reg: 0 solved: 1 total time: 0.850265
 opt: 0.004 reg: 0 solved: 3 total time: 0.855177
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.855225
 opt: 0.008 reg: 0 solved: 4 total time: 0.866885
 opt: 0.003 reg: 0 solved: 1 total time: 0.870266
 opt: 0.007 reg: 0 solved: 3 total time: 0.878268
 opt: 0.004 reg: 0 solved: 3 total time: 0.883405
 opt: 0.007 reg: 0 solved: 3 total time: 0.890993
 opt: 0.012 reg: 0 solved: 4 total time: 0.904401
 opt: 0.008 reg: 0 solved: 3 total time: 0.913147
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.913213
 opt: 0.008 reg: 0 solved: 4 total time: 0.92424
 opt: 0.007 reg: 0 solved: 3 total time: 0.932501
 opt: 0.006 reg: 0 solved: 3 total time: 0.940212
 opt: 0.015 reg: 0.001 solved: 4 total time: 0.956654
 opt: 0.008 reg: 0.001 solved: 4 total time: 0.966651
 opt: 0.008 reg: 0.001 solved: 4 total time: 0.977574
 opt: 0.012 reg: 0.001 solved: 4 total time: 0.99246
 opt: 0.015 reg: 0.001 solved: 4 total time: 1.00962
 opt: 0.011 reg: 0.001 solved: 4 total time: 1.02269
 opt: 0.006 reg: 0.003 solved: 4 total time: 1.03252
 opt: 0.012 reg: 0.003 solved: 4 total time: 1.04792
 opt: 0.008 reg: 0.003 solved: 4 total time: 1.05911
L = 3, leader states: 8192, follower subproblems: 8192, F:100000, total time: 1.0592
 opt: 0.007 reg: 0.008 solved: 4 total time: 1.07877
 opt: 0.007 reg: 0.017 solved: 3 total time: 1.10454
 opt: 0.013 reg: 0.019 solved: 6 total time: 1.13707
 opt: 0.008 reg: 0.007 solved: 4 total time: 1.15322
 opt: 0.011 reg: 0.01 solved: 6 total time: 1.17492
 opt: 0.012 reg: 0.017 solved: 6 total time: 1.20511
 opt: 0.019 reg: 0.005 solved: 5 total time: 1.23085
 opt: 0.012 reg: 0.014 solved: 6 total time: 1.25796
 opt: 0.01 reg: 0.019 solved: 6 total time: 1.2881
 opt: 0.022 reg: 0.003 solved: 6 total time: 1.31413
 opt: 0.016 reg: 0.002 solved: 4 total time: 1.33314
 opt: 0.013 reg: 0.002 solved: 4 total time: 1.34943
 opt: 0.012 reg: 0.006 solved: 6 total time: 1.36834
 opt: 0.022 reg: 0.005 solved: 6 total time: 1.39682
 opt: 0.013 reg: 0.008 solved: 6 total time: 1.41866
 opt: 0.013 reg: 0.004 solved: 4 total time: 1.43756
 opt: 0.019 reg: 0.008 solved: 6 total time: 1.46569
 opt: 0.014 reg: 0.006 solved: 4 total time: 1.48676
 opt: 0.023 reg: 0.014 solved: 6 total time: 1.52444
 opt: 0.011 reg: 0.021 solved: 6 total time: 1.558
 opt: 0.012 reg: 0.04 solved: 6 total time: 1.61142
 opt: 0.014 reg: 0.021 solved: 4 total time: 1.64746
 opt: 0.011 reg: 0.006 solved: 6 total time: 1.66509
 opt: 0.01 reg: 0.008 solved: 6 total time: 1.68404
 opt: 0.012 solved: 2147483647 total time: 1.69686
L = 4, leader states: 31250, follower subproblems: 31250, F:2147483647, total time: 1.70254
Search time: 0.867s
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 s8 blaststepdone
				 fix_switch t1 s5 blaststepdone
				 fix_switch t1 s31 blaststepdone
				 fix_switch t1 s28 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s24 blaststepdone
				 fix_switch t2 s1 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 51
Solved by optimal solver: 51
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 51
Solved follower subproblems: 51
Optimal solver time: 0.511s
Cost-bounded solver time: 0s
Follower search time: 0.511s
Total time: 1.70641s
Optimal engine:
Peak memory: 520080 KB
@@@T2316@@@
Done!
real 2.80
user 2.06
sys 0.32
