fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r170-tall-167838857300510
Last Updated
May 14, 2023

About the Execution of Marcie+red for FlexibleBarrier-PT-12a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5448.039 19067.00 28770.00 332.40 TTTFTFTTFFFTTTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857300510.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FlexibleBarrier-PT-12a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857300510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 25 13:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 13:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 13:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 128K Mar 5 18:22 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 FlexibleBarrier-PT-12a-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-12a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678560003729

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 18:40:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 18:40:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 18:40:05] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-11 18:40:05] [INFO ] Transformed 147 places.
[2023-03-11 18:40:05] [INFO ] Transformed 448 transitions.
[2023-03-11 18:40:05] [INFO ] Found NUPN structural information;
[2023-03-11 18:40:05] [INFO ] Parsed PT model containing 147 places and 448 transitions and 2045 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 12) seen :9
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 18:40:05] [INFO ] Flow matrix only has 314 transitions (discarded 12 similar events)
// Phase 1: matrix 314 rows 147 cols
[2023-03-11 18:40:05] [INFO ] Computed 14 place invariants in 15 ms
[2023-03-11 18:40:06] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 18:40:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 186 ms returned sat
[2023-03-11 18:40:06] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-11 18:40:06] [INFO ] State equation strengthened by 193 read => feed constraints.
[2023-03-11 18:40:06] [INFO ] After 98ms SMT Verify possible using 193 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-11 18:40:06] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-11 18:40:06] [INFO ] After 797ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 60 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 326/326 transitions.
Graph (trivial) has 48 edges and 147 vertex of which 12 / 147 are part of one of the 4 SCC in 3 ms
Free SCC test removed 8 places
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 131 transition count 290
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 131 transition count 289
Drop transitions removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 1 with 68 rules applied. Total rules applied 86 place count 131 transition count 221
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 86 place count 131 transition count 218
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 128 transition count 218
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 128 transition count 215
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 98 place count 125 transition count 215
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 125 transition count 214
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 124 transition count 213
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 114 place count 124 transition count 213
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 118 place count 124 transition count 209
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 124 transition count 209
Applied a total of 120 rules in 74 ms. Remains 124 /147 variables (removed 23) and now considering 209/326 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 124/147 places, 209/326 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 209 rows 124 cols
[2023-03-11 18:40:07] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-11 18:40:07] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 18:40:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-11 18:40:07] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 18:40:07] [INFO ] State equation strengthened by 135 read => feed constraints.
[2023-03-11 18:40:07] [INFO ] After 32ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 18:40:07] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 18:40:07] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 209/209 transitions.
Graph (trivial) has 31 edges and 124 vertex of which 8 / 124 are part of one of the 3 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 110 transition count 188
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 110 transition count 187
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 107 transition count 184
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 107 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 106 transition count 184
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 106 transition count 183
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 106 transition count 157
Graph (complete) has 275 edges and 106 vertex of which 100 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 100 transition count 156
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 63 place count 100 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 63 place count 100 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 98 transition count 147
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 98 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 71 place count 96 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 72 place count 96 transition count 145
Applied a total of 72 rules in 37 ms. Remains 96 /124 variables (removed 28) and now considering 145/209 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 96/124 places, 145/209 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2086983 steps, run timeout after 3001 ms. (steps per millisecond=695 ) properties seen :{}
Probabilistic random walk after 2086983 steps, saw 1358698 distinct states, run finished after 3002 ms. (steps per millisecond=695 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 96 cols
[2023-03-11 18:40:10] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-11 18:40:10] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 18:40:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-11 18:40:10] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 18:40:10] [INFO ] State equation strengthened by 101 read => feed constraints.
[2023-03-11 18:40:10] [INFO ] After 33ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 18:40:10] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 18:40:10] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 32 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 145/145 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 96/96 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 145/145 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-11 18:40:10] [INFO ] Invariant cache hit.
[2023-03-11 18:40:10] [INFO ] Implicit Places using invariants in 74 ms returned [94, 95]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 94/96 places, 145/145 transitions.
Graph (trivial) has 48 edges and 94 vertex of which 21 / 94 are part of one of the 10 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 83 transition count 118
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 77 transition count 116
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 23 place count 76 transition count 109
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 32 place count 69 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 33 place count 68 transition count 107
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 33 place count 68 transition count 105
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 37 place count 66 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 39 place count 65 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 41 place count 64 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 42 place count 64 transition count 104
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 43 place count 64 transition count 103
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 47 place count 64 transition count 99
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 51 place count 60 transition count 99
Applied a total of 51 rules in 18 ms. Remains 60 /94 variables (removed 34) and now considering 99/145 (removed 46) transitions.
// Phase 1: matrix 99 rows 60 cols
[2023-03-11 18:40:10] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-11 18:40:10] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 18:40:10] [INFO ] Invariant cache hit.
[2023-03-11 18:40:10] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/96 places, 99/145 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 166 ms. Remains : 60/96 places, 99/145 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2909508 steps, run timeout after 3001 ms. (steps per millisecond=969 ) properties seen :{}
Probabilistic random walk after 2909508 steps, saw 1388138 distinct states, run finished after 3001 ms. (steps per millisecond=969 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 18:40:13] [INFO ] Invariant cache hit.
[2023-03-11 18:40:13] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 18:40:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 18:40:13] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 18:40:13] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-11 18:40:13] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 32 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 60/60 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-11 18:40:13] [INFO ] Invariant cache hit.
[2023-03-11 18:40:13] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 18:40:13] [INFO ] Invariant cache hit.
[2023-03-11 18:40:14] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-11 18:40:14] [INFO ] Redundant transitions in 16 ms returned [51, 52, 53, 54, 55, 56, 57, 58]
Found 8 redundant transitions using SMT.
Drop transitions removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
// Phase 1: matrix 91 rows 60 cols
[2023-03-11 18:40:14] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-11 18:40:14] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 60/60 places, 91/99 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 156 ms. Remains : 60/60 places, 91/99 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2961331 steps, run timeout after 3001 ms. (steps per millisecond=986 ) properties seen :{}
Probabilistic random walk after 2961331 steps, saw 1396203 distinct states, run finished after 3001 ms. (steps per millisecond=986 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 18:40:17] [INFO ] Invariant cache hit.
[2023-03-11 18:40:17] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 18:40:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 18:40:17] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 18:40:17] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-11 18:40:17] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 32 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 60/60 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-11 18:40:17] [INFO ] Invariant cache hit.
[2023-03-11 18:40:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 18:40:17] [INFO ] Invariant cache hit.
[2023-03-11 18:40:17] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-11 18:40:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 18:40:17] [INFO ] Invariant cache hit.
[2023-03-11 18:40:17] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 60/60 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-11 18:40:17] [INFO ] Invariant cache hit.
[2023-03-11 18:40:17] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 18:40:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-11 18:40:17] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 18:40:17] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-11 18:40:17] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-11 18:40:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-11 18:40:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 60 places, 91 transitions and 226 arcs took 0 ms.
[2023-03-11 18:40:17] [INFO ] Flatten gal took : 22 ms
Total runtime 12588 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FlexibleBarrier_PT_12a
(NrP: 60 NrTr: 91 NrArc: 226)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.645sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 181 (1.8e+02) #states 29,859,841 (7)



starting MCC model checker
--------------------------

checking: AG [[[[[[p23<=0 & 0<=p23] | [p20<=1 & 1<=p20]] | [[p3<=0 & 0<=p3] | [p1<=1 & 1<=p1]]] | [[[p51<=1 & 1<=p51] | [p30<=1 & 1<=p30]] | [[p29<=0 & 0<=p29] | [p46<=1 & 1<=p46]]]] | [[[[p50<=0 & 0<=p50] | [p35<=0 & 0<=p35]] | [[p41<=0 & 0<=p41] | [p39<=1 & 1<=p39]]] | [[[[p32<=0 & 0<=p32] & [p55<=1 & 1<=p55]] | [[p37<=0 & 0<=p37] & [[[p21<=0 & 0<=p21] & [p27<=1 & 1<=p27]] | [[p46<=0 & 0<=p46] & [p5<=1 & 1<=p5]]]]] | [[[[p55<=1 & 1<=p55] & [p15<=1 & 1<=p15]] & [[[p9<=0 & 0<=p9] | [p41<=1 & 1<=p41]] & [[[p56<=0 & 0<=p56] | [[p7<=0 & 0<=p7] & [p44<=1 & 1<=p44]]] & [[p19<=1 & 1<=p19] | [[p11<=0 & 0<=p11] & [p58<=1 & 1<=p58]]]]]] | [[[p25<=0 & 0<=p25] & [[p14<=1 & 1<=p14] & [[p47<=0 & 0<=p47] | [p53<=1 & 1<=p53]]]] | [[p42<=1 & 1<=p42] & [p17<=1 & 1<=p17]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[p53<=1 & 1<=p53] | [p47<=0 & 0<=p47]] & [p14<=1 & 1<=p14]] & [p25<=0 & 0<=p25]] | [[p42<=1 & 1<=p42] & [p17<=1 & 1<=p17]]] | [[[[[[p58<=1 & 1<=p58] & [p11<=0 & 0<=p11]] | [p19<=1 & 1<=p19]] & [[[p44<=1 & 1<=p44] & [p7<=0 & 0<=p7]] | [p56<=0 & 0<=p56]]] & [[p41<=1 & 1<=p41] | [p9<=0 & 0<=p9]]] & [[p15<=1 & 1<=p15] & [p55<=1 & 1<=p55]]]] | [[[[[p5<=1 & 1<=p5] & [p46<=0 & 0<=p46]] | [[p27<=1 & 1<=p27] & [p21<=0 & 0<=p21]]] & [p37<=0 & 0<=p37]] | [[p55<=1 & 1<=p55] & [p32<=0 & 0<=p32]]]] | [[[p39<=1 & 1<=p39] | [p41<=0 & 0<=p41]] | [[p35<=0 & 0<=p35] | [p50<=0 & 0<=p50]]]] | [[[[p46<=1 & 1<=p46] | [p29<=0 & 0<=p29]] | [[p30<=1 & 1<=p30] | [p51<=1 & 1<=p51]]] | [[[p1<=1 & 1<=p1] | [p3<=0 & 0<=p3]] | [[p20<=1 & 1<=p20] | [p23<=0 & 0<=p23]]]]]]]]

abstracting: (0<=p23)
states: 29,859,841 (7)
abstracting: (p23<=0)
states: 24,883,201 (7)
abstracting: (1<=p20)
states: 4,976,640 (6)
abstracting: (p20<=1)
states: 29,859,841 (7)
abstracting: (0<=p3)
states: 29,859,841 (7)
abstracting: (p3<=0)
states: 26,127,361 (7)
abstracting: (1<=p1)
states: 3,732,480 (6)
abstracting: (p1<=1)
states: 29,859,841 (7)
abstracting: (1<=p51)
states: 3,317,760 (6)
abstracting: (p51<=1)
states: 29,859,841 (7)
abstracting: (1<=p30)
states: 5,971,968 (6)
abstracting: (p30<=1)
states: 29,859,841 (7)
abstracting: (0<=p29)
states: 29,859,841 (7)
abstracting: (p29<=0)
states: 23,887,873 (7)
abstracting: (1<=p46)
states: 3,317,760 (6)
abstracting: (p46<=1)
states: 29,859,841 (7)
abstracting: (0<=p50)
states: 29,859,841 (7)
abstracting: (p50<=0)
states: 26,542,081 (7)
abstracting: (0<=p35)
states: 29,859,841 (7)
abstracting: (p35<=0)
states: 24,883,201 (7)
abstracting: (0<=p41)
states: 29,859,841 (7)
abstracting: (p41<=0)
states: 26,542,081 (7)
abstracting: (1<=p39)
states: 4,976,640 (6)
abstracting: (p39<=1)
states: 29,859,841 (7)
abstracting: (0<=p32)
states: 29,859,841 (7)
abstracting: (p32<=0)
states: 23,887,873 (7)
abstracting: (1<=p55)
states: 3,317,760 (6)
abstracting: (p55<=1)
states: 29,859,841 (7)
abstracting: (0<=p37)
states: 29,859,841 (7)
abstracting: (p37<=0)
states: 24,883,201 (7)
abstracting: (0<=p21)
states: 29,859,841 (7)
abstracting: (p21<=0)
states: 24,883,201 (7)
abstracting: (1<=p27)
states: 7,464,960 (6)
abstracting: (p27<=1)
states: 29,859,841 (7)
abstracting: (0<=p46)
states: 29,859,841 (7)
abstracting: (p46<=0)
states: 26,542,081 (7)
abstracting: (1<=p5)
states: 3,732,480 (6)
abstracting: (p5<=1)
states: 29,859,841 (7)
abstracting: (1<=p55)
states: 3,317,760 (6)
abstracting: (p55<=1)
states: 29,859,841 (7)
abstracting: (1<=p15)
states: 7,464,960 (6)
abstracting: (p15<=1)
states: 29,859,841 (7)
abstracting: (0<=p9)
states: 29,859,841 (7)
abstracting: (p9<=0)
states: 22,394,881 (7)
abstracting: (1<=p41)
states: 3,317,760 (6)
abstracting: (p41<=1)
states: 29,859,841 (7)
abstracting: (0<=p56)
states: 29,859,841 (7)
abstracting: (p56<=0)
states: 26,542,081 (7)
abstracting: (0<=p7)
states: 29,859,841 (7)
abstracting: (p7<=0)
states: 26,127,361 (7)
abstracting: (1<=p44)
states: 3,317,760 (6)
abstracting: (p44<=1)
states: 29,859,841 (7)
abstracting: (1<=p19)
states: 4,976,640 (6)
abstracting: (p19<=1)
states: 29,859,841 (7)
abstracting: (0<=p11)
states: 29,859,841 (7)
abstracting: (p11<=0)
states: 22,394,881 (7)
abstracting: (1<=p58)
states: 14,929,920 (7)
abstracting: (p58<=1)
states: 29,859,841 (7)
abstracting: (1<=p17)
states: 7,464,960 (6)
abstracting: (p17<=1)
states: 29,859,841 (7)
abstracting: (1<=p42)
states: 3,317,760 (6)
abstracting: (p42<=1)
states: 29,859,841 (7)
abstracting: (0<=p25)
states: 29,859,841 (7)
abstracting: (p25<=0)
states: 22,394,881 (7)
abstracting: (1<=p14)
states: 14,929,920 (7)
abstracting: (p14<=1)
states: 29,859,841 (7)
abstracting: (0<=p47)
states: 29,859,841 (7)
abstracting: (p47<=0)
states: 26,542,081 (7)
abstracting: (1<=p53)
states: 3,317,760 (6)
abstracting: (p53<=1)
states: 29,859,841 (7)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-12a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

totally nodes used: 9477 (9.5e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8657 36535 45192
used/not used/entry size/cache size: 39430 67069434 16 1024MB
basic ops cache: hits/miss/sum: 3578 11881 15459
used/not used/entry size/cache size: 25986 16751230 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1101 2292 3393
used/not used/entry size/cache size: 2292 8386316 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67099410
1 9431
2 23
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.221sec


BK_STOP 1678560022796

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:786 (8), effective:114 (1)

initing FirstDep: 0m 0.000sec


iterations count:417 (4), effective:52 (0)

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="FlexibleBarrier-PT-12a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is FlexibleBarrier-PT-12a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857300510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12a.tgz
mv FlexibleBarrier-PT-12a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;