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/DialtelecomCz_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/DialtelecomCz_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.012s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.090s CPU, 0.093s wall-clock]
1154 relevant atoms
2168 auxiliary atoms
3322 final queue length
4129 total queue pushes
Completing instantiation... [0.060s CPU, 0.052s wall-clock]
Instantiating: [0.170s CPU, 0.171s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.000s CPU, 0.008s 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...
93 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.011s 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.005s wall-clock]
Translating task: [0.070s CPU, 0.070s 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.009s wall-clock]
Translator variables: 95
Translator derived variables: 0
Translator facts: 210
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 25
Translator operators: 768
Translator axioms: 0
Translator task size: 4412
Translator peak memory: 20688 KB
Writing output... [0.010s CPU, 0.011s wall-clock]
Done! [0.280s CPU, 0.287s 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.
95 variables of 95 necessary
0 of 3 mutex groups necessary.
768 of 768 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 210 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=9025, notReached=34687, spurious=388
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=41936, notReached=1776, spurious=388
3 operators are spurious because were not triggered
H^2 mutexes added fw: 1776, unreachable: 0
0 of 765 operators detected as spurious
Total mutex and disambiguation time: 0.049091 iterations: 2
888 of 888 mutex groups necessary.
765 of 768 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 765
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 95
888 of 888 mutex groups necessary.
765 of 765 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
95 variables of 95 of 95 necessary
The causal graph is not acyclic.
95 variables of 95 necessary
888 of 888 mutex groups necessary.
765 of 765 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 95
Preprocessor facts: 210
Preprocessor derived variables: 0
Preprocessor operators: 765
Preprocessor mutex groups: 888
Preprocessor task size: 6147
Writing output...
Preprocessor time: 0.0876686s
Preprocessor peak memory: 4060 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.000318836s]
Simplifying transitions... done!
done reading input! [t=0.0234213s]
building causal graph...done! [t=0.0242237s]
packing state variables...Variables: 95
Bytes per state: 16
done! [t=0.0243046s]
done initalizing global data [t=0.0243088s]
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() = 694
leader_operators.size() = 71
Initializing Symbolic Variables
Sym variable order: 1 16 13 50 38 62 56 73 5 20 44 32 26 12 48 30 54 42 24 3 18 66 60 36 25 37 49 69 4 43 31 61 19 55 11 2 22 80 46 40 64 7 52 34 28 58 39 27 33 45 6 63 51 77 57 21 15 53 35 41 84 65 8 59 47 23 29 14 17 9 10 74 70 81 92 78 71 89 68 86 79 94 0 88 93 75 72 85 67 87 90 76 91 83 82 
Num variables: 95 => 103
Initialize Symbolic Manager(206, 77669, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 56 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.013s
Starting Stackelberg bounded search...
 opt: 0.002 reg: 0 solved: 1 total time: 0.907598
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.907626
 opt: 0 reg: 0 solved: 1 total time: 0.910478
 opt: 0.001 reg: 0 solved: 1 total time: 0.91187
 opt: 0.001 reg: 0 solved: 1 total time: 0.913059
 opt: 0.001 reg: 0 solved: 1 total time: 0.915002
 opt: 0.001 reg: 0 solved: 1 total time: 0.917066
 opt: 0.004 reg: 0 solved: 2 total time: 0.921351
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.921404
 opt: 0.008 reg: 0 solved: 2 total time: 0.93198
 opt: 0.005 reg: 0 solved: 2 total time: 0.937502
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.937558
 opt: 0.002 reg: 0 solved: 1 total time: 0.943099
 opt: 0.005 reg: 0 solved: 2 total time: 0.948319
 opt: 0.007 reg: 0 solved: 3 total time: 0.95582
 opt: 0.007 reg: 0 solved: 4 total time: 0.96449
 opt: 0.007 reg: 0.001 solved: 3 total time: 0.973506
 opt: 0.007 reg: 0.002 solved: 3 total time: 0.983471
 opt: 0.016 reg: 0.005 solved: 4 total time: 1.00498
 opt: 0.011 reg: 0.002 solved: 4 total time: 1.01979
 opt: 0.008 reg: 0.012 solved: 4 total time: 1.0408
 opt: 0.008 reg: 0.012 solved: 5 total time: 1.06179
 opt: 0.011 reg: 0.003 solved: 4 total time: 1.07754
 opt: 0.011 reg: 0.005 solved: 4 total time: 1.09464
 opt: 0.014 reg: 0.006 solved: 5 total time: 1.11607
 opt: 0.015 reg: 0.004 solved: 5 total time: 1.1361
 opt: 0.006 reg: 0.012 solved: 5 total time: 1.15521
 opt: 0.011 reg: 0.02 solved: 5 total time: 1.18761
L = 3, leader states: 8192, follower subproblems: 8192, F:100000, total time: 1.18777
 opt: 0.007 reg: 0.021 solved: 3 total time: 1.22033
 opt: 0.016 reg: 0.002 solved: 4 total time: 1.23937
 opt: 0.012 reg: 0 solved: 4 total time: 1.25247
 opt: 0.005 reg: 0.001 solved: 2 total time: 1.25999
 opt: 0.018 reg: 0.002 solved: 5 total time: 1.28079
 opt: 0.012 reg: 0.005 solved: 4 total time: 1.29937
 opt: 0.014 reg: 0.012 solved: 3 total time: 1.32598
 opt: 0.007 reg: 0.012 solved: 3 total time: 1.34592
 opt: 0.013 reg: 0.004 solved: 5 total time: 1.36474
 opt: 0.014 reg: 0.01 solved: 4 total time: 1.3895
 opt: 0.015 reg: 0.009 solved: 4 total time: 1.41508
 opt: 0.012 reg: 0.01 solved: 5 total time: 1.43768
 opt: 0.012 reg: 0.005 solved: 5 total time: 1.45623
 opt: 0.011 reg: 0.018 solved: 5 total time: 1.48645
 opt: 0.011 reg: 0.017 solved: 5 total time: 1.51569
 opt: 0.012 reg: 0.021 solved: 5 total time: 1.55006
 opt: 0.015 reg: 0.02 solved: 5 total time: 1.58556
 opt: 0.01 reg: 0.011 solved: 4 total time: 1.60802
 opt: 0.01 reg: 0.001 solved: 4 total time: 1.62095
 opt: 0.018 reg: 0.002 solved: 5 total time: 1.64193
 opt: 0.017 reg: 0.004 solved: 5 total time: 1.66349
 opt: 0.012 reg: 0.005 solved: 4 total time: 1.68128
 opt: 0.016 reg: 0.006 solved: 4 total time: 1.70474
 opt: 0.01 reg: 0.007 solved: 5 total time: 1.72312
 opt: 0.013 reg: 0.005 solved: 5 total time: 1.74269
 opt: 0.022 reg: 0.01 solved: 5 total time: 1.77561
 opt: 0.013 reg: 0.006 solved: 5 total time: 1.7961
 opt: 0.011 reg: 0.004 solved: 5 total time: 1.81313
L = 4, leader states: 31250, follower subproblems: 31250, F:100000, total time: 1.81328
 opt: 0.017 reg: 0.015 solved: 5 total time: 1.85034
 opt: 0.006 reg: 0.016 solved: 2 total time: 1.87376
 opt: 0.014 reg: 0.005 solved: 3 total time: 1.89422
 opt: 0.015 reg: 0.006 solved: 4 total time: 1.91615
 opt: 0.016 reg: 0.01 solved: 4 total time: 1.94386
 opt: 0.013 reg: 0.012 solved: 5 total time: 1.96933
 opt: 0.015 reg: 0.009 solved: 3 total time: 1.99504
 opt: 0.014 reg: 0.018 solved: 4 total time: 2.02824
 opt: 0.015 reg: 0.016 solved: 5 total time: 2.0603
 opt: 0.015 reg: 0.004 solved: 4 total time: 2.08035
 opt: 0.016 reg: 0.005 solved: 5 total time: 2.10243
 opt: 0.027 reg: 0.016 solved: 5 total time: 2.14595
 opt: 0.017 reg: 0.01 solved: 5 total time: 2.1745
 opt: 0.037 reg: 0.011 solved: 5 total time: 2.22391
 opt: 0.025 reg: 0.013 solved: 4 total time: 2.26281
 opt: 0.025 reg: 0.018 solved: 4 total time: 2.3068
 opt: 0.031 reg: 0.023 solved: 5 total time: 2.36246
 opt: 0.014 solved: 2147483647 total time: 2.37758
L = 5, leader states: 93312, follower subproblems: 93312, F:2147483647, total time: 2.38727
Search time: 1.487s
Total number of leader states: 487287
Total number of follower subproblems: 302468
Pareto-frontier size: 1
Pareto-frontier: (5,2147483647) 
	 fix ops costs: 5, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s44 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s88 blaststepdone
				 fix_switch t2 s82 blaststepdone
				 fix_switch t2 s62 blaststepdone
				 fix_switch t2 s145 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s67 blaststepdone
				 fix_next-step t3 t4 blaststepdone
				 fix_last-step t4 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 71
Solved by optimal solver: 71
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 71
Solved follower subproblems: 71
Optimal solver time: 0.859s
Cost-bounded solver time: 0s
Follower search time: 0.859s
Total time: 2.39212s
Optimal engine:
Peak memory: 533836 KB
@@@T2937@@@
Done!
real 3.14
user 2.63
sys 0.37
