Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286026100991.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
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 r222-tall-165286026100991
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 30 00:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 00:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 00:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 00:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 30 00:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 30 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 30 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 239K May 10 09:34 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 1654282930723

Running Version 202205111006
[2022-06-03 19:02:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 19:02:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 19:02:12] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2022-06-03 19:02:12] [INFO ] Transformed 1003 places.
[2022-06-03 19:02:12] [INFO ] Transformed 1003 transitions.
[2022-06-03 19:02:12] [INFO ] Found NUPN structural information;
[2022-06-03 19:02:12] [INFO ] Parsed PT model containing 1003 places and 1003 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 16) seen :8
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2022-06-03 19:02:13] [INFO ] Computed 81 place invariants in 25 ms
[2022-06-03 19:02:13] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 19:02:13] [INFO ] [Nat]Absence check using 81 positive place invariants in 31 ms returned sat
[2022-06-03 19:02:15] [INFO ] After 1391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-03 19:02:15] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 6 ms to minimize.
[2022-06-03 19:02:16] [INFO ] Deduced a trap composed of 52 places in 248 ms of which 1 ms to minimize.
[2022-06-03 19:02:16] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 1 ms to minimize.
[2022-06-03 19:02:16] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 1 ms to minimize.
[2022-06-03 19:02:16] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 1 ms to minimize.
[2022-06-03 19:02:17] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 1 ms to minimize.
[2022-06-03 19:02:17] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 1 ms to minimize.
[2022-06-03 19:02:17] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
[2022-06-03 19:02:17] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 1 ms to minimize.
[2022-06-03 19:02:17] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 1 ms to minimize.
[2022-06-03 19:02:18] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 1 ms to minimize.
[2022-06-03 19:02:18] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2022-06-03 19:02:18] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 0 ms to minimize.
[2022-06-03 19:02:18] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 0 ms to minimize.
[2022-06-03 19:02:18] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 1 ms to minimize.
[2022-06-03 19:02:18] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 0 ms to minimize.
[2022-06-03 19:02:19] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 0 ms to minimize.
[2022-06-03 19:02:19] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 1 ms to minimize.
[2022-06-03 19:02:19] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 0 ms to minimize.
[2022-06-03 19:02:19] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 1 ms to minimize.
[2022-06-03 19:02:19] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 1 ms to minimize.
[2022-06-03 19:02:19] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2022-06-03 19:02:20] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 0 ms to minimize.
[2022-06-03 19:02:20] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 0 ms to minimize.
[2022-06-03 19:02:20] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 0 ms to minimize.
[2022-06-03 19:02:20] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2022-06-03 19:02:20] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 0 ms to minimize.
[2022-06-03 19:02:20] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 0 ms to minimize.
[2022-06-03 19:02:20] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 0 ms to minimize.
[2022-06-03 19:02:21] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 0 ms to minimize.
[2022-06-03 19:02:21] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 1 ms to minimize.
[2022-06-03 19:02:21] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 0 ms to minimize.
[2022-06-03 19:02:21] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 1 ms to minimize.
[2022-06-03 19:02:22] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 0 ms to minimize.
[2022-06-03 19:02:22] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 4 ms to minimize.
[2022-06-03 19:02:22] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 0 ms to minimize.
[2022-06-03 19:02:22] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
[2022-06-03 19:02:22] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 1 ms to minimize.
[2022-06-03 19:02:23] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 0 ms to minimize.
[2022-06-03 19:02:23] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 1 ms to minimize.
[2022-06-03 19:02:23] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 1 ms to minimize.
[2022-06-03 19:02:23] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 0 ms to minimize.
[2022-06-03 19:02:24] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 1 ms to minimize.
[2022-06-03 19:02:24] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 0 ms to minimize.
[2022-06-03 19:02:24] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 1 ms to minimize.
[2022-06-03 19:02:24] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 0 ms to minimize.
[2022-06-03 19:02:24] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 1 ms to minimize.
[2022-06-03 19:02:25] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 1 ms to minimize.
[2022-06-03 19:02:25] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 0 ms to minimize.
[2022-06-03 19:02:25] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2022-06-03 19:02:25] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 1 ms to minimize.
[2022-06-03 19:02:25] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2022-06-03 19:02:25] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 0 ms to minimize.
[2022-06-03 19:02:26] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 0 ms to minimize.
[2022-06-03 19:02:26] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2022-06-03 19:02:26] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 10697 ms
[2022-06-03 19:02:26] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 2 ms to minimize.
[2022-06-03 19:02:26] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 1 ms to minimize.
[2022-06-03 19:02:27] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 1 ms to minimize.
[2022-06-03 19:02:27] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 0 ms to minimize.
[2022-06-03 19:02:27] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 1 ms to minimize.
[2022-06-03 19:02:27] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 1 ms to minimize.
[2022-06-03 19:02:28] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 0 ms to minimize.
[2022-06-03 19:02:28] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 1 ms to minimize.
[2022-06-03 19:02:28] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 1 ms to minimize.
[2022-06-03 19:02:28] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 1 ms to minimize.
[2022-06-03 19:02:28] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 2 ms to minimize.
[2022-06-03 19:02:29] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 2 ms to minimize.
[2022-06-03 19:02:29] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 4 ms to minimize.
[2022-06-03 19:02:29] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2022-06-03 19:02:29] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 0 ms to minimize.
[2022-06-03 19:02:29] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 0 ms to minimize.
[2022-06-03 19:02:30] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 1 ms to minimize.
[2022-06-03 19:02:30] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 0 ms to minimize.
[2022-06-03 19:02:30] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 1 ms to minimize.
[2022-06-03 19:02:30] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 0 ms to minimize.
[2022-06-03 19:02:31] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 1 ms to minimize.
[2022-06-03 19:02:31] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2022-06-03 19:02:31] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 1 ms to minimize.
[2022-06-03 19:02:31] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 1 ms to minimize.
[2022-06-03 19:02:31] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2022-06-03 19:02:32] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 0 ms to minimize.
[2022-06-03 19:02:32] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 1 ms to minimize.
[2022-06-03 19:02:32] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 1 ms to minimize.
[2022-06-03 19:02:32] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 1 ms to minimize.
[2022-06-03 19:02:32] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 0 ms to minimize.
[2022-06-03 19:02:33] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 1 ms to minimize.
[2022-06-03 19:02:33] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2022-06-03 19:02:33] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 1 ms to minimize.
[2022-06-03 19:02:33] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 0 ms to minimize.
[2022-06-03 19:02:33] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 0 ms to minimize.
[2022-06-03 19:02:33] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2022-06-03 19:02:34] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 1 ms to minimize.
[2022-06-03 19:02:34] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 0 ms to minimize.
[2022-06-03 19:02:34] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 0 ms to minimize.
[2022-06-03 19:02:34] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 0 ms to minimize.
[2022-06-03 19:02:34] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 0 ms to minimize.
[2022-06-03 19:02:34] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2022-06-03 19:02:35] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 0 ms to minimize.
[2022-06-03 19:02:35] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 0 ms to minimize.
[2022-06-03 19:02:35] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 1 ms to minimize.
[2022-06-03 19:02:35] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 0 ms to minimize.
[2022-06-03 19:02:35] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 1 ms to minimize.
[2022-06-03 19:02:36] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2022-06-03 19:02:36] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2022-06-03 19:02:36] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2022-06-03 19:02:36] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 0 ms to minimize.
[2022-06-03 19:02:36] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2022-06-03 19:02:36] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 0 ms to minimize.
[2022-06-03 19:02:36] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2022-06-03 19:02:36] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 0 ms to minimize.
[2022-06-03 19:02:37] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 0 ms to minimize.
[2022-06-03 19:02:37] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 10626 ms
[2022-06-03 19:02:37] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 1 ms to minimize.
[2022-06-03 19:02:37] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 0 ms to minimize.
[2022-06-03 19:02:38] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 0 ms to minimize.
[2022-06-03 19:02:38] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2022-06-03 19:02:38] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 1 ms to minimize.
[2022-06-03 19:02:38] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 0 ms to minimize.
[2022-06-03 19:02:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 19:02:38] [INFO ] After 25072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 11007 ms.
Support contains 103 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 1003 transition count 781
Reduce places removed 222 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 224 rules applied. Total rules applied 446 place count 781 transition count 779
Reduce places removed 1 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 2 with 35 rules applied. Total rules applied 481 place count 780 transition count 745
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 515 place count 746 transition count 745
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 89 Pre rules applied. Total rules applied 515 place count 746 transition count 656
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 693 place count 657 transition count 656
Discarding 121 places :
Symmetric choice reduction at 4 with 121 rule applications. Total rules 814 place count 536 transition count 535
Iterating global reduction 4 with 121 rules applied. Total rules applied 935 place count 536 transition count 535
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 935 place count 536 transition count 500
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1005 place count 501 transition count 500
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 4 with 300 rules applied. Total rules applied 1305 place count 351 transition count 350
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 1373 place count 317 transition count 368
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 1378 place count 317 transition count 363
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1383 place count 312 transition count 363
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1384 place count 312 transition count 362
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1388 place count 312 transition count 362
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1389 place count 312 transition count 362
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 311 transition count 361
Applied a total of 1390 rules in 228 ms. Remains 311 /1003 variables (removed 692) and now considering 361/1003 (removed 642) transitions.
Finished structural reductions, in 1 iterations. Remains : 311/1003 places, 361/1003 transitions.
Incomplete random walk after 1000000 steps, including 18 resets, run finished after 10033 ms. (steps per millisecond=99 ) properties (out of 8) seen :6
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 1632 ms. (steps per millisecond=612 ) properties (out of 2) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 1537 ms. (steps per millisecond=650 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 361 rows 311 cols
[2022-06-03 19:03:03] [INFO ] Computed 81 place invariants in 5 ms
[2022-06-03 19:03:03] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:03:03] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2022-06-03 19:03:03] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:03:03] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-03 19:03:03] [INFO ] After 42ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:03:03] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-06-03 19:03:03] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2022-06-03 19:03:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2022-06-03 19:03:03] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-06-03 19:03:03] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 37 ms.
Support contains 10 out of 311 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 361/361 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 311 transition count 342
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 292 transition count 341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 291 transition count 341
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 40 place count 291 transition count 305
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 112 place count 255 transition count 305
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 252 transition count 302
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 252 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 118 place count 252 transition count 301
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 251 transition count 301
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 212 place count 205 transition count 255
Renaming transitions due to excessive name length > 1024 char.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 256 place count 183 transition count 275
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 183 transition count 274
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 259 place count 183 transition count 272
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 261 place count 183 transition count 270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 263 place count 181 transition count 270
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 264 place count 181 transition count 269
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 266 place count 181 transition count 269
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 270 place count 177 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 271 place count 176 transition count 265
Applied a total of 271 rules in 71 ms. Remains 176 /311 variables (removed 135) and now considering 265/361 (removed 96) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/311 places, 265/361 transitions.
Incomplete random walk after 1000000 steps, including 295 resets, run finished after 3281 ms. (steps per millisecond=304 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 27 resets, run finished after 1629 ms. (steps per millisecond=613 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4039701 steps, run timeout after 12001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 4039701 steps, saw 1725164 distinct states, run finished after 12003 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 265 rows 176 cols
[2022-06-03 19:03:20] [INFO ] Computed 80 place invariants in 3 ms
[2022-06-03 19:03:20] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:03:20] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2022-06-03 19:03:20] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:03:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-03 19:03:20] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:03:20] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-03 19:03:20] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 10 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 265/265 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 265/265 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 265/265 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 265/265 (removed 0) transitions.
// Phase 1: matrix 265 rows 176 cols
[2022-06-03 19:03:20] [INFO ] Computed 80 place invariants in 2 ms
[2022-06-03 19:03:20] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 265 rows 176 cols
[2022-06-03 19:03:20] [INFO ] Computed 80 place invariants in 1 ms
[2022-06-03 19:03:21] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-03 19:03:21] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2022-06-03 19:03:21] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 265 rows 176 cols
[2022-06-03 19:03:21] [INFO ] Computed 80 place invariants in 2 ms
[2022-06-03 19:03:21] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 265/265 transitions.
Incomplete random walk after 1000000 steps, including 258 resets, run finished after 3355 ms. (steps per millisecond=298 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 1605 ms. (steps per millisecond=623 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4299079 steps, run timeout after 12001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 4299079 steps, saw 1785034 distinct states, run finished after 12001 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 265 rows 176 cols
[2022-06-03 19:03:38] [INFO ] Computed 80 place invariants in 6 ms
[2022-06-03 19:03:38] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:03:38] [INFO ] [Nat]Absence check using 80 positive place invariants in 8 ms returned sat
[2022-06-03 19:03:38] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:03:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-03 19:03:38] [INFO ] After 13ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:03:38] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-06-03 19:03:38] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 10 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 265/265 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 265/265 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 265/265 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 265/265 (removed 0) transitions.
// Phase 1: matrix 265 rows 176 cols
[2022-06-03 19:03:38] [INFO ] Computed 80 place invariants in 2 ms
[2022-06-03 19:03:38] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 265 rows 176 cols
[2022-06-03 19:03:38] [INFO ] Computed 80 place invariants in 1 ms
[2022-06-03 19:03:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-03 19:03:38] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2022-06-03 19:03:38] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 265 rows 176 cols
[2022-06-03 19:03:38] [INFO ] Computed 80 place invariants in 1 ms
[2022-06-03 19:03:38] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 265/265 transitions.
Graph (trivial) has 66 edges and 176 vertex of which 4 / 176 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 565 edges and 174 vertex of which 172 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 63 edges and 170 vertex of which 4 / 170 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 168 transition count 256
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 62 edges and 166 vertex of which 6 / 166 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 163 transition count 247
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 60 edges and 160 vertex of which 6 / 160 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 157 transition count 236
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 55 edges and 155 vertex of which 2 / 155 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 3 with 13 rules applied. Total rules applied 48 place count 154 transition count 226
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 54 edges and 153 vertex of which 2 / 153 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 4 with 5 rules applied. Total rules applied 53 place count 152 transition count 223
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 483 edges and 151 vertex of which 148 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 5 with 6 rules applied. Total rules applied 59 place count 148 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 59 place count 148 transition count 215
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 62 place count 146 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 65 place count 144 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 69 place count 144 transition count 210
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 73 place count 144 transition count 206
Applied a total of 73 rules in 27 ms. Remains 144 /176 variables (removed 32) and now considering 206/265 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 206 rows 144 cols
[2022-06-03 19:03:38] [INFO ] Computed 64 place invariants in 1 ms
[2022-06-03 19:03:38] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:03:39] [INFO ] [Nat]Absence check using 64 positive place invariants in 7 ms returned sat
[2022-06-03 19:03:39] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:03:39] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-03 19:03:39] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:03:39] [INFO ] Flatten gal took : 52 ms
[2022-06-03 19:03:39] [INFO ] Flatten gal took : 19 ms
[2022-06-03 19:03:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16198154959429543561.gal : 11 ms
[2022-06-03 19:03:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8459453528718793871.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16198154959429543561.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8459453528718793871.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8459453528718793871.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 39
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :39 after 74
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :74 after 115
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :115 after 478
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :478 after 12363
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :12363 after 6.29153e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.29153e+06 after 8.89058e+11
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,5.22965e+21,0.108016,5984,2,351,13,10039,7,0,797,11000,0
Total reachable state count : 5229651944896745963520

Verifying 1 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,1.43539e+20,0.110408,5984,2,545,13,10039,7,0,810,11000,0
[2022-06-03 19:03:39] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17422517703335229081
[2022-06-03 19:03:39] [INFO ] Applying decomposition
[2022-06-03 19:03:39] [INFO ] Flatten gal took : 44 ms
[2022-06-03 19:03:39] [INFO ] Computing symmetric may disable matrix : 265 transitions.
[2022-06-03 19:03:39] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:03:39] [INFO ] Computing symmetric may enable matrix : 265 transitions.
[2022-06-03 19:03:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:03:39] [INFO ] Flatten gal took : 68 ms
[2022-06-03 19:03:39] [INFO ] Input system was already deterministic with 265 transitions.
[2022-06-03 19:03:39] [INFO ] Computing Do-Not-Accords matrix : 265 transitions.
[2022-06-03 19:03:39] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 19:03:39] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17422517703335229081
Running compilation step : cd /tmp/ltsmin17422517703335229081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2486876728271688958.txt' '-o' '/tmp/graph2486876728271688958.bin' '-w' '/tmp/graph2486876728271688958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2486876728271688958.bin' '-l' '-1' '-v' '-w' '/tmp/graph2486876728271688958.weights' '-q' '0' '-e' '0.001'
[2022-06-03 19:03:39] [INFO ] Decomposing Gal with order
[2022-06-03 19:03:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 19:03:39] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-03 19:03:39] [INFO ] Ran tautology test, simplified 0 / 1 in 337 ms.
[2022-06-03 19:03:39] [INFO ] BMC solution for property ShieldRVt-PT-020B-ReachabilityFireability-09(UNSAT) depth K=0 took 5 ms
[2022-06-03 19:03:40] [INFO ] Flatten gal took : 108 ms
[2022-06-03 19:03:40] [INFO ] BMC solution for property ShieldRVt-PT-020B-ReachabilityFireability-09(UNSAT) depth K=1 took 21 ms
[2022-06-03 19:03:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 236 labels/synchronizations in 18 ms.
[2022-06-03 19:03:40] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15599545824172197796.gal : 16 ms
[2022-06-03 19:03:40] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9542387652135680831.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability15599545824172197796.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9542387652135680831.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityFireability9542387652135680831.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
[2022-06-03 19:03:40] [INFO ] BMC solution for property ShieldRVt-PT-020B-ReachabilityFireability-09(UNSAT) depth K=2 took 105 ms
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 3
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 265 rows 176 cols
[2022-06-03 19:03:40] [INFO ] Computed 80 place invariants in 2 ms
[2022-06-03 19:03:40] [INFO ] Computed 80 place invariants in 2 ms
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-09 is true.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
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,8.99453e+24,0.172506,10328,398,30,13108,115,456,32099,60,397,0
Total reachable state count : 8994533277105104728096768

Verifying 1 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,1.9732e+12,0.176343,10592,130,24,13108,115,503,32099,69,397,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 19:03:40] [WARNING] Interrupting SMT solver.
[2022-06-03 19:03:40] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
Exception in thread "Thread-7" java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:117)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:283)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 19:03:40] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 19:03:40] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVt-PT-020B-ReachabilityFireability-09 SMT depth 3
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-03 19:03:40] [INFO ] During BMC, SMT solver timed out at depth 3
[2022-06-03 19:03:40] [INFO ] BMC solving timed out (3600000 secs) at depth 3
[2022-06-03 19:03:40] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 88551 ms.

BK_STOP 1654283020418

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-4028"
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 r222-tall-165286026100991"
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 ;