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.r229-tall-165286034500508.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-020B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-165286034500508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.7K Apr 30 06:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 06:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K May 9 08:58 LTLFireability.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 244K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1653037928713

Running Version 202205111006
[2022-05-20 09:12:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2022-05-20 09:12:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:12:10] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2022-05-20 09:12:10] [INFO ] Transformed 803 places.
[2022-05-20 09:12:10] [INFO ] Transformed 903 transitions.
[2022-05-20 09:12:10] [INFO ] Found NUPN structural information;
[2022-05-20 09:12:10] [INFO ] Parsed PT model containing 803 places and 903 transitions in 230 ms.
Structural test allowed to assert that 381 places are NOT stable. Took 11 ms.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 422) seen :372
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 49) seen :0
Running SMT prover for 49 properties.
// Phase 1: matrix 903 rows 803 cols
[2022-05-20 09:12:10] [INFO ] Computed 81 place invariants in 30 ms
[2022-05-20 09:12:11] [INFO ] After 968ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2022-05-20 09:12:12] [INFO ] [Nat]Absence check using 81 positive place invariants in 28 ms returned sat
[2022-05-20 09:12:15] [INFO ] After 2007ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :49
[2022-05-20 09:12:15] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 4 ms to minimize.
[2022-05-20 09:12:15] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 1 ms to minimize.
[2022-05-20 09:12:15] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 2 ms to minimize.
[2022-05-20 09:12:16] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 1 ms to minimize.
[2022-05-20 09:12:16] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2022-05-20 09:12:16] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2022-05-20 09:12:16] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2022-05-20 09:12:16] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2022-05-20 09:12:16] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 0 ms to minimize.
[2022-05-20 09:12:17] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2022-05-20 09:12:17] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2022-05-20 09:12:17] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 0 ms to minimize.
[2022-05-20 09:12:17] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 0 ms to minimize.
[2022-05-20 09:12:17] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 0 ms to minimize.
[2022-05-20 09:12:17] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2022-05-20 09:12:17] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2022-05-20 09:12:17] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2022-05-20 09:12:18] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2022-05-20 09:12:18] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 0 ms to minimize.
[2022-05-20 09:12:18] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2022-05-20 09:12:18] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2022-05-20 09:12:18] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2022-05-20 09:12:18] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2022-05-20 09:12:18] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:12:18] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2022-05-20 09:12:18] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 0 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 0 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 0 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 4581 ms
[2022-05-20 09:12:20] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2022-05-20 09:12:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-20 09:12:21] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2022-05-20 09:12:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-20 09:12:21] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2022-05-20 09:12:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-05-20 09:12:22] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2022-05-20 09:12:22] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:12:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-20 09:12:22] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 0 ms to minimize.
[2022-05-20 09:12:22] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 0 ms to minimize.
[2022-05-20 09:12:23] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 1 ms to minimize.
[2022-05-20 09:12:23] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 1 ms to minimize.
[2022-05-20 09:12:23] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 1 ms to minimize.
[2022-05-20 09:12:23] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 1 ms to minimize.
[2022-05-20 09:12:24] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 1 ms to minimize.
[2022-05-20 09:12:24] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 1 ms to minimize.
[2022-05-20 09:12:24] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 0 ms to minimize.
[2022-05-20 09:12:24] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 2 ms to minimize.
[2022-05-20 09:12:24] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 1 ms to minimize.
[2022-05-20 09:12:25] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 1 ms to minimize.
[2022-05-20 09:12:25] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 0 ms to minimize.
[2022-05-20 09:12:25] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 1 ms to minimize.
[2022-05-20 09:12:25] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 0 ms to minimize.
[2022-05-20 09:12:25] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3500 ms
[2022-05-20 09:12:26] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 4 ms to minimize.
[2022-05-20 09:12:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2022-05-20 09:12:26] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 1 ms to minimize.
[2022-05-20 09:12:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2022-05-20 09:12:26] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 0 ms to minimize.
[2022-05-20 09:12:26] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 0 ms to minimize.
[2022-05-20 09:12:27] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 0 ms to minimize.
[2022-05-20 09:12:27] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 0 ms to minimize.
[2022-05-20 09:12:27] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2022-05-20 09:12:27] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2022-05-20 09:12:27] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 1 ms to minimize.
[2022-05-20 09:12:27] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2022-05-20 09:12:28] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2022-05-20 09:12:28] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-05-20 09:12:28] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2022-05-20 09:12:28] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2022-05-20 09:12:28] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 0 ms to minimize.
[2022-05-20 09:12:28] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 1 ms to minimize.
[2022-05-20 09:12:29] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 0 ms to minimize.
[2022-05-20 09:12:29] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2022-05-20 09:12:29] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 0 ms to minimize.
[2022-05-20 09:12:29] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2022-05-20 09:12:29] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 0 ms to minimize.
[2022-05-20 09:12:29] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2022-05-20 09:12:29] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 0 ms to minimize.
[2022-05-20 09:12:29] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2022-05-20 09:12:30] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2022-05-20 09:12:30] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2022-05-20 09:12:30] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 0 ms to minimize.
[2022-05-20 09:12:30] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-20 09:12:30] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2022-05-20 09:12:30] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 0 ms to minimize.
[2022-05-20 09:12:30] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2022-05-20 09:12:30] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4159 ms
[2022-05-20 09:12:31] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 0 ms to minimize.
[2022-05-20 09:12:31] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 1 ms to minimize.
[2022-05-20 09:12:31] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2022-05-20 09:12:31] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 0 ms to minimize.
[2022-05-20 09:12:31] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 1 ms to minimize.
[2022-05-20 09:12:32] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 1 ms to minimize.
[2022-05-20 09:12:32] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 1 ms to minimize.
[2022-05-20 09:12:32] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 0 ms to minimize.
[2022-05-20 09:12:32] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 1 ms to minimize.
[2022-05-20 09:12:32] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 0 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 0 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 0 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 1 ms to minimize.
[2022-05-20 09:12:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2754 ms
[2022-05-20 09:12:33] [INFO ] After 20594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :49
Attempting to minimize the solution found.
Minimization took 1726 ms.
[2022-05-20 09:12:35] [INFO ] After 23675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :49
Parikh walk visited 3 properties in 6977 ms.
Support contains 46 out of 803 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 803 transition count 822
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 722 transition count 822
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 722 transition count 722
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 622 transition count 722
Discarding 106 places :
Symmetric choice reduction at 2 with 106 rule applications. Total rules 468 place count 516 transition count 616
Iterating global reduction 2 with 106 rules applied. Total rules applied 574 place count 516 transition count 616
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 574 place count 516 transition count 556
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 694 place count 456 transition count 556
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 950 place count 328 transition count 428
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 992 place count 328 transition count 428
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 993 place count 327 transition count 427
Applied a total of 993 rules in 183 ms. Remains 327 /803 variables (removed 476) and now considering 427/903 (removed 476) transitions.
Finished structural reductions, in 1 iterations. Remains : 327/803 places, 427/903 transitions.
Finished random walk after 4965 steps, including 19 resets, run visited all 46 properties in 132 ms. (steps per millisecond=37 )
Able to resolve query StableMarking after proving 423 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 33158 ms.

BK_STOP 1653037962990

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -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 1800 -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-020B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-020B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r229-tall-165286034500508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020B.tgz
mv ShieldRVs-PT-020B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;