About the Execution of LTSMin for CircadianClock-PT-000001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 139.230 | 2765.00 | 5509.00 | 15.90 | FFFFFTFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-2979
Executing tool ltsmin
Input is CircadianClock-PT-000001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r015kn-qhx2-146347847100006
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-0
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-1
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-10
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-11
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-12
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-13
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-14
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-15
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-2
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-3
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-4
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-5
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-6
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-7
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-8
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-9
=== Now, execution of the tool begins
BK_START 1463515977482
FORMULA CircadianClock-PT-000001-LTLFireability-0 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-1 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-2 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-3 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-4 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-5 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-6 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-7 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-8 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-9 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-000001-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
BK_STOP 1463515980247
--------------------
content from stderr:
ltl formula name CircadianClock-PT-000001-LTLFireability-0
ltl formula formula --ltl=/tmp/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.030 user 0.010 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.020 real 0.030 user 0.010 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.020 real 0.030 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_0_
pnml2lts-mc( 1/ 4): Loading Petri net took 0.020 real 0.030 user 0.010 sys
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 19 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 11
pnml2lts-mc( 0/ 4): unique transitions count: 49
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 6
pnml2lts-mc( 0/ 4): - claim success count: 16
pnml2lts-mc( 0/ 4): - cum. max stack depth: 15
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16 states 71 transitions, fanout: 4.438
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.005 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1600, Transitions per second: 7100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 21.9 B/state, compr.: 35.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-1
ltl formula formula --ltl=/tmp/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_1_
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 19 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 5
pnml2lts-mc( 0/ 4): unique transitions count: 15
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 10
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10 states 37 transitions, fanout: 3.700
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 31.3 B/state, compr.: 50.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-2
ltl formula formula --ltl=/tmp/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_2_
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 35 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 5
pnml2lts-mc( 0/ 4): unique transitions count: 14
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 35 transitions, fanout: 2.917
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 34.7 B/state, compr.: 55.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-3
ltl formula formula --ltl=/tmp/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_3_
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 20 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~5!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 10
pnml2lts-mc( 0/ 4): unique transitions count: 30
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 16
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16 states 48 transitions, fanout: 3.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1600, Transitions per second: 4800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 26.3 B/state, compr.: 42.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-4
ltl formula formula --ltl=/tmp/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_4_
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.020 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 18 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 6
pnml2lts-mc( 0/ 4): unique transitions count: 12
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3
pnml2lts-mc( 0/ 4): - claim found count: 3
pnml2lts-mc( 0/ 4): - claim success count: 17
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17 states 39 transitions, fanout: 2.294
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1700, Transitions per second: 3900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 34.7 B/state, compr.: 55.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-5
ltl formula formula --ltl=/tmp/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_5_
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 real 0.040 user 0.000 sys
pnml2lts-mc( 2/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 18 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 5
pnml2lts-mc( 0/ 4): unique transitions count: 13
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 10
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10 states 29 transitions, fanout: 2.900
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 34.7 B/state, compr.: 55.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-6
ltl formula formula --ltl=/tmp/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_6_
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.020 real 0.040 user 0.010 sys
pnml2lts-mc( 1/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 23 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 5
pnml2lts-mc( 0/ 4): unique transitions count: 13
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 10
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10 states 29 transitions, fanout: 2.900
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 32.0 B/state, compr.: 51.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-7
ltl formula formula --ltl=/tmp/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_7_
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.040 user 0.010 sys
pnml2lts-mc( 1/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 36 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~5!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 12
pnml2lts-mc( 0/ 4): unique transitions count: 37
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 18
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18 states 56 transitions, fanout: 3.111
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1800, Transitions per second: 5600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 26.3 B/state, compr.: 42.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-8
ltl formula formula --ltl=/tmp/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_8_
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.020 real 0.040 user 0.010 sys
pnml2lts-mc( 1/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 22 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 24
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 17
pnml2lts-mc( 0/ 4): - cum. max stack depth: 15
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17 states 46 transitions, fanout: 2.706
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 29.1 B/state, compr.: 47.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-9
ltl formula formula --ltl=/tmp/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_9_
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.030 real 0.060 user 0.010 sys
pnml2lts-mc( 2/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 15 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 33 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~7!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 12
pnml2lts-mc( 0/ 4): unique transitions count: 39
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 26
pnml2lts-mc( 0/ 4): - cum. max stack depth: 26
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26 states 94 transitions, fanout: 3.615
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2600, Transitions per second: 9400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 23.2 B/state, compr.: 37.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-10
ltl formula formula --ltl=/tmp/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_10_
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.020 real 0.030 user 0.000 sys
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.040 real 0.060 user 0.000 sys
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 22 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~6!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 24
pnml2lts-mc( 0/ 4): unique transitions count: 126
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 16
pnml2lts-mc( 0/ 4): - claim success count: 29
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 29 states 154 transitions, fanout: 5.310
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2900, Transitions per second: 15400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 17.2 B/state, compr.: 27.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-11
ltl formula formula --ltl=/tmp/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.060 real 0.100 user 0.010 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.060 real 0.100 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_11_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.110 user 0.010 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.060 real 0.110 user 0.010 sys
pnml2lts-mc( 1/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 15 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 31 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 6
pnml2lts-mc( 0/ 4): unique transitions count: 20
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 3
pnml2lts-mc( 0/ 4): - claim success count: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 39 transitions, fanout: 3.250
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 30.8 B/state, compr.: 49.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-12
ltl formula formula --ltl=/tmp/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.430 user 0.000 sys
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_12_
pnml2lts-mc( 1/ 4): Loading Petri net took 0.160 real 0.440 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.160 real 0.440 user 0.000 sys
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.160 real 0.440 user 0.000 sys
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 19 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 4
pnml2lts-mc( 0/ 4): unique transitions count: 12
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 43 transitions, fanout: 3.583
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1200, Transitions per second: 4300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 31.2 B/state, compr.: 50.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-13
ltl formula formula --ltl=/tmp/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_13_
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.020 real 0.030 user 0.010 sys
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.030 real 0.040 user 0.010 sys
pnml2lts-mc( 1/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 18 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 88.0 B/state, compr.: 141.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-14
ltl formula formula --ltl=/tmp/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_14_
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.030 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 20 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 5
pnml2lts-mc( 0/ 4): unique transitions count: 14
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 10
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10 states 30 transitions, fanout: 3.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 35.6 B/state, compr.: 57.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
ltl formula name CircadianClock-PT-000001-LTLFireability-15
ltl formula formula --ltl=/tmp/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 1/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 1/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 2/ 4): There are 0 safe places
pnml2lts-mc( 3/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 3/ 4): There are 0 safe places
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net has 14 places, 16 transitions and 58 arcs
pnml2lts-mc( 0/ 4): There are 0 safe places
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_15_
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.030 user 0.010 sys
pnml2lts-mc( 2/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 16 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 15, there are 18 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 4
pnml2lts-mc( 0/ 4): unique transitions count: 12
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2
pnml2lts-mc( 0/ 4): - claim success count: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 38 transitions, fanout: 3.167
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1200, Transitions per second: 3800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 35.2 B/state, compr.: 56.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 21 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
pnml2lts-mc( 1/ 4): max token count: 1
pnml2lts-mc( 2/ 4): max token count: 1
pnml2lts-mc( 3/ 4): max token count: 1
pnml2lts-mc( 0/ 4): max token count: 1
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircadianClock-PT-000001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsmin"
export BK_RESULT_DIR="/home/fko/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000001.tgz
mv CircadianClock-PT-000001 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool ltsmin"
echo " Input is CircadianClock-PT-000001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r015kn-qhx2-146347847100006"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;