fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r483-smll-171624275500220
Last Updated
July 7, 2024

About the Execution of LTSMin for DLCround-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
416.544 791390.00 3126885.00 35.40 FFFFFFT?FFFFFF?? normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-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 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.7K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 13 13:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 13 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 13 13:20 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.3M 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-09b-LTLFireability-00
FORMULA_NAME DLCround-PT-09b-LTLFireability-01
FORMULA_NAME DLCround-PT-09b-LTLFireability-02
FORMULA_NAME DLCround-PT-09b-LTLFireability-03
FORMULA_NAME DLCround-PT-09b-LTLFireability-04
FORMULA_NAME DLCround-PT-09b-LTLFireability-05
FORMULA_NAME DLCround-PT-09b-LTLFireability-06
FORMULA_NAME DLCround-PT-09b-LTLFireability-07
FORMULA_NAME DLCround-PT-09b-LTLFireability-08
FORMULA_NAME DLCround-PT-09b-LTLFireability-09
FORMULA_NAME DLCround-PT-09b-LTLFireability-10
FORMULA_NAME DLCround-PT-09b-LTLFireability-11
FORMULA_NAME DLCround-PT-09b-LTLFireability-12
FORMULA_NAME DLCround-PT-09b-LTLFireability-13
FORMULA_NAME DLCround-PT-09b-LTLFireability-14
FORMULA_NAME DLCround-PT-09b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717217540341

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-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
FORMULA DLCround-PT-09b-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-09b-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-09b-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-09b-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-09b-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-09b-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-09b-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DLCround-PT-09b-LTLFireability-07
FORMULA DLCround-PT-09b-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-09b-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-09b-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-09b-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-09b-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DLCround-PT-09b-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DLCround-PT-09b-LTLFireability-14
Could not compute solution for formula : DLCround-PT-09b-LTLFireability-15

BK_STOP 1717218331731

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

mcc2024
ltl formula name DLCround-PT-09b-LTLFireability-00
ltl formula formula --ltl=/tmp/409/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.650 real 0.210 user 0.200 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 3496 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5445 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 ~51!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 187
pnml2lts-mc( 0/ 4): unique transitions count: 1345
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: 198
pnml2lts-mc( 0/ 4): - cum. max stack depth: 198
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 198 states 1376 transitions, fanout: 6.949
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.150 sec minimum, 0.150 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1320, Transitions per second: 9173
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 38.8 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5558 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-09b-LTLFireability-01
ltl formula formula --ltl=/tmp/409/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.660 real 0.180 user 0.220 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/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 3497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5445 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 ~140136 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~2458!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9971
pnml2lts-mc( 0/ 4): unique transitions count: 122188
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 3322
pnml2lts-mc( 0/ 4): - claim success count: 9984
pnml2lts-mc( 0/ 4): - cum. max stack depth: 9984
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9984 states 122227 transitions, fanout: 12.242
pnml2lts-mc( 0/ 4): Total exploration time 7.610 sec (7.610 sec minimum, 7.610 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1312, Transitions per second: 16061
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.9MB, 17.0 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 5558 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.9MB (~256.0MB paged-in)
ltl formula name DLCround-PT-09b-LTLFireability-02
ltl formula formula --ltl=/tmp/409/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.640 real 0.170 user 0.230 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 3497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5440 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 ~129!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 490
pnml2lts-mc( 0/ 4): unique transitions count: 5519
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: 500
pnml2lts-mc( 0/ 4): - cum. max stack depth: 500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 500 states 5546 transitions, fanout: 11.092
pnml2lts-mc( 0/ 4): Total exploration time 0.430 sec (0.420 sec minimum, 0.425 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1163, Transitions per second: 12898
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 38.4 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5558 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name DLCround-PT-09b-LTLFireability-03
ltl formula formula --ltl=/tmp/409/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.620 real 0.170 user 0.250 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_3_
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 3497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5452 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 ~43!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 161
pnml2lts-mc( 0/ 4): unique transitions count: 1208
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: 172
pnml2lts-mc( 0/ 4): - cum. max stack depth: 172
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 172 states 1239 transitions, fanout: 7.203
pnml2lts-mc( 0/ 4): Total exploration time 0.160 sec (0.160 sec minimum, 0.160 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1075, Transitions per second: 7744
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 38.1 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5558 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-09b-LTLFireability-04
ltl formula formula --ltl=/tmp/409/ltl_4_
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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.620 real 0.190 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/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 3497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5442 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 ~56!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 220
pnml2lts-mc( 0/ 4): unique transitions count: 1572
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: 230
pnml2lts-mc( 0/ 4): - cum. max stack depth: 230
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 230 states 1600 transitions, fanout: 6.957
pnml2lts-mc( 0/ 4): Total exploration time 0.190 sec (0.180 sec minimum, 0.183 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1211, Transitions per second: 8421
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.7 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5558 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-09b-LTLFireability-05
ltl formula formula --ltl=/tmp/409/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.620 real 0.200 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 3496 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5464 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 ~32!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 117
pnml2lts-mc( 0/ 4): unique transitions count: 758
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: 127
pnml2lts-mc( 0/ 4): - cum. max stack depth: 127
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 127 states 783 transitions, fanout: 6.165
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.100 sec minimum, 0.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1270, Transitions per second: 7830
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 35.1 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5558 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-09b-LTLFireability-06
ltl formula formula --ltl=/tmp/409/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.650 real 0.220 user 0.200 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 3496 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5462 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, 96.0 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5558 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-09b-LTLFireability-07
ltl formula formula --ltl=/tmp/409/ltl_7_
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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.650 real 0.180 user 0.220 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/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 3497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5442 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): ~2500 levels ~10000 states ~149344 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~307720 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~619808 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~1231012 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~2385956 transitions
ltl formula name DLCround-PT-09b-LTLFireability-08
ltl formula formula --ltl=/tmp/409/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.700 real 0.160 user 0.260 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_8_
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 3497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5450 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: 155
pnml2lts-mc( 0/ 4): unique transitions count: 1242
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: 164
pnml2lts-mc( 0/ 4): - cum. max stack depth: 164
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 164 states 1264 transitions, fanout: 7.707
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.140 sec minimum, 0.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1171, Transitions per second: 9029
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 38.0 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5558 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-09b-LTLFireability-09
ltl formula formula --ltl=/tmp/409/ltl_9_
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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.710 real 0.180 user 0.280 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 3496 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5443 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 ~978!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 3955
pnml2lts-mc( 0/ 4): unique transitions count: 51819
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 442
pnml2lts-mc( 0/ 4): - claim success count: 3965
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3965
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3965 states 51844 transitions, fanout: 13.075
pnml2lts-mc( 0/ 4): Total exploration time 3.340 sec (3.340 sec minimum, 3.340 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1187, Transitions per second: 15522
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.1MB, 23.5 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 5558 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.1MB (~256.0MB paged-in)
ltl formula name DLCround-PT-09b-LTLFireability-10
ltl formula formula --ltl=/tmp/409/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.190 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 3497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5441 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 ~138!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 541
pnml2lts-mc( 0/ 4): unique transitions count: 6628
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: 551
pnml2lts-mc( 0/ 4): - cum. max stack depth: 551
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 551 states 6656 transitions, fanout: 12.080
pnml2lts-mc( 0/ 4): Total exploration time 0.450 sec (0.440 sec minimum, 0.442 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1224, Transitions per second: 14791
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 29.9 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5558 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name DLCround-PT-09b-LTLFireability-11
ltl formula formula --ltl=/tmp/409/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.620 real 0.190 user 0.240 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/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 3497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5443 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: 225
pnml2lts-mc( 0/ 4): unique transitions count: 1907
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: 235
pnml2lts-mc( 0/ 4): - cum. max stack depth: 235
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 235 states 1941 transitions, fanout: 8.260
pnml2lts-mc( 0/ 4): Total exploration time 0.210 sec (0.200 sec minimum, 0.203 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1119, Transitions per second: 9243
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, 32.3 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5558 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-09b-LTLFireability-12
ltl formula formula --ltl=/tmp/409/ltl_12_
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.630 real 0.180 user 0.220 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_12_
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 3497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5442 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 ~109236 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~228572 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~423000 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~18722!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 74912
pnml2lts-mc( 0/ 4): unique transitions count: 1193321
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 66477
pnml2lts-mc( 0/ 4): - claim success count: 74921
pnml2lts-mc( 0/ 4): - cum. max stack depth: 74921
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 74921 states 1193343 transitions, fanout: 15.928
pnml2lts-mc( 0/ 4): Total exploration time 61.500 sec (61.500 sec minimum, 61.500 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1218, Transitions per second: 19404
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 12.0MB, 11.5 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 3.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 5558 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 12.0MB (~256.0MB paged-in)
ltl formula name DLCround-PT-09b-LTLFireability-13
ltl formula formula --ltl=/tmp/409/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_13_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.420 real 0.240 user 0.300 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/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 3497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5441 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 ~81!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 322
pnml2lts-mc( 0/ 4): unique transitions count: 3504
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: 330
pnml2lts-mc( 0/ 4): - cum. max stack depth: 330
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 330 states 3523 transitions, fanout: 10.676
pnml2lts-mc( 0/ 4): Total exploration time 0.270 sec (0.270 sec minimum, 0.270 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1222, Transitions per second: 13048
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, 31.4 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5558 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-09b-LTLFireability-14
ltl formula formula --ltl=/tmp/409/ltl_14_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.190 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 3496 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5466 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): ~2500 levels ~10000 states ~103020 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~360964 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~805912 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~742200 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~1554168 transitions
ltl formula name DLCround-PT-09b-LTLFireability-15
ltl formula formula --ltl=/tmp/409/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-mc( 0/ 4): Petri net DLCround-PT-09b analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.160 user 0.250 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/409/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/409/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/409/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/409/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 3497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3496, there are 5444 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): ~2500 levels ~10000 states ~119036 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~396828 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~910524 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~2070904 transitions
pnml2lts-mc( 2/ 4): ~40000 levels ~160000 states ~4418356 transitions

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-09b"
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-09b, 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-171624275500220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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