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.r463-smll-171620117700028.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 ASLink-PT-02a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r463-smll-171620117700028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 279K May 18 16:42 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 ASLink-PT-02a-LTLFireability-00
FORMULA_NAME ASLink-PT-02a-LTLFireability-01
FORMULA_NAME ASLink-PT-02a-LTLFireability-02
FORMULA_NAME ASLink-PT-02a-LTLFireability-03
FORMULA_NAME ASLink-PT-02a-LTLFireability-04
FORMULA_NAME ASLink-PT-02a-LTLFireability-05
FORMULA_NAME ASLink-PT-02a-LTLFireability-06
FORMULA_NAME ASLink-PT-02a-LTLFireability-07
FORMULA_NAME ASLink-PT-02a-LTLFireability-08
FORMULA_NAME ASLink-PT-02a-LTLFireability-09
FORMULA_NAME ASLink-PT-02a-LTLFireability-10
FORMULA_NAME ASLink-PT-02a-LTLFireability-11
FORMULA_NAME ASLink-PT-02a-LTLFireability-12
FORMULA_NAME ASLink-PT-02a-LTLFireability-13
FORMULA_NAME ASLink-PT-02a-LTLFireability-14
FORMULA_NAME ASLink-PT-02a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717192444388

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

BK_STOP 1717193563597

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

mcc2024
ltl formula name ASLink-PT-02a-LTLFireability-00
ltl formula formula --ltl=/tmp/413/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 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.050 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 627 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1034 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): ~218 levels ~10000 states ~40272 transitions
pnml2lts-mc( 3/ 4): ~207 levels ~20000 states ~84328 transitions
pnml2lts-mc( 3/ 4): ~207 levels ~40000 states ~177148 transitions
pnml2lts-mc( 3/ 4): ~207 levels ~80000 states ~401212 transitions
pnml2lts-mc( 3/ 4): ~207 levels ~160000 states ~852572 transitions
pnml2lts-mc( 3/ 4): ~207 levels ~320000 states ~1729284 transitions
pnml2lts-mc( 3/ 4): ~207 levels ~640000 states ~3339132 transitions
pnml2lts-mc( 3/ 4): ~207 levels ~1280000 states ~7069200 transitions
pnml2lts-mc( 2/ 4): ~1919 levels ~2560000 states ~13131220 transitions
pnml2lts-mc( 0/ 4): ~218 levels ~5120000 states ~23025672 transitions
ltl formula name ASLink-PT-02a-LTLFireability-01
ltl formula formula --ltl=/tmp/413/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.040 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_1_
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 628 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1014 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 ~107!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 319
pnml2lts-mc( 0/ 4): unique transitions count: 1110
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 324
pnml2lts-mc( 0/ 4): - cum. max stack depth: 324
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 324 states 1165 transitions, fanout: 3.596
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.010 sec minimum, 0.025 sec on average)
pnml2lts-mc( 0/ 4): States per second: 10800, Transitions per second: 38833
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, 27.8 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1038 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 ASLink-PT-02a-LTLFireability-02
ltl formula formula --ltl=/tmp/413/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.040 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/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 628 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1011 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): ~153 levels ~10000 states ~35496 transitions
pnml2lts-mc( 1/ 4): ~160 levels ~20000 states ~68032 transitions
pnml2lts-mc( 1/ 4): ~160 levels ~40000 states ~144556 transitions
pnml2lts-mc( 1/ 4): ~160 levels ~80000 states ~294656 transitions
pnml2lts-mc( 1/ 4): ~160 levels ~160000 states ~621256 transitions
pnml2lts-mc( 1/ 4): ~177 levels ~320000 states ~1384612 transitions
pnml2lts-mc( 1/ 4): ~177 levels ~640000 states ~3071780 transitions
pnml2lts-mc( 2/ 4): ~3570 levels ~1280000 states ~4422260 transitions
pnml2lts-mc( 2/ 4): ~3591 levels ~2560000 states ~9482012 transitions
pnml2lts-mc( 0/ 4): ~239 levels ~5120000 states ~23598504 transitions
ltl formula name ASLink-PT-02a-LTLFireability-03
ltl formula formula --ltl=/tmp/413/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 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_3_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.020 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 627 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1039 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 ~21!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 53
pnml2lts-mc( 0/ 4): unique transitions count: 275
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 59
pnml2lts-mc( 0/ 4): - cum. max stack depth: 59
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 59 states 327 transitions, fanout: 5.542
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 31.7 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1038 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 ASLink-PT-02a-LTLFireability-04
ltl formula formula --ltl=/tmp/413/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 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.040 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_4_
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 628 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1011 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): ~47 levels ~10000 states ~37784 transitions
pnml2lts-mc( 0/ 4): ~47 levels ~20000 states ~85832 transitions
pnml2lts-mc( 2/ 4): ~2598 levels ~40000 states ~93808 transitions
pnml2lts-mc( 2/ 4): ~3261 levels ~80000 states ~205572 transitions
pnml2lts-mc( 2/ 4): ~6340 levels ~160000 states ~410876 transitions
pnml2lts-mc( 1/ 4): ~120 levels ~320000 states ~1361940 transitions
pnml2lts-mc( 1/ 4): ~139 levels ~640000 states ~2743536 transitions
pnml2lts-mc( 1/ 4): ~158 levels ~1280000 states ~5570220 transitions
pnml2lts-mc( 1/ 4): ~196 levels ~2560000 states ~10944748 transitions
pnml2lts-mc( 1/ 4): ~196 levels ~5120000 states ~23277508 transitions
ltl formula name ASLink-PT-02a-LTLFireability-05
ltl formula formula --ltl=/tmp/413/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.040 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 628 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1014 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 ~24!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 41
pnml2lts-mc( 0/ 4): unique transitions count: 169
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 45
pnml2lts-mc( 0/ 4): - cum. max stack depth: 45
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 45 states 206 transitions, fanout: 4.578
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: 4500, Transitions per second: 20600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 32.4 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1038 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 ASLink-PT-02a-LTLFireability-06
ltl formula formula --ltl=/tmp/413/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 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.030 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/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 628 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1012 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 ~24!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 62
pnml2lts-mc( 0/ 4): unique transitions count: 384
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 68
pnml2lts-mc( 0/ 4): - cum. max stack depth: 68
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 68 states 436 transitions, fanout: 6.412
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: 6800, Transitions per second: 43600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 29.1 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1038 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 ASLink-PT-02a-LTLFireability-07
ltl formula formula --ltl=/tmp/413/ltl_7_
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 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.040 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/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 628 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1010 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 ~34!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 127
pnml2lts-mc( 0/ 4): unique transitions count: 548
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 134
pnml2lts-mc( 0/ 4): - cum. max stack depth: 134
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 134 states 612 transitions, fanout: 4.567
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: 13400, Transitions per second: 61200
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.0 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1038 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 ASLink-PT-02a-LTLFireability-08
ltl formula formula --ltl=/tmp/413/ltl_8_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_8_
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 628 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1012 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): ~58 levels ~10000 states ~41352 transitions
pnml2lts-mc( 3/ 4): ~58 levels ~20000 states ~85944 transitions
pnml2lts-mc( 0/ 4): ~1250 levels ~40000 states ~109564 transitions
pnml2lts-mc( 0/ 4): ~1265 levels ~80000 states ~223800 transitions
pnml2lts-mc( 0/ 4): ~1265 levels ~160000 states ~488984 transitions
pnml2lts-mc( 0/ 4): ~3274 levels ~320000 states ~1005236 transitions
pnml2lts-mc( 0/ 4): ~7003 levels ~640000 states ~1958704 transitions
pnml2lts-mc( 0/ 4): ~10714 levels ~1280000 states ~4010940 transitions
pnml2lts-mc( 0/ 4): ~24857 levels ~2560000 states ~8104300 transitions
pnml2lts-mc( 0/ 4): ~40291 levels ~5120000 states ~19379632 transitions
ltl formula name ASLink-PT-02a-LTLFireability-09
ltl formula formula --ltl=/tmp/413/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
pnml2lts-mc( 0/ 4): Petri net has 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
Warning: program compiled against libxml 210 using older 209
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.440 real 0.040 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 627 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1025 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): ~112 levels ~10000 states ~32448 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~20000 states ~67200 transitions
pnml2lts-mc( 1/ 4): ~112 levels ~40000 states ~136152 transitions
pnml2lts-mc( 1/ 4): ~131 levels ~80000 states ~273908 transitions
pnml2lts-mc( 1/ 4): ~150 levels ~160000 states ~557040 transitions
pnml2lts-mc( 1/ 4): ~169 levels ~320000 states ~1133588 transitions
pnml2lts-mc( 1/ 4): ~188 levels ~640000 states ~2295084 transitions
pnml2lts-mc( 1/ 4): ~207 levels ~1280000 states ~4648220 transitions
pnml2lts-mc( 1/ 4): ~207 levels ~2560000 states ~9386652 transitions
pnml2lts-mc( 1/ 4): ~221 levels ~5120000 states ~18951416 transitions
ltl formula name ASLink-PT-02a-LTLFireability-10
ltl formula formula --ltl=/tmp/413/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.040 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 627 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1021 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 ~42!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 164
pnml2lts-mc( 0/ 4): unique transitions count: 818
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 172
pnml2lts-mc( 0/ 4): - cum. max stack depth: 172
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 172 states 896 transitions, fanout: 5.209
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: 8600, Transitions per second: 44800
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, 27.7 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1038 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 ASLink-PT-02a-LTLFireability-11
ltl formula formula --ltl=/tmp/413/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.050 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 627 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1015 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 ~303!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 446
pnml2lts-mc( 0/ 4): unique states count: 1388
pnml2lts-mc( 0/ 4): unique transitions count: 3413
pnml2lts-mc( 0/ 4): - self-loop count: 21
pnml2lts-mc( 0/ 4): - claim dead count: 501
pnml2lts-mc( 0/ 4): - claim found count: 103
pnml2lts-mc( 0/ 4): - claim success count: 1394
pnml2lts-mc( 0/ 4): - cum. max stack depth: 979
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1394 states 3465 transitions, fanout: 2.486
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 27880, Transitions per second: 69300
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, 21.8 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1038 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 ASLink-PT-02a-LTLFireability-12
ltl formula formula --ltl=/tmp/413/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 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.020 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 627 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1016 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 ~33!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 115
pnml2lts-mc( 0/ 4): unique transitions count: 553
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 122
pnml2lts-mc( 0/ 4): - cum. max stack depth: 122
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 122 states 616 transitions, fanout: 5.049
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: 12200, Transitions per second: 61600
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.5 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1038 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 ASLink-PT-02a-LTLFireability-13
ltl formula formula --ltl=/tmp/413/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 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.040 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_13_
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 628 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1010 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: 2
pnml2lts-mc( 0/ 4): unique states count: 2
pnml2lts-mc( 0/ 4): unique transitions count: 1
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: 8
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8 states 8 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, 272.0 B/state, compr.: 10.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1038 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 ASLink-PT-02a-LTLFireability-14
ltl formula formula --ltl=/tmp/413/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 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_14_
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 628 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1011 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 ~39!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 145
pnml2lts-mc( 0/ 4): unique transitions count: 595
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: 151
pnml2lts-mc( 0/ 4): - cum. max stack depth: 151
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 151 states 647 transitions, fanout: 4.285
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: 15100, Transitions per second: 64700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 32.1 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1038 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 ASLink-PT-02a-LTLFireability-15
ltl formula formula --ltl=/tmp/413/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 626 places, 1008 transitions and 3820 arcs
pnml2lts-mc( 0/ 4): Petri net ASLink-PT-02a analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.040 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_15_
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 628 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 627, there are 1014 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 ~58!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16
pnml2lts-mc( 0/ 4): unique states count: 231
pnml2lts-mc( 0/ 4): unique transitions count: 839
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 4
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 238
pnml2lts-mc( 0/ 4): - cum. max stack depth: 222
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 238 states 900 transitions, fanout: 3.782
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: 11900, Transitions per second: 45000
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, 33.2 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1038 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="ASLink-PT-02a"
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 ASLink-PT-02a, 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 r463-smll-171620117700028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 ;