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.r421-tajo-167905975000287.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 itstools
Input is ShieldRVt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975000287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 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.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 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 239K 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-020B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679171973194

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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-18 20:39:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:39:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:39:35] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-18 20:39:35] [INFO ] Transformed 1003 places.
[2023-03-18 20:39:35] [INFO ] Transformed 1003 transitions.
[2023-03-18 20:39:35] [INFO ] Found NUPN structural information;
[2023-03-18 20:39:35] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 20:39:35] [INFO ] Flatten gal took : 116 ms
[2023-03-18 20:39:35] [INFO ] Flatten gal took : 51 ms
[2023-03-18 20:39:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9098732739734506877.gal : 44 ms
[2023-03-18 20:39:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6025381732922812430.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9098732739734506877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6025381732922812430.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Incomplete random walk after 10000 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 16) seen :9
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality6025381732922812430.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2023-03-18 20:39:36] [INFO ] Computed 81 place invariants in 18 ms
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 49
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :49 after 229
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-04 does not hold.
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-01 is true.
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :229 after 2.80904e+06
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-03 does not hold.
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :2.80904e+06 after 1.9172e+09
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :1.9172e+09 after 2.56445e+13
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-15 is true.
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-02 is true.
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :2.56445e+13 after 1.68272e+20
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :1.68272e+20 after 1.53621e+27
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :1.53621e+27 after 8.96243e+41
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-10 does not hold.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-05 is true.
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :8.96243e+41 after 1.8507e+46
[2023-03-18 20:39:36] [INFO ] [Real]Absence check using 81 positive place invariants in 24 ms returned sat
[2023-03-18 20:39:36] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :1.8507e+46 after 1.8507e+46
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1.8507e+46 after 1.8507e+46
[2023-03-18 20:39:37] [INFO ] [Nat]Absence check using 81 positive place invariants in 20 ms returned sat
[2023-03-18 20:39:38] [INFO ] After 1033ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 20:39:38] [INFO ] Deduced a trap composed of 29 places in 303 ms of which 6 ms to minimize.
[2023-03-18 20:39:38] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 1 ms to minimize.
[2023-03-18 20:39:39] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 1 ms to minimize.
[2023-03-18 20:39:39] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 1 ms to minimize.
[2023-03-18 20:39:39] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 2 ms to minimize.
[2023-03-18 20:39:39] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 1 ms to minimize.
[2023-03-18 20:39:39] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 1 ms to minimize.
[2023-03-18 20:39:40] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 2 ms to minimize.
[2023-03-18 20:39:40] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 1 ms to minimize.
[2023-03-18 20:39:40] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 1 ms to minimize.
[2023-03-18 20:39:40] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 1 ms to minimize.
[2023-03-18 20:39:40] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 1 ms to minimize.
[2023-03-18 20:39:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2841 ms
[2023-03-18 20:39:41] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 1 ms to minimize.
[2023-03-18 20:39:41] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 0 ms to minimize.
[2023-03-18 20:39:41] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 1 ms to minimize.
[2023-03-18 20:39:42] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 1 ms to minimize.
[2023-03-18 20:39:42] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 0 ms to minimize.
[2023-03-18 20:39:42] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 0 ms to minimize.
[2023-03-18 20:39:42] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 0 ms to minimize.
[2023-03-18 20:39:43] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 1 ms to minimize.
[2023-03-18 20:39:43] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2023-03-18 20:39:43] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 1 ms to minimize.
[2023-03-18 20:39:43] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2023-03-18 20:39:43] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 0 ms to minimize.
[2023-03-18 20:39:44] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 1 ms to minimize.
[2023-03-18 20:39:44] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 0 ms to minimize.
[2023-03-18 20:39:44] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2023-03-18 20:39:44] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 0 ms to minimize.
[2023-03-18 20:39:44] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 0 ms to minimize.
[2023-03-18 20:39:45] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 0 ms to minimize.
[2023-03-18 20:39:45] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 1 ms to minimize.
[2023-03-18 20:39:45] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 0 ms to minimize.
[2023-03-18 20:39:45] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 1 ms to minimize.
[2023-03-18 20:39:45] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 5 ms to minimize.
[2023-03-18 20:39:46] [INFO ] Deduced a trap composed of 41 places in 241 ms of which 1 ms to minimize.
[2023-03-18 20:39:46] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2023-03-18 20:39:46] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 1 ms to minimize.
[2023-03-18 20:39:46] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2023-03-18 20:39:46] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 1 ms to minimize.
[2023-03-18 20:39:47] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2023-03-18 20:39:47] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2023-03-18 20:39:47] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2023-03-18 20:39:47] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2023-03-18 20:39:47] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2023-03-18 20:39:47] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2023-03-18 20:39:47] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 5 ms to minimize.
[2023-03-18 20:39:47] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2023-03-18 20:39:48] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2023-03-18 20:39:48] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 7016 ms
[2023-03-18 20:39:48] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2023-03-18 20:39:48] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 1 ms to minimize.
[2023-03-18 20:39:48] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2023-03-18 20:39:49] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 0 ms to minimize.
[2023-03-18 20:39:49] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 1 ms to minimize.
[2023-03-18 20:39:49] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2023-03-18 20:39:49] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 1 ms to minimize.
[2023-03-18 20:39:50] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 20 ms to minimize.
[2023-03-18 20:39:50] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2023-03-18 20:39:50] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 0 ms to minimize.
[2023-03-18 20:39:50] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2023-03-18 20:39:50] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2023-03-18 20:39:50] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 0 ms to minimize.
[2023-03-18 20:39:50] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2023-03-18 20:39:51] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2023-03-18 20:39:51] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2023-03-18 20:39:51] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 0 ms to minimize.
[2023-03-18 20:39:51] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2023-03-18 20:39:51] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2023-03-18 20:39:51] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2023-03-18 20:39:51] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 8 ms to minimize.
[2023-03-18 20:39:51] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 12 ms to minimize.
[2023-03-18 20:39:52] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3636 ms
[2023-03-18 20:39:52] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 1 ms to minimize.
[2023-03-18 20:39:52] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 0 ms to minimize.
[2023-03-18 20:39:52] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 0 ms to minimize.
[2023-03-18 20:39:52] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 0 ms to minimize.
[2023-03-18 20:39:52] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 0 ms to minimize.
[2023-03-18 20:39:53] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 1 ms to minimize.
[2023-03-18 20:39:53] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2023-03-18 20:39:53] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2023-03-18 20:39:53] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2023-03-18 20:39:53] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2023-03-18 20:39:53] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 1 ms to minimize.
[2023-03-18 20:39:54] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 0 ms to minimize.
[2023-03-18 20:39:54] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 0 ms to minimize.
[2023-03-18 20:39:54] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2023-03-18 20:39:54] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 0 ms to minimize.
[2023-03-18 20:39:54] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 0 ms to minimize.
[2023-03-18 20:39:54] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2023-03-18 20:39:54] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2626 ms
[2023-03-18 20:39:55] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 0 ms to minimize.
[2023-03-18 20:39:55] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 1 ms to minimize.
[2023-03-18 20:39:55] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 0 ms to minimize.
[2023-03-18 20:39:55] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2023-03-18 20:39:55] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 1 ms to minimize.
[2023-03-18 20:39:56] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2023-03-18 20:39:56] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2023-03-18 20:39:56] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 0 ms to minimize.
[2023-03-18 20:39:56] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 0 ms to minimize.
[2023-03-18 20:39:56] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 0 ms to minimize.
[2023-03-18 20:39:56] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-18 20:39:56] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2023-03-18 20:39:57] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2023-03-18 20:39:57] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 1 ms to minimize.
[2023-03-18 20:39:57] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 0 ms to minimize.
[2023-03-18 20:39:57] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 0 ms to minimize.
[2023-03-18 20:39:57] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 1 ms to minimize.
[2023-03-18 20:39:57] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2799 ms
[2023-03-18 20:39:57] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 0 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 1 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 0 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2023-03-18 20:39:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1137 ms
[2023-03-18 20:39:58] [INFO ] After 21829ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1224 ms.
[2023-03-18 20:40:00] [INFO ] After 23365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 256 ms.
Support contains 104 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 218 place count 1003 transition count 785
Reduce places removed 218 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 243 rules applied. Total rules applied 461 place count 785 transition count 760
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 486 place count 760 transition count 760
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 486 place count 760 transition count 664
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 678 place count 664 transition count 664
Discarding 127 places :
Symmetric choice reduction at 3 with 127 rule applications. Total rules 805 place count 537 transition count 537
Iterating global reduction 3 with 127 rules applied. Total rules applied 932 place count 537 transition count 537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 934 place count 537 transition count 535
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 935 place count 536 transition count 535
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 935 place count 536 transition count 495
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1015 place count 496 transition count 495
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 149
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 5 with 298 rules applied. Total rules applied 1313 place count 347 transition count 346
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1393 place count 307 transition count 371
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 1400 place count 307 transition count 364
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1407 place count 300 transition count 364
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1408 place count 300 transition count 363
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1414 place count 300 transition count 363
Applied a total of 1414 rules in 313 ms. Remains 300 /1003 variables (removed 703) and now considering 363/1003 (removed 640) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 300/1003 places, 363/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 363 rows 300 cols
[2023-03-18 20:40:01] [INFO ] Computed 81 place invariants in 12 ms
[2023-03-18 20:40:01] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 20:40:01] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-18 20:40:01] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 20:40:01] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-18 20:40:02] [INFO ] After 303ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 450 ms
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-18 20:40:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-18 20:40:02] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2023-03-18 20:40:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-18 20:40:03] [INFO ] After 1279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 302 ms.
[2023-03-18 20:40:03] [INFO ] After 1872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 112 ms.
Support contains 100 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 363/363 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 300 transition count 361
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 298 transition count 361
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 298 transition count 359
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 296 transition count 359
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 296 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 295 transition count 358
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 295 transition count 358
Applied a total of 11 rules in 44 ms. Remains 295 /300 variables (removed 5) and now considering 358/363 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 295/300 places, 358/363 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 328013 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 328013 steps, saw 169447 distinct states, run finished after 3002 ms. (steps per millisecond=109 ) properties seen :2
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 358 rows 295 cols
[2023-03-18 20:40:07] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-18 20:40:07] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:40:07] [INFO ] [Nat]Absence check using 81 positive place invariants in 8 ms returned sat
[2023-03-18 20:40:07] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 20:40:07] [INFO ] State equation strengthened by 92 read => feed constraints.
[2023-03-18 20:40:07] [INFO ] After 189ms SMT Verify possible using 92 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 20:40:07] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2023-03-18 20:40:07] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2023-03-18 20:40:07] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-18 20:40:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 223 ms
[2023-03-18 20:40:08] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-18 20:40:08] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-18 20:40:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2023-03-18 20:40:08] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-18 20:40:08] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-18 20:40:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-18 20:40:08] [INFO ] After 789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-18 20:40:08] [INFO ] After 1229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 55 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 358/358 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 295 transition count 349
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 286 transition count 349
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 18 place count 286 transition count 332
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 52 place count 269 transition count 332
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 268 transition count 331
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 268 transition count 331
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 106 place count 242 transition count 305
Renaming transitions due to excessive name length > 1024 char.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 236 transition count 310
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 236 transition count 308
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 234 transition count 308
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 234 transition count 307
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 234 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 233 transition count 306
Applied a total of 126 rules in 129 ms. Remains 233 /295 variables (removed 62) and now considering 306/358 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 233/295 places, 306/358 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 247876 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 247876 steps, saw 127345 distinct states, run finished after 3002 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 306 rows 233 cols
[2023-03-18 20:40:12] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-18 20:40:12] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:40:12] [INFO ] [Nat]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-18 20:40:12] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 20:40:12] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-18 20:40:12] [INFO ] After 253ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 20:40:13] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2023-03-18 20:40:13] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2023-03-18 20:40:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2023-03-18 20:40:13] [INFO ] After 548ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-18 20:40:13] [INFO ] After 1069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 43 ms.
Support contains 55 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 306/306 transitions.
Applied a total of 0 rules in 17 ms. Remains 233 /233 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 233/233 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 306/306 transitions.
Applied a total of 0 rules in 5 ms. Remains 233 /233 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2023-03-18 20:40:13] [INFO ] Invariant cache hit.
[2023-03-18 20:40:13] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-18 20:40:13] [INFO ] Invariant cache hit.
[2023-03-18 20:40:14] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-18 20:40:14] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
[2023-03-18 20:40:14] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-18 20:40:14] [INFO ] Invariant cache hit.
[2023-03-18 20:40:14] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1279 ms. Remains : 233/233 places, 306/306 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 233 transition count 294
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 233 transition count 294
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 233 transition count 288
Applied a total of 30 rules in 45 ms. Remains 233 /233 variables (removed 0) and now considering 288/306 (removed 18) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 288 rows 233 cols
[2023-03-18 20:40:14] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-18 20:40:14] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:40:14] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-18 20:40:15] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 20:40:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 20:40:15] [INFO ] After 100ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 20:40:15] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2023-03-18 20:40:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-18 20:40:15] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2023-03-18 20:40:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-18 20:40:15] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-18 20:40:15] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-18 20:40:15] [INFO ] Flatten gal took : 52 ms
[2023-03-18 20:40:15] [INFO ] Flatten gal took : 28 ms
[2023-03-18 20:40:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10762082306723451850.gal : 3 ms
[2023-03-18 20:40:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14173175495065020344.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10762082306723451850.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14173175495065020344.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14173175495065020344.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 25
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :25 after 193
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :193 after 30722
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.90476e+06 after 2.5657e+06
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2.5657e+06 after 2.57163e+06
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2.57163e+06 after 1.30181e+07
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.30181e+07 after 2.69419e+10
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2.69419e+10 after 7.89448e+24
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.16268e+33,0.293488,12504,2,1164,16,35842,9,0,1301,48391,0
Total reachable state count : 3162683497650404753184043091099648

Verifying 3 reachability properties.
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-09,2.89442e+30,0.309062,12504,2,3284,16,35842,9,0,1359,48391,0
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-11,1.05932e+29,0.311502,12768,2,566,16,35842,9,0,1374,48391,0
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-14,0,0.311893,12768,1,0,16,35842,9,0,1375,48391,0
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES OVER_APPROXIMATION
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 20:40:16] [INFO ] Flatten gal took : 39 ms
[2023-03-18 20:40:16] [INFO ] Applying decomposition
[2023-03-18 20:40:16] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16541135175076970322.txt' '-o' '/tmp/graph16541135175076970322.bin' '-w' '/tmp/graph16541135175076970322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16541135175076970322.bin' '-l' '-1' '-v' '-w' '/tmp/graph16541135175076970322.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:40:16] [INFO ] Decomposing Gal with order
[2023-03-18 20:40:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:40:16] [INFO ] Removed a total of 120 redundant transitions.
[2023-03-18 20:40:16] [INFO ] Flatten gal took : 133 ms
[2023-03-18 20:40:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2023-03-18 20:40:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6297234548949158906.gal : 25 ms
[2023-03-18 20:40:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality913846559415458592.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6297234548949158906.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality913846559415458592.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality913846559415458592.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 244
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :244 after 1328
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1328 after 5174
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :5174 after 5174
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5174 after 2.15071e+06
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 21:10:19] [INFO ] Flatten gal took : 333 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9131308436912529835
[2023-03-18 21:10:20] [INFO ] Applying decomposition
[2023-03-18 21:10:20] [INFO ] Computing symmetric may disable matrix : 306 transitions.
[2023-03-18 21:10:20] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:10:20] [INFO ] Computing symmetric may enable matrix : 306 transitions.
[2023-03-18 21:10:20] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:10:20] [INFO ] Flatten gal took : 174 ms
[2023-03-18 21:10:21] [INFO ] Computing Do-Not-Accords matrix : 306 transitions.
[2023-03-18 21:10:21] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:10:21] [INFO ] Built C files in 1940ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9131308436912529835
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15209550756851080033.txt' '-o' '/tmp/graph15209550756851080033.bin' '-w' '/tmp/graph15209550756851080033.weights'
Running compilation step : cd /tmp/ltsmin9131308436912529835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15209550756851080033.bin' '-l' '-1' '-v' '-w' '/tmp/graph15209550756851080033.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:10:22] [INFO ] Decomposing Gal with order
[2023-03-18 21:10:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:10:22] [INFO ] Removed a total of 368 redundant transitions.
[2023-03-18 21:10:22] [INFO ] Flatten gal took : 88 ms
[2023-03-18 21:10:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 27 ms.
[2023-03-18 21:10:22] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3742899093547102990.gal : 3 ms
[2023-03-18 21:10:22] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6228788847785287043.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability3742899093547102990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6228788847785287043.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability6228788847785287043.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 97
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :97 after 769
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :769 after 4.94624e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.0919e+33,0.292206,17168,541,54,27497,321,850,68141,119,1401,0
Total reachable state count : 3091903894220008625811533345062912

Verifying 2 reachability properties.
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-09 is true.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-09,2.52815e+28,0.301629,17432,527,45,27497,321,949,68141,128,1401,1941
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-11 is true.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-11,1.60062e+28,0.302775,17432,139,33,27497,321,976,68141,128,1401,2074
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1847417 ms.

BK_STOP 1679173823349

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVt-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 r421-tajo-167905975000287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;