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/Janetlense_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/Janetlense_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.023s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s 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.020s CPU, 0.022s wall-clock]
349 relevant atoms
680 auxiliary atoms
1029 final queue length
1205 total queue pushes
Completing instantiation... [0.010s CPU, 0.011s wall-clock]
Instantiating: [0.050s CPU, 0.053s 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...
36 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.013s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
2 operators removed
4 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.002s wall-clock]
Translator variables: 38
Translator derived variables: 0
Translator facts: 85
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 14
Translator operators: 167
Translator axioms: 0
Translator task size: 1001
Translator peak memory: 17516 KB
Writing output... [0.010s CPU, 0.002s wall-clock]
Done! [0.090s CPU, 0.104s 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.
38 variables of 38 necessary
0 of 3 mutex groups necessary.
167 of 167 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 85 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=1444, notReached=5649, spurious=132
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=6767, notReached=326, spurious=132
2 operators are spurious because were not triggered
H^2 mutexes added fw: 326, unreachable: 0
0 of 165 operators detected as spurious
Total mutex and disambiguation time: 0.005922 iterations: 2
163 of 163 mutex groups necessary.
165 of 167 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 165
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 38
163 of 163 mutex groups necessary.
165 of 165 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
38 variables of 38 of 38 necessary
The causal graph is not acyclic.
38 variables of 38 necessary
163 of 163 mutex groups necessary.
165 of 165 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 38
Preprocessor facts: 85
Preprocessor derived variables: 0
Preprocessor operators: 165
Preprocessor mutex groups: 163
Preprocessor task size: 1303
Writing output...
Preprocessor time: 0.0156608s
Preprocessor peak memory: 2624 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.000317438s]
Simplifying transitions... done!
done reading input! [t=0.00685924s]
building causal graph...done! [t=0.00726166s]
packing state variables...Variables: 38
Bytes per state: 8
done! [t=0.00728747s]
done initalizing global data [t=0.00729604s]
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() = 25
leader_vars_follower_preconditioned.size() = 24
follower_operators.size() = 141
leader_operators.size() = 24
Initializing Symbolic Variables
Sym variable order: 1 10 7 6 19 16 5 13 29 22 9 8 2 11 17 3 23 20 14 18 12 4 26 21 15 30 33 28 37 25 32 0 36 34 24 31 27 35 
Num variables: 38 => 43
Initialize Symbolic Manager(86, 186046, 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: 0.001s
Starting Stackelberg bounded search...
 opt: 0 reg: 0 solved: 1 total time: 0.488553
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.488577
 opt: 0 reg: 0 solved: 1 total time: 0.489452
 opt: 0 reg: 0 solved: 1 total time: 0.489909
 opt: 0.001 reg: 0 solved: 3 total time: 0.491406
 opt: 0 reg: 0 solved: 1 total time: 0.491963
L = 1, leader states: 16, follower subproblems: 16, F:100000, total time: 0.491991
 opt: 0.002 reg: 0 solved: 4 total time: 0.494872
 opt: 0.001 reg: 0 solved: 3 total time: 0.49654
 opt: 0.002 reg: 0 solved: 4 total time: 0.499429
 opt: 0.001 solved: 2147483647 total time: 0.501106
L = 2, leader states: 54, follower subproblems: 54, F:2147483647, total time: 0.501886
Search time: 0.014s
Total number of leader states: 262
Total number of follower subproblems: 163
Pareto-frontier size: 1
Pareto-frontier: (2,2147483647) 
	 fix ops costs: 2, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s13 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s15 blaststepdone
				 fix_switch t1 s14 blaststepdone
				 fix_last-step t1 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 9
Solved by optimal solver: 9
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 9
Solved follower subproblems: 9
Optimal solver time: 0.007s
Cost-bounded solver time: 0s
Follower search time: 0.007s
Total time: 0.502638s
Optimal engine:
Peak memory: 453692 KB
@@@T767@@@
Done!
real 1.03
user 0.56
sys 0.27
