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/Garr201104_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/Garr201104_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.009s wall-clock]
Normalizing task... [0.000s CPU, 0.000s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.020s CPU, 0.016s wall-clock]
259 relevant atoms
501 auxiliary atoms
760 final queue length
875 total queue pushes
Completing instantiation... [0.000s CPU, 0.007s wall-clock]
Instantiating: [0.040s CPU, 0.043s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.006s 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...
26 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.010s CPU, 0.008s 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.001s wall-clock]
Translating task: [0.010s CPU, 0.009s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
1 operators removed
4 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.002s wall-clock]
Translator variables: 28
Translator derived variables: 0
Translator facts: 64
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 13
Translator operators: 114
Translator axioms: 0
Translator task size: 686
Translator peak memory: 17512 KB
Writing output... [0.000s CPU, 0.002s wall-clock]
Done! [0.070s CPU, 0.073s 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.
28 variables of 28 necessary
0 of 3 mutex groups necessary.
114 of 114 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 64 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=784, notReached=3206, spurious=106
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=3734, notReached=256, spurious=106
1 operators are spurious because were not triggered
H^2 mutexes added fw: 256, unreachable: 0
0 of 113 operators detected as spurious
Total mutex and disambiguation time: 0.003712 iterations: 2
128 of 128 mutex groups necessary.
113 of 114 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 113
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 28
128 of 128 mutex groups necessary.
113 of 113 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
28 variables of 28 of 28 necessary
The causal graph is not acyclic.
28 variables of 28 necessary
128 of 128 mutex groups necessary.
113 of 113 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 28
Preprocessor facts: 64
Preprocessor derived variables: 0
Preprocessor operators: 113
Preprocessor mutex groups: 128
Preprocessor task size: 924
Writing output...
Preprocessor time: 0.0105967s
Preprocessor peak memory: 2488 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.00033289s]
Simplifying transitions... done!
done reading input! [t=0.0054553s]
building causal graph...done! [t=0.0057564s]
packing state variables...Variables: 28
Bytes per state: 8
done! [t=0.00578349s]
done initalizing global data [t=0.00579403s]
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() = 19
leader_vars_follower_preconditioned.size() = 18
follower_operators.size() = 94
leader_operators.size() = 19
Initializing Symbolic Variables
Sym variable order: 1 9 6 15 13 4 17 11 21 2 16 18 3 10 14 12 8 5 7 22 19 27 0 23 25 26 20 24 
Num variables: 28 => 33
Initialize Symbolic Manager(66, 242424, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 21 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0s
Starting Stackelberg bounded search...
 opt: 0 reg: 0 solved: 1 total time: 0.372452
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.372476
 opt: 0 reg: 0 solved: 1 total time: 0.372948
 opt: 0 reg: 0 solved: 1 total time: 0.373223
 opt: 0 reg: 0 solved: 2 total time: 0.373895
L = 1, leader states: 8, follower subproblems: 8, F:100000, total time: 0.373917
 opt: 0 reg: 0 solved: 2 total time: 0.375115
 opt: 0 reg: 0 solved: 2 total time: 0.376115
L = 2, leader states: 18, follower subproblems: 18, F:100000, total time: 0.376142
 opt: 0 solved: 2147483647 total time: 0.377053
L = 3, leader states: 32, follower subproblems: 32, F:2147483647, total time: 0.377422
Search time: 0.005s
Total number of leader states: 133
Total number of follower subproblems: 79
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 s53 blaststepdone
				 fix_switch t1 s33 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 7
Solved by optimal solver: 7
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 7
Solved follower subproblems: 7
Optimal solver time: 0s
Cost-bounded solver time: 0s
Follower search time: 0s
Total time: 0.377923s
Optimal engine:
Peak memory: 412068 KB
@@@T605@@@
Done!
real 0.84
user 0.45
sys 0.22
