About the Execution of Marcie+red for ShieldRVt-PT-004B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5590.703 | 21504.00 | 34912.00 | 116.00 | TTFFTTFFTTTTFTFT | 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-167905978700239.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-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978700239
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 22:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 22:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 22:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 22:55 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 48K 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-004B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-004B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679346632892
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-004B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:10:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:10:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:10:35] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-20 21:10:35] [INFO ] Transformed 203 places.
[2023-03-20 21:10:35] [INFO ] Transformed 203 transitions.
[2023-03-20 21:10:35] [INFO ] Found NUPN structural information;
[2023-03-20 21:10:35] [INFO ] Parsed PT model containing 203 places and 203 transitions and 478 arcs in 143 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 3 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 16) seen :11
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 203 rows 203 cols
[2023-03-20 21:10:36] [INFO ] Computed 17 place invariants in 8 ms
[2023-03-20 21:10:36] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 21:10:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-20 21:10:37] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-20 21:10:37] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 7 ms to minimize.
[2023-03-20 21:10:37] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 0 ms to minimize.
[2023-03-20 21:10:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2023-03-20 21:10:37] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2023-03-20 21:10:37] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2023-03-20 21:10:37] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2023-03-20 21:10:37] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2023-03-20 21:10:37] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2023-03-20 21:10:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 376 ms
[2023-03-20 21:10:37] [INFO ] After 1131ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-20 21:10:37] [INFO ] After 1413ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 53 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 203/203 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 203 transition count 174
Reduce places removed 29 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 31 rules applied. Total rules applied 60 place count 174 transition count 172
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 173 transition count 167
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 71 place count 168 transition count 167
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 71 place count 168 transition count 149
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 107 place count 150 transition count 149
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 125 place count 132 transition count 131
Iterating global reduction 4 with 18 rules applied. Total rules applied 143 place count 132 transition count 131
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 143 place count 132 transition count 129
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 130 transition count 129
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 193 place count 107 transition count 106
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 107 transition count 103
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 199 place count 104 transition count 103
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 202 place count 104 transition count 103
Applied a total of 202 rules in 79 ms. Remains 104 /203 variables (removed 99) and now considering 103/203 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 104/203 places, 103/203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 712256 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :{}
Probabilistic random walk after 712256 steps, saw 315733 distinct states, run finished after 3002 ms. (steps per millisecond=237 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 103 rows 104 cols
[2023-03-20 21:10:41] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-20 21:10:41] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:10:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-20 21:10:41] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:10:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 21:10:41] [INFO ] After 39ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:10:41] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2023-03-20 21:10:41] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-20 21:10:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2023-03-20 21:10:41] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2023-03-20 21:10:41] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2023-03-20 21:10:41] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2023-03-20 21:10:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2023-03-20 21:10:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 220 ms
[2023-03-20 21:10:41] [INFO ] After 451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-20 21:10:42] [INFO ] After 693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 53 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/104 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-20 21:10:42] [INFO ] Invariant cache hit.
[2023-03-20 21:10:42] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 21:10:42] [INFO ] Invariant cache hit.
[2023-03-20 21:10:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 21:10:42] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-20 21:10:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 21:10:42] [INFO ] Invariant cache hit.
[2023-03-20 21:10:42] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 104/104 places, 103/103 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 102
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 104 transition count 102
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 104 transition count 101
Applied a total of 5 rules in 19 ms. Remains 104 /104 variables (removed 0) and now considering 101/103 (removed 2) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 101 rows 104 cols
[2023-03-20 21:10:42] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-20 21:10:42] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:10:42] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-03-20 21:10:42] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:10:42] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-20 21:10:42] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-20 21:10:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2023-03-20 21:10:42] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-20 21:10:42] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:10:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-20 21:10:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 103 transitions and 284 arcs took 3 ms.
[2023-03-20 21:10:43] [INFO ] Flatten gal took : 33 ms
Total runtime 8021 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_004B
(NrP: 104 NrTr: 103 NrArc: 284)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.387sec
RS generation: 0m 2.628sec
-> reachability set: #nodes 47372 (4.7e+04) #states 376,913,901,211 (11)
starting MCC model checker
--------------------------
checking: EF [[[[p8<=1 & 1<=p8] & [p66<=1 & 1<=p66]] & [[p93<=1 & 1<=p93] & [[[p88<=1 & 1<=p88] | [[p18<=1 & 1<=p18] | [p95<=1 & 1<=p95]]] | [[p102<=0 & 0<=p102] | [[p41<=1 & 1<=p41] | [[p34<=1 & 1<=p34] & [p25<=1 & 1<=p25]]]]]]]]
normalized: E [true U [[[[[p102<=0 & 0<=p102] | [[[p34<=1 & 1<=p34] & [p25<=1 & 1<=p25]] | [p41<=1 & 1<=p41]]] | [[p88<=1 & 1<=p88] | [[p18<=1 & 1<=p18] | [p95<=1 & 1<=p95]]]] & [p93<=1 & 1<=p93]] & [[p66<=1 & 1<=p66] & [p8<=1 & 1<=p8]]]]
abstracting: (1<=p8)
states: 54,366,087,168 (10)
abstracting: (p8<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p66)
states: 40,374,380,394 (10)
abstracting: (p66<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p93)
states: 53,360,114,796 (10)
abstracting: (p93<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p95)
states: 15,876 (4)
abstracting: (p95<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p18)
states: 62,594,300,928 (10)
abstracting: (p18<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p88)
states: 35,103,333,792 (10)
abstracting: (p88<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p41)
states: 62,862,530,368 (10)
abstracting: (p41<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p25)
states: 509,026,092 (8)
abstracting: (p25<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p34)
states: 48,402,994,128 (10)
abstracting: (p34<=1)
states: 376,913,901,211 (11)
abstracting: (0<=p102)
states: 376,913,901,211 (11)
abstracting: (p102<=0)
states: 318,994,517,707 (11)
-> the formula is TRUE
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.505sec
checking: AG [[[[p69<=0 & 0<=p69] | [p87<=0 & 0<=p87]] | [[p88<=1 & 1<=p88] | [[[p0<=0 & 0<=p0] & [[p98<=0 & 0<=p98] & [p10<=0 & 0<=p10]]] & [[p54<=0 & 0<=p54] & [[[p95<=1 & 1<=p95] | [[p59<=1 & 1<=p59] & [[p61<=1 & 1<=p61] & [p72<=1 & 1<=p72]]]] & [[p81<=1 & 1<=p81] | [[p84<=0 & 0<=p84] & [p100<=0 & 0<=p100]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[p100<=0 & 0<=p100] & [p84<=0 & 0<=p84]] | [p81<=1 & 1<=p81]] & [[[[p72<=1 & 1<=p72] & [p61<=1 & 1<=p61]] & [p59<=1 & 1<=p59]] | [p95<=1 & 1<=p95]]] & [p54<=0 & 0<=p54]] & [[[p10<=0 & 0<=p10] & [p98<=0 & 0<=p98]] & [p0<=0 & 0<=p0]]] | [p88<=1 & 1<=p88]] | [[p87<=0 & 0<=p87] | [p69<=0 & 0<=p69]]]]]]
abstracting: (0<=p69)
states: 376,913,901,211 (11)
abstracting: (p69<=0)
states: 314,106,534,499 (11)
abstracting: (0<=p87)
states: 376,913,901,211 (11)
abstracting: (p87<=0)
states: 376,913,885,335 (11)
abstracting: (1<=p88)
states: 35,103,333,792 (10)
abstracting: (p88<=1)
states: 376,913,901,211 (11)
abstracting: (0<=p0)
states: 376,913,901,211 (11)
abstracting: (p0<=0)
states: 376,913,901,210 (11)
abstracting: (0<=p98)
states: 376,913,901,211 (11)
abstracting: (p98<=0)
states: 345,959,806,771 (11)
abstracting: (0<=p10)
states: 376,913,901,211 (11)
abstracting: (p10<=0)
states: 322,547,814,043 (11)
abstracting: (0<=p54)
states: 376,913,901,211 (11)
abstracting: (p54<=0)
states: 335,041,691,491 (11)
abstracting: (1<=p95)
states: 15,876 (4)
abstracting: (p95<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p59)
states: 59,080,685,295 (10)
abstracting: (p59<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p61)
states: 59,155,093,434 (10)
abstracting: (p61<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p72)
states: 62,842,749,594 (10)
abstracting: (p72<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p81)
states: 71,842,279,428 (10)
abstracting: (p81<=1)
states: 376,913,901,211 (11)
abstracting: (0<=p84)
states: 376,913,901,211 (11)
abstracting: (p84<=0)
states: 282,520,497,139 (11)
abstracting: (0<=p100)
states: 376,913,901,211 (11)
abstracting: (p100<=0)
states: 318,183,731,323 (11)
-> the formula is TRUE
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.158sec
checking: AG [[[[0<=p77 & p77<=0] | [p43<=0 & 0<=p43]] | [[[[p39<=0 & 0<=p39] & [p27<=0 & 0<=p27]] & [[p91<=0 & 0<=p91] & [[[p48<=1 & 1<=p48] | [[p94<=1 & 1<=p94] & [p103<=1 & 1<=p103]]] & [[[[p38<=0 & 0<=p38] & [p29<=0 & 0<=p29]] & [[p63<=0 & 0<=p63] & [[p2<=0 & 0<=p2] | [p15<=0 & 0<=p15]]]] | [[p16<=0 & 0<=p16] & [[p30<=1 & 1<=p30] & [[p4<=0 & 0<=p4] | [[p11<=0 & 0<=p11] | [p24<=0 & 0<=p24]]]]]]]]] | [[[[[p49<=1 & 1<=p49] | [p82<=1 & 1<=p82]] | [[p57<=1 & 1<=p57] | [[[p7<=1 & 1<=p7] & [[p33<=1 & 1<=p33] & [p50<=1 & 1<=p50]]] | [[p75<=0 & 0<=p75] & [[p55<=0 & 0<=p55] & [p0<=0 & 0<=p0]]]]]] & [[p38<=0 & 0<=p38] | [[[p52<=1 & 1<=p52] | [p14<=1 & 1<=p14]] & [[p71<=0 & 0<=p71] | [[p78<=0 & 0<=p78] & [p100<=0 & 0<=p100]]]]]] | [[[p59<=1 & 1<=p59] & [p61<=1 & 1<=p61]] & [[p72<=1 & 1<=p72] & [[p22<=0 & 0<=p22] | [p0<=1 & 1<=p0]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p0<=1 & 1<=p0] | [p22<=0 & 0<=p22]] & [p72<=1 & 1<=p72]] & [[p61<=1 & 1<=p61] & [p59<=1 & 1<=p59]]] | [[[[[[p100<=0 & 0<=p100] & [p78<=0 & 0<=p78]] | [p71<=0 & 0<=p71]] & [[p14<=1 & 1<=p14] | [p52<=1 & 1<=p52]]] | [p38<=0 & 0<=p38]] & [[[[[[p0<=0 & 0<=p0] & [p55<=0 & 0<=p55]] & [p75<=0 & 0<=p75]] | [[[p50<=1 & 1<=p50] & [p33<=1 & 1<=p33]] & [p7<=1 & 1<=p7]]] | [p57<=1 & 1<=p57]] | [[p82<=1 & 1<=p82] | [p49<=1 & 1<=p49]]]]] | [[[[[[[[[p24<=0 & 0<=p24] | [p11<=0 & 0<=p11]] | [p4<=0 & 0<=p4]] & [p30<=1 & 1<=p30]] & [p16<=0 & 0<=p16]] | [[[[p15<=0 & 0<=p15] | [p2<=0 & 0<=p2]] & [p63<=0 & 0<=p63]] & [[p29<=0 & 0<=p29] & [p38<=0 & 0<=p38]]]] & [[[p103<=1 & 1<=p103] & [p94<=1 & 1<=p94]] | [p48<=1 & 1<=p48]]] & [p91<=0 & 0<=p91]] & [[p27<=0 & 0<=p27] & [p39<=0 & 0<=p39]]]] | [[p43<=0 & 0<=p43] | [0<=p77 & p77<=0]]]]]]
abstracting: (p77<=0)
states: 376,913,898,565 (11)
abstracting: (0<=p77)
states: 376,913,901,211 (11)
abstracting: (0<=p43)
states: 376,913,901,211 (11)
abstracting: (p43<=0)
states: 314,081,655,643 (11)
abstracting: (0<=p39)
states: 376,913,901,211 (11)
abstracting: (p39<=0)
states: 314,296,867,483 (11)
abstracting: (0<=p27)
states: 376,913,901,211 (11)
abstracting: (p27<=0)
states: 376,909,796,831 (11)
abstracting: (0<=p91)
states: 376,913,901,211 (11)
abstracting: (p91<=0)
states: 319,288,404,343 (11)
abstracting: (1<=p48)
states: 62,811,980,128 (10)
abstracting: (p48<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p94)
states: 57,786,966,582 (10)
abstracting: (p94<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p103)
states: 59,917,350,996 (10)
abstracting: (p103<=1)
states: 376,913,901,211 (11)
abstracting: (0<=p38)
states: 376,913,901,211 (11)
abstracting: (p38<=0)
states: 290,536,240,475 (11)
abstracting: (0<=p29)
states: 376,913,901,211 (11)
abstracting: (p29<=0)
states: 345,832,470,491 (11)
abstracting: (0<=p63)
states: 376,913,901,211 (11)
abstracting: (p63<=0)
states: 317,758,807,777 (11)
abstracting: (0<=p2)
states: 376,913,901,211 (11)
abstracting: (p2<=0)
states: 249,022,640,023 (11)
abstracting: (0<=p15)
states: 376,913,901,211 (11)
abstracting: (p15<=0)
states: 314,305,776,283 (11)
abstracting: (0<=p16)
states: 376,913,901,211 (11)
abstracting: (p16<=0)
states: 314,305,776,283 (11)
abstracting: (1<=p30)
states: 62,222,939,840 (10)
abstracting: (p30<=1)
states: 376,913,901,211 (11)
abstracting: (0<=p4)
states: 376,913,901,211 (11)
abstracting: (p4<=0)
states: 250,079,358,619 (11)
abstracting: (0<=p11)
states: 376,913,901,211 (11)
abstracting: (p11<=0)
states: 322,030,513,945 (11)
abstracting: (0<=p24)
states: 376,913,901,211 (11)
abstracting: (p24<=0)
states: 282,997,607,407 (11)
abstracting: (1<=p49)
states: 62,811,980,128 (10)
abstracting: (p49<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p82)
states: 132,542,464,788 (11)
abstracting: (p82<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p57)
states: 54,249,661,560 (10)
abstracting: (p57<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p7)
states: 54,366,087,168 (10)
abstracting: (p7<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p33)
states: 62,346,445,008 (10)
abstracting: (p33<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p50)
states: 62,831,964,254 (10)
abstracting: (p50<=1)
states: 376,913,901,211 (11)
abstracting: (0<=p75)
states: 376,913,901,211 (11)
abstracting: (p75<=0)
states: 282,815,319,439 (11)
abstracting: (0<=p55)
states: 376,913,901,211 (11)
abstracting: (p55<=0)
states: 322,664,239,651 (11)
abstracting: (0<=p0)
states: 376,913,901,211 (11)
abstracting: (p0<=0)
states: 376,913,901,210 (11)
abstracting: (0<=p38)
states: 376,913,901,211 (11)
abstracting: (p38<=0)
states: 290,536,240,475 (11)
abstracting: (1<=p52)
states: 59,346 (4)
abstracting: (p52<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p14)
states: 62,608,124,928 (10)
abstracting: (p14<=1)
states: 376,913,901,211 (11)
abstracting: (0<=p71)
states: 376,913,901,211 (11)
abstracting: (p71<=0)
states: 314,106,534,499 (11)
abstracting: (0<=p78)
states: 376,913,901,211 (11)
abstracting: (p78<=0)
states: 376,913,898,565 (11)
abstracting: (0<=p100)
states: 376,913,901,211 (11)
abstracting: (p100<=0)
states: 318,183,731,323 (11)
abstracting: (1<=p59)
states: 59,080,685,295 (10)
abstracting: (p59<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p61)
states: 59,155,093,434 (10)
abstracting: (p61<=1)
states: 376,913,901,211 (11)
abstracting: (1<=p72)
states: 62,842,749,594 (10)
abstracting: (p72<=1)
states: 376,913,901,211 (11)
abstracting: (0<=p22)
states: 376,913,901,211 (11)
abstracting: (p22<=0)
states: 283,008,625,819 (11)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 376,913,901,211 (11)
-> the formula is TRUE
FORMULA ShieldRVt-PT-004B-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.773sec
totally nodes used: 1868404 (1.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5871968 13088340 18960308
used/not used/entry size/cache size: 12837794 54271070 16 1024MB
basic ops cache: hits/miss/sum: 1076441 2935302 4011743
used/not used/entry size/cache size: 4099475 12677741 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: 132975 362210 495185
used/not used/entry size/cache size: 355366 8033242 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 65427434
1 1522150
2 134995
3 21256
4 2689
5 306
6 30
7 3
8 0
9 1
>= 10 0
Total processing time: 0m11.009sec
BK_STOP 1679346654396
--------------------
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 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:15315 (148), effective:1639 (15)
initing FirstDep: 0m 0.000sec
iterations count:2745 (26), effective:273 (2)
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-004B"
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-004B, 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-167905978700239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-004B.tgz
mv ShieldRVt-PT-004B 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 '
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 ;