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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:39 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.3K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 16:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 16:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 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 49K 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-003B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679484523869

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-003B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 11:28:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 11:28:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:28:46] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-22 11:28:46] [INFO ] Transformed 183 places.
[2023-03-22 11:28:46] [INFO ] Transformed 180 transitions.
[2023-03-22 11:28:46] [INFO ] Found NUPN structural information;
[2023-03-22 11:28:46] [INFO ] Parsed PT model containing 183 places and 180 transitions and 540 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 23 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 10) seen :8
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 180 rows 183 cols
[2023-03-22 11:28:46] [INFO ] Computed 28 place invariants in 14 ms
[2023-03-22 11:28:47] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 11:28:47] [INFO ] [Nat]Absence check using 28 positive place invariants in 12 ms returned sat
[2023-03-22 11:28:47] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-22 11:28:47] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 6 ms to minimize.
[2023-03-22 11:28:47] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2023-03-22 11:28:47] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
[2023-03-22 11:28:47] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2023-03-22 11:28:47] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2023-03-22 11:28:47] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2023-03-22 11:28:47] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2023-03-22 11:28:47] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2023-03-22 11:28:47] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2023-03-22 11:28:48] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2023-03-22 11:28:48] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2023-03-22 11:28:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 843 ms
[2023-03-22 11:28:48] [INFO ] After 984ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-22 11:28:48] [INFO ] After 1165ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 22 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 180/180 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 183 transition count 173
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 176 transition count 171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 174 transition count 171
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 18 place count 174 transition count 155
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 50 place count 158 transition count 155
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 68 place count 140 transition count 137
Iterating global reduction 3 with 18 rules applied. Total rules applied 86 place count 140 transition count 137
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 86 place count 140 transition count 133
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 94 place count 136 transition count 133
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 162 place count 102 transition count 99
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 177 place count 102 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 101 transition count 98
Applied a total of 178 rules in 55 ms. Remains 101 /183 variables (removed 82) and now considering 98/180 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 101/183 places, 98/180 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2017436 steps, run timeout after 3001 ms. (steps per millisecond=672 ) properties seen :{}
Probabilistic random walk after 2017436 steps, saw 371448 distinct states, run finished after 3002 ms. (steps per millisecond=672 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 98 rows 101 cols
[2023-03-22 11:28:51] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-22 11:28:51] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:28:51] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned sat
[2023-03-22 11:28:51] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 11:28:51] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:28:51] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 2 ms to minimize.
[2023-03-22 11:28:51] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2023-03-22 11:28:51] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-22 11:28:51] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-22 11:28:52] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2023-03-22 11:28:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 489 ms
[2023-03-22 11:28:52] [INFO ] After 649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-22 11:28:52] [INFO ] After 745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 22 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 98/98 transitions.
Applied a total of 0 rules in 9 ms. Remains 101 /101 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 101/101 places, 98/98 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 98/98 transitions.
Applied a total of 0 rules in 8 ms. Remains 101 /101 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-22 11:28:52] [INFO ] Invariant cache hit.
[2023-03-22 11:28:52] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-22 11:28:52] [INFO ] Invariant cache hit.
[2023-03-22 11:28:52] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-22 11:28:52] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 11:28:52] [INFO ] Invariant cache hit.
[2023-03-22 11:28:52] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 537 ms. Remains : 101/101 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 11:28:52] [INFO ] Invariant cache hit.
[2023-03-22 11:28:52] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:28:52] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2023-03-22 11:28:52] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 11:28:52] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:28:52] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-22 11:28:53] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-22 11:28:53] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2023-03-22 11:28:53] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-22 11:28:53] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
[2023-03-22 11:28:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 483 ms
[2023-03-22 11:28:53] [INFO ] After 627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-22 11:28:53] [INFO ] After 712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 11:28:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 18 ms.
[2023-03-22 11:28:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 101 places, 98 transitions and 397 arcs took 4 ms.
[2023-03-22 11:28:53] [INFO ] Flatten gal took : 38 ms
Total runtime 7600 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_003B
(NrP: 101 NrTr: 98 NrArc: 397)

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

net check time: 0m 0.000sec

init dd package: 0m 3.165sec


RS generation: 0m56.673sec


-> reachability set: #nodes 32911 (3.3e+04) #states 1,339,464,144,252 (12)



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

checking: EF [[[[p51<=0 & 0<=p51] & [[p25<=1 & 1<=p25] & [p14<=1 & 1<=p14]]] & [[p62<=1 & 1<=p62] & [[[[p23<=0 & 0<=p23] & [p18<=1 & 1<=p18]] | [[[[p88<=0 & 0<=p88] | [p13<=1 & 1<=p13]] & [[p68<=0 & 0<=p68] | [[p38<=0 & 0<=p38] & [[p35<=0 & 0<=p35] | [p51<=1 & 1<=p51]]]]] | [[[[p67<=1 & 1<=p67] | [p3<=1 & 1<=p3]] | [[p70<=1 & 1<=p70] | [[p96<=0 & 0<=p96] | [p43<=1 & 1<=p43]]]] & [[[[p23<=0 & 0<=p23] | [p78<=1 & 1<=p78]] | [[p65<=0 & 0<=p65] | [p37<=1 & 1<=p37]]] & [[p56<=1 & 1<=p56] | [p15<=0 & 0<=p15]]]]]] & [[p81<=0 & 0<=p81] | [p65<=1 & 1<=p65]]]]]]
normalized: E [true U [[[[[p81<=0 & 0<=p81] | [p65<=1 & 1<=p65]] & [[[[[[[p23<=0 & 0<=p23] | [p78<=1 & 1<=p78]] | [[p65<=0 & 0<=p65] | [p37<=1 & 1<=p37]]] & [[p56<=1 & 1<=p56] | [p15<=0 & 0<=p15]]] & [[[p70<=1 & 1<=p70] | [[p43<=1 & 1<=p43] | [p96<=0 & 0<=p96]]] | [[p3<=1 & 1<=p3] | [p67<=1 & 1<=p67]]]] | [[[[[p51<=1 & 1<=p51] | [p35<=0 & 0<=p35]] & [p38<=0 & 0<=p38]] | [p68<=0 & 0<=p68]] & [[p13<=1 & 1<=p13] | [p88<=0 & 0<=p88]]]] | [[p18<=1 & 1<=p18] & [p23<=0 & 0<=p23]]]] & [p62<=1 & 1<=p62]] & [[[p14<=1 & 1<=p14] & [p25<=1 & 1<=p25]] & [p51<=0 & 0<=p51]]]]

abstracting: (0<=p51)
states: 1,339,464,144,252 (12)
abstracting: (p51<=0)
states: 1,064,223,335,526 (12)
abstracting: (1<=p25)
states: 676,149,129,564 (11)
abstracting: (p25<=1)
states: 1,339,464,144,252 (12)
abstracting: (1<=p14)
states: 446,673,096,276 (11)
abstracting: (p14<=1)
states: 1,339,464,144,252 (12)
abstracting: (1<=p62)
states: 21,600 (4)
abstracting: (p62<=1)
states: 1,339,464,144,252 (12)
abstracting: (0<=p23)
states: 1,339,464,144,252 (12)
abstracting: (p23<=0)
states: 1,338,357,083,268 (12)
abstracting: (1<=p18)
states: 1,107,060,984 (9)
abstracting: (p18<=1)
states: 1,339,464,144,252 (12)
abstracting: (0<=p88)
states: 1,339,464,144,252 (12)
abstracting: (p88<=0)
states: 1,064,141,278,011 (12)
abstracting: (1<=p13)
states: 447,304,962,573 (11)
abstracting: (p13<=1)
states: 1,339,464,144,252 (12)
abstracting: (0<=p68)
states: 1,339,464,144,252 (12)
abstracting: (p68<=0)
states: 1,125,173,279,208 (12)
abstracting: (0<=p38)
states: 1,339,464,144,252 (12)
abstracting: (p38<=0)
states: 1,339,464,136,377 (12)
abstracting: (0<=p35)
states: 1,339,464,144,252 (12)
abstracting: (p35<=0)
states: 1,339,458,033,366 (12)
abstracting: (1<=p51)
states: 275,240,808,726 (11)
abstracting: (p51<=1)
states: 1,339,464,144,252 (12)
abstracting: (1<=p67)
states: 211,469,158,098 (11)
abstracting: (p67<=1)
states: 1,339,464,144,252 (12)
abstracting: (1<=p3)
states: 161,046 (5)
abstracting: (p3<=1)
states: 1,339,464,144,252 (12)
abstracting: (0<=p96)
states: 1,339,464,144,252 (12)
abstracting: (p96<=0)
states: 1,111,282,525,876 (12)
abstracting: (1<=p43)
states: 536,077,673,145 (11)
abstracting: (p43<=1)
states: 1,339,464,144,252 (12)
abstracting: (1<=p70)
states: 750
abstracting: (p70<=1)
states: 1,339,464,144,252 (12)
abstracting: (0<=p15)
states: 1,339,464,144,252 (12)
abstracting: (p15<=0)
states: 894,022,190,922 (11)
abstracting: (1<=p56)
states: 672,711,143,487 (11)
abstracting: (p56<=1)
states: 1,339,464,144,252 (12)
abstracting: (1<=p37)
states: 7,875 (3)
abstracting: (p37<=1)
states: 1,339,464,144,252 (12)
abstracting: (0<=p65)
states: 1,339,464,144,252 (12)
abstracting: (p65<=0)
states: 1,105,106,642,259 (12)
abstracting: (1<=p78)
states: 535,149,357,231 (11)
abstracting: (p78<=1)
states: 1,339,464,144,252 (12)
abstracting: (0<=p23)
states: 1,339,464,144,252 (12)
abstracting: (p23<=0)
states: 1,338,357,083,268 (12)
abstracting: (1<=p65)
states: 234,357,501,993 (11)
abstracting: (p65<=1)
states: 1,339,464,144,252 (12)
abstracting: (0<=p81)
states: 1,339,464,144,252 (12)
abstracting: (p81<=0)
states: 892,976,096,668 (11)
-> the formula is FALSE

FORMULA ShieldIIPs-PT-003B-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.277sec

totally nodes used: 21069676 (2.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 91781576 210284189 302065765
used/not used/entry size/cache size: 64591235 2517629 16 1024MB
basic ops cache: hits/miss/sum: 1203818 3200939 4404757
used/not used/entry size/cache size: 4294394 12482822 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: 98260 251550 349810
used/not used/entry size/cache size: 248409 8140199 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 49818411
1 14097071
2 2685277
3 439346
4 60732
5 7169
6 774
7 76
8 8
9 0
>= 10 0

Total processing time: 1m 5.962sec


BK_STOP 1679484599919

--------------------
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

30911 70322 68988 126022 127734 136333 49763
iterations count:703985 (7183), effective:83269 (849)

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="ShieldIIPs-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 ShieldIIPs-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-167903717400046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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