About the Execution of Marcie+red for ShieldRVt-PT-010B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5848.523 | 40300.00 | 60460.00 | 127.20 | FTTTFFTTFFTFFFTT | 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-167905978700271.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-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978700271
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.2K Feb 25 22:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 22:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 22:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:51 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.8K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:52 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 119K 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-010B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679347667783
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-010B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:27:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:27:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:27:50] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-20 21:27:50] [INFO ] Transformed 503 places.
[2023-03-20 21:27:50] [INFO ] Transformed 503 transitions.
[2023-03-20 21:27:50] [INFO ] Found NUPN structural information;
[2023-03-20 21:27:50] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 16) seen :12
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 503 rows 503 cols
[2023-03-20 21:27:51] [INFO ] Computed 41 place invariants in 11 ms
[2023-03-20 21:27:52] [INFO ] After 562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:27:52] [INFO ] [Nat]Absence check using 41 positive place invariants in 337 ms returned sat
[2023-03-20 21:27:53] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:27:54] [INFO ] Deduced a trap composed of 20 places in 407 ms of which 11 ms to minimize.
[2023-03-20 21:27:54] [INFO ] Deduced a trap composed of 26 places in 398 ms of which 1 ms to minimize.
[2023-03-20 21:27:54] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2023-03-20 21:27:55] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 2 ms to minimize.
[2023-03-20 21:27:56] [INFO ] Deduced a trap composed of 32 places in 1619 ms of which 1 ms to minimize.
[2023-03-20 21:27:56] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2023-03-20 21:27:57] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2023-03-20 21:27:57] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2023-03-20 21:27:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3407 ms
[2023-03-20 21:27:57] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2023-03-20 21:27:57] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 1 ms to minimize.
[2023-03-20 21:27:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2023-03-20 21:27:58] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 1 ms to minimize.
[2023-03-20 21:27:58] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 1 ms to minimize.
[2023-03-20 21:27:58] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2023-03-20 21:27:58] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 0 ms to minimize.
[2023-03-20 21:27:58] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2023-03-20 21:27:59] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2023-03-20 21:27:59] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 0 ms to minimize.
[2023-03-20 21:27:59] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
[2023-03-20 21:27:59] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2023-03-20 21:27:59] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 1 ms to minimize.
[2023-03-20 21:27:59] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2023-03-20 21:28:00] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2023-03-20 21:28:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2049 ms
[2023-03-20 21:28:00] [INFO ] After 6980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 285 ms.
[2023-03-20 21:28:00] [INFO ] After 8382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 95 ms.
Support contains 78 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 503/503 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 503 transition count 408
Reduce places removed 95 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 1 with 130 rules applied. Total rules applied 225 place count 408 transition count 373
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 260 place count 373 transition count 373
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 260 place count 373 transition count 342
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 322 place count 342 transition count 342
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 364 place count 300 transition count 300
Iterating global reduction 3 with 42 rules applied. Total rules applied 406 place count 300 transition count 300
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 406 place count 300 transition count 288
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 430 place count 288 transition count 288
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 566 place count 220 transition count 220
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 596 place count 205 transition count 225
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 599 place count 205 transition count 222
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 602 place count 202 transition count 222
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 603 place count 202 transition count 221
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 604 place count 202 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 605 place count 201 transition count 220
Applied a total of 605 rules in 143 ms. Remains 201 /503 variables (removed 302) and now considering 220/503 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 201/503 places, 220/503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 201 cols
[2023-03-20 21:28:00] [INFO ] Computed 41 place invariants in 4 ms
[2023-03-20 21:28:00] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:28:01] [INFO ] [Nat]Absence check using 41 positive place invariants in 9 ms returned sat
[2023-03-20 21:28:01] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:28:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 21:28:01] [INFO ] After 50ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:28:01] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2023-03-20 21:28:03] [INFO ] Deduced a trap composed of 17 places in 1717 ms of which 26 ms to minimize.
[2023-03-20 21:28:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1935 ms
[2023-03-20 21:28:03] [INFO ] After 2032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-20 21:28:03] [INFO ] After 2311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 36 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 220/220 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 201 transition count 210
Reduce places removed 10 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 12 rules applied. Total rules applied 22 place count 191 transition count 208
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 190 transition count 206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 27 place count 188 transition count 206
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 27 place count 188 transition count 197
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 45 place count 179 transition count 197
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 50 place count 174 transition count 192
Iterating global reduction 4 with 5 rules applied. Total rules applied 55 place count 174 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 55 place count 174 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 57 place count 173 transition count 191
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 53 rules applied. Total rules applied 110 place count 146 transition count 165
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 120 place count 141 transition count 168
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 141 transition count 167
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 141 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 140 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 125 place count 138 transition count 164
Applied a total of 125 rules in 146 ms. Remains 138 /201 variables (removed 63) and now considering 164/220 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 138/201 places, 164/220 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1067114 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :{}
Probabilistic random walk after 1067114 steps, saw 733718 distinct states, run finished after 3002 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 164 rows 138 cols
[2023-03-20 21:28:06] [INFO ] Computed 40 place invariants in 4 ms
[2023-03-20 21:28:06] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:28:06] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-20 21:28:06] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:28:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 21:28:06] [INFO ] After 43ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:28:06] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-20 21:28:07] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2023-03-20 21:28:07] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-20 21:28:07] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2023-03-20 21:28:07] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2023-03-20 21:28:07] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-20 21:28:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 466 ms
[2023-03-20 21:28:07] [INFO ] After 555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-20 21:28:07] [INFO ] After 786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 36 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 164/164 transitions.
Applied a total of 0 rules in 8 ms. Remains 138 /138 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 138/138 places, 164/164 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 164/164 transitions.
Applied a total of 0 rules in 6 ms. Remains 138 /138 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2023-03-20 21:28:07] [INFO ] Invariant cache hit.
[2023-03-20 21:28:07] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-20 21:28:07] [INFO ] Invariant cache hit.
[2023-03-20 21:28:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-20 21:28:07] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-20 21:28:07] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 21:28:07] [INFO ] Invariant cache hit.
[2023-03-20 21:28:07] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 138/138 places, 164/164 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 138 transition count 158
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 138 transition count 158
Applied a total of 11 rules in 34 ms. Remains 138 /138 variables (removed 0) and now considering 158/164 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 158 rows 138 cols
[2023-03-20 21:28:07] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-20 21:28:08] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 21:28:08] [INFO ] [Nat]Absence check using 40 positive place invariants in 7 ms returned sat
[2023-03-20 21:28:08] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 21:28:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 21:28:08] [INFO ] After 34ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:28:08] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2023-03-20 21:28:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-20 21:28:08] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-20 21:28:08] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 21:28:08] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 24 ms.
[2023-03-20 21:28:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 164 transitions and 672 arcs took 2 ms.
[2023-03-20 21:28:08] [INFO ] Flatten gal took : 73 ms
Total runtime 18521 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_010B
(NrP: 138 NrTr: 164 NrArc: 672)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
net check time: 0m 0.000sec
init dd package: 0m 3.249sec
RS generation: 0m 8.753sec
-> reachability set: #nodes 45712 (4.6e+04) #states 1,305,304,916,091,475,386 (18)
starting MCC model checker
--------------------------
checking: AG [[[[[0<=p15 & p15<=0] | [[p109<=0 & 0<=p109] | [p63<=1 & 1<=p63]]] | [[[p40<=0 & 0<=p40] | [p120<=0 & 0<=p120]] | [[p51<=0 & 0<=p51] | [p59<=0 & 0<=p59]]]] | [[[p45<=1 & 1<=p45] | [[p72<=1 & 1<=p72] | [[p103<=1 & 1<=p103] & [p114<=0 & 0<=p114]]]] | [[[[[[[1<=p58 & p58<=1] | [p133<=1 & 1<=p133]] | [[p56<=1 & 1<=p56] | [[p89<=0 & 0<=p89] | [[p135<=0 & 0<=p135] & [[p124<=1 & 1<=p124] & [p1<=0 & 0<=p1]]]]]] & [p2<=0 & 0<=p2]] & [p125<=0 & 0<=p125]] | [[p106<=1 & 1<=p106] & [[p9<=0 & 0<=p9] & [[p36<=0 & 0<=p36] | [[p31<=0 & 0<=p31] | [p85<=0 & 0<=p85]]]]]] | [[[[p34<=1 & 1<=p34] & [[p28<=1 & 1<=p28] & [p16<=1 & 1<=p16]]] & [[p22<=1 & 1<=p22] & [[p24<=1 & 1<=p24] & [[p65<=0 & 0<=p65] | [[p127<=1 & 1<=p127] & [p77<=1 & 1<=p77]]]]]] | [[p52<=0 & 0<=p52] & [[p91<=1 & 1<=p91] & [p100<=1 & 1<=p100]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[[p127<=1 & 1<=p127] & [p77<=1 & 1<=p77]] | [p65<=0 & 0<=p65]] & [p24<=1 & 1<=p24]] & [p22<=1 & 1<=p22]] & [[[p28<=1 & 1<=p28] & [p16<=1 & 1<=p16]] & [p34<=1 & 1<=p34]]] | [[p52<=0 & 0<=p52] & [[p91<=1 & 1<=p91] & [p100<=1 & 1<=p100]]]] | [[[p106<=1 & 1<=p106] & [[[[p85<=0 & 0<=p85] | [p31<=0 & 0<=p31]] | [p36<=0 & 0<=p36]] & [p9<=0 & 0<=p9]]] | [[p125<=0 & 0<=p125] & [[p2<=0 & 0<=p2] & [[[[[[p1<=0 & 0<=p1] & [p124<=1 & 1<=p124]] & [p135<=0 & 0<=p135]] | [p89<=0 & 0<=p89]] | [p56<=1 & 1<=p56]] | [[p133<=1 & 1<=p133] | [1<=p58 & p58<=1]]]]]]] | [[[[p114<=0 & 0<=p114] & [p103<=1 & 1<=p103]] | [p72<=1 & 1<=p72]] | [p45<=1 & 1<=p45]]] | [[[[p59<=0 & 0<=p59] | [p51<=0 & 0<=p51]] | [[p120<=0 & 0<=p120] | [p40<=0 & 0<=p40]]] | [[[p63<=1 & 1<=p63] | [p109<=0 & 0<=p109]] | [0<=p15 & p15<=0]]]]]]]
abstracting: (p15<=0)
states: 1,305,059,896,310,569,266 (18)
abstracting: (0<=p15)
states: 1,305,304,916,091,475,386 (18)
abstracting: (0<=p109)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p109<=0)
states: 872,650,423,311,992,058 (17)
abstracting: (1<=p63)
states: 261,060,985,623,674,880 (17)
abstracting: (p63<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (0<=p40)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p40<=0)
states: 1,305,282,264,129,247,746 (18)
abstracting: (0<=p120)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p120<=0)
states: 979,835,187,438,125,130 (17)
abstracting: (0<=p51)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p51<=0)
states: 1,044,237,417,997,917,936 (18)
abstracting: (0<=p59)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p59<=0)
states: 978,981,047,093,907,066 (17)
abstracting: (1<=p45)
states: 435,093,462,790,963,200 (17)
abstracting: (p45<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (1<=p72)
states: 326,326,227,741,673,920 (17)
abstracting: (p72<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (1<=p103)
states: 187,940,417,217,954,766 (17)
abstracting: (p103<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (0<=p114)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p114<=0)
states: 870,203,277,394,319,946 (17)
abstracting: (p58<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (1<=p58)
states: 326,323,868,997,568,320 (17)
abstracting: (1<=p133)
states: 326,326,229,022,866,580 (17)
abstracting: (p133<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (1<=p56)
states: 4,719,141,953,400 (12)
abstracting: (p56<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (0<=p89)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p89<=0)
states: 1,086,041,100,330,871,482 (18)
abstracting: (0<=p135)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p135<=0)
states: 1,305,304,916,091,470,853 (18)
abstracting: (1<=p124)
states: 281,910,625,826,927,616 (17)
abstracting: (p124<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (0<=p1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p1<=0)
states: 1,305,304,916,072,327,820 (18)
abstracting: (0<=p2)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p2<=0)
states: 1,305,304,915,500,949,932 (18)
abstracting: (0<=p125)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p125<=0)
states: 1,023,394,290,264,547,770 (18)
abstracting: (0<=p9)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p9<=0)
states: 870,385,123,408,731,258 (17)
abstracting: (0<=p36)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p36<=0)
states: 1,044,262,432,709,053,626 (18)
abstracting: (0<=p31)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p31<=0)
states: 1,305,282,264,129,247,746 (18)
abstracting: (0<=p85)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p85<=0)
states: 1,305,304,915,977,317,574 (18)
abstracting: (1<=p106)
states: 325,959,157,602,995,040 (17)
abstracting: (p106<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (1<=p100)
states: 231,499,520,044,374,384 (17)
abstracting: (p100<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (1<=p91)
states: 214,124,824,266,193,812 (17)
abstracting: (p91<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (0<=p52)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p52<=0)
states: 1,044,252,523,998,698,736 (18)
abstracting: (1<=p34)
states: 261,042,483,382,421,760 (17)
abstracting: (p34<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (1<=p16)
states: 260,951,867,165,293,056 (17)
abstracting: (p16<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (1<=p28)
states: 326,189,843,711,826,048 (17)
abstracting: (p28<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (1<=p22)
states: 260,970,376,837,599,432 (17)
abstracting: (p22<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (1<=p24)
states: 434,919,792,682,744,128 (17)
abstracting: (p24<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (0<=p65)
states: 1,305,304,916,091,475,386 (18)
abstracting: (p65<=0)
states: 1,044,243,934,755,720,186 (18)
abstracting: (1<=p77)
states: 326,326,227,889,105,584 (17)
abstracting: (p77<=1)
states: 1,305,304,916,091,475,386 (18)
abstracting: (1<=p127)
states: 435,101,638,697,155,440 (17)
abstracting: (p127<=1)
states: 1,305,304,916,091,475,386 (18)
-> the formula is FALSE
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.947sec
totally nodes used: 5655227 (5.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 14990786 40524438 55515224
used/not used/entry size/cache size: 33088881 34019983 16 1024MB
basic ops cache: hits/miss/sum: 943364 2958503 3901867
used/not used/entry size/cache size: 4237770 12539446 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: 55428 232985 288413
used/not used/entry size/cache size: 230383 8158225 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 62128247
1 4412210
2 477370
3 77811
4 11497
5 1534
6 181
7 12
8 2
9 0
>= 10 0
Total processing time: 0m19.032sec
BK_STOP 1679347708083
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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
65474 46102
iterations count:228529 (1393), effective:27589 (168)
initing FirstDep: 0m 0.000sec
iterations count:27276 (166), effective:1809 (11)
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-010B"
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-010B, 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-167905978700271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-010B.tgz
mv ShieldRVt-PT-010B 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 ;