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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 8.6K Feb 25 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 83K 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 ShieldIIPt-PT-005B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-005B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679499193035

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=ShieldIIPt-PT-005B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:33:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 15:33:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:33:15] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-22 15:33:15] [INFO ] Transformed 353 places.
[2023-03-22 15:33:15] [INFO ] Transformed 328 transitions.
[2023-03-22 15:33:15] [INFO ] Found NUPN structural information;
[2023-03-22 15:33:15] [INFO ] Parsed PT model containing 353 places and 328 transitions and 816 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 12) seen :9
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 328 rows 353 cols
[2023-03-22 15:33:16] [INFO ] Computed 46 place invariants in 8 ms
[2023-03-22 15:33:16] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:33:16] [INFO ] [Nat]Absence check using 46 positive place invariants in 61 ms returned sat
[2023-03-22 15:33:17] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:33:17] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 29 ms to minimize.
[2023-03-22 15:33:17] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 17 ms to minimize.
[2023-03-22 15:33:17] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2023-03-22 15:33:17] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 11 ms to minimize.
[2023-03-22 15:33:18] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2023-03-22 15:33:18] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2023-03-22 15:33:18] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2023-03-22 15:33:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 972 ms
[2023-03-22 15:33:18] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2023-03-22 15:33:18] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
[2023-03-22 15:33:18] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2023-03-22 15:33:18] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2023-03-22 15:33:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 494 ms
[2023-03-22 15:33:18] [INFO ] After 1888ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-22 15:33:18] [INFO ] After 2211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 27 ms.
Support contains 33 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 328/328 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 353 transition count 260
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 138 place count 285 transition count 258
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 10 rules applied. Total rules applied 148 place count 284 transition count 249
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 157 place count 275 transition count 249
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 157 place count 275 transition count 229
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 197 place count 255 transition count 229
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 222 place count 230 transition count 204
Iterating global reduction 4 with 25 rules applied. Total rules applied 247 place count 230 transition count 204
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 247 place count 230 transition count 198
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 259 place count 224 transition count 198
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 407 place count 150 transition count 124
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 421 place count 143 transition count 125
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 424 place count 143 transition count 122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 427 place count 140 transition count 122
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 431 place count 140 transition count 122
Applied a total of 431 rules in 89 ms. Remains 140 /353 variables (removed 213) and now considering 122/328 (removed 206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 140/353 places, 122/328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 229027 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 229027 steps, saw 146214 distinct states, run finished after 3003 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 122 rows 140 cols
[2023-03-22 15:33:22] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-22 15:33:22] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:33:22] [INFO ] [Nat]Absence check using 46 positive place invariants in 7 ms returned sat
[2023-03-22 15:33:22] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:33:22] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-22 15:33:22] [INFO ] After 114ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:33:22] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2023-03-22 15:33:22] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2023-03-22 15:33:22] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2023-03-22 15:33:22] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 3 ms to minimize.
[2023-03-22 15:33:23] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2023-03-22 15:33:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 390 ms
[2023-03-22 15:33:23] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2023-03-22 15:33:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-22 15:33:23] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2023-03-22 15:33:23] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-22 15:33:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2023-03-22 15:33:23] [INFO ] After 908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-22 15:33:23] [INFO ] After 1105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 32 ms.
Support contains 33 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 140/140 places, 122/122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-22 15:33:23] [INFO ] Invariant cache hit.
[2023-03-22 15:33:23] [INFO ] Implicit Places using invariants in 200 ms returned [124]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 207 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 139/140 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 215 ms. Remains : 139/140 places, 122/122 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 277462 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 277462 steps, saw 176996 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 122 rows 139 cols
[2023-03-22 15:33:26] [INFO ] Computed 45 place invariants in 2 ms
[2023-03-22 15:33:26] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:33:26] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2023-03-22 15:33:27] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:33:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 15:33:27] [INFO ] After 94ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:33:27] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-22 15:33:27] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2023-03-22 15:33:27] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2023-03-22 15:33:27] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2023-03-22 15:33:27] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-22 15:33:27] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2023-03-22 15:33:27] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2023-03-22 15:33:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 612 ms
[2023-03-22 15:33:28] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 0 ms to minimize.
[2023-03-22 15:33:28] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2023-03-22 15:33:28] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
[2023-03-22 15:33:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 593 ms
[2023-03-22 15:33:28] [INFO ] After 1422ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-22 15:33:28] [INFO ] After 1669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 34 ms.
Support contains 31 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 122/122 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 135 transition count 118
Applied a total of 8 rules in 12 ms. Remains 135 /139 variables (removed 4) and now considering 118/122 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 135/139 places, 118/122 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 314378 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 314378 steps, saw 204054 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 118 rows 135 cols
[2023-03-22 15:33:31] [INFO ] Computed 45 place invariants in 3 ms
[2023-03-22 15:33:31] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 15:33:31] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2023-03-22 15:33:32] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 15:33:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 15:33:32] [INFO ] After 63ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:33:32] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2023-03-22 15:33:32] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 13 ms to minimize.
[2023-03-22 15:33:32] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-22 15:33:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 294 ms
[2023-03-22 15:33:32] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2023-03-22 15:33:32] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2023-03-22 15:33:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2023-03-22 15:33:32] [INFO ] After 570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-22 15:33:32] [INFO ] After 974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 31 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 118/118 transitions.
Applied a total of 0 rules in 7 ms. Remains 135 /135 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 135/135 places, 118/118 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 118/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-22 15:33:32] [INFO ] Invariant cache hit.
[2023-03-22 15:33:33] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-22 15:33:33] [INFO ] Invariant cache hit.
[2023-03-22 15:33:33] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-22 15:33:33] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
[2023-03-22 15:33:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 15:33:33] [INFO ] Invariant cache hit.
[2023-03-22 15:33:33] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 938 ms. Remains : 135/135 places, 118/118 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 135 transition count 118
Applied a total of 8 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 118 rows 135 cols
[2023-03-22 15:33:33] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-22 15:33:33] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 15:33:33] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-22 15:33:33] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 15:33:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-22 15:33:34] [INFO ] After 55ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:33:34] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2023-03-22 15:33:34] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 25 ms to minimize.
[2023-03-22 15:33:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-22 15:33:34] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-22 15:33:34] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 15:33:34] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 23 ms.
[2023-03-22 15:33:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 118 transitions and 452 arcs took 2 ms.
[2023-03-22 15:33:34] [INFO ] Flatten gal took : 76 ms
Total runtime 19066 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: ShieldIIPt_PT_005B
(NrP: 135 NrTr: 118 NrArc: 452)

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

net check time: 0m 0.000sec

init dd package: 0m 2.945sec


RS generation: 0m 0.769sec


-> reachability set: #nodes 33876 (3.4e+04) #states 779,604,090,320,622,448 (17)



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

checking: EF [[[[p2<=1 & 1<=p2] & [[p35<=1 & 1<=p35] & [p127<=0 & 0<=p127]]] & [[p79<=1 & 1<=p79] & [[p21<=1 & 1<=p21] & [[p71<=0 & 0<=p71] | [p12<=1 & 1<=p12]]]]]]
normalized: E [true U [[[p79<=1 & 1<=p79] & [[p21<=1 & 1<=p21] & [[p71<=0 & 0<=p71] | [p12<=1 & 1<=p12]]]] & [[[p127<=0 & 0<=p127] & [p35<=1 & 1<=p35]] & [p2<=1 & 1<=p2]]]]

abstracting: (1<=p2)
states: 389,703,492,764,172,288 (17)
abstracting: (p2<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (1<=p35)
states: 259,914,064,747,364,352 (17)
abstracting: (p35<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (0<=p127)
states: 779,604,090,320,622,448 (17)
abstracting: (p127<=0)
states: 576,585,820,345,168,450 (17)
abstracting: (1<=p12)
states: 259,981,106,490,114,048 (17)
abstracting: (p12<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (0<=p71)
states: 779,604,090,320,622,448 (17)
abstracting: (p71<=0)
states: 539,839,985,178,760,048 (17)
abstracting: (1<=p21)
states: 155,886,272,868,777,984 (17)
abstracting: (p21<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (1<=p79)
states: 170,683,173 (8)
abstracting: (p79<=1)
states: 779,604,090,320,622,448 (17)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.065sec

checking: AG [[[[[p12<=1 & 1<=p12] | [p28<=0 & 0<=p28]] | [[p131<=0 & 0<=p131] | [p99<=0 & 0<=p99]]] | [[[p81<=1 & 1<=p81] | [p6<=0 & 0<=p6]] | [[[p125<=0 & 0<=p125] & [p52<=1 & 1<=p52]] | [[[p123<=0 & 0<=p123] & [p121<=1 & 1<=p121]] | [[[p118<=1 & 1<=p118] & [p55<=1 & 1<=p55]] & [[p107<=0 & 0<=p107] & [[[[p105<=0 & 0<=p105] & [p70<=1 & 1<=p70]] & [[[p63<=0 & 0<=p63] | [p109<=1 & 1<=p109]] & [[[p4<=0 & 0<=p4] | [p43<=1 & 1<=p43]] | [[p33<=0 & 0<=p33] | [p133<=1 & 1<=p133]]]]] | [[[p30<=0 & 0<=p30] | [p101<=1 & 1<=p101]] & [[p19<=1 & 1<=p19] | [p54<=1 & 1<=p54]]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[[p54<=1 & 1<=p54] | [p19<=1 & 1<=p19]] & [[p101<=1 & 1<=p101] | [p30<=0 & 0<=p30]]] | [[[[[p133<=1 & 1<=p133] | [p33<=0 & 0<=p33]] | [[p43<=1 & 1<=p43] | [p4<=0 & 0<=p4]]] & [[p109<=1 & 1<=p109] | [p63<=0 & 0<=p63]]] & [[p70<=1 & 1<=p70] & [p105<=0 & 0<=p105]]]] & [p107<=0 & 0<=p107]] & [[p55<=1 & 1<=p55] & [p118<=1 & 1<=p118]]] | [[p121<=1 & 1<=p121] & [p123<=0 & 0<=p123]]] | [[p52<=1 & 1<=p52] & [p125<=0 & 0<=p125]]] | [[p6<=0 & 0<=p6] | [p81<=1 & 1<=p81]]] | [[[p99<=0 & 0<=p99] | [p131<=0 & 0<=p131]] | [[p28<=0 & 0<=p28] | [p12<=1 & 1<=p12]]]]]]]

abstracting: (1<=p12)
states: 259,981,106,490,114,048 (17)
abstracting: (p12<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (0<=p28)
states: 779,604,090,320,622,448 (17)
abstracting: (p28<=0)
states: 623,623,010,946,945,904 (17)
abstracting: (0<=p131)
states: 779,604,090,320,622,448 (17)
abstracting: (p131<=0)
states: 629,249,384,756,131,228 (17)
abstracting: (0<=p99)
states: 779,604,090,320,622,448 (17)
abstracting: (p99<=0)
states: 779,604,090,320,328,823 (17)
abstracting: (1<=p81)
states: 259,868,029,981,667,328 (17)
abstracting: (p81<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (0<=p6)
states: 779,604,090,320,622,448 (17)
abstracting: (p6<=0)
states: 519,693,411,519,861,616 (17)
abstracting: (0<=p125)
states: 779,604,090,320,622,448 (17)
abstracting: (p125<=0)
states: 585,862,674,511,223,818 (17)
abstracting: (1<=p52)
states: 194,854,963,031,359,488 (17)
abstracting: (p52<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (0<=p123)
states: 779,604,090,320,622,448 (17)
abstracting: (p123<=0)
states: 658,925,540,111,263,852 (17)
abstracting: (1<=p121)
states: 238,338,150,510,068,640 (17)
abstracting: (p121<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (1<=p118)
states: 178,863,615,102,606,336 (17)
abstracting: (p118<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (1<=p55)
states: 195,042,036,581,203,968 (17)
abstracting: (p55<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (0<=p107)
states: 779,604,090,320,622,448 (17)
abstracting: (p107<=0)
states: 779,604,090,320,622,205 (17)
abstracting: (0<=p105)
states: 779,604,090,320,622,448 (17)
abstracting: (p105<=0)
states: 584,703,067,740,576,976 (17)
abstracting: (1<=p70)
states: 60,311,774,655,990,693 (16)
abstracting: (p70<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (0<=p63)
states: 779,604,090,320,622,448 (17)
abstracting: (p63<=0)
states: 491,887,164,150,387,568 (17)
abstracting: (1<=p109)
states: 256,002,674,204,350,998 (17)
abstracting: (p109<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (0<=p4)
states: 779,604,090,320,622,448 (17)
abstracting: (p4<=0)
states: 779,586,807,759,626,827 (17)
abstracting: (1<=p43)
states: 389,508,462,239,809,536 (17)
abstracting: (p43<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (0<=p33)
states: 779,604,090,320,622,448 (17)
abstracting: (p33<=0)
states: 779,604,069,033,249,355 (17)
abstracting: (1<=p133)
states: 157,312,346,189,032,746 (17)
abstracting: (p133<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (0<=p30)
states: 779,604,090,320,622,448 (17)
abstracting: (p30<=0)
states: 623,969,731,879,146,352 (17)
abstracting: (1<=p101)
states: 259,868,030,106,727,296 (17)
abstracting: (p101<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (1<=p19)
states: 155,886,272,868,777,984 (17)
abstracting: (p19<=1)
states: 779,604,090,320,622,448 (17)
abstracting: (1<=p54)
states: 194,477,937,877,057,536 (17)
abstracting: (p54<=1)
states: 779,604,090,320,622,448 (17)
-> the formula is TRUE

FORMULA ShieldIIPt-PT-005B-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.278sec

totally nodes used: 494490 (4.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1120660 3366026 4486686
used/not used/entry size/cache size: 3533655 63575209 16 1024MB
basic ops cache: hits/miss/sum: 214793 699562 914355
used/not used/entry size/cache size: 1090929 15686287 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 58033 174293 232326
used/not used/entry size/cache size: 172945 8215663 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66643111
1 439420
2 24054
3 2158
4 117
5 4
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.945sec


BK_STOP 1679499220860

--------------------
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.000sec


iterations count:34287 (290), effective:4684 (39)

initing FirstDep: 0m 0.012sec

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="ShieldIIPt-PT-005B"
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 ShieldIIPt-PT-005B, 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-167903717700254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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