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.r394-oct2-167903717900447.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717900447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 02:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 172K 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 ShieldPPPs-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679514338505

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 19:45:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 19:45:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:45:42] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-22 19:45:42] [INFO ] Transformed 683 places.
[2023-03-22 19:45:42] [INFO ] Transformed 633 transitions.
[2023-03-22 19:45:42] [INFO ] Found NUPN structural information;
[2023-03-22 19:45:42] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 16) seen :9
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 633 rows 683 cols
[2023-03-22 19:45:43] [INFO ] Computed 111 place invariants in 14 ms
[2023-03-22 19:45:43] [INFO ] After 511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 19:45:44] [INFO ] [Nat]Absence check using 111 positive place invariants in 38 ms returned sat
[2023-03-22 19:45:45] [INFO ] After 1385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 19:45:46] [INFO ] Deduced a trap composed of 30 places in 321 ms of which 19 ms to minimize.
[2023-03-22 19:45:46] [INFO ] Deduced a trap composed of 18 places in 294 ms of which 1 ms to minimize.
[2023-03-22 19:45:46] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 1 ms to minimize.
[2023-03-22 19:45:47] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 4 ms to minimize.
[2023-03-22 19:45:47] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 1 ms to minimize.
[2023-03-22 19:45:47] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 1 ms to minimize.
[2023-03-22 19:45:47] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2023-03-22 19:45:48] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2023-03-22 19:45:48] [INFO ] Deduced a trap composed of 27 places in 335 ms of which 1 ms to minimize.
[2023-03-22 19:45:48] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2023-03-22 19:45:48] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 1 ms to minimize.
[2023-03-22 19:45:49] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2023-03-22 19:45:49] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 0 ms to minimize.
[2023-03-22 19:45:49] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2023-03-22 19:45:49] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:45:49] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 1 ms to minimize.
[2023-03-22 19:45:49] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2023-03-22 19:45:50] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2023-03-22 19:45:50] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 0 ms to minimize.
[2023-03-22 19:45:50] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2023-03-22 19:45:50] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:45:50] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 0 ms to minimize.
[2023-03-22 19:45:50] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4957 ms
[2023-03-22 19:45:51] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 1 ms to minimize.
[2023-03-22 19:45:51] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2023-03-22 19:45:51] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2023-03-22 19:45:51] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 0 ms to minimize.
[2023-03-22 19:45:52] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2023-03-22 19:45:52] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 0 ms to minimize.
[2023-03-22 19:45:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1247 ms
[2023-03-22 19:45:52] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 1 ms to minimize.
[2023-03-22 19:45:52] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 0 ms to minimize.
[2023-03-22 19:45:53] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 0 ms to minimize.
[2023-03-22 19:45:53] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 1 ms to minimize.
[2023-03-22 19:45:53] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 0 ms to minimize.
[2023-03-22 19:45:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1225 ms
[2023-03-22 19:45:53] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 14 ms to minimize.
[2023-03-22 19:45:54] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 13 ms to minimize.
[2023-03-22 19:45:54] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 8 ms to minimize.
[2023-03-22 19:45:54] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-22 19:45:54] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 3 ms to minimize.
[2023-03-22 19:45:54] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 0 ms to minimize.
[2023-03-22 19:45:55] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 3 ms to minimize.
[2023-03-22 19:45:55] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2023-03-22 19:45:55] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 0 ms to minimize.
[2023-03-22 19:45:55] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 1 ms to minimize.
[2023-03-22 19:45:56] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 1 ms to minimize.
[2023-03-22 19:45:56] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 1 ms to minimize.
[2023-03-22 19:45:56] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 0 ms to minimize.
[2023-03-22 19:45:56] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 1 ms to minimize.
[2023-03-22 19:45:57] [INFO ] Deduced a trap composed of 47 places in 300 ms of which 1 ms to minimize.
[2023-03-22 19:45:57] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 1 ms to minimize.
[2023-03-22 19:45:57] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 0 ms to minimize.
[2023-03-22 19:45:57] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 14 ms to minimize.
[2023-03-22 19:45:57] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2023-03-22 19:45:58] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 0 ms to minimize.
[2023-03-22 19:45:58] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 0 ms to minimize.
[2023-03-22 19:45:58] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 0 ms to minimize.
[2023-03-22 19:45:58] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 0 ms to minimize.
[2023-03-22 19:45:58] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 13 ms to minimize.
[2023-03-22 19:45:59] [INFO ] Deduced a trap composed of 50 places in 267 ms of which 20 ms to minimize.
[2023-03-22 19:45:59] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 0 ms to minimize.
[2023-03-22 19:45:59] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 1 ms to minimize.
[2023-03-22 19:45:59] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 1 ms to minimize.
[2023-03-22 19:46:00] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2023-03-22 19:46:00] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 1 ms to minimize.
[2023-03-22 19:46:00] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6694 ms
[2023-03-22 19:46:00] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 14 ms to minimize.
[2023-03-22 19:46:01] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 0 ms to minimize.
[2023-03-22 19:46:01] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2023-03-22 19:46:01] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 0 ms to minimize.
[2023-03-22 19:46:01] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2023-03-22 19:46:02] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 1 ms to minimize.
[2023-03-22 19:46:02] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 1 ms to minimize.
[2023-03-22 19:46:02] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 1 ms to minimize.
[2023-03-22 19:46:03] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 0 ms to minimize.
[2023-03-22 19:46:03] [INFO ] Deduced a trap composed of 28 places in 193 ms of which 1 ms to minimize.
[2023-03-22 19:46:03] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2023-03-22 19:46:03] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 0 ms to minimize.
[2023-03-22 19:46:03] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2023-03-22 19:46:04] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2023-03-22 19:46:04] [INFO ] Deduced a trap composed of 29 places in 216 ms of which 1 ms to minimize.
[2023-03-22 19:46:04] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2023-03-22 19:46:04] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3986 ms
[2023-03-22 19:46:04] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 2 ms to minimize.
[2023-03-22 19:46:05] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2023-03-22 19:46:05] [INFO ] Deduced a trap composed of 22 places in 247 ms of which 0 ms to minimize.
[2023-03-22 19:46:05] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2023-03-22 19:46:05] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 1 ms to minimize.
[2023-03-22 19:46:05] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2023-03-22 19:46:06] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 0 ms to minimize.
[2023-03-22 19:46:06] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2023-03-22 19:46:06] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 0 ms to minimize.
[2023-03-22 19:46:06] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 0 ms to minimize.
[2023-03-22 19:46:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1891 ms
[2023-03-22 19:46:06] [INFO ] After 22338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 799 ms.
[2023-03-22 19:46:07] [INFO ] After 23552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 124 ms.
Support contains 139 out of 683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 683/683 places, 633/633 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 683 transition count 591
Reduce places removed 42 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 54 rules applied. Total rules applied 96 place count 641 transition count 579
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 108 place count 629 transition count 579
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 108 place count 629 transition count 539
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 188 place count 589 transition count 539
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 237 place count 540 transition count 490
Iterating global reduction 3 with 49 rules applied. Total rules applied 286 place count 540 transition count 490
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 286 place count 540 transition count 482
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 302 place count 532 transition count 482
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 492 place count 437 transition count 387
Partial Free-agglomeration rule applied 51 times.
Drop transitions removed 51 transitions
Iterating global reduction 3 with 51 rules applied. Total rules applied 543 place count 437 transition count 387
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 544 place count 436 transition count 386
Applied a total of 544 rules in 210 ms. Remains 436 /683 variables (removed 247) and now considering 386/633 (removed 247) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 436/683 places, 386/633 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 386 rows 436 cols
[2023-03-22 19:46:08] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 19:46:08] [INFO ] [Real]Absence check using 111 positive place invariants in 32 ms returned sat
[2023-03-22 19:46:08] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 19:46:08] [INFO ] [Nat]Absence check using 111 positive place invariants in 54 ms returned sat
[2023-03-22 19:46:08] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 19:46:09] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 0 ms to minimize.
[2023-03-22 19:46:09] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2023-03-22 19:46:09] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2023-03-22 19:46:09] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2023-03-22 19:46:09] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 0 ms to minimize.
[2023-03-22 19:46:09] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2023-03-22 19:46:10] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 0 ms to minimize.
[2023-03-22 19:46:10] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:46:10] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-22 19:46:10] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2023-03-22 19:46:10] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2023-03-22 19:46:10] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 0 ms to minimize.
[2023-03-22 19:46:10] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2023-03-22 19:46:10] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:46:11] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2023-03-22 19:46:11] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:46:11] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2023-03-22 19:46:11] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2023-03-22 19:46:11] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:46:11] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:46:11] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 1 ms to minimize.
[2023-03-22 19:46:11] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2023-03-22 19:46:12] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 0 ms to minimize.
[2023-03-22 19:46:12] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3223 ms
[2023-03-22 19:46:12] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 0 ms to minimize.
[2023-03-22 19:46:12] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2023-03-22 19:46:12] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2023-03-22 19:46:12] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:46:13] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2023-03-22 19:46:13] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:46:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 880 ms
[2023-03-22 19:46:13] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-22 19:46:13] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:46:13] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:46:13] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-22 19:46:13] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-22 19:46:13] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-22 19:46:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 636 ms
[2023-03-22 19:46:13] [INFO ] After 5293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-22 19:46:14] [INFO ] After 5695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 33 ms.
Support contains 40 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 386/386 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 436 transition count 378
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 428 transition count 378
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 16 place count 428 transition count 363
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 46 place count 413 transition count 363
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 409 transition count 359
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 409 transition count 359
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 54 place count 409 transition count 358
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 408 transition count 358
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 170 place count 351 transition count 301
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 193 place count 351 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 350 transition count 300
Applied a total of 194 rules in 115 ms. Remains 350 /436 variables (removed 86) and now considering 300/386 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 350/436 places, 300/386 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 300 rows 350 cols
[2023-03-22 19:46:14] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 19:46:14] [INFO ] [Real]Absence check using 108 positive place invariants in 39 ms returned sat
[2023-03-22 19:46:14] [INFO ] [Real]Absence check using 108 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 19:46:14] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 19:46:15] [INFO ] [Nat]Absence check using 108 positive place invariants in 22 ms returned sat
[2023-03-22 19:46:15] [INFO ] [Nat]Absence check using 108 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 19:46:15] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 19:46:15] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2023-03-22 19:46:15] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2023-03-22 19:46:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2023-03-22 19:46:16] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-22 19:46:16] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-03-22 19:46:16] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2023-03-22 19:46:16] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-03-22 19:46:16] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-22 19:46:16] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:46:16] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:46:16] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2023-03-22 19:46:16] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-22 19:46:16] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2023-03-22 19:46:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 909 ms
[2023-03-22 19:46:16] [INFO ] After 1862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-22 19:46:17] [INFO ] After 2098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 36 ms.
Support contains 27 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 300/300 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 350 transition count 297
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 347 transition count 297
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 24 place count 338 transition count 288
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 338 transition count 288
Applied a total of 27 rules in 73 ms. Remains 338 /350 variables (removed 12) and now considering 288/300 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 338/350 places, 288/300 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 381087 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 381087 steps, saw 79870 distinct states, run finished after 3004 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 288 rows 338 cols
[2023-03-22 19:46:20] [INFO ] Computed 111 place invariants in 5 ms
[2023-03-22 19:46:20] [INFO ] [Real]Absence check using 106 positive place invariants in 18 ms returned sat
[2023-03-22 19:46:20] [INFO ] [Real]Absence check using 106 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-22 19:46:20] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 19:46:20] [INFO ] [Nat]Absence check using 106 positive place invariants in 22 ms returned sat
[2023-03-22 19:46:20] [INFO ] [Nat]Absence check using 106 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-22 19:46:21] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 19:46:21] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2023-03-22 19:46:21] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-22 19:46:21] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 10 ms to minimize.
[2023-03-22 19:46:21] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 2 ms to minimize.
[2023-03-22 19:46:21] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 0 ms to minimize.
[2023-03-22 19:46:21] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 0 ms to minimize.
[2023-03-22 19:46:22] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 0 ms to minimize.
[2023-03-22 19:46:22] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 1 ms to minimize.
[2023-03-22 19:46:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1170 ms
[2023-03-22 19:46:22] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2023-03-22 19:46:22] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2023-03-22 19:46:22] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2023-03-22 19:46:23] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-22 19:46:23] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 22 ms to minimize.
[2023-03-22 19:46:23] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-22 19:46:23] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 4 ms to minimize.
[2023-03-22 19:46:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 826 ms
[2023-03-22 19:46:23] [INFO ] After 2798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-22 19:46:23] [INFO ] After 3153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 27 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 23 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 338/338 places, 288/288 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 16 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-22 19:46:23] [INFO ] Invariant cache hit.
[2023-03-22 19:46:24] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-22 19:46:24] [INFO ] Invariant cache hit.
[2023-03-22 19:46:24] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2023-03-22 19:46:24] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 19:46:24] [INFO ] Invariant cache hit.
[2023-03-22 19:46:24] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1177 ms. Remains : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 8 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 19:46:24] [INFO ] Invariant cache hit.
[2023-03-22 19:46:24] [INFO ] [Real]Absence check using 106 positive place invariants in 14 ms returned sat
[2023-03-22 19:46:24] [INFO ] [Real]Absence check using 106 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-22 19:46:24] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 19:46:25] [INFO ] [Nat]Absence check using 106 positive place invariants in 21 ms returned sat
[2023-03-22 19:46:25] [INFO ] [Nat]Absence check using 106 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 19:46:25] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 19:46:25] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2023-03-22 19:46:25] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 13 ms to minimize.
[2023-03-22 19:46:26] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 0 ms to minimize.
[2023-03-22 19:46:26] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 1 ms to minimize.
[2023-03-22 19:46:26] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 0 ms to minimize.
[2023-03-22 19:46:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 917 ms
[2023-03-22 19:46:26] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2023-03-22 19:46:27] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:46:27] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2023-03-22 19:46:27] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-22 19:46:27] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:46:27] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:46:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1144 ms
[2023-03-22 19:46:27] [INFO ] After 2771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 204 ms.
[2023-03-22 19:46:28] [INFO ] After 3110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 19:46:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-22 19:46:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 338 places, 288 transitions and 1241 arcs took 4 ms.
[2023-03-22 19:46:28] [INFO ] Flatten gal took : 99 ms
Total runtime 46477 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldPPPs_PT_010B
(NrP: 338 NrTr: 288 NrArc: 1241)

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

net check time: 0m 0.000sec

init dd package: 0m 2.917sec


before gc: list nodes free: 208341

after gc: idd nodes used:2204445, unused:61795555; list nodes free:289721168

before gc: list nodes free: 1099697

after gc: idd nodes used:4743135, unused:59256865; list nodes free:277964777
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5998080 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098688 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 ReachabilityFireability -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

2121098 4732972

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="ShieldPPPs-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldPPPs-PT-010B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717900447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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