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/Arpanet19719_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/Arpanet19719_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.054s 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.013s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.040s CPU, 0.037s wall-clock]
611 relevant atoms
1184 auxiliary atoms
1795 final queue length
2166 total queue pushes
Completing instantiation... [0.020s CPU, 0.020s wall-clock]
Instantiating: [0.080s CPU, 0.080s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.000s 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...
56 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.000s 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.010s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.002s wall-clock]
Translating task: [0.020s CPU, 0.026s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
2 operators removed
4 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.004s wall-clock]
Translator variables: 58
Translator derived variables: 0
Translator facts: 130
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 19
Translator operators: 353
Translator axioms: 0
Translator task size: 2061
Translator peak memory: 18572 KB
Writing output... [0.000s CPU, 0.005s wall-clock]
Done! [0.130s CPU, 0.181s 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.
58 variables of 58 necessary
0 of 3 mutex groups necessary.
353 of 353 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 130 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=3364, notReached=13308, spurious=228
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=15876, notReached=796, spurious=228
2 operators are spurious because were not triggered
H^2 mutexes added fw: 796, unreachable: 0
0 of 351 operators detected as spurious
Total mutex and disambiguation time: 0.013218 iterations: 2
398 of 398 mutex groups necessary.
351 of 353 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 351
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 58
398 of 398 mutex groups necessary.
351 of 351 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
58 variables of 58 of 58 necessary
The causal graph is not acyclic.
58 variables of 58 necessary
398 of 398 mutex groups necessary.
351 of 351 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 58
Preprocessor facts: 130
Preprocessor derived variables: 0
Preprocessor operators: 351
Preprocessor mutex groups: 398
Preprocessor task size: 2828
Writing output...
Preprocessor time: 0.0299998s
Preprocessor peak memory: 3052 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.000359452s]
Simplifying transitions... done!
done reading input! [t=0.0120769s]
building causal graph...done! [t=0.0125008s]
packing state variables...Variables: 58
Bytes per state: 8
done! [t=0.0125554s]
done initalizing global data [t=0.0125607s]
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() = 310
leader_operators.size() = 41
Initializing Symbolic Variables
Sym variable order: 1 12 13 21 25 49 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 39 43 54 44 50 57 48 53 0 56 47 41 55 40 45 51 52 
Num variables: 58 => 64
Initialize Symbolic Manager(128, 125000, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 39 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.566087
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.566118
 opt: 0 reg: 0 solved: 1 total time: 0.567363
 opt: 0 reg: 0 solved: 1 total time: 0.568291
 opt: 0.001 reg: 0 solved: 1 total time: 0.569465
 opt: 0 reg: 0 solved: 1 total time: 0.570512
 opt: 0.002 reg: 0 solved: 2 total time: 0.572639
L = 1, leader states: 32, follower subproblems: 32, F:100000, total time: 0.572706
 opt: 0.002 reg: 0 solved: 2 total time: 0.576582
 opt: 0.002 reg: 0 solved: 2 total time: 0.579182
L = 2, leader states: 162, follower subproblems: 162, F:100000, total time: 0.579219
 opt: 0.003 reg: 0 solved: 4 total time: 0.5844
 opt: 0.003 reg: 0 solved: 4 total time: 0.588929
 opt: 0.002 reg: 0 solved: 2 total time: 0.59205
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.59993
 opt: 0.003 reg: 0.006 solved: 3 total time: 0.610305
 opt: 0.005 reg: 0.009 solved: 4 total time: 0.625194
 opt: 0.005 reg: 0.007 solved: 4 total time: 0.638907
 opt: 0.005 reg: 0.009 solved: 4 total time: 0.653594
 opt: 0.005 reg: 0.005 solved: 4 total time: 0.66472
L = 3, leader states: 512, follower subproblems: 512, F:100000, total time: 0.6648
 opt: 0.005 reg: 0.003 solved: 4 total time: 0.674777
 opt: 0.005 reg: 0.004 solved: 4 total time: 0.684377
 opt: 0.004 reg: 0.009 solved: 4 total time: 0.69831
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.706739
 opt: 0.002 reg: 0.001 solved: 2 total time: 0.710703
 opt: 0.004 reg: 0.002 solved: 4 total time: 0.717844
 opt: 0.005 reg: 0.003 solved: 4 total time: 0.727066
 opt: 0.005 reg: 0.003 solved: 4 total time: 0.73586
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.744173
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.752576
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.760592
 opt: 0.004 reg: 0.002 solved: 4 total time: 0.767632
 opt: 0.004 reg: 0.002 solved: 4 total time: 0.774379
 opt: 0.006 reg: 0.002 solved: 4 total time: 0.782913
 opt: 0.005 reg: 0.005 solved: 4 total time: 0.793911
 opt: 0.005 reg: 0.005 solved: 4 total time: 0.804679
 opt: 0.006 reg: 0.003 solved: 4 total time: 0.814733
 opt: 0.005 reg: 0.006 solved: 4 total time: 0.826236
 opt: 0.005 reg: 0.009 solved: 4 total time: 0.841365
 opt: 0.003 solved: 2147483647 total time: 0.844854
L = 4, leader states: 1250, follower subproblems: 1250, F:2147483647, total time: 0.84768
Search time: 0.284s
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 s16 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s8 blaststepdone
				 fix_switch t2 s15 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s14 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 37
Solved by optimal solver: 37
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 37
Solved follower subproblems: 37
Optimal solver time: 0.136s
Cost-bounded solver time: 0s
Follower search time: 0.136s
Total time: 0.849333s
Optimal engine:
Peak memory: 415412 KB
@@@T1206@@@
Done!
real 2.19
user 0.97
sys 0.27
