About the Execution of LTSMin for QuasiCertifProtocol-PT-32
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
928.200 | 1583530.00 | 1650898.00 | 6245.10 | ?????F??FFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.........................
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 30K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool ltsmin
Input is QuasiCertifProtocol-PT-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r185-qhx2-152732128200068
=====================================================================
--------------------
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 QuasiCertifProtocol-PT-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1528231787536
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-00 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-01 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-02 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-03 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-04 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-06 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-07 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1528233371066
--------------------
content from stderr:
mcc2018
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-00
ltl formula formula --ltl=/tmp/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 3.230 real 0.570 user 8.370 sys
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-01
ltl formula formula --ltl=/tmp/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.700 real 0.440 user 1.320 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_1_
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-02
ltl formula formula --ltl=/tmp/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.470 user 0.270 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_2_
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-03
ltl formula formula --ltl=/tmp/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.550 user 0.260 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_3_
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-04
ltl formula formula --ltl=/tmp/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.530 user 0.290 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_4_
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-05
ltl formula formula --ltl=/tmp/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.490 real 0.430 user 0.590 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/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 3738 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3807, there are 509 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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: 0
pnml2lts-mc( 0/ 4): unique states count: 128
pnml2lts-mc( 0/ 4): unique transitions count: 4592
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 131
pnml2lts-mc( 0/ 4): - cum. max stack depth: 131
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 131 states 4800 transitions, fanout: 36.641
pnml2lts-mc( 0/ 4): Total exploration time 0.840 sec (0.790 sec minimum, 0.803 sec on average)
pnml2lts-mc( 0/ 4): States per second: 156, Transitions per second: 5714
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 46.2 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 520 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~8192.0MB paged-in)
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-06
ltl formula formula --ltl=/tmp/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.480 user 0.320 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_6_
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-07
ltl formula formula --ltl=/tmp/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.460 user 0.330 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_7_
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-08
ltl formula formula --ltl=/tmp/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.490 user 0.260 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/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 3738 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3807, there are 514 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~36!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 131
pnml2lts-mc( 0/ 4): unique transitions count: 2271
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: 135
pnml2lts-mc( 0/ 4): - cum. max stack depth: 135
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 135 states 2512 transitions, fanout: 18.607
pnml2lts-mc( 0/ 4): Total exploration time 0.600 sec (0.590 sec minimum, 0.598 sec on average)
pnml2lts-mc( 0/ 4): States per second: 225, Transitions per second: 4187
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 62.5 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 520 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~8192.0MB paged-in)
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-09
ltl formula formula --ltl=/tmp/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.060 real 0.710 user 3.290 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_9_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 3738 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3807, there are 507 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~36!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 111
pnml2lts-mc( 0/ 4): unique transitions count: 2212
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: 114
pnml2lts-mc( 0/ 4): - cum. max stack depth: 114
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 114 states 2318 transitions, fanout: 20.333
pnml2lts-mc( 0/ 4): Total exploration time 0.540 sec (0.520 sec minimum, 0.530 sec on average)
pnml2lts-mc( 0/ 4): States per second: 211, Transitions per second: 4293
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 64.8 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 520 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~8192.0MB paged-in)
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-10
ltl formula formula --ltl=/tmp/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.540 user 0.220 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_10_
pnml2lts-mc( 0/ 4): There are 3737 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3807, there are 510 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~36!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 95
pnml2lts-mc( 0/ 4): unique transitions count: 2602
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: 98
pnml2lts-mc( 0/ 4): - cum. max stack depth: 98
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 98 states 2708 transitions, fanout: 27.633
pnml2lts-mc( 0/ 4): Total exploration time 0.630 sec (0.580 sec minimum, 0.618 sec on average)
pnml2lts-mc( 0/ 4): States per second: 156, Transitions per second: 4298
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 63.1 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 520 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~8192.0MB paged-in)
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-11
ltl formula formula --ltl=/tmp/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.410 user 0.310 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_11_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 3738 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3807, there are 509 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~36!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 130
pnml2lts-mc( 0/ 4): unique transitions count: 2264
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: 133
pnml2lts-mc( 0/ 4): - cum. max stack depth: 133
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 133 states 2370 transitions, fanout: 17.820
pnml2lts-mc( 0/ 4): Total exploration time 0.630 sec (0.610 sec minimum, 0.625 sec on average)
pnml2lts-mc( 0/ 4): States per second: 211, Transitions per second: 3762
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 63.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 520 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~8192.0MB paged-in)
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-12
ltl formula formula --ltl=/tmp/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.520 user 0.320 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_12_
pnml2lts-mc( 0/ 4): There are 3737 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3807, there are 533 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~36!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 96
pnml2lts-mc( 0/ 4): unique transitions count: 2307
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: 99
pnml2lts-mc( 0/ 4): - cum. max stack depth: 99
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 99 states 2413 transitions, fanout: 24.374
pnml2lts-mc( 0/ 4): Total exploration time 0.540 sec (0.510 sec minimum, 0.530 sec on average)
pnml2lts-mc( 0/ 4): States per second: 183, Transitions per second: 4469
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 65.0 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 520 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~8192.0MB paged-in)
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-13
ltl formula formula --ltl=/tmp/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.480 user 0.280 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 3738 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3807, there are 508 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~36!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 110
pnml2lts-mc( 0/ 4): unique transitions count: 2256
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: 113
pnml2lts-mc( 0/ 4): - cum. max stack depth: 113
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 113 states 2362 transitions, fanout: 20.903
pnml2lts-mc( 0/ 4): Total exploration time 0.560 sec (0.520 sec minimum, 0.537 sec on average)
pnml2lts-mc( 0/ 4): States per second: 202, Transitions per second: 4218
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 65.5 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 520 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~8192.0MB paged-in)
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-14
ltl formula formula --ltl=/tmp/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.470 user 0.270 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_14_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 3738 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3807, there are 508 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~36!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 105
pnml2lts-mc( 0/ 4): unique transitions count: 2354
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: 108
pnml2lts-mc( 0/ 4): - cum. max stack depth: 108
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 108 states 2460 transitions, fanout: 22.778
pnml2lts-mc( 0/ 4): Total exploration time 0.590 sec (0.520 sec minimum, 0.570 sec on average)
pnml2lts-mc( 0/ 4): States per second: 183, Transitions per second: 4169
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 62.7 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 520 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~8192.0MB paged-in)
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-15
ltl formula formula --ltl=/tmp/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 3806 places, 506 transitions and 8173 arcs
pnml2lts-mc( 0/ 4): Petri net QuasiCertifProtocol-PT-32 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.460 user 0.330 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_15_
pnml2lts-mc( 0/ 4): There are 3737 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 3807, there are 544 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 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 ~36!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 128
pnml2lts-mc( 0/ 4): unique transitions count: 4502
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: 131
pnml2lts-mc( 0/ 4): - cum. max stack depth: 131
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 131 states 4710 transitions, fanout: 35.954
pnml2lts-mc( 0/ 4): Total exploration time 0.820 sec (0.820 sec minimum, 0.820 sec on average)
pnml2lts-mc( 0/ 4): States per second: 160, Transitions per second: 5744
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 47.1 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 520 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~8192.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="QuasiCertifProtocol-PT-32"
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"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool ltsmin"
echo " Input is QuasiCertifProtocol-PT-32, 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 r185-qhx2-152732128200068"
echo "====================================================================="
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
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 ;