Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r578-smll-171734921000164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsmin
Input is MedleyA-PT-21, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r578-smll-171734921000164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 70K Jun 2 16:33 model.pnml

--------------------
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 MedleyA-PT-21-LTLFireability-00
FORMULA_NAME MedleyA-PT-21-LTLFireability-01
FORMULA_NAME MedleyA-PT-21-LTLFireability-02
FORMULA_NAME MedleyA-PT-21-LTLFireability-03
FORMULA_NAME MedleyA-PT-21-LTLFireability-04
FORMULA_NAME MedleyA-PT-21-LTLFireability-05
FORMULA_NAME MedleyA-PT-21-LTLFireability-06
FORMULA_NAME MedleyA-PT-21-LTLFireability-07
FORMULA_NAME MedleyA-PT-21-LTLFireability-08
FORMULA_NAME MedleyA-PT-21-LTLFireability-09
FORMULA_NAME MedleyA-PT-21-LTLFireability-10
FORMULA_NAME MedleyA-PT-21-LTLFireability-11
FORMULA_NAME MedleyA-PT-21-LTLFireability-12
FORMULA_NAME MedleyA-PT-21-LTLFireability-13
FORMULA_NAME MedleyA-PT-21-LTLFireability-14
FORMULA_NAME MedleyA-PT-21-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717357546389

Invoking MCC driver with
BK_TOOL=ltsmin
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
FORMULA MedleyA-PT-21-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-21-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : MedleyA-PT-21-LTLFireability-14
FORMULA MedleyA-PT-21-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717357706722

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

mcc2024
ltl formula name MedleyA-PT-21-LTLFireability-00
ltl formula formula --ltl=/tmp/414/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 307 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 308 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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): Empty product with LTL!
pnml2lts-mc( 0/ 4):
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, 72.0 B/state, compr.: 5.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 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 (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-01
ltl formula formula --ltl=/tmp/414/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 307 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 316 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~94!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6074
pnml2lts-mc( 0/ 4): unique states count: 8494
pnml2lts-mc( 0/ 4): unique transitions count: 20456
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1604
pnml2lts-mc( 0/ 4): - claim found count: 1887
pnml2lts-mc( 0/ 4): - claim success count: 8538
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1205
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8538 states 20556 transitions, fanout: 2.408
pnml2lts-mc( 0/ 4): Total exploration time 0.130 sec (0.130 sec minimum, 0.130 sec on average)
pnml2lts-mc( 0/ 4): States per second: 65677, Transitions per second: 158123
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 17.4 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-02
ltl formula formula --ltl=/tmp/414/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_2_
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 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 302 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~19!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 66
pnml2lts-mc( 0/ 4): unique transitions count: 315
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: 75
pnml2lts-mc( 0/ 4): - cum. max stack depth: 75
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 75 states 338 transitions, fanout: 4.507
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: 7500, Transitions per second: 33800
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.5 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 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 (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-03
ltl formula formula --ltl=/tmp/414/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_3_
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 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 301 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~65!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 218
pnml2lts-mc( 0/ 4): unique transitions count: 1585
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: 227
pnml2lts-mc( 0/ 4): - cum. max stack depth: 227
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 227 states 1604 transitions, fanout: 7.066
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: 22700, Transitions per second: 160400
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, 22.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 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 (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-04
ltl formula formula --ltl=/tmp/414/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_4_
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 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 306 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4
pnml2lts-mc( 0/ 4): unique states count: 4
pnml2lts-mc( 0/ 4): unique transitions count: 3
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 13
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13 states 16 transitions, fanout: 1.231
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, 86.0 B/state, compr.: 7.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 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 (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-05
ltl formula formula --ltl=/tmp/414/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 307 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 306 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~18!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 76
pnml2lts-mc( 0/ 4): unique transitions count: 393
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: 86
pnml2lts-mc( 0/ 4): - cum. max stack depth: 86
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 86 states 419 transitions, fanout: 4.872
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, 28.7 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 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 (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-06
ltl formula formula --ltl=/tmp/414/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_6_
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 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 301 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~102!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5
pnml2lts-mc( 0/ 4): unique states count: 342
pnml2lts-mc( 0/ 4): unique transitions count: 2645
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 7
pnml2lts-mc( 0/ 4): - claim success count: 351
pnml2lts-mc( 0/ 4): - cum. max stack depth: 346
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 351 states 2668 transitions, fanout: 7.601
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 17550, Transitions per second: 133400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 20.1 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-07
ltl formula formula --ltl=/tmp/414/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_7_
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 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 301 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~117!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 424
pnml2lts-mc( 0/ 4): unique transitions count: 3255
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 12
pnml2lts-mc( 0/ 4): - claim success count: 433
pnml2lts-mc( 0/ 4): - cum. max stack depth: 433
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 433 states 3278 transitions, fanout: 7.570
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 21650, Transitions per second: 163900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 19.8 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-08
ltl formula formula --ltl=/tmp/414/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 307 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 312 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~22!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22
pnml2lts-mc( 0/ 4): unique states count: 97
pnml2lts-mc( 0/ 4): unique transitions count: 379
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: 106
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 106 states 398 transitions, fanout: 3.755
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: 10600, Transitions per second: 39800
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.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 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 (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-09
ltl formula formula --ltl=/tmp/414/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_9_
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 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 302 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~19!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 69
pnml2lts-mc( 0/ 4): unique transitions count: 326
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: 78
pnml2lts-mc( 0/ 4): - cum. max stack depth: 78
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 78 states 349 transitions, fanout: 4.474
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.4 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 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 (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-10
ltl formula formula --ltl=/tmp/414/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_10_
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 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 301 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~65!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 227
pnml2lts-mc( 0/ 4): unique transitions count: 1666
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: 234
pnml2lts-mc( 0/ 4): - cum. max stack depth: 234
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 234 states 1688 transitions, fanout: 7.214
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: 23400, Transitions per second: 168800
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.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 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 (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-11
ltl formula formula --ltl=/tmp/414/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_11_
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 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 302 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~132!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 455
pnml2lts-mc( 0/ 4): unique transitions count: 3269
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 20
pnml2lts-mc( 0/ 4): - claim success count: 467
pnml2lts-mc( 0/ 4): - cum. max stack depth: 467
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 467 states 3304 transitions, fanout: 7.075
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23350, Transitions per second: 165200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 20.5 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-12
ltl formula formula --ltl=/tmp/414/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_12_
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 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 300 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~23!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 70
pnml2lts-mc( 0/ 4): unique transitions count: 616
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: 79
pnml2lts-mc( 0/ 4): - cum. max stack depth: 79
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 79 states 650 transitions, fanout: 8.228
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: 7900, Transitions per second: 65000
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.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 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 (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-13
ltl formula formula --ltl=/tmp/414/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 307 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 305 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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 ~69!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 233
pnml2lts-mc( 0/ 4): unique transitions count: 1753
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: 245
pnml2lts-mc( 0/ 4): - cum. max stack depth: 245
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 245 states 1787 transitions, fanout: 7.294
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 12250, Transitions per second: 89350
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, 19.3 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 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 (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-14
ltl formula formula --ltl=/tmp/414/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 307 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 305 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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): ~432 levels ~10000 states ~36148 transitions
pnml2lts-mc( 2/ 4): ~434 levels ~20000 states ~78748 transitions
pnml2lts-mc( 2/ 4): ~442 levels ~40000 states ~147972 transitions
pnml2lts-mc( 2/ 4): ~443 levels ~80000 states ~297204 transitions
pnml2lts-mc( 2/ 4): ~443 levels ~160000 states ~674524 transitions
pnml2lts-mc( 1/ 4): ~1859 levels ~320000 states ~1288324 transitions
pnml2lts-mc( 2/ 4): ~443 levels ~640000 states ~2964088 transitions
pnml2lts-mc( 2/ 4): ~444 levels ~1280000 states ~5942136 transitions
pnml2lts-mc( 2/ 4): ~448 levels ~2560000 states ~13034644 transitions
pnml2lts-mc( 2/ 4): ~464 levels ~5120000 states ~28143476 transitions
pnml2lts-mc( 2/ 4): ~464 levels ~10240000 states ~56385204 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2389974
pnml2lts-mc( 0/ 4): unique states count: 17878493
pnml2lts-mc( 0/ 4): unique transitions count: 102355439
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 55344106
pnml2lts-mc( 0/ 4): - claim found count: 29087842
pnml2lts-mc( 0/ 4): - claim success count: 17878505
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28998
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 17878505 states 102355468 transitions, fanout: 5.725
pnml2lts-mc( 0/ 4): Total exploration time 157.770 sec (157.770 sec minimum, 157.770 sec on average)
pnml2lts-mc( 0/ 4): States per second: 113320, Transitions per second: 648764
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 200.6MB, 11.7 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 53.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 301 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 200.6MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-21-LTLFireability-15
ltl formula formula --ltl=/tmp/414/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 298 transitions and 700 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net MedleyA-PT-21 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/414/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/414/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/414/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/414/ltl_15_
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 308 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 307, there are 299 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 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): Empty product with LTL!
pnml2lts-mc( 0/ 4):
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, 72.0 B/state, compr.: 5.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 301 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 (~256.0MB paged-in)

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="MedleyA-PT-21"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsmin"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsmin"
echo " Input is MedleyA-PT-21, 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 r578-smll-171734921000164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-21.tgz
mv MedleyA-PT-21 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;