Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978700286.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978700286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 239K Mar 5 18:23 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 ShieldRVt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679347949238

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=ShieldRVt-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:32:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 21:32:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:32:31] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-20 21:32:31] [INFO ] Transformed 1003 places.
[2023-03-20 21:32:31] [INFO ] Transformed 1003 transitions.
[2023-03-20 21:32:31] [INFO ] Found NUPN structural information;
[2023-03-20 21:32:31] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 14) seen :10
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2023-03-20 21:32:31] [INFO ] Computed 81 place invariants in 16 ms
[2023-03-20 21:32:32] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 21:32:32] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2023-03-20 21:32:33] [INFO ] After 920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 21:32:33] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 11 ms to minimize.
[2023-03-20 21:32:34] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 1 ms to minimize.
[2023-03-20 21:32:34] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 2 ms to minimize.
[2023-03-20 21:32:34] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 5 ms to minimize.
[2023-03-20 21:32:35] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 1 ms to minimize.
[2023-03-20 21:32:35] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 1 ms to minimize.
[2023-03-20 21:32:35] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 1 ms to minimize.
[2023-03-20 21:32:35] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 1 ms to minimize.
[2023-03-20 21:32:36] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 1 ms to minimize.
[2023-03-20 21:32:36] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 0 ms to minimize.
[2023-03-20 21:32:36] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 0 ms to minimize.
[2023-03-20 21:32:37] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 1 ms to minimize.
[2023-03-20 21:32:37] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 0 ms to minimize.
[2023-03-20 21:32:37] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 0 ms to minimize.
[2023-03-20 21:32:37] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 1 ms to minimize.
[2023-03-20 21:32:38] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2023-03-20 21:32:38] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2023-03-20 21:32:38] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 1 ms to minimize.
[2023-03-20 21:32:38] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 1 ms to minimize.
[2023-03-20 21:32:38] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 0 ms to minimize.
[2023-03-20 21:32:39] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 0 ms to minimize.
[2023-03-20 21:32:39] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 1 ms to minimize.
[2023-03-20 21:32:39] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 1 ms to minimize.
[2023-03-20 21:32:39] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 0 ms to minimize.
[2023-03-20 21:32:40] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2023-03-20 21:32:40] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 1 ms to minimize.
[2023-03-20 21:32:40] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 1 ms to minimize.
[2023-03-20 21:32:40] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 0 ms to minimize.
[2023-03-20 21:32:40] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 1 ms to minimize.
[2023-03-20 21:32:41] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2023-03-20 21:32:41] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 1 ms to minimize.
[2023-03-20 21:32:41] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 0 ms to minimize.
[2023-03-20 21:32:41] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 1 ms to minimize.
[2023-03-20 21:32:41] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 1 ms to minimize.
[2023-03-20 21:32:41] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 4 ms to minimize.
[2023-03-20 21:32:42] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2023-03-20 21:32:42] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8655 ms
[2023-03-20 21:32:43] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 1 ms to minimize.
[2023-03-20 21:32:43] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 1 ms to minimize.
[2023-03-20 21:32:43] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 2 ms to minimize.
[2023-03-20 21:32:43] [INFO ] Deduced a trap composed of 34 places in 266 ms of which 1 ms to minimize.
[2023-03-20 21:32:44] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 1 ms to minimize.
[2023-03-20 21:32:44] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 1 ms to minimize.
[2023-03-20 21:32:44] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 1 ms to minimize.
[2023-03-20 21:32:45] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 1 ms to minimize.
[2023-03-20 21:32:45] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 0 ms to minimize.
[2023-03-20 21:32:45] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 1 ms to minimize.
[2023-03-20 21:32:46] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 1 ms to minimize.
[2023-03-20 21:32:46] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 1 ms to minimize.
[2023-03-20 21:32:46] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 0 ms to minimize.
[2023-03-20 21:32:46] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 1 ms to minimize.
[2023-03-20 21:32:47] [INFO ] Deduced a trap composed of 59 places in 210 ms of which 2 ms to minimize.
[2023-03-20 21:32:47] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 1 ms to minimize.
[2023-03-20 21:32:47] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 1 ms to minimize.
[2023-03-20 21:32:47] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 1 ms to minimize.
[2023-03-20 21:32:48] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 0 ms to minimize.
[2023-03-20 21:32:48] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2023-03-20 21:32:48] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 0 ms to minimize.
[2023-03-20 21:32:48] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 1 ms to minimize.
[2023-03-20 21:32:48] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2023-03-20 21:32:48] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6158 ms
[2023-03-20 21:32:49] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 1 ms to minimize.
[2023-03-20 21:32:49] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 1 ms to minimize.
[2023-03-20 21:32:49] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 1 ms to minimize.
[2023-03-20 21:32:49] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 1 ms to minimize.
[2023-03-20 21:32:50] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 1 ms to minimize.
[2023-03-20 21:32:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1161 ms
[2023-03-20 21:32:50] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 1 ms to minimize.
[2023-03-20 21:32:50] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 1 ms to minimize.
[2023-03-20 21:32:51] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 1 ms to minimize.
[2023-03-20 21:32:51] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 1 ms to minimize.
[2023-03-20 21:32:51] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 5 ms to minimize.
[2023-03-20 21:32:51] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 1 ms to minimize.
[2023-03-20 21:32:51] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2023-03-20 21:32:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1600 ms
[2023-03-20 21:32:51] [INFO ] After 19505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 645 ms.
[2023-03-20 21:32:52] [INFO ] After 20408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 211 ms.
Support contains 109 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 1003 transition count 773
Reduce places removed 230 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 260 rules applied. Total rules applied 490 place count 773 transition count 743
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 520 place count 743 transition count 743
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 520 place count 743 transition count 665
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 676 place count 665 transition count 665
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 778 place count 563 transition count 563
Iterating global reduction 3 with 102 rules applied. Total rules applied 880 place count 563 transition count 563
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 880 place count 563 transition count 529
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 948 place count 529 transition count 529
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 2 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 1268 place count 369 transition count 369
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1334 place count 336 transition count 385
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1335 place count 336 transition count 384
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1341 place count 336 transition count 378
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1347 place count 330 transition count 378
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1348 place count 330 transition count 378
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1349 place count 330 transition count 378
Applied a total of 1349 rules in 257 ms. Remains 330 /1003 variables (removed 673) and now considering 378/1003 (removed 625) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 330/1003 places, 378/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) 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 4) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 378 rows 330 cols
[2023-03-20 21:32:53] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 21:32:53] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 21:32:53] [INFO ] [Nat]Absence check using 81 positive place invariants in 15 ms returned sat
[2023-03-20 21:32:53] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 21:32:53] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-20 21:32:53] [INFO ] After 113ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 21:32:54] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2023-03-20 21:32:54] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-20 21:32:54] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2023-03-20 21:32:54] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-20 21:32:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 443 ms
[2023-03-20 21:32:54] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2023-03-20 21:32:54] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-20 21:32:54] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-20 21:32:54] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-20 21:32:54] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2023-03-20 21:32:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 505 ms
[2023-03-20 21:32:55] [INFO ] After 1183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-20 21:32:55] [INFO ] After 1613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 52 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 378/378 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 330 transition count 358
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 310 transition count 356
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 308 transition count 356
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 44 place count 308 transition count 343
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 70 place count 295 transition count 343
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 144 place count 258 transition count 306
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 166 place count 247 transition count 316
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 247 transition count 316
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 246 transition count 315
Applied a total of 168 rules in 79 ms. Remains 246 /330 variables (removed 84) and now considering 315/378 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 246/330 places, 315/378 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 513896 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{1=1}
Probabilistic random walk after 513896 steps, saw 313851 distinct states, run finished after 3002 ms. (steps per millisecond=171 ) properties seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 315 rows 246 cols
[2023-03-20 21:32:58] [INFO ] Computed 81 place invariants in 7 ms
[2023-03-20 21:32:58] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:32:58] [INFO ] [Nat]Absence check using 81 positive place invariants in 17 ms returned sat
[2023-03-20 21:32:58] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:32:58] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-20 21:32:59] [INFO ] After 87ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:32:59] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2023-03-20 21:32:59] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2023-03-20 21:32:59] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2023-03-20 21:32:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
[2023-03-20 21:32:59] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-20 21:32:59] [INFO ] After 779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 35 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 315/315 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 246 transition count 311
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 242 transition count 311
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 242 transition count 306
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 237 transition count 306
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 44 place count 224 transition count 293
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 220 transition count 296
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 218 transition count 294
Applied a total of 54 rules in 55 ms. Remains 218 /246 variables (removed 28) and now considering 294/315 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 218/246 places, 294/315 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 903148 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 903148 steps, saw 563833 distinct states, run finished after 3002 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 218 cols
[2023-03-20 21:33:02] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-20 21:33:02] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:33:02] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-20 21:33:02] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:33:02] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-20 21:33:02] [INFO ] After 143ms SMT Verify possible using 109 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:33:03] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2023-03-20 21:33:03] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2023-03-20 21:33:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2023-03-20 21:33:03] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-20 21:33:03] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 35 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 294/294 transitions.
Applied a total of 0 rules in 14 ms. Remains 218 /218 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 218/218 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 294/294 transitions.
Applied a total of 0 rules in 11 ms. Remains 218 /218 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-20 21:33:03] [INFO ] Invariant cache hit.
[2023-03-20 21:33:03] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-20 21:33:03] [INFO ] Invariant cache hit.
[2023-03-20 21:33:03] [INFO ] State equation strengthened by 109 read => feed constraints.
[2023-03-20 21:33:03] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-20 21:33:03] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-20 21:33:03] [INFO ] Invariant cache hit.
[2023-03-20 21:33:03] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 718 ms. Remains : 218/218 places, 294/294 transitions.
Graph (trivial) has 56 edges and 218 vertex of which 2 / 218 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 683 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 216 transition count 285
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 216 transition count 285
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 24 place count 216 transition count 278
Applied a total of 24 rules in 30 ms. Remains 216 /218 variables (removed 2) and now considering 278/294 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 278 rows 216 cols
[2023-03-20 21:33:03] [INFO ] Computed 80 place invariants in 3 ms
[2023-03-20 21:33:04] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:33:04] [INFO ] [Nat]Absence check using 80 positive place invariants in 13 ms returned sat
[2023-03-20 21:33:04] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:33:04] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-20 21:33:04] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:33:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 14 ms.
[2023-03-20 21:33:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 218 places, 294 transitions and 1432 arcs took 4 ms.
[2023-03-20 21:33:04] [INFO ] Flatten gal took : 81 ms
Total runtime 33671 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: ShieldRVt_PT_020B
(NrP: 218 NrTr: 294 NrArc: 1432)

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

net check time: 0m 0.000sec

init dd package: 0m 3.230sec


before gc: list nodes free: 1830687

after gc: idd nodes used:173292, unused:63826708; list nodes free:292787592

before gc: list nodes free: 1007664

after gc: idd nodes used:170708, unused:63829292; list nodes free:292823264

before gc: list nodes free: 521191

after gc: idd nodes used:171576, unused:63828424; list nodes free:292817921

before gc: list nodes free: 1766566

after gc: idd nodes used:168650, unused:63831350; list nodes free:294934257

before gc: list nodes free: 159501

after gc: idd nodes used:172166, unused:63827834; list nodes free:294914580

RS generation: 26m30.810sec


-> reachability set: #nodes 144422 (1.4e+05) #states 58,558,713,860,876,481,956,068,114,563,072 (31)



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

checking: AG [[[[[[[[[[p34<=1 & 1<=p34] | [p133<=0 & 0<=p133]] | [[1<=p36 & p36<=1] | [0<=p168 & p168<=0]]] & [[1<=p38 & p38<=1] | [0<=p10 & p10<=0]]] & [[[1<=p110 & p110<=1] | [0<=p114 & p114<=0]] & [0<=p138 & p138<=0]]] & [[[0<=p128 & p128<=0] & [0<=p214 & p214<=0]] & [0<=p195 & p195<=0]]] | [p42<=1 & 1<=p42]] | [[[p53<=1 & 1<=p53] & [[[[1<=p118 & p118<=1] | [p7<=0 & 0<=p7]] | [[0<=p174 & p174<=0] | [p56<=1 & 1<=p56]]] & [[p63<=0 & 0<=p63] | [p199<=1 & 1<=p199]]]] | [[[[[1<=p132 & p132<=1] | [[p1<=0 & 0<=p1] | [p18<=1 & 1<=p18]]] & [[[p209<=0 & 0<=p209] | [p83<=1 & 1<=p83]] | [p96<=1 & 1<=p96]]] & [p171<=0 & 0<=p171]] | [[p120<=0 & 0<=p120] & [[p31<=1 & 1<=p31] & [p161<=0 & 0<=p161]]]]]] | [[[1<=p148 & p148<=1] | [1<=p170 & p170<=1]] | [[0<=p85 & p85<=0] | [[p104<=1 & 1<=p104] | [p12<=0 & 0<=p12]]]]]]
normalized: ~ [E [true U ~ [[[[[1<=p148 & p148<=1] | [1<=p170 & p170<=1]] | [[0<=p85 & p85<=0] | [[p104<=1 & 1<=p104] | [p12<=0 & 0<=p12]]]] | [[[[[[[p7<=0 & 0<=p7] | [1<=p118 & p118<=1]] | [[p56<=1 & 1<=p56] | [0<=p174 & p174<=0]]] & [[p199<=1 & 1<=p199] | [p63<=0 & 0<=p63]]] & [p53<=1 & 1<=p53]] | [[[p171<=0 & 0<=p171] & [[[[p83<=1 & 1<=p83] | [p209<=0 & 0<=p209]] | [p96<=1 & 1<=p96]] & [[[p18<=1 & 1<=p18] | [p1<=0 & 0<=p1]] | [1<=p132 & p132<=1]]]] | [[p120<=0 & 0<=p120] & [[p161<=0 & 0<=p161] & [p31<=1 & 1<=p31]]]]] | [[p42<=1 & 1<=p42] | [[[0<=p195 & p195<=0] & [[0<=p214 & p214<=0] & [0<=p128 & p128<=0]]] & [[[[1<=p110 & p110<=1] | [0<=p114 & p114<=0]] & [0<=p138 & p138<=0]] & [[[1<=p38 & p38<=1] | [0<=p10 & p10<=0]] & [[[0<=p168 & p168<=0] | [1<=p36 & p36<=1]] | [[p34<=1 & 1<=p34] | [p133<=0 & 0<=p133]]]]]]]]]]]]

abstracting: (0<=p133)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p133<=0)
states: 46,846,971,088,602,980,727,485,972,348,928 (31)
abstracting: (1<=p34)
states: 9,759,785,643,046,124,760,205,570,867,200 (30)
abstracting: (p34<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p36<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (1<=p36)
states: 9,759,785,643,046,124,760,205,570,867,200 (30)
abstracting: (p168<=0)
states: 48,798,928,217,397,068,296,723,428,802,560 (31)
abstracting: (0<=p168)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p10<=0)
states: 43,919,035,395,657,841,303,855,218,819,072 (31)
abstracting: (0<=p10)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p38<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (1<=p38)
states: 11,711,742,774,772,726,569,388,474,368,000 (31)
abstracting: (p138<=0)
states: 41,479,088,984,787,508,052,234,732,568,576 (31)
abstracting: (0<=p138)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p114<=0)
states: 43,919,035,396,114,881,278,568,321,515,520 (31)
abstracting: (0<=p114)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p110<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (1<=p110)
states: 14,639,678,465,178,201,806,757,496,356,864 (31)
abstracting: (p128<=0)
states: 39,039,142,573,753,979,908,431,210,872,832 (31)
abstracting: (0<=p128)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p214<=0)
states: 43,919,035,395,657,361,467,051,085,922,304 (31)
abstracting: (0<=p214)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p195<=0)
states: 43,919,035,395,657,361,467,051,085,922,304 (31)
abstracting: (0<=p195)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (1<=p42)
states: 19,519,571,280,896,621,425,174,826,188,800 (31)
abstracting: (p42<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (1<=p31)
states: 11,711,742,769,577,738,256,535,020,109,824 (31)
abstracting: (p31<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (0<=p161)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p161<=0)
states: 43,919,035,395,657,361,467,051,085,922,304 (31)
abstracting: (0<=p120)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p120<=0)
states: 39,039,142,582,086,678,796,315,574,403,072 (31)
abstracting: (p132<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (1<=p132)
states: 11,711,742,772,273,501,228,582,142,214,144 (31)
abstracting: (0<=p1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p1<=0)
states: 58,558,713,860,876,481,956,002,884,747,264 (31)
abstracting: (1<=p18)
states: 14,639,678,464,136,218,132,371,996,672,000 (31)
abstracting: (p18<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (1<=p96)
states: 19,519,571,284,793,342,496,602,062,848,000 (31)
abstracting: (p96<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (0<=p209)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p209<=0)
states: 39,039,142,573,917,654,637,378,743,042,048 (31)
abstracting: (1<=p83)
states: 11,711,742,772,607,881,529,706,676,224,000 (31)
abstracting: (p83<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (0<=p171)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p171<=0)
states: 39,039,142,573,917,654,637,378,743,042,048 (31)
abstracting: (1<=p53)
states: 11,711,742,772,607,881,529,706,676,224,000 (31)
abstracting: (p53<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (0<=p63)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p63<=0)
states: 43,919,035,396,740,263,823,696,117,891,072 (31)
abstracting: (1<=p199)
states: 14,639,678,465,219,120,489,017,028,640,768 (31)
abstracting: (p199<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p174<=0)
states: 39,039,142,573,917,654,637,378,743,042,048 (31)
abstracting: (0<=p174)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (1<=p56)
states: 11,711,742,770,443,676,272,407,739,367,424 (31)
abstracting: (p56<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p118<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (1<=p118)
states: 19,519,571,283,789,665,961,466,065,321,984 (31)
abstracting: (0<=p7)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p7<=0)
states: 41,827,652,755,828,898,210,921,890,971,648 (31)
abstracting: (0<=p12)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p12<=0)
states: 43,919,035,396,543,459,729,179,590,787,072 (31)
abstracting: (1<=p104)
states: 959,673,574,291,931,136 (17)
abstracting: (p104<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p85<=0)
states: 46,846,971,090,432,805,683,660,375,195,648 (31)
abstracting: (0<=p85)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (p170<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (1<=p170)
states: 9,759,785,643,479,413,659,344,685,760,512 (30)
abstracting: (p148<=1)
states: 58,558,713,860,876,481,956,068,114,563,072 (31)
abstracting: (1<=p148)
states: 15,859,651,670,654,047,196,427,583,488,000 (31)

before gc: list nodes free: 1505129

after gc: idd nodes used:1500524, unused:62499476; list nodes free:290851754

before gc: list nodes free: 3302206

after gc: idd nodes used:1407357, unused:62592643; list nodes free:291276732

before gc: list nodes free: 3286533

after gc: idd nodes used:1471035, unused:62528965; list nodes free:290979391

before gc: list nodes free: 2280453

after gc: idd nodes used:1453429, unused:62546571; list nodes free:291061208

before gc: list nodes free: 387038

after gc: idd nodes used:1506819, unused:62493181; list nodes free:290819017

before gc: list nodes free: 772421

after gc: idd nodes used:1443549, unused:62556451; list nodes free:291111697

before gc: list nodes free: 1030643

after gc: idd nodes used:1442845, unused:62557155; list nodes free:291115603

before gc: list nodes free: 749544

after gc: idd nodes used:1523123, unused:62476877; list nodes free:292838337

before gc: list nodes free: 899396

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6002796 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16099116 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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.001sec

163211 171767 173159 181055 182735 171847 169543 171151 209699 179115 171651 171851 174531 168931 170183 170095 177951 178875 172927 173703 172543 173999 172723 171339 170359 170447 170495 168883 168539 172703 174691 169827 169449 172323 170501 170167 170729 170329 170421 170581 169931 170537 167875 168287 167859 167045 169843 169655 168155 188483 174067 170227 168221 168703 171723 170823 169145 169887 172769 169493 169113 170969 171855 169157 168149 168869 168055 169089 169867 169059 173339 169731 167935 168947 169203 171005 170321 176565 175073 169169 168403 168445 170415 168817 171105 170371 169873 165723 166323 170147 166465 165957 169905 168953 167835 166411 165627 170375 165721 165125 180837 167361 169777 166199 166297 165413 166439 168341 165819 168095 167159 178479 169981 165733 165833 172989 169125 169167 167149 171627 170733 168079 172823 169399 166367 165593 166339 167919 167271 169191 171105 169529 173013 166973 170741 172019 170201 167279 166835 150385 156309 145523 145725 151205 146375 147225 147337 159013 147651 148943 146847 145951 145643 146049 146279 145465 147893 149775 146343 154536
iterations count:16048849 (54587), effective:1885809 (6414)

initing FirstDep: 0m 0.001sec

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="ShieldRVt-PT-020B"
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 ShieldRVt-PT-020B, 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 r426-tajo-167905978700286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B 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 ;