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.r483-smll-171624275600252.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 DLCround-PT-11b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r483-smll-171624275600252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 13 12:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 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 1.7M 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 DLCround-PT-11b-LTLFireability-00
FORMULA_NAME DLCround-PT-11b-LTLFireability-01
FORMULA_NAME DLCround-PT-11b-LTLFireability-02
FORMULA_NAME DLCround-PT-11b-LTLFireability-03
FORMULA_NAME DLCround-PT-11b-LTLFireability-04
FORMULA_NAME DLCround-PT-11b-LTLFireability-05
FORMULA_NAME DLCround-PT-11b-LTLFireability-06
FORMULA_NAME DLCround-PT-11b-LTLFireability-07
FORMULA_NAME DLCround-PT-11b-LTLFireability-08
FORMULA_NAME DLCround-PT-11b-LTLFireability-09
FORMULA_NAME DLCround-PT-11b-LTLFireability-10
FORMULA_NAME DLCround-PT-11b-LTLFireability-11
FORMULA_NAME DLCround-PT-11b-LTLFireability-12
FORMULA_NAME DLCround-PT-11b-LTLFireability-13
FORMULA_NAME DLCround-PT-11b-LTLFireability-14
FORMULA_NAME DLCround-PT-11b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717220291238

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

BK_STOP 1717221074068

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

mcc2024
ltl formula name DLCround-PT-11b-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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.270 user 0.270 sys
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): LTL layer: formula: /tmp/413/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 4376 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 6998 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: 788
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: 155
pnml2lts-mc( 0/ 4): - cum. max stack depth: 155
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 155 states 813 transitions, fanout: 5.245
pnml2lts-mc( 0/ 4): Total exploration time 0.310 sec (0.300 sec minimum, 0.305 sec on average)
pnml2lts-mc( 0/ 4): States per second: 500, Transitions per second: 2623
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, 41.2 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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 DLCround-PT-11b-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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.820 real 0.230 user 0.280 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_1_
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): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 4377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 6996 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 ~73!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 284
pnml2lts-mc( 0/ 4): unique transitions count: 2866
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: 294
pnml2lts-mc( 0/ 4): - cum. max stack depth: 294
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 294 states 2895 transitions, fanout: 9.847
pnml2lts-mc( 0/ 4): Total exploration time 0.580 sec (0.570 sec minimum, 0.575 sec on average)
pnml2lts-mc( 0/ 4): States per second: 507, Transitions per second: 4991
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, 30.2 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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 DLCround-PT-11b-LTLFireability-02
ltl formula formula --ltl=/tmp/413/ltl_2_
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.210 user 0.300 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_2_
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 4377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 6997 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 ~71!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 269
pnml2lts-mc( 0/ 4): unique transitions count: 2302
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: 279
pnml2lts-mc( 0/ 4): - cum. max stack depth: 279
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 279 states 2330 transitions, fanout: 8.351
pnml2lts-mc( 0/ 4): Total exploration time 0.560 sec (0.550 sec minimum, 0.558 sec on average)
pnml2lts-mc( 0/ 4): States per second: 498, Transitions per second: 4161
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, 45.5 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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 DLCround-PT-11b-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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.200 user 0.310 sys
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): LTL layer: formula: /tmp/413/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 4376 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 6997 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): ~2500 levels ~10000 states ~164572 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~4661!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 18377
pnml2lts-mc( 0/ 4): unique transitions count: 232649
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 12482
pnml2lts-mc( 0/ 4): - claim success count: 18385
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18385
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18385 states 232668 transitions, fanout: 12.655
pnml2lts-mc( 0/ 4): Total exploration time 35.500 sec (35.480 sec minimum, 35.493 sec on average)
pnml2lts-mc( 0/ 4): States per second: 518, Transitions per second: 6554
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.5MB, 17.1 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 7110 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.5MB (~256.0MB paged-in)
ltl formula name DLCround-PT-11b-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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.220 user 0.290 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 5 states
pnml2lts-mc( 0/ 4): There are 4376 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 7014 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 ~85!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 335
pnml2lts-mc( 0/ 4): unique transitions count: 2958
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: 344
pnml2lts-mc( 0/ 4): - cum. max stack depth: 344
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 344 states 2983 transitions, fanout: 8.672
pnml2lts-mc( 0/ 4): Total exploration time 0.680 sec (0.670 sec minimum, 0.673 sec on average)
pnml2lts-mc( 0/ 4): States per second: 506, Transitions per second: 4387
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, 35.4 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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 DLCround-PT-11b-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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.230 user 0.300 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 4377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 7007 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): ~1252 levels ~10000 states ~195016 transitions
pnml2lts-mc( 1/ 4): ~2502 levels ~20000 states ~389596 transitions
pnml2lts-mc( 1/ 4): ~5002 levels ~40000 states ~781636 transitions
pnml2lts-mc( 1/ 4): ~10002 levels ~80000 states ~1507024 transitions
ltl formula name DLCround-PT-11b-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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.880 real 0.220 user 0.300 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_6_
pnml2lts-mc( 0/ 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 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 4377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 7004 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, 104.0 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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 DLCround-PT-11b-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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.810 real 0.260 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_7_
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 4377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 6996 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.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 400, Transitions per second: 400
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, 104.0 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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 DLCround-PT-11b-LTLFireability-08
ltl formula formula --ltl=/tmp/413/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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.250 user 0.260 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_8_
pnml2lts-mc( 0/ 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 4377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 6997 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 ~82!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 317
pnml2lts-mc( 0/ 4): unique transitions count: 2597
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: 325
pnml2lts-mc( 0/ 4): - cum. max stack depth: 325
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 325 states 2616 transitions, fanout: 8.049
pnml2lts-mc( 0/ 4): Total exploration time 0.650 sec (0.630 sec minimum, 0.645 sec on average)
pnml2lts-mc( 0/ 4): States per second: 500, Transitions per second: 4025
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, 41.4 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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 DLCround-PT-11b-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
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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.790 real 0.200 user 0.300 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_9_
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 4377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 7000 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 ~29!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 105
pnml2lts-mc( 0/ 4): unique transitions count: 694
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: 116
pnml2lts-mc( 0/ 4): - cum. max stack depth: 116
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 116 states 724 transitions, fanout: 6.241
pnml2lts-mc( 0/ 4): Total exploration time 0.210 sec (0.210 sec minimum, 0.210 sec on average)
pnml2lts-mc( 0/ 4): States per second: 552, Transitions per second: 3448
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 42.5 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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 DLCround-PT-11b-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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.580 real 0.290 user 0.310 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_10_
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 4377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 7000 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 ~66!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 256
pnml2lts-mc( 0/ 4): unique transitions count: 2187
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: 267
pnml2lts-mc( 0/ 4): - cum. max stack depth: 267
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 267 states 2220 transitions, fanout: 8.315
pnml2lts-mc( 0/ 4): Total exploration time 0.520 sec (0.520 sec minimum, 0.520 sec on average)
pnml2lts-mc( 0/ 4): States per second: 513, Transitions per second: 4269
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, 40.1 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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 DLCround-PT-11b-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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.780 real 0.210 user 0.280 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/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 4377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 6997 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): ~2500 levels ~10000 states ~211408 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~643176 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~1342240 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~2588520 transitions
ltl formula name DLCround-PT-11b-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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.910 real 0.230 user 0.280 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 4376 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 6995 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 ~59!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 242
pnml2lts-mc( 0/ 4): unique transitions count: 2114
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: 250
pnml2lts-mc( 0/ 4): - cum. max stack depth: 250
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 250 states 2133 transitions, fanout: 8.532
pnml2lts-mc( 0/ 4): Total exploration time 0.520 sec (0.510 sec minimum, 0.517 sec on average)
pnml2lts-mc( 0/ 4): States per second: 481, Transitions per second: 4102
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, 37.4 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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 DLCround-PT-11b-LTLFireability-13
ltl formula formula --ltl=/tmp/413/ltl_13_
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.760 real 0.250 user 0.270 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_13_
pnml2lts-mc( 3/ 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 4377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 6994 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): ~2500 levels ~10000 states ~120004 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~295604 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~582124 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~1236932 transitions
ltl formula name DLCround-PT-11b-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 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_14_
pnml2lts-mc( 0/ 4): Loading Petri net took 1.970 real 0.240 user 0.430 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_14_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 4377 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 6994 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 ~44!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 194
pnml2lts-mc( 0/ 4): unique transitions count: 1830
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: 202
pnml2lts-mc( 0/ 4): - cum. max stack depth: 202
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 202 states 1853 transitions, fanout: 9.173
pnml2lts-mc( 0/ 4): Total exploration time 0.530 sec (0.520 sec minimum, 0.525 sec on average)
pnml2lts-mc( 0/ 4): States per second: 381, Transitions per second: 3496
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, 34.3 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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 DLCround-PT-11b-LTLFireability-15
ltl formula formula --ltl=/tmp/413/ltl_15_
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 4375 places, 6991 transitions and 19673 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-11b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.770 real 0.220 user 0.270 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_15_
pnml2lts-mc( 3/ 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 4 states
pnml2lts-mc( 0/ 4): There are 4376 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 4376, there are 6998 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 ~39!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 149
pnml2lts-mc( 0/ 4): unique transitions count: 1129
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: 158
pnml2lts-mc( 0/ 4): - cum. max stack depth: 158
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 158 states 1151 transitions, fanout: 7.285
pnml2lts-mc( 0/ 4): Total exploration time 0.320 sec (0.320 sec minimum, 0.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 494, Transitions per second: 3597
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, 41.6 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 7110 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="DLCround-PT-11b"
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 DLCround-PT-11b, 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 r483-smll-171624275600252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-11b.tgz
mv DLCround-PT-11b 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 ;