fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r426-tajo-167905978700255
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldRVt-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5451.203 15282.00 25397.00 110.80 FTTTTTFFTFTFTTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978700255.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-005B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978700255
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 23:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 23:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:05 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.5K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 23:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 23:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 23:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 23:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 60K 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 ShieldRVt-PT-005B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679347309636

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-005B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:21:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:21:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:21:51] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-20 21:21:51] [INFO ] Transformed 253 places.
[2023-03-20 21:21:51] [INFO ] Transformed 253 transitions.
[2023-03-20 21:21:51] [INFO ] Found NUPN structural information;
[2023-03-20 21:21:51] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 16) seen :13
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 253 rows 253 cols
[2023-03-20 21:21:52] [INFO ] Computed 21 place invariants in 20 ms
[2023-03-20 21:21:52] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 21:21:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 39 ms returned sat
[2023-03-20 21:21:53] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 21:21:53] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 5 ms to minimize.
[2023-03-20 21:21:53] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2023-03-20 21:21:53] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2023-03-20 21:21:53] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2023-03-20 21:21:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 394 ms
[2023-03-20 21:21:53] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2023-03-20 21:21:53] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2023-03-20 21:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-20 21:21:53] [INFO ] After 884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 21:21:54] [INFO ] After 1162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 42 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 253/253 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 253 transition count 210
Reduce places removed 43 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 50 rules applied. Total rules applied 93 place count 210 transition count 203
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 100 place count 203 transition count 203
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 100 place count 203 transition count 181
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 144 place count 181 transition count 181
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 172 place count 153 transition count 153
Iterating global reduction 3 with 28 rules applied. Total rules applied 200 place count 153 transition count 153
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 3 with 2 rules applied. Total rules applied 202 place count 153 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 152 transition count 151
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 203 place count 152 transition count 144
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 217 place count 145 transition count 144
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 289 place count 109 transition count 108
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 303 place count 102 transition count 109
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 304 place count 102 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 305 place count 101 transition count 108
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 306 place count 101 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 307 place count 100 transition count 107
Applied a total of 307 rules in 123 ms. Remains 100 /253 variables (removed 153) and now considering 107/253 (removed 146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 100/253 places, 107/253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
FORMULA ShieldRVt-PT-005B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 107 rows 100 cols
[2023-03-20 21:21:54] [INFO ] Computed 21 place invariants in 7 ms
[2023-03-20 21:21:54] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:21:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 21:21:54] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:21:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 21:21:54] [INFO ] After 22ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:21:54] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-20 21:21:54] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-20 21:21:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2023-03-20 21:21:54] [INFO ] After 141ms 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-20 21:21:54] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 39 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 107/107 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 99 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 97 transition count 104
Applied a total of 6 rules in 6 ms. Remains 97 /100 variables (removed 3) and now considering 104/107 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 97/100 places, 104/107 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1740372 steps, run timeout after 3001 ms. (steps per millisecond=579 ) properties seen :{}
Probabilistic random walk after 1740372 steps, saw 708205 distinct states, run finished after 3002 ms. (steps per millisecond=579 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 97 cols
[2023-03-20 21:21:57] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-20 21:21:57] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:21:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-03-20 21:21:58] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:21:58] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-20 21:21:58] [INFO ] After 43ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:21:58] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-20 21:21:58] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2023-03-20 21:21:58] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2023-03-20 21:21:58] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-20 21:21:58] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-20 21:21:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 254 ms
[2023-03-20 21:21:58] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 21:21:58] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 39 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 104/104 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-20 21:21:58] [INFO ] Invariant cache hit.
[2023-03-20 21:21:58] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-20 21:21:58] [INFO ] Invariant cache hit.
[2023-03-20 21:21:58] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-20 21:21:58] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-20 21:21:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 21:21:58] [INFO ] Invariant cache hit.
[2023-03-20 21:21:58] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 97/97 places, 104/104 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 104
Applied a total of 1 rules in 31 ms. Remains 97 /97 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 97 cols
[2023-03-20 21:21:58] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-20 21:21:58] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:21:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 43 ms returned sat
[2023-03-20 21:21:59] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:21:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 21:21:59] [INFO ] After 24ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:21:59] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-20 21:21:59] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:21:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-20 21:21:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 104 transitions and 351 arcs took 1 ms.
[2023-03-20 21:21:59] [INFO ] Flatten gal took : 48 ms
Total runtime 7746 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVt_PT_005B
(NrP: 97 NrTr: 104 NrArc: 351)

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

net check time: 0m 0.000sec

init dd package: 0m 2.859sec


RS generation: 0m 0.170sec


-> reachability set: #nodes 6149 (6.1e+03) #states 833,965,467,316 (11)



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

checking: AG [[[[[0<=p22 & p22<=0] | [p14<=1 & 1<=p14]] | [[p54<=0 & 0<=p54] | [[p96<=0 & 0<=p96] | [p24<=1 & 1<=p24]]]] | [[[p67<=1 & 1<=p67] | [[[p5<=1 & 1<=p5] & [[p32<=1 & 1<=p32] & [p45<=1 & 1<=p45]]] | [[[p54<=0 & 0<=p54] | [[[p50<=1 & 1<=p50] & [[p52<=1 & 1<=p52] & [p62<=1 & 1<=p62]]] | [[p80<=1 & 1<=p80] & [[[p11<=1 & 1<=p11] | [[p35<=1 & 1<=p35] & [p41<=1 & 1<=p41]]] | [[[p86<=1 & 1<=p86] & [p93<=1 & 1<=p93]] | [[p65<=1 & 1<=p65] & [[p82<=1 & 1<=p82] & [p95<=1 & 1<=p95]]]]]]]] & [[p61<=1 & 1<=p61] | [[p89<=1 & 1<=p89] | [p70<=1 & 1<=p70]]]]]] | [[[p39<=1 & 1<=p39] & [[p31<=0 & 0<=p31] | [p75<=1 & 1<=p75]]] | [[[[p69<=0 & 0<=p69] | [p8<=0 & 0<=p8]] & [[[p17<=1 & 1<=p17] | [p1<=1 & 1<=p1]] | [[p36<=1 & 1<=p36] | [p67<=1 & 1<=p67]]]] | [[[p51<=0 & 0<=p51] & [[p59<=0 & 0<=p59] & [p49<=0 & 0<=p49]]] & [[p43<=1 & 1<=p43] & [[[p84<=0 & 0<=p84] | [p18<=0 & 0<=p18]] & [[p26<=1 & 1<=p26] | [p54<=0 & 0<=p54]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p43<=1 & 1<=p43] & [[[p84<=0 & 0<=p84] | [p18<=0 & 0<=p18]] & [[p26<=1 & 1<=p26] | [p54<=0 & 0<=p54]]]] & [[[p49<=0 & 0<=p49] & [p59<=0 & 0<=p59]] & [p51<=0 & 0<=p51]]] | [[[[p67<=1 & 1<=p67] | [p36<=1 & 1<=p36]] | [[p1<=1 & 1<=p1] | [p17<=1 & 1<=p17]]] & [[p8<=0 & 0<=p8] | [p69<=0 & 0<=p69]]]] | [[[p75<=1 & 1<=p75] | [p31<=0 & 0<=p31]] & [p39<=1 & 1<=p39]]] | [[[[[[p70<=1 & 1<=p70] | [p89<=1 & 1<=p89]] | [p61<=1 & 1<=p61]] & [[[[[[[[p95<=1 & 1<=p95] & [p82<=1 & 1<=p82]] & [p65<=1 & 1<=p65]] | [[p93<=1 & 1<=p93] & [p86<=1 & 1<=p86]]] | [[[p41<=1 & 1<=p41] & [p35<=1 & 1<=p35]] | [p11<=1 & 1<=p11]]] & [p80<=1 & 1<=p80]] | [[[p62<=1 & 1<=p62] & [p52<=1 & 1<=p52]] & [p50<=1 & 1<=p50]]] | [p54<=0 & 0<=p54]]] | [[[p45<=1 & 1<=p45] & [p32<=1 & 1<=p32]] & [p5<=1 & 1<=p5]]] | [p67<=1 & 1<=p67]]] | [[[[p24<=1 & 1<=p24] | [p96<=0 & 0<=p96]] | [p54<=0 & 0<=p54]] | [[p14<=1 & 1<=p14] | [0<=p22 & p22<=0]]]]]]]

abstracting: (p22<=0)
states: 572,791,400,116 (11)
abstracting: (0<=p22)
states: 833,965,467,316 (11)
abstracting: (1<=p14)
states: 134,661,252,960 (11)
abstracting: (p14<=1)
states: 833,965,467,316 (11)
abstracting: (0<=p54)
states: 833,965,467,316 (11)
abstracting: (p54<=0)
states: 694,973,441,716 (11)
abstracting: (0<=p96)
states: 833,965,467,316 (11)
abstracting: (p96<=0)
states: 833,965,455,212 (11)
abstracting: (1<=p24)
states: 10,444,318,560 (10)
abstracting: (p24<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p67)
states: 208,488,038,400 (11)
abstracting: (p67<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p5)
states: 168,807,628,800 (11)
abstracting: (p5<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p32)
states: 167,326,593,696 (11)
abstracting: (p32<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p45)
states: 139,750,037,208 (11)
abstracting: (p45<=1)
states: 833,965,467,316 (11)
abstracting: (0<=p54)
states: 833,965,467,316 (11)
abstracting: (p54<=0)
states: 694,973,441,716 (11)
abstracting: (1<=p50)
states: 166,797,081,360 (11)
abstracting: (p50<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p52)
states: 138,992,025,600 (11)
abstracting: (p52<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p62)
states: 139,080,514,320 (11)
abstracting: (p62<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p80)
states: 3,026 (3)
abstracting: (p80<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p11)
states: 136,957,132,800 (11)
abstracting: (p11<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p35)
states: 278,166,319,776 (11)
abstracting: (p35<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p41)
states: 138,549,657,600 (11)
abstracting: (p41<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p86)
states: 208,491,371,368 (11)
abstracting: (p86<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p93)
states: 208,491,359,264 (11)
abstracting: (p93<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p65)
states: 208,492,466,176 (11)
abstracting: (p65<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p82)
states: 416,982,730,632 (11)
abstracting: (p82<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p95)
states: 208,491,359,264 (11)
abstracting: (p95<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p61)
states: 139,080,499,200 (11)
abstracting: (p61<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p89)
states: 208,491,359,264 (11)
abstracting: (p89<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p70)
states: 208,491,359,232 (11)
abstracting: (p70<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p39)
states: 1,067,000,256 (9)
abstracting: (p39<=1)
states: 833,965,467,316 (11)
abstracting: (0<=p31)
states: 833,965,467,316 (11)
abstracting: (p31<=0)
states: 667,705,878,196 (11)
abstracting: (1<=p75)
states: 208,491,359,232 (11)
abstracting: (p75<=1)
states: 833,965,467,316 (11)
abstracting: (0<=p69)
states: 833,965,467,316 (11)
abstracting: (p69<=0)
states: 625,474,108,084 (11)
abstracting: (0<=p8)
states: 833,965,467,316 (11)
abstracting: (p8<=0)
states: 673,823,817,556 (11)
abstracting: (1<=p17)
states: 191,102,976,000 (11)
abstracting: (p17<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p1)
states: 12,298 (4)
abstracting: (p1<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p36)
states: 1,067,000,256 (9)
abstracting: (p36<=1)
states: 833,965,467,316 (11)
abstracting: (1<=p67)
states: 208,488,038,400 (11)
abstracting: (p67<=1)
states: 833,965,467,316 (11)
abstracting: (0<=p51)
states: 833,965,467,316 (11)
abstracting: (p51<=0)
states: 694,973,441,716 (11)
abstracting: (0<=p59)
states: 833,965,467,316 (11)
abstracting: (p59<=0)
states: 694,884,968,116 (11)
abstracting: (0<=p49)
states: 833,965,467,316 (11)
abstracting: (p49<=0)
states: 667,175,036,596 (11)
abstracting: (0<=p54)
states: 833,965,467,316 (11)
abstracting: (p54<=0)
states: 694,973,441,716 (11)
abstracting: (1<=p26)
states: 133,375,032 (8)
abstracting: (p26<=1)
states: 833,965,467,316 (11)
abstracting: (0<=p18)
states: 833,965,467,316 (11)
abstracting: (p18<=0)
states: 642,862,491,316 (11)
abstracting: (0<=p84)
states: 833,965,467,316 (11)
abstracting: (p84<=0)
states: 625,474,108,052 (11)
abstracting: (1<=p43)
states: 138,549,657,600 (11)
abstracting: (p43<=1)
states: 833,965,467,316 (11)
-> the formula is TRUE

FORMULA ShieldRVt-PT-005B-ReachabilityFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.172sec

totally nodes used: 225735 (2.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 256672 796457 1053129
used/not used/entry size/cache size: 851937 66256927 16 1024MB
basic ops cache: hits/miss/sum: 126858 369285 496143
used/not used/entry size/cache size: 701052 16076164 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: 35963 99575 135538
used/not used/entry size/cache size: 99253 8289355 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 66895114
1 202560
2 10433
3 719
4 38
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.196sec


BK_STOP 1679347324918

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -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:6485 (62), effective:992 (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="ShieldRVt-PT-005B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldRVt-PT-005B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978700255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-005B.tgz
mv ShieldRVt-PT-005B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;