About the Execution of LTSMin for ShieldPPPt-PT-100A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 236.695 | 246817.00 | 966516.00 | 27.60 | F?TTFF??FFFFFF?F | 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.r527-tall-171683761600692.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 ShieldPPPt-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r527-tall-171683761600692
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 11 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 685K 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 ShieldPPPt-PT-100A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717237595033
Invoking MCC driver with
BK_TOOL=ltsmin
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
FORMULA ShieldPPPt-PT-100A-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldPPPt-PT-100A-LTLFireability-01
FORMULA ShieldPPPt-PT-100A-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-100A-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-100A-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-100A-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldPPPt-PT-100A-LTLFireability-06
Could not compute solution for formula : ShieldPPPt-PT-100A-LTLFireability-07
FORMULA ShieldPPPt-PT-100A-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-100A-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-100A-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-100A-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-100A-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-100A-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldPPPt-PT-100A-LTLFireability-14
FORMULA ShieldPPPt-PT-100A-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717237841850
--------------------
content from stderr:
mcc2024
ltl formula name ShieldPPPt-PT-100A-LTLFireability-00
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_0_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.050 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_0_
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 2505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1806 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 ~7!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 12
pnml2lts-mc( 0/ 4): unique transitions count: 37
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: 19
pnml2lts-mc( 0/ 4): - cum. max stack depth: 19
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 19 states 56 transitions, fanout: 2.947
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1900, Transitions per second: 5600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 104.6 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 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 ShieldPPPt-PT-100A-LTLFireability-01
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.050 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 2504 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1825 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): ~2481 levels ~10000 states ~59616 transitions
pnml2lts-mc( 0/ 4): ~4955 levels ~20000 states ~124460 transitions
pnml2lts-mc( 0/ 4): ~9907 levels ~40000 states ~255136 transitions
pnml2lts-mc( 0/ 4): ~19835 levels ~80000 states ~532648 transitions
pnml2lts-mc( 1/ 4): ~39493 levels ~160000 states ~1142028 transitions
pnml2lts-mc( 0/ 4): ~79427 levels ~320000 states ~2338592 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 393347
pnml2lts-mc( 0/ 4): unique transitions count: 3556966
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 895719
pnml2lts-mc( 0/ 4): - claim success count: 393359
pnml2lts-mc( 0/ 4): - cum. max stack depth: 391289
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 393359 states 3556980 transitions, fanout: 9.043
pnml2lts-mc( 0/ 4): Total exploration time 55.450 sec (55.390 sec minimum, 55.412 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7094, Transitions per second: 64148
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 82.4MB, 35.9 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1833 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 82.4MB (~256.0MB paged-in)
ltl formula name ShieldPPPt-PT-100A-LTLFireability-02
ltl formula formula --ltl=/tmp/406/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.070 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1812 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.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 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 ShieldPPPt-PT-100A-LTLFireability-03
ltl formula formula --ltl=/tmp/406/ltl_3_
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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.070 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 2504 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1813 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: 3
pnml2lts-mc( 0/ 4): unique states count: 3
pnml2lts-mc( 0/ 4): unique transitions count: 3
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 9
pnml2lts-mc( 0/ 4): - cum. max stack depth: 9
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9 states 16 transitions, fanout: 1.778
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, 464.0 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 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 ShieldPPPt-PT-100A-LTLFireability-04
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.060 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 2504 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1824 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 ~7!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 13
pnml2lts-mc( 0/ 4): unique transitions count: 70
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: 21
pnml2lts-mc( 0/ 4): - cum. max stack depth: 21
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21 states 94 transitions, fanout: 4.476
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, 91.5 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 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 ShieldPPPt-PT-100A-LTLFireability-05
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.050 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_5_
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 2505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1806 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 ~7!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 21
pnml2lts-mc( 0/ 4): unique transitions count: 56
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: 32
pnml2lts-mc( 0/ 4): - cum. max stack depth: 32
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32 states 78 transitions, fanout: 2.438
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3200, Transitions per second: 7800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 86.0 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 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 ShieldPPPt-PT-100A-LTLFireability-06
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.060 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_6_
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 2505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1809 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): ~2492 levels ~10000 states ~60500 transitions
pnml2lts-mc( 0/ 4): ~4987 levels ~20000 states ~128404 transitions
pnml2lts-mc( 0/ 4): ~9966 levels ~40000 states ~268492 transitions
pnml2lts-mc( 0/ 4): ~19928 levels ~80000 states ~567244 transitions
pnml2lts-mc( 0/ 4): ~39892 levels ~160000 states ~1178764 transitions
pnml2lts-mc( 0/ 4): ~79689 levels ~320000 states ~2414312 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 384617
pnml2lts-mc( 0/ 4): unique transitions count: 3443650
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 977080
pnml2lts-mc( 0/ 4): - claim success count: 384628
pnml2lts-mc( 0/ 4): - cum. max stack depth: 383602
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 384628 states 3443657 transitions, fanout: 8.953
pnml2lts-mc( 0/ 4): Total exploration time 54.690 sec (54.610 sec minimum, 54.645 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7033, Transitions per second: 62967
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 79.9MB, 40.1 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1833 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 79.9MB (~256.0MB paged-in)
ltl formula name ShieldPPPt-PT-100A-LTLFireability-07
ltl formula formula --ltl=/tmp/406/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.060 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1822 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): ~2489 levels ~10000 states ~61604 transitions
pnml2lts-mc( 0/ 4): ~4980 levels ~20000 states ~136460 transitions
pnml2lts-mc( 0/ 4): ~9956 levels ~40000 states ~282220 transitions
pnml2lts-mc( 1/ 4): ~19997 levels ~80000 states ~785268 transitions
pnml2lts-mc( 0/ 4): ~39862 levels ~160000 states ~1258720 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 297295
pnml2lts-mc( 0/ 4): unique transitions count: 3004805
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 662397
pnml2lts-mc( 0/ 4): - claim success count: 297309
pnml2lts-mc( 0/ 4): - cum. max stack depth: 297006
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 297309 states 3004819 transitions, fanout: 10.107
pnml2lts-mc( 0/ 4): Total exploration time 50.010 sec (49.950 sec minimum, 49.982 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5945, Transitions per second: 60084
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 79.9MB, 40.3 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1833 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 79.9MB (~256.0MB paged-in)
ltl formula name ShieldPPPt-PT-100A-LTLFireability-08
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.060 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_8_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1808 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 ~16!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 29
pnml2lts-mc( 0/ 4): unique transitions count: 87
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: 37
pnml2lts-mc( 0/ 4): - cum. max stack depth: 37
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 37 states 103 transitions, fanout: 2.784
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3700, Transitions per second: 10300
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, 77.8 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 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 ShieldPPPt-PT-100A-LTLFireability-09
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.070 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_9_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1810 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 ~16!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 31
pnml2lts-mc( 0/ 4): unique transitions count: 91
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: 39
pnml2lts-mc( 0/ 4): - cum. max stack depth: 39
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 39 states 107 transitions, fanout: 2.744
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3900, Transitions per second: 10700
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 72.2 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 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 ShieldPPPt-PT-100A-LTLFireability-10
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.060 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/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 2505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1805 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 ~37!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 76
pnml2lts-mc( 0/ 4): unique states count: 181
pnml2lts-mc( 0/ 4): unique transitions count: 544
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 21
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 199
pnml2lts-mc( 0/ 4): - cum. max stack depth: 123
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 199 states 586 transitions, fanout: 2.945
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.030 sec minimum, 0.045 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3980, Transitions per second: 11720
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, 56.7 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 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 ShieldPPPt-PT-100A-LTLFireability-11
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_11_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.060 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_11_
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 2505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1804 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 ~9!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 16
pnml2lts-mc( 0/ 4): unique transitions count: 44
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: 27
pnml2lts-mc( 0/ 4): - cum. max stack depth: 27
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 27 states 66 transitions, fanout: 2.444
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, 102.2 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 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 ShieldPPPt-PT-100A-LTLFireability-12
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.060 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_12_
pnml2lts-mc( 0/ 4): There are 2504 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1811 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 ~10!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 19
pnml2lts-mc( 0/ 4): unique transitions count: 53
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: 25
pnml2lts-mc( 0/ 4): - cum. max stack depth: 25
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 25 states 66 transitions, fanout: 2.640
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2500, Transitions per second: 6600
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, 87.2 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 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 ShieldPPPt-PT-100A-LTLFireability-13
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_13_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.400 real 0.050 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_13_
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 2505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1806 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 ~8!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 16
pnml2lts-mc( 0/ 4): unique transitions count: 51
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: 28
pnml2lts-mc( 0/ 4): - cum. max stack depth: 28
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28 states 73 transitions, fanout: 2.607
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, 92.8 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 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 ShieldPPPt-PT-100A-LTLFireability-14
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.090 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_14_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 2505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1817 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): ~2500 levels ~10000 states ~67336 transitions
pnml2lts-mc( 2/ 4): ~4999 levels ~20000 states ~128976 transitions
pnml2lts-mc( 2/ 4): ~9999 levels ~40000 states ~272808 transitions
pnml2lts-mc( 3/ 4): ~19914 levels ~80000 states ~584224 transitions
pnml2lts-mc( 1/ 4): ~39990 levels ~160000 states ~1239964 transitions
pnml2lts-mc( 1/ 4): ~79977 levels ~320000 states ~2602080 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 368828
pnml2lts-mc( 0/ 4): unique transitions count: 3353090
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 932953
pnml2lts-mc( 0/ 4): - claim success count: 368840
pnml2lts-mc( 0/ 4): - cum. max stack depth: 368442
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 368840 states 3353109 transitions, fanout: 9.091
pnml2lts-mc( 0/ 4): Total exploration time 69.750 sec (69.720 sec minimum, 69.732 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5288, Transitions per second: 48073
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 79.6MB, 40.7 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1833 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 79.6MB (~256.0MB paged-in)
ltl formula name ShieldPPPt-PT-100A-LTLFireability-15
ltl formula formula --ltl=/tmp/406/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 2503 places, 1803 transitions and 7206 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldPPPt-PT-100A analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.060 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/406/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/406/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/406/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/406/ltl_15_
pnml2lts-mc( 0/ 4): There are 2504 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2504, there are 1807 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 ~7!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 8
pnml2lts-mc( 0/ 4): unique transitions count: 17
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: 18
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18 states 37 transitions, fanout: 2.056
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1800, Transitions per second: 3700
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, 147.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1833 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-100A"
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 ShieldPPPt-PT-100A, 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 r527-tall-171683761600692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100A.tgz
mv ShieldPPPt-PT-100A 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 ;