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/GtsCe_1.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/GtsCe_1.pddl
Parsing...
Parsing: [0.000s CPU, 0.013s wall-clock]
Normalizing task... [0.010s 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.007s wall-clock]
Generated 173 rules.
Computing model... [0.060s CPU, 0.068s wall-clock]
1141 relevant atoms
2141 auxiliary atoms
3282 final queue length
4077 total queue pushes
Completing instantiation... [0.050s CPU, 0.050s wall-clock]
Instantiating: [0.130s CPU, 0.143s 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...
90 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.010s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.005s wall-clock]
Translating task: [0.060s CPU, 0.064s 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: 92
Translator derived variables: 0
Translator facts: 204
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 25
Translator operators: 759
Translator axioms: 0
Translator task size: 4348
Translator peak memory: 20692 KB
Writing output... [0.010s CPU, 0.011s wall-clock]
Done! [0.240s CPU, 0.256s 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.
92 variables of 92 necessary
0 of 3 mutex groups necessary.
759 of 759 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 204 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=8464, notReached=32770, spurious=382
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=39268, notReached=1966, spurious=382
6 operators are spurious because were not triggered
H^2 mutexes added fw: 1966, unreachable: 0
0 of 753 operators detected as spurious
Total mutex and disambiguation time: 0.048715 iterations: 2
983 of 983 mutex groups necessary.
753 of 759 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 753
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 92
983 of 983 mutex groups necessary.
753 of 753 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
92 variables of 92 of 92 necessary
The causal graph is not acyclic.
92 variables of 92 necessary
983 of 983 mutex groups necessary.
753 of 753 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 92
Preprocessor facts: 204
Preprocessor derived variables: 0
Preprocessor operators: 753
Preprocessor mutex groups: 983
Preprocessor task size: 6258
Writing output...
Preprocessor time: 0.0871373s
Preprocessor peak memory: 4048 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.0003294s]
Simplifying transitions... done!
done reading input! [t=0.0231501s]
building causal graph...done! [t=0.023863s]
packing state variables...Variables: 92
Bytes per state: 16
done! [t=0.0239473s]
done initalizing global data [t=0.023953s]
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() = 682
leader_operators.size() = 71
Initializing Symbolic Variables
Sym variable order: 1 13 15 10 12 18 30 42 54 3 48 60 36 24 66 46 22 28 40 34 7 78 64 58 52 16 44 72 62 56 38 5 20 32 50 26 2 63 39 45 21 6 75 57 33 27 51 31 55 49 61 4 19 43 25 69 37 65 81 53 47 35 8 41 23 59 29 9 14 11 17 88 85 86 87 80 77 83 90 68 89 71 84 74 0 73 76 91 67 70 82 79 
Num variables: 92 => 100
Initialize Symbolic Manager(200, 80000, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 139 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.014s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.859011
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.859049
 opt: 0 reg: 0 solved: 1 total time: 0.862002
 opt: 0.001 reg: 0 solved: 1 total time: 0.863087
 opt: 0 reg: 0 solved: 1 total time: 0.86411
 opt: 0.001 reg: 0 solved: 1 total time: 0.866121
 opt: 0.001 reg: 0 solved: 1 total time: 0.868016
 opt: 0.003 reg: 0 solved: 2 total time: 0.871189
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.871237
 opt: 0.004 reg: 0 solved: 2 total time: 0.878336
 opt: 0.005 reg: 0 solved: 2 total time: 0.884036
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.884088
 opt: 0.002 reg: 0 solved: 1 total time: 0.889446
 opt: 0.004 reg: 0 solved: 2 total time: 0.893786
 opt: 0.005 reg: 0 solved: 6 total time: 0.899998
 opt: 0.005 reg: 0 solved: 4 total time: 0.906084
 opt: 0.01 reg: 0.001 solved: 4 total time: 0.918276
 opt: 0.006 reg: 0.001 solved: 3 total time: 0.926393
 opt: 0.006 reg: 0.005 solved: 7 total time: 0.938247
 opt: 0.007 reg: 0.004 solved: 4 total time: 0.95023
 opt: 0.015 reg: 0.005 solved: 7 total time: 0.971622
 opt: 0.017 reg: 0.004 solved: 7 total time: 0.993388
 opt: 0.007 reg: 0.01 solved: 5 total time: 1.01175
 opt: 0.013 reg: 0.009 solved: 7 total time: 1.03504
 opt: 0.003 solved: 2147483647 total time: 1.03907
L = 3, leader states: 8192, follower subproblems: 8192, F:2147483647, total time: 1.04293
Search time: 0.188s
Total number of leader states: 56653
Total number of follower subproblems: 36139
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 s87 blaststepdone
				 fix_switch t1 s147 blaststepdone
				 fix_switch t1 s140 blaststepdone
				 fix_switch t1 s131 blaststepdone
				 fix_switch t1 s125 blaststepdone
				 fix_switch t1 s124 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 22
Solved by optimal solver: 22
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 22
Solved follower subproblems: 22
Optimal solver time: 0.116s
Cost-bounded solver time: 0s
Follower search time: 0.116s
Total time: 1.04634s
Optimal engine:
Peak memory: 491944 KB
@@@T1544@@@
Done!
real 1.79
user 1.29
sys 0.33
