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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 21:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:06 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.9K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 21:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 56K 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 ShieldPPPt-PT-003B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-003B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679523754071

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=ShieldPPPt-PT-003B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:22:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 22:22:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:22:36] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-22 22:22:36] [INFO ] Transformed 237 places.
[2023-03-22 22:22:36] [INFO ] Transformed 216 transitions.
[2023-03-22 22:22:36] [INFO ] Found NUPN structural information;
[2023-03-22 22:22:36] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 14) seen :11
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 :1
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 216 rows 237 cols
[2023-03-22 22:22:37] [INFO ] Computed 34 place invariants in 11 ms
[2023-03-22 22:22:37] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-22 22:22:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-22 22:22:38] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-22 22:22:38] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 4 ms to minimize.
[2023-03-22 22:22:38] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2023-03-22 22:22:38] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2023-03-22 22:22:38] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-22 22:22:38] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2023-03-22 22:22:38] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2023-03-22 22:22:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 380 ms
[2023-03-22 22:22:38] [INFO ] After 681ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 22:22:38] [INFO ] After 809ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 23 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 216/216 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 237 transition count 167
Reduce places removed 49 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 51 rules applied. Total rules applied 100 place count 188 transition count 165
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 105 place count 187 transition count 161
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 109 place count 183 transition count 161
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 109 place count 183 transition count 149
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 133 place count 171 transition count 149
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 151 place count 153 transition count 131
Iterating global reduction 4 with 18 rules applied. Total rules applied 169 place count 153 transition count 131
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 169 place count 153 transition count 122
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 187 place count 144 transition count 122
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 253 place count 111 transition count 89
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
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 267 place count 104 transition count 89
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 271 place count 104 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 272 place count 103 transition count 88
Applied a total of 272 rules in 73 ms. Remains 103 /237 variables (removed 134) and now considering 88/216 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 103/237 places, 88/216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1256253 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :{}
Probabilistic random walk after 1256253 steps, saw 925425 distinct states, run finished after 3004 ms. (steps per millisecond=418 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 103 cols
[2023-03-22 22:22:41] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-22 22:22:41] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:22:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-22 22:22:41] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-22 22:22:41] [INFO ] After 27ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:42] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 22:22:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-22 22:22:42] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 22:22:42] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 103/103 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-22 22:22:42] [INFO ] Invariant cache hit.
[2023-03-22 22:22:42] [INFO ] Implicit Places using invariants in 155 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/103 places, 88/88 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 171 ms. Remains : 102/103 places, 88/88 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1504137 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :{}
Probabilistic random walk after 1504137 steps, saw 1100752 distinct states, run finished after 3004 ms. (steps per millisecond=500 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 102 cols
[2023-03-22 22:22:45] [INFO ] Computed 33 place invariants in 16 ms
[2023-03-22 22:22:45] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:22:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 64 ms returned sat
[2023-03-22 22:22:45] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 22:22:45] [INFO ] After 25ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:45] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 13 ms to minimize.
[2023-03-22 22:22:45] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2023-03-22 22:22:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2023-03-22 22:22:45] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-22 22:22:46] [INFO ] After 606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 102/102 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-22 22:22:46] [INFO ] Invariant cache hit.
[2023-03-22 22:22:46] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-22 22:22:46] [INFO ] Invariant cache hit.
[2023-03-22 22:22:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 22:22:46] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-22 22:22:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 22:22:46] [INFO ] Invariant cache hit.
[2023-03-22 22:22:46] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 634 ms. Remains : 102/102 places, 88/88 transitions.
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 102 transition count 88
Applied a total of 12 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 102 cols
[2023-03-22 22:22:46] [INFO ] Computed 33 place invariants in 4 ms
[2023-03-22 22:22:46] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:22:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 20 ms returned sat
[2023-03-22 22:22:46] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-22 22:22:46] [INFO ] After 30ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:47] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-03-22 22:22:47] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2023-03-22 22:22:47] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2023-03-22 22:22:47] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2023-03-22 22:22:47] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2023-03-22 22:22:47] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2023-03-22 22:22:47] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2023-03-22 22:22:47] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-03-22 22:22:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 633 ms
[2023-03-22 22:22:47] [INFO ] After 682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 22:22:47] [INFO ] After 851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:22:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-22 22:22:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 88 transitions and 316 arcs took 1 ms.
[2023-03-22 22:22:47] [INFO ] Flatten gal took : 36 ms
Total runtime 11209 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: ShieldPPPt_PT_003B
(NrP: 102 NrTr: 88 NrArc: 316)

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

net check time: 0m 0.000sec

init dd package: 0m 2.986sec


RS generation: 0m 0.097sec


-> reachability set: #nodes 748 (7.5e+02) #states 3,389,377,932,062 (12)



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

checking: AG [[[[p74<=0 & 0<=p74] | [p40<=1 & 1<=p40]] | [[[p7<=1 & 1<=p7] & [p84<=0 & 0<=p84]] | [[[[[p84<=0 & 0<=p84] | [p5<=0 & 0<=p5]] & [[[p7<=1 & 1<=p7] | [p38<=1 & 1<=p38]] | [[p51<=0 & 0<=p51] | [[p81<=0 & 0<=p81] | [p3<=1 & 1<=p3]]]]] & [[[p19<=0 & 0<=p19] | [[p87<=1 & 1<=p87] & [p13<=1 & 1<=p13]]] & [[[[p70<=0 & 0<=p70] | [p42<=0 & 0<=p42]] | [[p79<=1 & 1<=p79] | [[p65<=0 & 0<=p65] & [p3<=1 & 1<=p3]]]] & [[p90<=1 & 1<=p90] | [[p11<=1 & 1<=p11] | [p95<=0 & 0<=p95]]]]]] | [[[p2<=0 & 0<=p2] & [p65<=0 & 0<=p65]] & [[p87<=1 & 1<=p87] & [[p53<=1 & 1<=p53] & [[p31<=0 & 0<=p31] | [p36<=1 & 1<=p36]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p87<=1 & 1<=p87] & [[p53<=1 & 1<=p53] & [[p31<=0 & 0<=p31] | [p36<=1 & 1<=p36]]]] & [[p65<=0 & 0<=p65] & [p2<=0 & 0<=p2]]] | [[[[[[p11<=1 & 1<=p11] | [p95<=0 & 0<=p95]] | [p90<=1 & 1<=p90]] & [[[[p3<=1 & 1<=p3] & [p65<=0 & 0<=p65]] | [p79<=1 & 1<=p79]] | [[p42<=0 & 0<=p42] | [p70<=0 & 0<=p70]]]] & [[[p13<=1 & 1<=p13] & [p87<=1 & 1<=p87]] | [p19<=0 & 0<=p19]]] & [[[[[p3<=1 & 1<=p3] | [p81<=0 & 0<=p81]] | [p51<=0 & 0<=p51]] | [[p38<=1 & 1<=p38] | [p7<=1 & 1<=p7]]] & [[p5<=0 & 0<=p5] | [p84<=0 & 0<=p84]]]]] | [[p84<=0 & 0<=p84] & [p7<=1 & 1<=p7]]] | [[p40<=1 & 1<=p40] | [p74<=0 & 0<=p74]]]]]]

abstracting: (0<=p74)
states: 3,389,377,932,062 (12)
abstracting: (p74<=0)
states: 3,389,377,932,041 (12)
abstracting: (1<=p40)
states: 3,710 (3)
abstracting: (p40<=1)
states: 3,389,377,932,062 (12)
abstracting: (1<=p7)
states: 56,451,095,768 (10)
abstracting: (p7<=1)
states: 3,389,377,932,062 (12)
abstracting: (0<=p84)
states: 3,389,377,932,062 (12)
abstracting: (p84<=0)
states: 2,826,513,285,902 (12)
abstracting: (0<=p84)
states: 3,389,377,932,062 (12)
abstracting: (p84<=0)
states: 2,826,513,285,902 (12)
abstracting: (0<=p5)
states: 3,389,377,932,062 (12)
abstracting: (p5<=0)
states: 3,389,371,108,934 (12)
abstracting: (1<=p7)
states: 56,451,095,768 (10)
abstracting: (p7<=1)
states: 3,389,377,932,062 (12)
abstracting: (1<=p38)
states: 680,712,801,280 (11)
abstracting: (p38<=1)
states: 3,389,377,932,062 (12)
abstracting: (0<=p51)
states: 3,389,377,932,062 (12)
abstracting: (p51<=0)
states: 2,905,408,908,062 (12)
abstracting: (0<=p81)
states: 3,389,377,932,062 (12)
abstracting: (p81<=0)
states: 2,264,796,997,742 (12)
abstracting: (1<=p3)
states: 1,195,269,181,440 (12)
abstracting: (p3<=1)
states: 3,389,377,932,062 (12)
abstracting: (0<=p19)
states: 3,389,377,932,062 (12)
abstracting: (p19<=0)
states: 2,190,811,388,702 (12)
abstracting: (1<=p87)
states: 1,124,351,262,720 (12)
abstracting: (p87<=1)
states: 3,389,377,932,062 (12)
abstracting: (1<=p13)
states: 952,132,300,800 (11)
abstracting: (p13<=1)
states: 3,389,377,932,062 (12)
abstracting: (0<=p70)
states: 3,389,377,932,062 (12)
abstracting: (p70<=0)
states: 2,259,815,040,542 (12)
abstracting: (0<=p42)
states: 3,389,377,932,062 (12)
abstracting: (p42<=0)
states: 3,388,688,686,432 (12)
abstracting: (1<=p79)
states: 562,290,467,160 (11)
abstracting: (p79<=1)
states: 3,389,377,932,062 (12)
abstracting: (0<=p65)
states: 3,389,377,932,062 (12)
abstracting: (p65<=0)
states: 2,542,205,763,422 (12)
abstracting: (1<=p3)
states: 1,195,269,181,440 (12)
abstracting: (p3<=1)
states: 3,389,377,932,062 (12)
abstracting: (1<=p90)
states: 677,875,586,404 (11)
abstracting: (p90<=1)
states: 3,389,377,932,062 (12)
abstracting: (0<=p95)
states: 3,389,377,932,062 (12)
abstracting: (p95<=0)
states: 2,264,796,997,742 (12)
abstracting: (1<=p11)
states: 476,066,150,400 (11)
abstracting: (p11<=1)
states: 3,389,377,932,062 (12)
abstracting: (0<=p2)
states: 3,389,377,932,062 (12)
abstracting: (p2<=0)
states: 2,390,572,479,262 (12)
abstracting: (0<=p65)
states: 3,389,377,932,062 (12)
abstracting: (p65<=0)
states: 2,542,205,763,422 (12)
abstracting: (1<=p36)
states: 666,492,610,560 (11)
abstracting: (p36<=1)
states: 3,389,377,932,062 (12)
abstracting: (0<=p31)
states: 3,389,377,932,062 (12)
abstracting: (p31<=0)
states: 2,278,556,914,462 (12)
abstracting: (1<=p53)
states: 967,938,048,000 (11)
abstracting: (p53<=1)
states: 3,389,377,932,062 (12)
abstracting: (1<=p87)
states: 1,124,351,262,720 (12)
abstracting: (p87<=1)
states: 3,389,377,932,062 (12)
-> the formula is TRUE

FORMULA ShieldPPPt-PT-003B-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

totally nodes used: 63409 (6.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 131031 446899 577930
used/not used/entry size/cache size: 489657 66619207 16 1024MB
basic ops cache: hits/miss/sum: 7428 32159 39587
used/not used/entry size/cache size: 69988 16707228 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: 2000 7107 9107
used/not used/entry size/cache size: 7107 8381501 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 67046729
1 60904
2 1189
3 41
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.881sec


BK_STOP 1679523772990

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:6508 (73), effective:873 (9)

initing FirstDep: 0m 0.000sec

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="ShieldPPPt-PT-003B"
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 ShieldPPPt-PT-003B, 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-167903718100574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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