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-165286025900855.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 ShieldRVs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025900855
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 7.1K Apr 30 07:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 07:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 06:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 06:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 07:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 30 07:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 07:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 07:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:59 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 320K 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 ShieldRVs-PT-050A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654280997775

Running Version 202205111006
[2022-06-03 18:29:59] [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 18:29:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 18:29:59] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2022-06-03 18:29:59] [INFO ] Transformed 703 places.
[2022-06-03 18:29:59] [INFO ] Transformed 953 transitions.
[2022-06-03 18:29:59] [INFO ] Found NUPN structural information;
[2022-06-03 18:29:59] [INFO ] Parsed PT model containing 703 places and 953 transitions in 265 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 15 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 16) seen :10
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :1
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 953 rows 703 cols
[2022-06-03 18:30:00] [INFO ] Computed 201 place invariants in 23 ms
[2022-06-03 18:30:00] [INFO ] [Real]Absence check using 201 positive place invariants in 32 ms returned sat
[2022-06-03 18:30:00] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-03 18:30:01] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2022-06-03 18:30:02] [INFO ] After 1325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-03 18:30:03] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 6 ms to minimize.
[2022-06-03 18:30:03] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2022-06-03 18:30:03] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 1 ms to minimize.
[2022-06-03 18:30:03] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
[2022-06-03 18:30:03] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2022-06-03 18:30:04] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 2 ms to minimize.
[2022-06-03 18:30:04] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2022-06-03 18:30:04] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2022-06-03 18:30:04] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2022-06-03 18:30:04] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2022-06-03 18:30:05] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 0 ms to minimize.
[2022-06-03 18:30:05] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2022-06-03 18:30:05] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2022-06-03 18:30:05] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2022-06-03 18:30:05] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2022-06-03 18:30:06] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2022-06-03 18:30:06] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2022-06-03 18:30:06] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2022-06-03 18:30:06] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2022-06-03 18:30:06] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2022-06-03 18:30:06] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2022-06-03 18:30:07] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
[2022-06-03 18:30:07] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2022-06-03 18:30:07] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2022-06-03 18:30:07] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2022-06-03 18:30:07] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-06-03 18:30:08] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2022-06-03 18:30:08] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2022-06-03 18:30:08] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2022-06-03 18:30:08] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-06-03 18:30:08] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2022-06-03 18:30:09] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2022-06-03 18:30:09] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2022-06-03 18:30:09] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-06-03 18:30:09] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 0 ms to minimize.
[2022-06-03 18:30:09] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 1 ms to minimize.
[2022-06-03 18:30:10] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 1 ms to minimize.
[2022-06-03 18:30:10] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2022-06-03 18:30:10] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 1 ms to minimize.
[2022-06-03 18:30:10] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 0 ms to minimize.
[2022-06-03 18:30:10] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2022-06-03 18:30:11] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2022-06-03 18:30:11] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2022-06-03 18:30:11] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2022-06-03 18:30:11] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2022-06-03 18:30:11] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2022-06-03 18:30:12] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2022-06-03 18:30:12] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2022-06-03 18:30:12] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2022-06-03 18:30:12] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2022-06-03 18:30:12] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2022-06-03 18:30:13] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2022-06-03 18:30:13] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2022-06-03 18:30:13] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 1 ms to minimize.
[2022-06-03 18:30:13] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2022-06-03 18:30:13] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2022-06-03 18:30:13] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 4 ms to minimize.
[2022-06-03 18:30:14] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2022-06-03 18:30:14] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2022-06-03 18:30:14] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2022-06-03 18:30:14] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 0 ms to minimize.
[2022-06-03 18:30:14] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2022-06-03 18:30:15] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2022-06-03 18:30:15] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-06-03 18:30:15] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2022-06-03 18:30:15] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 3 ms to minimize.
[2022-06-03 18:30:15] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2022-06-03 18:30:15] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2022-06-03 18:30:16] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2022-06-03 18:30:16] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2022-06-03 18:30:16] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2022-06-03 18:30:16] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 0 ms to minimize.
[2022-06-03 18:30:16] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2022-06-03 18:30:16] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2022-06-03 18:30:17] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2022-06-03 18:30:17] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 1 ms to minimize.
[2022-06-03 18:30:17] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2022-06-03 18:30:17] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2022-06-03 18:30:17] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2022-06-03 18:30:17] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2022-06-03 18:30:18] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2022-06-03 18:30:18] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2022-06-03 18:30:18] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2022-06-03 18:30:18] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2022-06-03 18:30:18] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2022-06-03 18:30:18] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2022-06-03 18:30:18] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2022-06-03 18:30:19] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2022-06-03 18:30:19] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2022-06-03 18:30:19] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2022-06-03 18:30:19] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2022-06-03 18:30:19] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2022-06-03 18:30:19] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2022-06-03 18:30:20] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2022-06-03 18:30:20] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2022-06-03 18:30:20] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-06-03 18:30:20] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2022-06-03 18:30:20] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2022-06-03 18:30:20] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-06-03 18:30:20] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2022-06-03 18:30:20] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2022-06-03 18:30:21] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2022-06-03 18:30:21] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2022-06-03 18:30:21] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2022-06-03 18:30:21] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2022-06-03 18:30:21] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2022-06-03 18:30:21] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2022-06-03 18:30:21] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2022-06-03 18:30:21] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2022-06-03 18:30:22] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2022-06-03 18:30:22] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2022-06-03 18:30:22] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-06-03 18:30:22] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2022-06-03 18:30:22] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2022-06-03 18:30:22] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2022-06-03 18:30:22] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2022-06-03 18:30:22] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2022-06-03 18:30:22] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2022-06-03 18:30:23] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2022-06-03 18:30:23] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 0 ms to minimize.
[2022-06-03 18:30:23] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-06-03 18:30:23] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2022-06-03 18:30:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-06-03 18:30:23] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2022-06-03 18:30:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-06-03 18:30:23] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2022-06-03 18:30:23] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2022-06-03 18:30:23] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2022-06-03 18:30:24] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2022-06-03 18:30:25] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 0 ms to minimize.
[2022-06-03 18:30:25] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2022-06-03 18:30:25] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2022-06-03 18:30:25] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2022-06-03 18:30:25] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2022-06-03 18:30:25] [INFO ] Trap strengthening (SAT) tested/added 146/145 trap constraints in 22706 ms
[2022-06-03 18:30:25] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 0 ms to minimize.
[2022-06-03 18:30:25] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2022-06-03 18:30:26] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 0 ms to minimize.
[2022-06-03 18:30:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 18:30:26] [INFO ] After 25092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 7805 ms.
Support contains 16 out of 703 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 0 with 98 rules applied. Total rules applied 100 place count 702 transition count 952
Applied a total of 100 rules in 199 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 702/703 places, 952/953 transitions.
Incomplete random walk after 1000000 steps, including 1722 resets, run finished after 11658 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 185 resets, run finished after 3238 ms. (steps per millisecond=308 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 45967 steps, including 7 resets, run visited all 1 properties in 145 ms. (steps per millisecond=317 )
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 50105 ms.

BK_STOP 1654281049189

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="ShieldRVs-PT-050A"
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 ShieldRVs-PT-050A, 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-165286025900855"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050A.tgz
mv ShieldRVs-PT-050A 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 ;