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/Ion_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/Ion_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.010s 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.011s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.040s CPU, 0.040s wall-clock]
611 relevant atoms
1189 auxiliary atoms
1800 final queue length
2169 total queue pushes
Completing instantiation... [0.020s CPU, 0.023s wall-clock]
Instantiating: [0.080s CPU, 0.084s 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...
57 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.002s wall-clock]
Translating task: [0.040s CPU, 0.030s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.005s wall-clock]
Translator variables: 59
Translator derived variables: 0
Translator facts: 132
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 19
Translator operators: 355
Translator axioms: 0
Translator task size: 2072
Translator peak memory: 18572 KB
Writing output... [0.010s CPU, 0.006s wall-clock]
Done! [0.150s CPU, 0.147s 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.
59 variables of 59 necessary
0 of 3 mutex groups necessary.
355 of 355 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 132 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=3481, notReached=13713, spurious=230
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=16378, notReached=816, spurious=230
5 operators are spurious because were not triggered
H^2 mutexes added fw: 816, unreachable: 0
0 of 350 operators detected as spurious
Total mutex and disambiguation time: 0.014925 iterations: 2
408 of 408 mutex groups necessary.
350 of 355 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 350
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 59
408 of 408 mutex groups necessary.
350 of 350 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
59 variables of 59 of 59 necessary
The causal graph is not acyclic.
59 variables of 59 necessary
408 of 408 mutex groups necessary.
350 of 350 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 59
Preprocessor facts: 132
Preprocessor derived variables: 0
Preprocessor operators: 350
Preprocessor mutex groups: 408
Preprocessor task size: 2843
Writing output...
Preprocessor time: 0.0302013s
Preprocessor peak memory: 3056 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.000322325s]
Simplifying transitions... done!
done reading input! [t=0.0130111s]
building causal graph...done! [t=0.0135501s]
packing state variables...Variables: 59
Bytes per state: 12
done! [t=0.0136259s]
done initalizing global data [t=0.0136319s]
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() = 41
leader_vars_follower_preconditioned.size() = 40
follower_operators.size() = 309
leader_operators.size() = 41
Initializing Symbolic Variables
Sym variable order: 1 12 13 21 25 50 37 6 29 17 33 26 38 18 14 3 22 30 34 11 2 28 16 20 5 36 46 24 32 23 31 35 19 4 15 42 27 8 9 10 7 53 54 52 49 45 41 57 55 40 44 0 56 48 58 51 39 47 43 
Num variables: 59 => 65
Initialize Symbolic Manager(130, 123076, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 46 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.003s
Starting Stackelberg bounded search...
 opt: 0 reg: 0 solved: 1 total time: 0.611642
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.611678
 opt: 0 reg: 0 solved: 1 total time: 0.613016
 opt: 0 reg: 0 solved: 1 total time: 0.613851
 opt: 0 reg: 0 solved: 1 total time: 0.614793
 opt: 0 reg: 0 solved: 1 total time: 0.61558
 opt: 0.001 reg: 0 solved: 2 total time: 0.617539
L = 1, leader states: 32, follower subproblems: 32, F:100000, total time: 0.617584
 opt: 0.002 reg: 0 solved: 2 total time: 0.621037
 opt: 0.002 reg: 0 solved: 2 total time: 0.624068
L = 2, leader states: 162, follower subproblems: 162, F:100000, total time: 0.624118
 opt: 0.003 reg: 0 solved: 3 total time: 0.629185
 opt: 0.003 reg: 0 solved: 3 total time: 0.63352
 opt: 0.002 reg: 0 solved: 2 total time: 0.636644
 opt: 0.004 reg: 0 solved: 4 total time: 0.64196
 opt: 0.006 reg: 0.001 solved: 4 total time: 0.649347
 opt: 0.004 reg: 0.002 solved: 4 total time: 0.656367
L = 3, leader states: 512, follower subproblems: 512, F:100000, total time: 0.656479
 opt: 0.004 reg: 0.004 solved: 4 total time: 0.667249
 opt: 0.005 reg: 0.008 solved: 4 total time: 0.681644
 opt: 0.004 reg: 0.006 solved: 4 total time: 0.692962
 opt: 0.002 reg: 0.006 solved: 2 total time: 0.70268
 opt: 0.004 reg: 0.014 solved: 3 total time: 0.721464
 opt: 0.003 reg: 0.016 solved: 4 total time: 0.741396
 opt: 0.006 reg: 0.022 solved: 4 total time: 0.770295
 opt: 0.006 reg: 0.023 solved: 5 total time: 0.80065
 opt: 0.006 reg: 0.007 solved: 4 total time: 0.81505
 opt: 0.005 reg: 0.008 solved: 4 total time: 0.829112
 opt: 0.004 solved: 2147483647 total time: 0.834045
L = 4, leader states: 1250, follower subproblems: 1250, F:2147483647, total time: 0.836711
Search time: 0.227s
Total number of leader states: 5844
Total number of follower subproblems: 3570
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 s79 blaststepdone
				 fix_switch t1 s110 blaststepdone
				 fix_switch t1 s105 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s74 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 25
Solved by optimal solver: 25
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 25
Solved follower subproblems: 25
Optimal solver time: 0.076s
Cost-bounded solver time: 0s
Follower search time: 0.076s
Total time: 0.838627s
Optimal engine:
Peak memory: 416856 KB
@@@T1180@@@
Done!
real 1.33
user 0.95
sys 0.29
