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.r024-tall-165251918500446.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 BusinessProcesses-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918500446
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.9K Apr 29 23:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 23:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 23:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 29 23:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 23:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 29 23:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 29 23:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 159K May 10 09:33 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 BusinessProcesses-PT-16-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654200781741

Running Version 202205111006
[2022-06-02 20:13:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-02 20:13:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:13:03] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2022-06-02 20:13:03] [INFO ] Transformed 638 places.
[2022-06-02 20:13:03] [INFO ] Transformed 578 transitions.
[2022-06-02 20:13:03] [INFO ] Found NUPN structural information;
[2022-06-02 20:13:03] [INFO ] Parsed PT model containing 638 places and 578 transitions in 279 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 13 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 595 ms. (steps per millisecond=16 ) properties (out of 15) seen :4
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 570 rows 630 cols
[2022-06-02 20:13:04] [INFO ] Computed 100 place invariants in 35 ms
[2022-06-02 20:13:05] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-02 20:13:05] [INFO ] [Nat]Absence check using 62 positive place invariants in 29 ms returned sat
[2022-06-02 20:13:05] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 17 ms returned sat
[2022-06-02 20:13:06] [INFO ] After 597ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2022-06-02 20:13:06] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 9 ms to minimize.
[2022-06-02 20:13:06] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 1 ms to minimize.
[2022-06-02 20:13:06] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 2 ms to minimize.
[2022-06-02 20:13:07] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 1 ms to minimize.
[2022-06-02 20:13:07] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2022-06-02 20:13:07] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 1 ms to minimize.
[2022-06-02 20:13:07] [INFO ] Deduced a trap composed of 127 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:13:07] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2022-06-02 20:13:08] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2022-06-02 20:13:08] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2022-06-02 20:13:08] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 1 ms to minimize.
[2022-06-02 20:13:08] [INFO ] Deduced a trap composed of 141 places in 152 ms of which 1 ms to minimize.
[2022-06-02 20:13:08] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 1 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 0 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2022-06-02 20:13:09] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 0 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 24 trap constraints in 4155 ms
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-06-02 20:13:10] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 0 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 0 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2022-06-02 20:13:11] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 0 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 0 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 0 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
[2022-06-02 20:13:12] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 141 places in 137 ms of which 1 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 2 ms to minimize.
[2022-06-02 20:13:13] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 144 places in 134 ms of which 1 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 148 places in 153 ms of which 1 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:13:14] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 0 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 0 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 0 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 144 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:13:15] [INFO ] Deduced a trap composed of 146 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 1 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 159 places in 162 ms of which 2 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 160 places in 129 ms of which 2 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 11 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 1 ms to minimize.
[2022-06-02 20:13:16] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 1 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 141 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 144 places in 122 ms of which 1 ms to minimize.
[2022-06-02 20:13:17] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 144 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:13:18] [INFO ] Deduced a trap composed of 140 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:13:19] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:13:19] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:13:19] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:13:19] [INFO ] Deduced a trap composed of 149 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:13:19] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 1 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 145 places in 149 ms of which 0 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 142 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 141 places in 121 ms of which 1 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 142 places in 124 ms of which 1 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:13:20] [INFO ] Deduced a trap composed of 149 places in 140 ms of which 0 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 161 places in 141 ms of which 1 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 161 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 0 ms to minimize.
[2022-06-02 20:13:21] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 156 places in 139 ms of which 1 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 152 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 1 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 0 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 165 places in 136 ms of which 0 ms to minimize.
[2022-06-02 20:13:22] [INFO ] Deduced a trap composed of 141 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 150 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 136 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 141 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 142 places in 142 ms of which 0 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 143 places in 162 ms of which 0 ms to minimize.
[2022-06-02 20:13:23] [INFO ] Deduced a trap composed of 160 places in 141 ms of which 0 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 145 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 151 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 152 places in 151 ms of which 0 ms to minimize.
[2022-06-02 20:13:24] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 153 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 147 places in 144 ms of which 0 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 0 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 150 places in 142 ms of which 1 ms to minimize.
[2022-06-02 20:13:25] [INFO ] Deduced a trap composed of 141 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:13:26] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:13:26] [INFO ] Deduced a trap composed of 144 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:13:26] [INFO ] Deduced a trap composed of 155 places in 140 ms of which 0 ms to minimize.
[2022-06-02 20:13:26] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 1 ms to minimize.
[2022-06-02 20:13:26] [INFO ] Deduced a trap composed of 153 places in 136 ms of which 0 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 155 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 151 places in 146 ms of which 0 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 146 places in 131 ms of which 1 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 147 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 0 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 151 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:13:27] [INFO ] Deduced a trap composed of 142 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:13:28] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 0 ms to minimize.
[2022-06-02 20:13:28] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2022-06-02 20:13:28] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 1 ms to minimize.
[2022-06-02 20:13:28] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2022-06-02 20:13:28] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 0 ms to minimize.
[2022-06-02 20:13:29] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2022-06-02 20:13:29] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 0 ms to minimize.
[2022-06-02 20:13:29] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2022-06-02 20:13:29] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2022-06-02 20:13:29] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2022-06-02 20:13:29] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 0 ms to minimize.
[2022-06-02 20:13:29] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 0 ms to minimize.
[2022-06-02 20:13:30] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 0 ms to minimize.
[2022-06-02 20:13:30] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2022-06-02 20:13:30] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 1 ms to minimize.
[2022-06-02 20:13:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 20:13:30] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1971 ms.
Support contains 21 out of 630 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 349 edges and 630 vertex of which 7 / 630 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 618 transition count 424
Reduce places removed 137 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 140 rules applied. Total rules applied 279 place count 481 transition count 421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 282 place count 478 transition count 421
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 282 place count 478 transition count 338
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 179 rules applied. Total rules applied 461 place count 382 transition count 338
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 546 place count 297 transition count 253
Iterating global reduction 3 with 85 rules applied. Total rules applied 631 place count 297 transition count 253
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 631 place count 297 transition count 243
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 654 place count 284 transition count 243
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 824 place count 198 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 826 place count 197 transition count 163
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 827 place count 197 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 828 place count 196 transition count 162
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 832 place count 196 transition count 162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 833 place count 195 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 834 place count 194 transition count 161
Applied a total of 834 rules in 162 ms. Remains 194 /630 variables (removed 436) and now considering 161/570 (removed 409) transitions.
Finished structural reductions, in 1 iterations. Remains : 194/630 places, 161/570 transitions.
Incomplete random walk after 1000000 steps, including 65278 resets, run finished after 3000 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 269687 steps, including 4306 resets, run visited all 1 properties in 357 ms. (steps per millisecond=755 )
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 32805 ms.

BK_STOP 1654200815911

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="BusinessProcesses-PT-16"
export BK_EXAMINATION="ReachabilityCardinality"
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 BusinessProcesses-PT-16, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918500446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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