fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286025800831
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldRVs-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
558.264 52010.00 78102.00 120.60 TTFTTTFTTTTTTTTT normal

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-165286025800831.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-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025800831
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 6.0K Apr 30 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 06:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 06:32 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:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 30 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 30 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 30 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 30 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 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 370K 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-030B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654279926694

Running Version 202205111006
[2022-06-03 18:12:07] [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:12:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 18:12:08] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2022-06-03 18:12:08] [INFO ] Transformed 1203 places.
[2022-06-03 18:12:08] [INFO ] Transformed 1353 transitions.
[2022-06-03 18:12:08] [INFO ] Found NUPN structural information;
[2022-06-03 18:12:08] [INFO ] Parsed PT model containing 1203 places and 1353 transitions in 281 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 16) seen :10
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2022-06-03 18:12:09] [INFO ] Computed 121 place invariants in 40 ms
[2022-06-03 18:12:09] [INFO ] After 853ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-03 18:12:10] [INFO ] [Nat]Absence check using 121 positive place invariants in 46 ms returned sat
[2022-06-03 18:12:12] [INFO ] After 1513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-03 18:12:12] [INFO ] Deduced a trap composed of 25 places in 388 ms of which 6 ms to minimize.
[2022-06-03 18:12:13] [INFO ] Deduced a trap composed of 17 places in 381 ms of which 2 ms to minimize.
[2022-06-03 18:12:13] [INFO ] Deduced a trap composed of 20 places in 347 ms of which 1 ms to minimize.
[2022-06-03 18:12:14] [INFO ] Deduced a trap composed of 25 places in 334 ms of which 1 ms to minimize.
[2022-06-03 18:12:14] [INFO ] Deduced a trap composed of 27 places in 325 ms of which 2 ms to minimize.
[2022-06-03 18:12:14] [INFO ] Deduced a trap composed of 34 places in 327 ms of which 1 ms to minimize.
[2022-06-03 18:12:15] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 1 ms to minimize.
[2022-06-03 18:12:15] [INFO ] Deduced a trap composed of 66 places in 290 ms of which 1 ms to minimize.
[2022-06-03 18:12:15] [INFO ] Deduced a trap composed of 20 places in 296 ms of which 1 ms to minimize.
[2022-06-03 18:12:16] [INFO ] Deduced a trap composed of 37 places in 294 ms of which 0 ms to minimize.
[2022-06-03 18:12:16] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 1 ms to minimize.
[2022-06-03 18:12:17] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 0 ms to minimize.
[2022-06-03 18:12:17] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 1 ms to minimize.
[2022-06-03 18:12:17] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 1 ms to minimize.
[2022-06-03 18:12:18] [INFO ] Deduced a trap composed of 34 places in 256 ms of which 1 ms to minimize.
[2022-06-03 18:12:18] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 0 ms to minimize.
[2022-06-03 18:12:18] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 1 ms to minimize.
[2022-06-03 18:12:19] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 1 ms to minimize.
[2022-06-03 18:12:19] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 1 ms to minimize.
[2022-06-03 18:12:19] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 1 ms to minimize.
[2022-06-03 18:12:20] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 1 ms to minimize.
[2022-06-03 18:12:20] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 1 ms to minimize.
[2022-06-03 18:12:20] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 0 ms to minimize.
[2022-06-03 18:12:20] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 0 ms to minimize.
[2022-06-03 18:12:21] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 1 ms to minimize.
[2022-06-03 18:12:21] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 1 ms to minimize.
[2022-06-03 18:12:21] [INFO ] Deduced a trap composed of 36 places in 212 ms of which 1 ms to minimize.
[2022-06-03 18:12:22] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 1 ms to minimize.
[2022-06-03 18:12:22] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 0 ms to minimize.
[2022-06-03 18:12:22] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 1 ms to minimize.
[2022-06-03 18:12:22] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 1 ms to minimize.
[2022-06-03 18:12:23] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 1 ms to minimize.
[2022-06-03 18:12:23] [INFO ] Deduced a trap composed of 59 places in 240 ms of which 0 ms to minimize.
[2022-06-03 18:12:23] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 1 ms to minimize.
[2022-06-03 18:12:24] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 1 ms to minimize.
[2022-06-03 18:12:24] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 1 ms to minimize.
[2022-06-03 18:12:24] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 1 ms to minimize.
[2022-06-03 18:12:24] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 1 ms to minimize.
[2022-06-03 18:12:25] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 1 ms to minimize.
[2022-06-03 18:12:25] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 1 ms to minimize.
[2022-06-03 18:12:25] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 0 ms to minimize.
[2022-06-03 18:12:26] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 1 ms to minimize.
[2022-06-03 18:12:26] [INFO ] Deduced a trap composed of 45 places in 237 ms of which 1 ms to minimize.
[2022-06-03 18:12:26] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 1 ms to minimize.
[2022-06-03 18:12:27] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 0 ms to minimize.
[2022-06-03 18:12:27] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 0 ms to minimize.
[2022-06-03 18:12:27] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 1 ms to minimize.
[2022-06-03 18:12:27] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 1 ms to minimize.
[2022-06-03 18:12:28] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 0 ms to minimize.
[2022-06-03 18:12:28] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 1 ms to minimize.
[2022-06-03 18:12:28] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 1 ms to minimize.
[2022-06-03 18:12:28] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 0 ms to minimize.
[2022-06-03 18:12:29] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 0 ms to minimize.
[2022-06-03 18:12:29] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 0 ms to minimize.
[2022-06-03 18:12:29] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2022-06-03 18:12:29] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 0 ms to minimize.
[2022-06-03 18:12:30] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2022-06-03 18:12:30] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2022-06-03 18:12:30] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 1 ms to minimize.
[2022-06-03 18:12:30] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2022-06-03 18:12:31] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 1 ms to minimize.
[2022-06-03 18:12:31] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 1 ms to minimize.
[2022-06-03 18:12:31] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 1 ms to minimize.
[2022-06-03 18:12:32] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 2 ms to minimize.
[2022-06-03 18:12:32] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 1 ms to minimize.
[2022-06-03 18:12:32] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 3 ms to minimize.
[2022-06-03 18:12:32] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 2 ms to minimize.
[2022-06-03 18:12:33] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 0 ms to minimize.
[2022-06-03 18:12:33] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 1 ms to minimize.
[2022-06-03 18:12:33] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 1 ms to minimize.
[2022-06-03 18:12:33] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 1 ms to minimize.
[2022-06-03 18:12:34] [INFO ] Deduced a trap composed of 55 places in 217 ms of which 1 ms to minimize.
[2022-06-03 18:12:34] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 1 ms to minimize.
[2022-06-03 18:12:34] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 1 ms to minimize.
[2022-06-03 18:12:35] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 1 ms to minimize.
[2022-06-03 18:12:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 18:12:35] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 7343 ms.
Support contains 112 out of 1203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 1203 transition count 1264
Reduce places removed 89 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 98 rules applied. Total rules applied 187 place count 1114 transition count 1255
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 196 place count 1105 transition count 1255
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 196 place count 1105 transition count 1109
Deduced a syphon composed of 146 places in 4 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 488 place count 959 transition count 1109
Discarding 174 places :
Symmetric choice reduction at 3 with 174 rule applications. Total rules 662 place count 785 transition count 935
Iterating global reduction 3 with 174 rules applied. Total rules applied 836 place count 785 transition count 935
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 836 place count 785 transition count 882
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 942 place count 732 transition count 882
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 191
Deduced a syphon composed of 191 places in 1 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 3 with 382 rules applied. Total rules applied 1324 place count 541 transition count 691
Partial Free-agglomeration rule applied 51 times.
Drop transitions removed 51 transitions
Iterating global reduction 3 with 51 rules applied. Total rules applied 1375 place count 541 transition count 691
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1376 place count 540 transition count 690
Applied a total of 1376 rules in 388 ms. Remains 540 /1203 variables (removed 663) and now considering 690/1353 (removed 663) transitions.
Finished structural reductions, in 1 iterations. Remains : 540/1203 places, 690/1353 transitions.
Incomplete random walk after 1000000 steps, including 1928 resets, run finished after 6653 ms. (steps per millisecond=150 ) properties (out of 5) seen :4
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 168 resets, run finished after 2887 ms. (steps per millisecond=346 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 690 rows 540 cols
[2022-06-03 18:12:52] [INFO ] Computed 121 place invariants in 7 ms
[2022-06-03 18:12:52] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 18:12:52] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2022-06-03 18:12:52] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 18:12:53] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2022-06-03 18:12:53] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2022-06-03 18:12:53] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-06-03 18:12:53] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2022-06-03 18:12:53] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2022-06-03 18:12:53] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2022-06-03 18:12:53] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2022-06-03 18:12:53] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2022-06-03 18:12:53] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2022-06-03 18:12:53] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-06-03 18:12:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 943 ms
[2022-06-03 18:12:53] [INFO ] After 1355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2022-06-03 18:12:54] [INFO ] After 1579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 129 ms.
Support contains 36 out of 540 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 540/540 places, 690/690 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 540 transition count 682
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 532 transition count 682
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 16 place count 532 transition count 663
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 54 place count 513 transition count 663
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 511 transition count 661
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 511 transition count 661
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 142 place count 469 transition count 619
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 154 place count 469 transition count 619
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 163 place count 460 transition count 610
Applied a total of 163 rules in 126 ms. Remains 460 /540 variables (removed 80) and now considering 610/690 (removed 80) transitions.
Finished structural reductions, in 1 iterations. Remains : 460/540 places, 610/690 transitions.
Incomplete random walk after 1000000 steps, including 2413 resets, run finished after 3912 ms. (steps per millisecond=255 ) properties (out of 1) seen :0
Finished Best-First random walk after 146518 steps, including 37 resets, run visited all 1 properties in 424 ms. (steps per millisecond=345 )
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 50808 ms.

BK_STOP 1654279978704

--------------------
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-030B"
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-030B, 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-165286025800831"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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