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-167903718000478.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-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:50 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.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 01:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 528K 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-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679517486037

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=ShieldPPPs-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 20:38:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 20:38:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:38:08] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-22 20:38:08] [INFO ] Transformed 2043 places.
[2023-03-22 20:38:08] [INFO ] Transformed 1893 transitions.
[2023-03-22 20:38:08] [INFO ] Found NUPN structural information;
[2023-03-22 20:38:08] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 12) seen :10
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1893 rows 2043 cols
[2023-03-22 20:38:08] [INFO ] Computed 331 place invariants in 37 ms
[2023-03-22 20:38:09] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:38:10] [INFO ] [Nat]Absence check using 331 positive place invariants in 155 ms returned sat
[2023-03-22 20:38:11] [INFO ] After 1521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:38:12] [INFO ] Deduced a trap composed of 13 places in 698 ms of which 12 ms to minimize.
[2023-03-22 20:38:13] [INFO ] Deduced a trap composed of 22 places in 575 ms of which 2 ms to minimize.
[2023-03-22 20:38:13] [INFO ] Deduced a trap composed of 18 places in 453 ms of which 4 ms to minimize.
[2023-03-22 20:38:14] [INFO ] Deduced a trap composed of 24 places in 469 ms of which 4 ms to minimize.
[2023-03-22 20:38:15] [INFO ] Deduced a trap composed of 20 places in 510 ms of which 3 ms to minimize.
[2023-03-22 20:38:15] [INFO ] Deduced a trap composed of 16 places in 423 ms of which 1 ms to minimize.
[2023-03-22 20:38:16] [INFO ] Deduced a trap composed of 42 places in 509 ms of which 5 ms to minimize.
[2023-03-22 20:38:16] [INFO ] Deduced a trap composed of 26 places in 449 ms of which 1 ms to minimize.
[2023-03-22 20:38:17] [INFO ] Deduced a trap composed of 35 places in 493 ms of which 1 ms to minimize.
[2023-03-22 20:38:17] [INFO ] Deduced a trap composed of 35 places in 538 ms of which 1 ms to minimize.
[2023-03-22 20:38:18] [INFO ] Deduced a trap composed of 41 places in 537 ms of which 1 ms to minimize.
[2023-03-22 20:38:19] [INFO ] Deduced a trap composed of 17 places in 466 ms of which 1 ms to minimize.
[2023-03-22 20:38:19] [INFO ] Deduced a trap composed of 33 places in 365 ms of which 1 ms to minimize.
[2023-03-22 20:38:20] [INFO ] Deduced a trap composed of 25 places in 555 ms of which 2 ms to minimize.
[2023-03-22 20:38:20] [INFO ] Deduced a trap composed of 20 places in 428 ms of which 1 ms to minimize.
[2023-03-22 20:38:21] [INFO ] Deduced a trap composed of 28 places in 535 ms of which 1 ms to minimize.
[2023-03-22 20:38:22] [INFO ] Deduced a trap composed of 22 places in 513 ms of which 1 ms to minimize.
[2023-03-22 20:38:23] [INFO ] Deduced a trap composed of 31 places in 484 ms of which 1 ms to minimize.
[2023-03-22 20:38:23] [INFO ] Deduced a trap composed of 19 places in 498 ms of which 1 ms to minimize.
[2023-03-22 20:38:24] [INFO ] Deduced a trap composed of 11 places in 545 ms of which 1 ms to minimize.
[2023-03-22 20:38:25] [INFO ] Deduced a trap composed of 22 places in 672 ms of which 2 ms to minimize.
[2023-03-22 20:38:25] [INFO ] Deduced a trap composed of 35 places in 474 ms of which 8 ms to minimize.
[2023-03-22 20:38:26] [INFO ] Deduced a trap composed of 23 places in 357 ms of which 1 ms to minimize.
[2023-03-22 20:38:26] [INFO ] Deduced a trap composed of 10 places in 385 ms of which 1 ms to minimize.
[2023-03-22 20:38:27] [INFO ] Deduced a trap composed of 22 places in 368 ms of which 1 ms to minimize.
[2023-03-22 20:38:27] [INFO ] Deduced a trap composed of 25 places in 386 ms of which 1 ms to minimize.
[2023-03-22 20:38:28] [INFO ] Deduced a trap composed of 26 places in 397 ms of which 1 ms to minimize.
[2023-03-22 20:38:28] [INFO ] Deduced a trap composed of 24 places in 352 ms of which 1 ms to minimize.
[2023-03-22 20:38:29] [INFO ] Deduced a trap composed of 16 places in 386 ms of which 1 ms to minimize.
[2023-03-22 20:38:29] [INFO ] Deduced a trap composed of 19 places in 388 ms of which 2 ms to minimize.
[2023-03-22 20:38:29] [INFO ] Deduced a trap composed of 34 places in 364 ms of which 1 ms to minimize.
[2023-03-22 20:38:30] [INFO ] Deduced a trap composed of 15 places in 329 ms of which 1 ms to minimize.
[2023-03-22 20:38:30] [INFO ] Deduced a trap composed of 56 places in 302 ms of which 1 ms to minimize.
[2023-03-22 20:38:31] [INFO ] Deduced a trap composed of 20 places in 397 ms of which 5 ms to minimize.
[2023-03-22 20:38:31] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 1 ms to minimize.
[2023-03-22 20:38:32] [INFO ] Deduced a trap composed of 30 places in 350 ms of which 1 ms to minimize.
[2023-03-22 20:38:32] [INFO ] Deduced a trap composed of 17 places in 364 ms of which 1 ms to minimize.
[2023-03-22 20:38:33] [INFO ] Deduced a trap composed of 37 places in 366 ms of which 1 ms to minimize.
[2023-03-22 20:38:33] [INFO ] Deduced a trap composed of 26 places in 347 ms of which 1 ms to minimize.
[2023-03-22 20:38:34] [INFO ] Deduced a trap composed of 27 places in 437 ms of which 13 ms to minimize.
[2023-03-22 20:38:34] [INFO ] Deduced a trap composed of 20 places in 372 ms of which 1 ms to minimize.
[2023-03-22 20:38:34] [INFO ] Trap strengthening (SAT) tested/added 41/41 trap constraints in 22671 ms
[2023-03-22 20:38:34] [INFO ] After 24371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 20:38:34] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 66 ms.
Support contains 54 out of 2043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 2043 transition count 1700
Reduce places removed 193 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 198 rules applied. Total rules applied 391 place count 1850 transition count 1695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 396 place count 1845 transition count 1695
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 396 place count 1845 transition count 1545
Deduced a syphon composed of 150 places in 5 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 696 place count 1695 transition count 1545
Discarding 197 places :
Symmetric choice reduction at 3 with 197 rule applications. Total rules 893 place count 1498 transition count 1348
Iterating global reduction 3 with 197 rules applied. Total rules applied 1090 place count 1498 transition count 1348
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1090 place count 1498 transition count 1270
Deduced a syphon composed of 78 places in 5 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 1246 place count 1420 transition count 1270
Performed 429 Post agglomeration using F-continuation condition.Transition count delta: 429
Deduced a syphon composed of 429 places in 1 ms
Reduce places removed 429 places and 0 transitions.
Iterating global reduction 3 with 858 rules applied. Total rules applied 2104 place count 991 transition count 841
Partial Free-agglomeration rule applied 248 times.
Drop transitions removed 248 transitions
Iterating global reduction 3 with 248 rules applied. Total rules applied 2352 place count 991 transition count 841
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2353 place count 990 transition count 840
Applied a total of 2353 rules in 691 ms. Remains 990 /2043 variables (removed 1053) and now considering 840/1893 (removed 1053) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 990/2043 places, 840/1893 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 154845 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154845 steps, saw 113397 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 990 cols
[2023-03-22 20:38:38] [INFO ] Computed 331 place invariants in 61 ms
[2023-03-22 20:38:38] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:38:39] [INFO ] [Nat]Absence check using 310 positive place invariants in 190 ms returned sat
[2023-03-22 20:38:39] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-22 20:38:40] [INFO ] After 818ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:38:40] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2023-03-22 20:38:40] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2023-03-22 20:38:40] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2023-03-22 20:38:41] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-22 20:38:41] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2023-03-22 20:38:41] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2023-03-22 20:38:41] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 0 ms to minimize.
[2023-03-22 20:38:41] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2023-03-22 20:38:42] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-22 20:38:42] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-03-22 20:38:42] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2023-03-22 20:38:42] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 2 ms to minimize.
[2023-03-22 20:38:42] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2023-03-22 20:38:43] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2023-03-22 20:38:43] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 9 ms to minimize.
[2023-03-22 20:38:43] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 1 ms to minimize.
[2023-03-22 20:38:43] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-22 20:38:43] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2023-03-22 20:38:43] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2023-03-22 20:38:44] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-22 20:38:44] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2023-03-22 20:38:44] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-22 20:38:44] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 13 ms to minimize.
[2023-03-22 20:38:44] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2023-03-22 20:38:44] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-22 20:38:44] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-22 20:38:45] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 0 ms to minimize.
[2023-03-22 20:38:45] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 8 ms to minimize.
[2023-03-22 20:38:45] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2023-03-22 20:38:45] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-22 20:38:45] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5331 ms
[2023-03-22 20:38:45] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2023-03-22 20:38:46] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2023-03-22 20:38:46] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2023-03-22 20:38:46] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2023-03-22 20:38:46] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2023-03-22 20:38:46] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2023-03-22 20:38:47] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-22 20:38:47] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2023-03-22 20:38:47] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-22 20:38:47] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2023-03-22 20:38:47] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-22 20:38:47] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2023-03-22 20:38:48] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 0 ms to minimize.
[2023-03-22 20:38:48] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2023-03-22 20:38:48] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2023-03-22 20:38:48] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2023-03-22 20:38:48] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-22 20:38:49] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 1 ms to minimize.
[2023-03-22 20:38:49] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2023-03-22 20:38:49] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2023-03-22 20:38:49] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2023-03-22 20:38:49] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2023-03-22 20:38:50] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2023-03-22 20:38:50] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 1 ms to minimize.
[2023-03-22 20:38:50] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 1 ms to minimize.
[2023-03-22 20:38:50] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-22 20:38:51] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2023-03-22 20:38:51] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-22 20:38:51] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2023-03-22 20:38:51] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 4 ms to minimize.
[2023-03-22 20:38:51] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 20:38:52] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2023-03-22 20:38:52] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 6399 ms
[2023-03-22 20:38:52] [INFO ] After 12958ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 435 ms.
[2023-03-22 20:38:52] [INFO ] After 13759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 54 out of 990 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 990/990 places, 840/840 transitions.
Applied a total of 0 rules in 92 ms. Remains 990 /990 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 990/990 places, 840/840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 990/990 places, 840/840 transitions.
Applied a total of 0 rules in 61 ms. Remains 990 /990 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2023-03-22 20:38:52] [INFO ] Invariant cache hit.
[2023-03-22 20:38:53] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-22 20:38:53] [INFO ] Invariant cache hit.
[2023-03-22 20:38:54] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
[2023-03-22 20:38:54] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-22 20:38:54] [INFO ] Invariant cache hit.
[2023-03-22 20:38:55] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2442 ms. Remains : 990/990 places, 840/840 transitions.
Applied a total of 0 rules in 29 ms. Remains 990 /990 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 20:38:55] [INFO ] Invariant cache hit.
[2023-03-22 20:38:55] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 20:38:55] [INFO ] [Nat]Absence check using 310 positive place invariants in 43 ms returned sat
[2023-03-22 20:38:55] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 3 ms returned sat
[2023-03-22 20:38:56] [INFO ] After 586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 20:38:56] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-22 20:38:56] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2023-03-22 20:38:56] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2023-03-22 20:38:57] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2023-03-22 20:38:57] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-22 20:38:57] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2023-03-22 20:38:57] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-22 20:38:57] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-03-22 20:38:57] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2023-03-22 20:38:58] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-22 20:38:58] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2023-03-22 20:38:58] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2023-03-22 20:38:58] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-22 20:38:58] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2023-03-22 20:38:58] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-22 20:38:58] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2023-03-22 20:38:59] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-22 20:38:59] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-22 20:38:59] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2023-03-22 20:38:59] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-22 20:38:59] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-22 20:38:59] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2023-03-22 20:38:59] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 1 ms to minimize.
[2023-03-22 20:39:00] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3720 ms
[2023-03-22 20:39:00] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
[2023-03-22 20:39:00] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2023-03-22 20:39:01] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2023-03-22 20:39:01] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 2 ms to minimize.
[2023-03-22 20:39:01] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
[2023-03-22 20:39:01] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
[2023-03-22 20:39:02] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2023-03-22 20:39:02] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2023-03-22 20:39:02] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 2 ms to minimize.
[2023-03-22 20:39:02] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 1 ms to minimize.
[2023-03-22 20:39:03] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2023-03-22 20:39:03] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 0 ms to minimize.
[2023-03-22 20:39:03] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 0 ms to minimize.
[2023-03-22 20:39:03] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2023-03-22 20:39:04] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-03-22 20:39:04] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2023-03-22 20:39:04] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2023-03-22 20:39:04] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 0 ms to minimize.
[2023-03-22 20:39:05] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2023-03-22 20:39:05] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2023-03-22 20:39:05] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2023-03-22 20:39:05] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2023-03-22 20:39:06] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2023-03-22 20:39:06] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2023-03-22 20:39:06] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2023-03-22 20:39:06] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2023-03-22 20:39:06] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2023-03-22 20:39:07] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 0 ms to minimize.
[2023-03-22 20:39:07] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2023-03-22 20:39:07] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2023-03-22 20:39:07] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 0 ms to minimize.
[2023-03-22 20:39:07] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2023-03-22 20:39:08] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2023-03-22 20:39:08] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-22 20:39:08] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 0 ms to minimize.
[2023-03-22 20:39:08] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2023-03-22 20:39:08] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2023-03-22 20:39:09] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2023-03-22 20:39:09] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2023-03-22 20:39:09] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2023-03-22 20:39:09] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2023-03-22 20:39:09] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-22 20:39:09] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2023-03-22 20:39:10] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-22 20:39:10] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2023-03-22 20:39:10] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 0 ms to minimize.
[2023-03-22 20:39:10] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 10192 ms
[2023-03-22 20:39:10] [INFO ] After 14975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 508 ms.
[2023-03-22 20:39:11] [INFO ] After 15697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 20:39:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-22 20:39:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 990 places, 840 transitions and 3647 arcs took 7 ms.
[2023-03-22 20:39:11] [INFO ] Flatten gal took : 98 ms
Total runtime 63509 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: ShieldPPPs_PT_030B
(NrP: 990 NrTr: 840 NrArc: 3647)

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

net check time: 0m 0.000sec

init dd package: 0m 2.930sec


before gc: list nodes free: 234160

after gc: idd nodes used:225305, unused:63774695; list nodes free:273708846

before gc: list nodes free: 1257438

after gc: idd nodes used:458093, unused:63541907; list nodes free:276815828

before gc: list nodes free: 1493819

after gc: idd nodes used:751373, unused:63248627; list nodes free:279652086

before gc: list nodes free: 2458862

after gc: idd nodes used:757299, unused:63242701; list nodes free:279640529

before gc: list nodes free: 1868639

after gc: idd nodes used:1093925, unused:62906075; list nodes free:278044656

before gc: list nodes free: 1946327

after gc: idd nodes used:968525, unused:63031475; list nodes free:280770823
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6256824 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16096372 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.003sec

235282 265054 485078 709730 739286 1046368 980014 969444

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-030B"
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 ShieldPPPs-PT-030B, 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 r394-oct2-167903718000478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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