About the Execution of Marcie+red for ShieldRVs-PT-020B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10014.436 | 3600000.00 | 3640463.00 | 911.40 | TTF?FFTFTTFTTFFF | 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-167905978500111.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 ShieldRVs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978500111
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 244K 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 ShieldRVs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679340496385
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=ShieldRVs-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:28:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:28:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:28:18] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-20 19:28:18] [INFO ] Transformed 803 places.
[2023-03-20 19:28:18] [INFO ] Transformed 903 transitions.
[2023-03-20 19:28:18] [INFO ] Found NUPN structural information;
[2023-03-20 19:28:18] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 193 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 11 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 16) seen :8
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 903 rows 803 cols
[2023-03-20 19:28:19] [INFO ] Computed 81 place invariants in 17 ms
[2023-03-20 19:28:19] [INFO ] After 471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 19:28:19] [INFO ] [Nat]Absence check using 81 positive place invariants in 28 ms returned sat
[2023-03-20 19:28:20] [INFO ] After 1047ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-20 19:28:21] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 19 ms to minimize.
[2023-03-20 19:28:21] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2023-03-20 19:28:21] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 1 ms to minimize.
[2023-03-20 19:28:21] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2023-03-20 19:28:21] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:28:21] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2023-03-20 19:28:22] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2023-03-20 19:28:22] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 33 ms to minimize.
[2023-03-20 19:28:22] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2023-03-20 19:28:22] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2023-03-20 19:28:22] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2023-03-20 19:28:22] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2023-03-20 19:28:22] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2023-03-20 19:28:23] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2023-03-20 19:28:23] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2023-03-20 19:28:23] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2112 ms
[2023-03-20 19:28:23] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2023-03-20 19:28:23] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2023-03-20 19:28:23] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2023-03-20 19:28:24] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 1 ms to minimize.
[2023-03-20 19:28:24] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 0 ms to minimize.
[2023-03-20 19:28:24] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2023-03-20 19:28:24] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2023-03-20 19:28:24] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2023-03-20 19:28:25] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2023-03-20 19:28:25] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:28:25] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2023-03-20 19:28:25] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2023-03-20 19:28:25] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2023-03-20 19:28:25] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2023-03-20 19:28:26] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2023-03-20 19:28:26] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2023-03-20 19:28:26] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:28:26] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2023-03-20 19:28:26] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2023-03-20 19:28:26] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3235 ms
[2023-03-20 19:28:26] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2023-03-20 19:28:26] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2023-03-20 19:28:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-03-20 19:28:27] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 0 ms to minimize.
[2023-03-20 19:28:27] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2023-03-20 19:28:27] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2023-03-20 19:28:28] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 2 ms to minimize.
[2023-03-20 19:28:28] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-20 19:28:28] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2023-03-20 19:28:28] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 0 ms to minimize.
[2023-03-20 19:28:28] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2023-03-20 19:28:29] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2023-03-20 19:28:29] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 0 ms to minimize.
[2023-03-20 19:28:29] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:28:29] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2023-03-20 19:28:29] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-20 19:28:29] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2023-03-20 19:28:30] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2023-03-20 19:28:30] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2023-03-20 19:28:30] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-20 19:28:30] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2023-03-20 19:28:30] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3426 ms
[2023-03-20 19:28:30] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 0 ms to minimize.
[2023-03-20 19:28:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-20 19:28:31] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 0 ms to minimize.
[2023-03-20 19:28:31] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 5 ms to minimize.
[2023-03-20 19:28:31] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2023-03-20 19:28:31] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:28:31] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 0 ms to minimize.
[2023-03-20 19:28:31] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 0 ms to minimize.
[2023-03-20 19:28:31] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2023-03-20 19:28:32] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2023-03-20 19:28:32] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2023-03-20 19:28:32] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 0 ms to minimize.
[2023-03-20 19:28:32] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 2 ms to minimize.
[2023-03-20 19:28:32] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 1 ms to minimize.
[2023-03-20 19:28:33] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 1 ms to minimize.
[2023-03-20 19:28:33] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 9 ms to minimize.
[2023-03-20 19:28:33] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2023-03-20 19:28:33] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 0 ms to minimize.
[2023-03-20 19:28:34] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 1 ms to minimize.
[2023-03-20 19:28:34] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 1 ms to minimize.
[2023-03-20 19:28:34] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 1 ms to minimize.
[2023-03-20 19:28:34] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 1 ms to minimize.
[2023-03-20 19:28:34] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 0 ms to minimize.
[2023-03-20 19:28:35] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 1 ms to minimize.
[2023-03-20 19:28:35] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 1 ms to minimize.
[2023-03-20 19:28:35] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 1 ms to minimize.
[2023-03-20 19:28:35] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 0 ms to minimize.
[2023-03-20 19:28:36] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2023-03-20 19:28:36] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 1 ms to minimize.
[2023-03-20 19:28:36] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 1 ms to minimize.
[2023-03-20 19:28:36] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2023-03-20 19:28:36] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2023-03-20 19:28:37] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2023-03-20 19:28:37] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2023-03-20 19:28:37] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 1 ms to minimize.
[2023-03-20 19:28:37] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 0 ms to minimize.
[2023-03-20 19:28:37] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 0 ms to minimize.
[2023-03-20 19:28:37] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 1 ms to minimize.
[2023-03-20 19:28:38] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 0 ms to minimize.
[2023-03-20 19:28:38] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 1 ms to minimize.
[2023-03-20 19:28:38] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 1 ms to minimize.
[2023-03-20 19:28:38] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 1 ms to minimize.
[2023-03-20 19:28:38] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2023-03-20 19:28:39] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 0 ms to minimize.
[2023-03-20 19:28:39] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 0 ms to minimize.
[2023-03-20 19:28:39] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 1 ms to minimize.
[2023-03-20 19:28:39] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2023-03-20 19:28:39] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2023-03-20 19:28:39] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 1 ms to minimize.
[2023-03-20 19:28:40] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 0 ms to minimize.
[2023-03-20 19:28:40] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2023-03-20 19:28:40] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 0 ms to minimize.
[2023-03-20 19:28:40] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 0 ms to minimize.
[2023-03-20 19:28:40] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 0 ms to minimize.
[2023-03-20 19:28:40] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 1 ms to minimize.
[2023-03-20 19:28:41] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 1 ms to minimize.
[2023-03-20 19:28:41] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 0 ms to minimize.
[2023-03-20 19:28:41] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 0 ms to minimize.
[2023-03-20 19:28:41] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2023-03-20 19:28:41] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:28:41] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 10862 ms
[2023-03-20 19:28:41] [INFO ] After 21821ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 927 ms.
[2023-03-20 19:28:42] [INFO ] After 23135ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 137 ms.
Support contains 109 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 803 transition count 845
Reduce places removed 58 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 65 rules applied. Total rules applied 123 place count 745 transition count 838
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 130 place count 738 transition count 838
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 130 place count 738 transition count 744
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 318 place count 644 transition count 744
Discarding 106 places :
Symmetric choice reduction at 3 with 106 rule applications. Total rules 424 place count 538 transition count 638
Iterating global reduction 3 with 106 rules applied. Total rules applied 530 place count 538 transition count 638
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 530 place count 538 transition count 604
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 598 place count 504 transition count 604
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 858 place count 374 transition count 474
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 3 with 32 rules applied. Total rules applied 890 place count 374 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 891 place count 373 transition count 473
Applied a total of 891 rules in 209 ms. Remains 373 /803 variables (removed 430) and now considering 473/903 (removed 430) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 373/803 places, 473/903 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 5) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 473 rows 373 cols
[2023-03-20 19:28:43] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 19:28:43] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 19:28:43] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-20 19:28:44] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 19:28:44] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-20 19:28:44] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-20 19:28:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-20 19:28:44] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2023-03-20 19:28:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2023-03-20 19:28:44] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-20 19:28:44] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2023-03-20 19:28:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 490 ms
[2023-03-20 19:28:44] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:28:44] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:28:45] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-20 19:28:45] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-20 19:28:45] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2023-03-20 19:28:45] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-20 19:28:45] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-20 19:28:45] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2023-03-20 19:28:45] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2023-03-20 19:28:45] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2023-03-20 19:28:45] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2023-03-20 19:28:45] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2023-03-20 19:28:45] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-20 19:28:46] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-03-20 19:28:46] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1425 ms
[2023-03-20 19:28:46] [INFO ] After 2357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 250 ms.
[2023-03-20 19:28:46] [INFO ] After 2670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 93 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 473/473 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 471
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 371 transition count 471
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 371 transition count 469
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 369 transition count 469
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 364 transition count 464
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 364 transition count 464
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 363 transition count 463
Applied a total of 20 rules in 87 ms. Remains 363 /373 variables (removed 10) and now considering 463/473 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 363/373 places, 463/473 transitions.
Incomplete random walk after 10000 steps, including 28 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) 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 2) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 463 rows 363 cols
[2023-03-20 19:28:46] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 19:28:46] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:28:46] [INFO ] [Nat]Absence check using 81 positive place invariants in 20 ms returned sat
[2023-03-20 19:28:47] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:28:47] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-20 19:28:47] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-20 19:28:47] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2023-03-20 19:28:47] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-20 19:28:47] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-20 19:28:47] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2023-03-20 19:28:47] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2023-03-20 19:28:48] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-20 19:28:48] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-20 19:28:48] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-20 19:28:48] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2023-03-20 19:28:48] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-20 19:28:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1199 ms
[2023-03-20 19:28:48] [INFO ] After 1647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-20 19:28:48] [INFO ] After 1906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 76 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 463/463 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 363 transition count 461
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 361 transition count 461
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 361 transition count 459
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 359 transition count 459
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 32 place count 347 transition count 447
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 347 transition count 447
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 344 transition count 444
Applied a total of 36 rules in 72 ms. Remains 344 /363 variables (removed 19) and now considering 444/463 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 344/363 places, 444/463 transitions.
Incomplete random walk after 10000 steps, including 29 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 595962 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 595962 steps, saw 116264 distinct states, run finished after 3002 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 444 rows 344 cols
[2023-03-20 19:28:51] [INFO ] Computed 81 place invariants in 5 ms
[2023-03-20 19:28:51] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:28:51] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-20 19:28:52] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:28:52] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-20 19:28:52] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2023-03-20 19:28:52] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2023-03-20 19:28:52] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-20 19:28:52] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2023-03-20 19:28:53] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-20 19:28:53] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-20 19:28:53] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2023-03-20 19:28:53] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-20 19:28:53] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-03-20 19:28:53] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2023-03-20 19:28:53] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-20 19:28:53] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2023-03-20 19:28:53] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1185 ms
[2023-03-20 19:28:53] [INFO ] After 1628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-20 19:28:53] [INFO ] After 1868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 76 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 444/444 transitions.
Applied a total of 0 rules in 20 ms. Remains 344 /344 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 344/344 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 444/444 transitions.
Applied a total of 0 rules in 17 ms. Remains 344 /344 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2023-03-20 19:28:53] [INFO ] Invariant cache hit.
[2023-03-20 19:28:54] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-20 19:28:54] [INFO ] Invariant cache hit.
[2023-03-20 19:28:54] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-20 19:28:54] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-20 19:28:54] [INFO ] Invariant cache hit.
[2023-03-20 19:28:54] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 840 ms. Remains : 344/344 places, 444/444 transitions.
Applied a total of 0 rules in 7 ms. Remains 344 /344 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 19:28:54] [INFO ] Invariant cache hit.
[2023-03-20 19:28:54] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:28:54] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-20 19:28:55] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:28:55] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2023-03-20 19:28:55] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-20 19:28:55] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-20 19:28:55] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-20 19:28:55] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-20 19:28:55] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2023-03-20 19:28:55] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2023-03-20 19:28:55] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2023-03-20 19:28:56] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2023-03-20 19:28:56] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-20 19:28:56] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-20 19:28:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1046 ms
[2023-03-20 19:28:56] [INFO ] After 1378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 193 ms.
[2023-03-20 19:28:56] [INFO ] After 1650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 19:28:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-20 19:28:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 344 places, 444 transitions and 1986 arcs took 5 ms.
[2023-03-20 19:28:56] [INFO ] Flatten gal took : 88 ms
Total runtime 38719 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: ShieldRVs_PT_020B
(NrP: 344 NrTr: 444 NrArc: 1986)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.015sec
net check time: 0m 0.000sec
init dd package: 0m 3.111sec
before gc: list nodes free: 721441
after gc: idd nodes used:129357, unused:63870643; list nodes free:280422292
before gc: list nodes free: 602502
after gc: idd nodes used:152077, unused:63847923; list nodes free:288700728
before gc: list nodes free: 226994
after gc: idd nodes used:240906, unused:63759094; list nodes free:290385081
before gc: list nodes free: 1152546
after gc: idd nodes used:275593, unused:63724407; list nodes free:292314562
before gc: list nodes free: 849910
after gc: idd nodes used:297290, unused:63702710; list nodes free:292218901
before gc: list nodes free: 4544910
after gc: idd nodes used:400991, unused:63599009; list nodes free:291762237
before gc: list nodes free: 1980568
after gc: idd nodes used:499312, unused:63500688; list nodes free:291313810
before gc: list nodes free: 994575
after gc: idd nodes used:489482, unused:63510518; list nodes free:291350200
before gc: list nodes free: 1478476
after gc: idd nodes used:496267, unused:63503733; list nodes free:291323869
before gc: list nodes free: 5034427
after gc: idd nodes used:381373, unused:63618627; list nodes free:291869709
before gc: list nodes free: 3843991
after gc: idd nodes used:392367, unused:63607633; list nodes free:291816812
before gc: list nodes free: 4641648
after gc: idd nodes used:401057, unused:63598943; list nodes free:291782586
before gc: list nodes free: 4451382
after gc: idd nodes used:413100, unused:63586900; list nodes free:291724680
before gc: list nodes free: 4577992
after gc: idd nodes used:401185, unused:63598815; list nodes free:291785106
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6134652 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16103520 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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.002sec
17824 29681 32046 35377 34690 35333 67424 215247 195615 165229 219688 214055 240374 299059 278135 292443 336191 246404 440919 506657 486604 501199 513311 408077 382858 380849 395786 401782 393351 401152 398428 412571 416772 401118 390102 397425
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="ShieldRVs-PT-020B"
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 ShieldRVs-PT-020B, 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-167905978500111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020B.tgz
mv ShieldRVs-PT-020B 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 ;