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-167903717500134.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 ShieldIIPs-PT-040A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:00 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:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 338K 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 ShieldIIPs-PT-040A-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679492610761

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=ShieldIIPs-PT-040A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:43:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 13:43:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:43:33] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-22 13:43:33] [INFO ] Transformed 1003 places.
[2023-03-22 13:43:33] [INFO ] Transformed 963 transitions.
[2023-03-22 13:43:33] [INFO ] Found NUPN structural information;
[2023-03-22 13:43:33] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 13) seen :9
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-22 13:43:34] [INFO ] Computed 361 place invariants in 27 ms
[2023-03-22 13:43:34] [INFO ] After 467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 13:43:35] [INFO ] [Nat]Absence check using 361 positive place invariants in 84 ms returned sat
[2023-03-22 13:43:37] [INFO ] After 2457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 13:43:38] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 8 ms to minimize.
[2023-03-22 13:43:38] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2023-03-22 13:43:38] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2023-03-22 13:43:38] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-22 13:43:39] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-22 13:43:39] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-22 13:43:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2023-03-22 13:43:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1714 ms
[2023-03-22 13:43:40] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-22 13:43:40] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2023-03-22 13:43:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 415 ms
[2023-03-22 13:43:41] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2023-03-22 13:43:41] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-22 13:43:41] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2023-03-22 13:43:42] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-22 13:43:42] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-22 13:43:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1111 ms
[2023-03-22 13:43:43] [INFO ] Deduced a trap composed of 11 places in 328 ms of which 1 ms to minimize.
[2023-03-22 13:43:43] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2023-03-22 13:43:43] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-22 13:43:43] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2023-03-22 13:43:43] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2023-03-22 13:43:43] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2023-03-22 13:43:44] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2023-03-22 13:43:44] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-22 13:43:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1711 ms
[2023-03-22 13:43:44] [INFO ] After 9283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4519 ms.
[2023-03-22 13:43:48] [INFO ] After 14257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 453 ms.
Support contains 127 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 203 place count 1003 transition count 963
Applied a total of 203 rules in 126 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 1003/1003 places, 963/963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 108733 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{2=1}
Probabilistic random walk after 108733 steps, saw 100988 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :1
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-22 13:43:53] [INFO ] Computed 361 place invariants in 45 ms
[2023-03-22 13:43:53] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 13:43:53] [INFO ] [Nat]Absence check using 353 positive place invariants in 158 ms returned sat
[2023-03-22 13:43:53] [INFO ] [Nat]Absence check using 353 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-22 13:43:56] [INFO ] After 2405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 13:43:56] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2023-03-22 13:43:57] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2023-03-22 13:43:57] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2023-03-22 13:43:57] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2023-03-22 13:43:57] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2023-03-22 13:43:58] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-22 13:43:58] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2023-03-22 13:43:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1723 ms
[2023-03-22 13:43:58] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-22 13:43:59] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2023-03-22 13:43:59] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2023-03-22 13:43:59] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 20 ms to minimize.
[2023-03-22 13:43:59] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-22 13:43:59] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-22 13:44:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1273 ms
[2023-03-22 13:44:00] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2023-03-22 13:44:01] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 1 ms to minimize.
[2023-03-22 13:44:01] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-22 13:44:01] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 13 ms to minimize.
[2023-03-22 13:44:01] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2023-03-22 13:44:02] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2023-03-22 13:44:02] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 1 ms to minimize.
[2023-03-22 13:44:02] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-22 13:44:02] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 0 ms to minimize.
[2023-03-22 13:44:03] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2023-03-22 13:44:03] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 23 ms to minimize.
[2023-03-22 13:44:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2762 ms
[2023-03-22 13:44:03] [INFO ] After 9486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2190 ms.
[2023-03-22 13:44:05] [INFO ] After 12316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 320 ms.
Support contains 93 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 1003 transition count 963
Applied a total of 20 rules in 55 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 1003/1003 places, 963/963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 138406 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138406 steps, saw 124123 distinct states, run finished after 3003 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-22 13:44:09] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-22 13:44:09] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 13:44:10] [INFO ] [Nat]Absence check using 349 positive place invariants in 64 ms returned sat
[2023-03-22 13:44:10] [INFO ] [Nat]Absence check using 349 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-22 13:44:13] [INFO ] After 3556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 13:44:14] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2023-03-22 13:44:14] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2023-03-22 13:44:14] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2023-03-22 13:44:15] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-22 13:44:15] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2023-03-22 13:44:15] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2023-03-22 13:44:15] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-22 13:44:15] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-22 13:44:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1736 ms
[2023-03-22 13:44:16] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-22 13:44:16] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-22 13:44:17] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 2 ms to minimize.
[2023-03-22 13:44:17] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2023-03-22 13:44:17] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2023-03-22 13:44:17] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 2 ms to minimize.
[2023-03-22 13:44:18] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 1 ms to minimize.
[2023-03-22 13:44:18] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2023-03-22 13:44:18] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-22 13:44:18] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2023-03-22 13:44:19] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2023-03-22 13:44:19] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-22 13:44:19] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2023-03-22 13:44:19] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2023-03-22 13:44:20] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 0 ms to minimize.
[2023-03-22 13:44:20] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-22 13:44:20] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4027 ms
[2023-03-22 13:44:21] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2023-03-22 13:44:21] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-22 13:44:21] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 0 ms to minimize.
[2023-03-22 13:44:22] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2023-03-22 13:44:22] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2023-03-22 13:44:22] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2023-03-22 13:44:22] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2023-03-22 13:44:22] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-22 13:44:23] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2023-03-22 13:44:23] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-22 13:44:23] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-22 13:44:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2232 ms
[2023-03-22 13:44:23] [INFO ] After 13337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1220 ms.
[2023-03-22 13:44:24] [INFO ] After 14931ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 267 ms.
Support contains 93 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 26 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1003/1003 places, 963/963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 23 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-22 13:44:25] [INFO ] Invariant cache hit.
[2023-03-22 13:44:25] [INFO ] Implicit Places using invariants in 899 ms returned []
[2023-03-22 13:44:25] [INFO ] Invariant cache hit.
[2023-03-22 13:44:27] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2728 ms to find 0 implicit places.
[2023-03-22 13:44:28] [INFO ] Redundant transitions in 193 ms returned []
[2023-03-22 13:44:28] [INFO ] Invariant cache hit.
[2023-03-22 13:44:28] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3724 ms. Remains : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 24 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-22 13:44:28] [INFO ] Invariant cache hit.
[2023-03-22 13:44:29] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 13:44:29] [INFO ] [Nat]Absence check using 349 positive place invariants in 61 ms returned sat
[2023-03-22 13:44:29] [INFO ] [Nat]Absence check using 349 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-22 13:44:31] [INFO ] After 2332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 13:44:32] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 0 ms to minimize.
[2023-03-22 13:44:33] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 0 ms to minimize.
[2023-03-22 13:44:33] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-22 13:44:33] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-22 13:44:33] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2023-03-22 13:44:34] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 0 ms to minimize.
[2023-03-22 13:44:34] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 0 ms to minimize.
[2023-03-22 13:44:34] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2023-03-22 13:44:34] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-22 13:44:35] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-22 13:44:35] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-22 13:44:35] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 13:44:35] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-22 13:44:35] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3238 ms
[2023-03-22 13:44:36] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 0 ms to minimize.
[2023-03-22 13:44:37] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
[2023-03-22 13:44:37] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2023-03-22 13:44:37] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-22 13:44:37] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2023-03-22 13:44:37] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2023-03-22 13:44:38] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-22 13:44:38] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 0 ms to minimize.
[2023-03-22 13:44:38] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2023-03-22 13:44:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2347 ms
[2023-03-22 13:44:39] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2023-03-22 13:44:39] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-22 13:44:39] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2023-03-22 13:44:40] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2023-03-22 13:44:40] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 1 ms to minimize.
[2023-03-22 13:44:40] [INFO ] Deduced a trap composed of 17 places in 396 ms of which 0 ms to minimize.
[2023-03-22 13:44:41] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2023-03-22 13:44:41] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-22 13:44:41] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2023-03-22 13:44:41] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2023-03-22 13:44:41] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-22 13:44:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2713 ms
[2023-03-22 13:44:41] [INFO ] After 12554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1871 ms.
[2023-03-22 13:44:43] [INFO ] After 14775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 13:44:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 13 ms.
[2023-03-22 13:44:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1003 places, 963 transitions and 4802 arcs took 12 ms.
[2023-03-22 13:44:44] [INFO ] Flatten gal took : 166 ms
Total runtime 71313 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: ShieldIIPs_PT_040A
(NrP: 1003 NrTr: 963 NrArc: 4802)

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

net check time: 0m 0.000sec

init dd package: 0m 3.036sec


before gc: list nodes free: 851251

after gc: idd nodes used:2051481, unused:61948519; list nodes free:278117675
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6160952 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099700 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.004sec

2241191 2306055 2058079 2701513 2622897

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="ShieldIIPs-PT-040A"
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 ShieldIIPs-PT-040A, 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-167903717500134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040A.tgz
mv ShieldIIPs-PT-040A 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 ;