fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r195kn-qhx2-146444258700033
Last Updated
June 30, 2016

About the Execution of LTSMin for S_CircadianClock-PT-001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
144.270 2848.00 7908.00 39.80 FFFFFFFFFFFFFFFF 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 S_CircadianClock-PT-001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r195kn-qhx2-146444258700033
=====================================================================


--------------------
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-001000-LTLFireability-0
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-1
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-10
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-11
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-12
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-13
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-14
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-15
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-2
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-3
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-4
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-5
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-6
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-7
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-8
FORMULA_NAME CircadianClock-PT-001000-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1464855996575

FORMULA CircadianClock-PT-001000-LTLFireability-0 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-1 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-2 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-3 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-4 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-5 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-6 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-7 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-8 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-9 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING
FORMULA CircadianClock-PT-001000-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN STATIC_VARIABLE_REORDERING

BK_STOP 1464855999423

--------------------
content from stderr:

ltl formula name CircadianClock-PT-001000-LTLFireability-0
ltl formula formula --ltl=/tmp/ltl_0_
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( 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( 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.010 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_0_
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.020 user 0.010 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.030 sys
pnml2lts-mc( 0/ 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 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: 0
pnml2lts-mc( 0/ 4): unique states count: 6
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: 14
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14 states 55 transitions, fanout: 3.929
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: 1400, Transitions per second: 5500
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, 39.1 B/state, compr.: 63.1%
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: 1000
pnml2lts-mc( 1/ 4): max token count: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-LTLFireability-1
ltl formula formula --ltl=/tmp/ltl_1_
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( 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( 3/ 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.010 user 0.020 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_1_
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): buchi has 1 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 17 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 ~2!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 3
pnml2lts-mc( 0/ 4): unique transitions count: 10
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: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 28 transitions, fanout: 3.500
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, 53.0 B/state, compr.: 85.5%
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: 1000
pnml2lts-mc( 2/ 4): max token count: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-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( 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( 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( 3/ 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.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_2_
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 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.010 user 0.020 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( 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: 19
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: 11
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11 states 39 transitions, fanout: 3.545
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.002 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1100, 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, 40.5 B/state, compr.: 65.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: 1000
pnml2lts-mc( 2/ 4): max token count: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-LTLFireability-3
ltl formula formula --ltl=/tmp/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
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 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( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_3_
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.020 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.040 user 0.030 sys
pnml2lts-mc( 1/ 4): buchi has 1 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 17 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 ~2!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 4
pnml2lts-mc( 0/ 4): unique transitions count: 6
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: 9
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 28 transitions, fanout: 2.333
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: 2800
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, 56.0 B/state, compr.: 90.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( 3/ 4): max token count: 1000
pnml2lts-mc( 2/ 4): max token count: 1000
pnml2lts-mc( 1/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-LTLFireability-4
ltl formula formula --ltl=/tmp/ltl_4_
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( 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 model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
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( 3/ 4): LTL layer: formula: /tmp/ltl_4_
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 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.020 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 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 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: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 40
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: 16
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16 states 66 transitions, fanout: 4.125
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: 6600
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, 38.6 B/state, compr.: 62.2%
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: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 1/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-LTLFireability-5
ltl formula formula --ltl=/tmp/ltl_5_
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( 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( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.040 real 0.100 user 0.020 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.100 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_5_
pnml2lts-mc( 2/ 4): Loading Petri net took 0.040 real 0.100 user 0.020 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.040 real 0.100 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 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 ~4!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7
pnml2lts-mc( 0/ 4): unique transitions count: 27
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 45 transitions, fanout: 3.750
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: 1200, Transitions per second: 4500
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, 40.0 B/state, compr.: 64.5%
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: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 2/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-LTLFireability-6
ltl formula formula --ltl=/tmp/ltl_6_
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( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_6_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.020 user 0.020 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 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( 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: 5
pnml2lts-mc( 0/ 4): unique transitions count: 16
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: 11
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11 states 38 transitions, fanout: 3.455
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: 1100, 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, 48.7 B/state, compr.: 78.5%
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: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 2/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-LTLFireability-7
ltl formula formula --ltl=/tmp/ltl_7_
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( 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.000 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_7_
pnml2lts-mc( 1/ 4): Loading Petri net took 0.000 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.000 real 0.000 user 0.020 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.010 real 0.020 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( 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: 5
pnml2lts-mc( 0/ 4): unique transitions count: 19
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 46 transitions, fanout: 3.833
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: 4600
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, 43.0 B/state, compr.: 69.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( 2/ 4): max token count: 1000
pnml2lts-mc( 1/ 4): max token count: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-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( 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( 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( 0/ 4): LTL layer: formula: /tmp/ltl_8_
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.010 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.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 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( 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: 3
pnml2lts-mc( 0/ 4): unique transitions count: 8
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: 6
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6 states 18 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, 51.4 B/state, compr.: 82.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: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 1/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-LTLFireability-9
ltl formula formula --ltl=/tmp/ltl_9_
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( 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( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_9_
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.020 user 0.000 sys
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.020 user 0.000 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): buchi has 1 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 17 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 ~2!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 3
pnml2lts-mc( 0/ 4): unique transitions count: 10
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: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 28 transitions, fanout: 3.500
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: 800, Transitions per second: 2800
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, 53.0 B/state, compr.: 85.5%
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: 1000
pnml2lts-mc( 2/ 4): max token count: 1000
pnml2lts-mc( 1/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-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( 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( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.020 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_10_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.020 real 0.030 user 0.000 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.020 real 0.030 user 0.000 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( 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: 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: 9
pnml2lts-mc( 0/ 4): - cum. max stack depth: 9
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9 states 30 transitions, fanout: 3.333
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, 49.8 B/state, compr.: 80.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( 2/ 4): max token count: 1000
pnml2lts-mc( 1/ 4): max token count: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-LTLFireability-11
ltl formula formula --ltl=/tmp/ltl_11_
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( 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 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): Petri net model.pnml analyzed
pnml2lts-mc( 3/ 4): Loading Petri net took 0.020 real 0.050 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_11_
pnml2lts-mc( 1/ 4): Loading Petri net took 0.020 real 0.050 user 0.000 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.020 real 0.050 user 0.000 sys
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.050 user 0.000 sys
pnml2lts-mc( 3/ 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( 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: 5
pnml2lts-mc( 0/ 4): unique transitions count: 19
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 45 transitions, fanout: 3.750
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: 4500
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, 42.1 B/state, compr.: 68.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: 1000
pnml2lts-mc( 2/ 4): max token count: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-LTLFireability-12
ltl formula formula --ltl=/tmp/ltl_12_
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( 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 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( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_12_
pnml2lts-mc( 2/ 4): Loading Petri net took 0.010 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.000 user 0.020 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.010 real 0.000 user 0.030 sys
pnml2lts-mc( 0/ 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 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 ~4!
pnml2lts-mc( 1/ 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: 23
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: 13
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13 states 49 transitions, fanout: 3.769
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, 39.5 B/state, compr.: 63.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( 3/ 4): max token count: 1000
pnml2lts-mc( 2/ 4): max token count: 1000
pnml2lts-mc( 1/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-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( 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 model.pnml analyzed
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_13_
pnml2lts-mc( 1/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.010 real 0.010 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.020 user 0.010 sys
pnml2lts-mc( 3/ 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 28 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 ~9!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 19
pnml2lts-mc( 0/ 4): unique transitions count: 140
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 29
pnml2lts-mc( 0/ 4): - claim success count: 36
pnml2lts-mc( 0/ 4): - cum. max stack depth: 36
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 36 states 268 transitions, fanout: 7.444
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1200, Transitions per second: 8933
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.4 B/state, compr.: 50.7%
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: 1000
pnml2lts-mc( 2/ 4): max token count: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-LTLFireability-14
ltl formula formula --ltl=/tmp/ltl_14_
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( 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( 3/ 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): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_14_
pnml2lts-mc( 3/ 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( 2/ 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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 42
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: 16
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16 states 74 transitions, fanout: 4.625
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: 7400
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, 37.3 B/state, compr.: 60.2%
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: 1000
pnml2lts-mc( 2/ 4): max token count: 1000
pnml2lts-mc( 1/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000
ltl formula name CircadianClock-PT-001000-LTLFireability-15
ltl formula formula --ltl=/tmp/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
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 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( 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( 2/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 1/ 4): Loading Petri net took 0.020 real 0.040 user 0.010 sys
pnml2lts-mc( 3/ 4): Petri net model.pnml analyzed
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.040 user 0.010 sys
pnml2lts-mc( 2/ 4): Loading Petri net took 0.020 real 0.040 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_15_
pnml2lts-mc( 3/ 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 24 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: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 33
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: 14
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14 states 51 transitions, fanout: 3.643
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.8 B/state, compr.: 57.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( 2/ 4): max token count: 1000
pnml2lts-mc( 3/ 4): max token count: 1000
pnml2lts-mc( 1/ 4): max token count: 1000
pnml2lts-mc( 0/ 4): max token count: 1000

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="S_CircadianClock-PT-001000"
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/S_CircadianClock-PT-001000.tgz
mv S_CircadianClock-PT-001000 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 S_CircadianClock-PT-001000, 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 r195kn-qhx2-146444258700033"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;