About the Execution of LTSMin for PermAdmissibility-PT-50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 182.151 | 264961.00 | 1052862.00 | 48.10 | ????????TTFFFFFF | 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.r511-smll-171654407100196.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 PermAdmissibility-PT-50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r511-smll-171654407100196
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 9.3K Apr 12 09:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 09:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 12 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 296K Apr 12 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 98K Apr 12 09:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 12 09:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 340K May 18 16:43 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 PermAdmissibility-PT-50-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717250500230
Invoking MCC driver with
BK_TOOL=ltsmin
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Could not compute solution for formula : PermAdmissibility-PT-50-LTLFireability-00
Could not compute solution for formula : PermAdmissibility-PT-50-LTLFireability-01
Could not compute solution for formula : PermAdmissibility-PT-50-LTLFireability-02
Could not compute solution for formula : PermAdmissibility-PT-50-LTLFireability-03
Could not compute solution for formula : PermAdmissibility-PT-50-LTLFireability-04
Could not compute solution for formula : PermAdmissibility-PT-50-LTLFireability-05
Could not compute solution for formula : PermAdmissibility-PT-50-LTLFireability-06
Could not compute solution for formula : PermAdmissibility-PT-50-LTLFireability-07
FORMULA PermAdmissibility-PT-50-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-PT-50-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-PT-50-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-PT-50-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-PT-50-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-PT-50-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-PT-50-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PermAdmissibility-PT-50-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717250765191
--------------------
content from stderr:
mcc2024
ltl formula name PermAdmissibility-PT-50-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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.020 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PermAdmissibility-PT-50-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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.030 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_1_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name PermAdmissibility-PT-50-LTLFireability-02
ltl formula formula --ltl=/tmp/413/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.020 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_2_
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 106 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 612 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): ~312 levels ~10000 states ~17608 transitions
pnml2lts-mc( 0/ 4): ~312 levels ~20000 states ~29344 transitions
pnml2lts-mc( 0/ 4): ~312 levels ~40000 states ~52712 transitions
pnml2lts-mc( 0/ 4): ~312 levels ~80000 states ~103260 transitions
pnml2lts-mc( 3/ 4): ~312 levels ~160000 states ~248884 transitions
pnml2lts-mc( 3/ 4): ~312 levels ~320000 states ~503860 transitions
pnml2lts-mc( 3/ 4): ~312 levels ~640000 states ~1023304 transitions
pnml2lts-mc( 3/ 4): ~312 levels ~1280000 states ~2074108 transitions
pnml2lts-mc( 3/ 4): ~312 levels ~2560000 states ~4197984 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3014281
pnml2lts-mc( 0/ 4): unique states count: 3015424
pnml2lts-mc( 0/ 4): unique transitions count: 4223860
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1201037
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 3015427
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1248
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3015427 states 4223874 transitions, fanout: 1.401
pnml2lts-mc( 0/ 4): Total exploration time 33.520 sec (33.450 sec minimum, 33.482 sec on average)
pnml2lts-mc( 0/ 4): States per second: 89959, Transitions per second: 126011
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 87.1MB, 30.2 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 9.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 601 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 87.1MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-50-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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PermAdmissibility-PT-50-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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_4_
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), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PermAdmissibility-PT-50-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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_5_
pnml2lts-mc( 0/ 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 2 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 626 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): ~801 levels ~10000 states ~37912 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~20000 states ~51544 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~40000 states ~92860 transitions
pnml2lts-mc( 1/ 4): ~801 levels ~80000 states ~229176 transitions
pnml2lts-mc( 1/ 4): ~801 levels ~160000 states ~512000 transitions
pnml2lts-mc( 1/ 4): ~801 levels ~320000 states ~1142808 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~640000 states ~1641192 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~1280000 states ~3228452 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~2560000 states ~6525924 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~5120000 states ~14231112 transitions
pnml2lts-mc( 0/ 4): ~801 levels ~10240000 states ~27690012 transitions
ltl formula name PermAdmissibility-PT-50-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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 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( 3/ 4): LTL layer: formula: /tmp/413/ltl_6_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PermAdmissibility-PT-50-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
pnml2lts-mc( 0/ 4): Petri net has 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_7_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.020 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_7_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
ltl formula name PermAdmissibility-PT-50-LTLFireability-08
ltl formula formula --ltl=/tmp/413/ltl_8_
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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.030 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_8_
pnml2lts-mc( 2/ 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 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 106 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 599 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): ~52 levels ~10000 states ~16236 transitions
pnml2lts-mc( 3/ 4): ~52 levels ~20000 states ~32156 transitions
pnml2lts-mc( 3/ 4): ~52 levels ~40000 states ~63756 transitions
pnml2lts-mc( 1/ 4): ~52 levels ~80000 states ~126664 transitions
pnml2lts-mc( 3/ 4): ~52 levels ~160000 states ~260036 transitions
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: 227222
pnml2lts-mc( 0/ 4): unique states count: 227222
pnml2lts-mc( 0/ 4): unique transitions count: 353396
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 158168
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 245016
pnml2lts-mc( 0/ 4): - cum. max stack depth: 208
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 245016 states 409200 transitions, fanout: 1.670
pnml2lts-mc( 0/ 4): Total exploration time 3.050 sec (3.050 sec minimum, 3.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 80333, Transitions per second: 134164
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 8.1MB, 37.5 B/state, compr.: 5.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 601 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 8.1MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-50-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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_9_
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 106 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 612 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, 168.0 B/state, compr.: 24.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 601 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 PermAdmissibility-PT-50-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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.030 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_10_
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 106 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 597 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 ~801!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2040
pnml2lts-mc( 0/ 4): unique transitions count: 29763
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2043
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2043
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2043 states 29779 transitions, fanout: 14.576
pnml2lts-mc( 0/ 4): Total exploration time 0.190 sec (0.180 sec minimum, 0.185 sec on average)
pnml2lts-mc( 0/ 4): States per second: 10753, Transitions per second: 156732
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.8MB, 58.8 B/state, compr.: 8.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 601 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.8MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-50-LTLFireability-11
ltl formula formula --ltl=/tmp/413/ltl_11_
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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 598 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 ~801!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 76
pnml2lts-mc( 0/ 4): unique states count: 2105
pnml2lts-mc( 0/ 4): unique transitions count: 13622
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2159
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2083
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2159 states 14048 transitions, fanout: 6.507
pnml2lts-mc( 0/ 4): Total exploration time 0.130 sec (0.130 sec minimum, 0.130 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16608, Transitions per second: 108062
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.8MB, 60.7 B/state, compr.: 8.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 601 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.8MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-50-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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.030 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_12_
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 106 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 599 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 ~801!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 110
pnml2lts-mc( 0/ 4): unique states count: 2613
pnml2lts-mc( 0/ 4): unique transitions count: 37032
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2617
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2507
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2617 states 37088 transitions, fanout: 14.172
pnml2lts-mc( 0/ 4): Total exploration time 0.230 sec (0.230 sec minimum, 0.230 sec on average)
pnml2lts-mc( 0/ 4): States per second: 11378, Transitions per second: 161252
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.4MB, 40.6 B/state, compr.: 6.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 601 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.4MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-50-LTLFireability-13
ltl formula formula --ltl=/tmp/413/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.030 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 611 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 ~801!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 384
pnml2lts-mc( 0/ 4): unique states count: 3272
pnml2lts-mc( 0/ 4): unique transitions count: 78239
pnml2lts-mc( 0/ 4): - self-loop count: 73
pnml2lts-mc( 0/ 4): - claim dead count: 1212
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 3276
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2895
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3276 states 78303 transitions, fanout: 23.902
pnml2lts-mc( 0/ 4): Total exploration time 0.280 sec (0.280 sec minimum, 0.280 sec on average)
pnml2lts-mc( 0/ 4): States per second: 11700, Transitions per second: 279654
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, 40.1 B/state, compr.: 5.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 601 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 PermAdmissibility-PT-50-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 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.040 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 604 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 ~801!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1950
pnml2lts-mc( 0/ 4): unique transitions count: 13773
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1954
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1954
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1954 states 13805 transitions, fanout: 7.065
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.110 sec minimum, 0.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 17764, Transitions per second: 125500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 51.7 B/state, compr.: 7.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 601 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~256.0MB paged-in)
ltl formula name PermAdmissibility-PT-50-LTLFireability-15
ltl formula formula --ltl=/tmp/413/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 168 places, 592 transitions and 3456 arcs
pnml2lts-mc( 0/ 4): Petri net PermAdmissibility-PT-50 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.030 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/413/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/413/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/413/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/413/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 105 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 169, there are 605 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 ~801!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2051
pnml2lts-mc( 0/ 4): unique transitions count: 13620
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2057
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2057
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2057 states 13660 transitions, fanout: 6.641
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.110 sec minimum, 0.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18700, Transitions per second: 124182
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.8MB, 59.8 B/state, compr.: 8.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 601 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.8MB (~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="PermAdmissibility-PT-50"
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 PermAdmissibility-PT-50, 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 r511-smll-171654407100196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-50.tgz
mv PermAdmissibility-PT-50 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 '
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 ;