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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 5.8K Apr 30 00:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:59 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 26K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 30 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 30 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 30 00:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 30 00:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 189K 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-19-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654200977718

Running Version 202205111006
[2022-06-02 20:16:18] [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:16:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:16:19] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2022-06-02 20:16:19] [INFO ] Transformed 772 places.
[2022-06-02 20:16:19] [INFO ] Transformed 685 transitions.
[2022-06-02 20:16:19] [INFO ] Found NUPN structural information;
[2022-06-02 20:16:19] [INFO ] Parsed PT model containing 772 places and 685 transitions in 270 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 18 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 12) seen :3
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 670 rows 757 cols
[2022-06-02 20:16:20] [INFO ] Computed 125 place invariants in 41 ms
[2022-06-02 20:16:21] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 20:16:21] [INFO ] [Nat]Absence check using 78 positive place invariants in 38 ms returned sat
[2022-06-02 20:16:21] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 22 ms returned sat
[2022-06-02 20:16:22] [INFO ] After 1270ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2022-06-02 20:16:23] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 8 ms to minimize.
[2022-06-02 20:16:23] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 1 ms to minimize.
[2022-06-02 20:16:23] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 2 ms to minimize.
[2022-06-02 20:16:23] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 1 ms to minimize.
[2022-06-02 20:16:24] [INFO ] Deduced a trap composed of 148 places in 181 ms of which 1 ms to minimize.
[2022-06-02 20:16:24] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 0 ms to minimize.
[2022-06-02 20:16:24] [INFO ] Deduced a trap composed of 143 places in 178 ms of which 0 ms to minimize.
[2022-06-02 20:16:24] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 1 ms to minimize.
[2022-06-02 20:16:24] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 1 ms to minimize.
[2022-06-02 20:16:25] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 1 ms to minimize.
[2022-06-02 20:16:25] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 1 ms to minimize.
[2022-06-02 20:16:25] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 1 ms to minimize.
[2022-06-02 20:16:25] [INFO ] Deduced a trap composed of 167 places in 162 ms of which 0 ms to minimize.
[2022-06-02 20:16:25] [INFO ] Deduced a trap composed of 152 places in 156 ms of which 1 ms to minimize.
[2022-06-02 20:16:26] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 0 ms to minimize.
[2022-06-02 20:16:26] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2022-06-02 20:16:26] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2022-06-02 20:16:26] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 1 ms to minimize.
[2022-06-02 20:16:26] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2022-06-02 20:16:27] [INFO ] Deduced a trap composed of 145 places in 153 ms of which 0 ms to minimize.
[2022-06-02 20:16:27] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 0 ms to minimize.
[2022-06-02 20:16:27] [INFO ] Deduced a trap composed of 164 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:16:27] [INFO ] Deduced a trap composed of 163 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:16:27] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 1 ms to minimize.
[2022-06-02 20:16:28] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 1 ms to minimize.
[2022-06-02 20:16:28] [INFO ] Deduced a trap composed of 173 places in 158 ms of which 1 ms to minimize.
[2022-06-02 20:16:28] [INFO ] Deduced a trap composed of 177 places in 160 ms of which 0 ms to minimize.
[2022-06-02 20:16:28] [INFO ] Deduced a trap composed of 170 places in 166 ms of which 1 ms to minimize.
[2022-06-02 20:16:28] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 0 ms to minimize.
[2022-06-02 20:16:28] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 1 ms to minimize.
[2022-06-02 20:16:29] [INFO ] Deduced a trap composed of 175 places in 152 ms of which 1 ms to minimize.
[2022-06-02 20:16:29] [INFO ] Deduced a trap composed of 176 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:16:29] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 0 ms to minimize.
[2022-06-02 20:16:29] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 1 ms to minimize.
[2022-06-02 20:16:29] [INFO ] Deduced a trap composed of 170 places in 165 ms of which 6 ms to minimize.
[2022-06-02 20:16:30] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:16:30] [INFO ] Deduced a trap composed of 171 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:16:30] [INFO ] Deduced a trap composed of 171 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:16:30] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 0 ms to minimize.
[2022-06-02 20:16:30] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 0 ms to minimize.
[2022-06-02 20:16:31] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 1 ms to minimize.
[2022-06-02 20:16:31] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 0 ms to minimize.
[2022-06-02 20:16:31] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 7 ms to minimize.
[2022-06-02 20:16:31] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 1 ms to minimize.
[2022-06-02 20:16:32] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 0 ms to minimize.
[2022-06-02 20:16:32] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 0 ms to minimize.
[2022-06-02 20:16:32] [INFO ] Deduced a trap composed of 135 places in 171 ms of which 1 ms to minimize.
[2022-06-02 20:16:32] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 1 ms to minimize.
[2022-06-02 20:16:32] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2022-06-02 20:16:33] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 1 ms to minimize.
[2022-06-02 20:16:33] [INFO ] Deduced a trap composed of 170 places in 168 ms of which 1 ms to minimize.
[2022-06-02 20:16:33] [INFO ] Deduced a trap composed of 169 places in 164 ms of which 1 ms to minimize.
[2022-06-02 20:16:33] [INFO ] Deduced a trap composed of 146 places in 166 ms of which 1 ms to minimize.
[2022-06-02 20:16:33] [INFO ] Deduced a trap composed of 142 places in 165 ms of which 0 ms to minimize.
[2022-06-02 20:16:34] [INFO ] Deduced a trap composed of 140 places in 163 ms of which 1 ms to minimize.
[2022-06-02 20:16:34] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 0 ms to minimize.
[2022-06-02 20:16:34] [INFO ] Deduced a trap composed of 147 places in 164 ms of which 0 ms to minimize.
[2022-06-02 20:16:34] [INFO ] Deduced a trap composed of 142 places in 161 ms of which 0 ms to minimize.
[2022-06-02 20:16:34] [INFO ] Deduced a trap composed of 171 places in 163 ms of which 1 ms to minimize.
[2022-06-02 20:16:35] [INFO ] Deduced a trap composed of 177 places in 167 ms of which 0 ms to minimize.
[2022-06-02 20:16:35] [INFO ] Deduced a trap composed of 145 places in 159 ms of which 1 ms to minimize.
[2022-06-02 20:16:35] [INFO ] Deduced a trap composed of 147 places in 163 ms of which 1 ms to minimize.
[2022-06-02 20:16:35] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 0 ms to minimize.
[2022-06-02 20:16:35] [INFO ] Deduced a trap composed of 172 places in 166 ms of which 1 ms to minimize.
[2022-06-02 20:16:36] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 0 ms to minimize.
[2022-06-02 20:16:36] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 16 ms to minimize.
[2022-06-02 20:16:36] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 1 ms to minimize.
[2022-06-02 20:16:36] [INFO ] Deduced a trap composed of 165 places in 187 ms of which 4 ms to minimize.
[2022-06-02 20:16:36] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 1 ms to minimize.
[2022-06-02 20:16:37] [INFO ] Deduced a trap composed of 177 places in 156 ms of which 0 ms to minimize.
[2022-06-02 20:16:37] [INFO ] Deduced a trap composed of 176 places in 160 ms of which 1 ms to minimize.
[2022-06-02 20:16:37] [INFO ] Deduced a trap composed of 175 places in 163 ms of which 0 ms to minimize.
[2022-06-02 20:16:37] [INFO ] Deduced a trap composed of 165 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:16:37] [INFO ] Deduced a trap composed of 171 places in 165 ms of which 0 ms to minimize.
[2022-06-02 20:16:38] [INFO ] Deduced a trap composed of 173 places in 161 ms of which 1 ms to minimize.
[2022-06-02 20:16:38] [INFO ] Deduced a trap composed of 165 places in 175 ms of which 1 ms to minimize.
[2022-06-02 20:16:38] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 0 ms to minimize.
[2022-06-02 20:16:38] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 0 ms to minimize.
[2022-06-02 20:16:38] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 0 ms to minimize.
[2022-06-02 20:16:39] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:16:39] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:16:39] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 0 ms to minimize.
[2022-06-02 20:16:39] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:16:39] [INFO ] Deduced a trap composed of 169 places in 152 ms of which 1 ms to minimize.
[2022-06-02 20:16:40] [INFO ] Deduced a trap composed of 170 places in 158 ms of which 1 ms to minimize.
[2022-06-02 20:16:40] [INFO ] Deduced a trap composed of 155 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:16:40] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 0 ms to minimize.
[2022-06-02 20:16:40] [INFO ] Deduced a trap composed of 159 places in 159 ms of which 1 ms to minimize.
[2022-06-02 20:16:40] [INFO ] Deduced a trap composed of 163 places in 164 ms of which 1 ms to minimize.
[2022-06-02 20:16:41] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 0 ms to minimize.
[2022-06-02 20:16:41] [INFO ] Deduced a trap composed of 174 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:16:41] [INFO ] Deduced a trap composed of 165 places in 143 ms of which 0 ms to minimize.
[2022-06-02 20:16:41] [INFO ] Deduced a trap composed of 167 places in 143 ms of which 0 ms to minimize.
[2022-06-02 20:16:41] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:16:41] [INFO ] Deduced a trap composed of 166 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:16:42] [INFO ] Deduced a trap composed of 166 places in 149 ms of which 1 ms to minimize.
[2022-06-02 20:16:42] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 1 ms to minimize.
[2022-06-02 20:16:42] [INFO ] Deduced a trap composed of 169 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:16:42] [INFO ] Deduced a trap composed of 160 places in 159 ms of which 0 ms to minimize.
[2022-06-02 20:16:42] [INFO ] Deduced a trap composed of 169 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:16:43] [INFO ] Deduced a trap composed of 166 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:16:43] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:16:43] [INFO ] Deduced a trap composed of 175 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:16:43] [INFO ] Deduced a trap composed of 173 places in 147 ms of which 0 ms to minimize.
[2022-06-02 20:16:43] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:16:44] [INFO ] Deduced a trap composed of 191 places in 148 ms of which 1 ms to minimize.
[2022-06-02 20:16:44] [INFO ] Deduced a trap composed of 163 places in 154 ms of which 0 ms to minimize.
[2022-06-02 20:16:44] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 0 ms to minimize.
[2022-06-02 20:16:44] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 0 ms to minimize.
[2022-06-02 20:16:44] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:16:44] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 1 ms to minimize.
[2022-06-02 20:16:45] [INFO ] Deduced a trap composed of 194 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:16:45] [INFO ] Deduced a trap composed of 176 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:16:45] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:16:45] [INFO ] Deduced a trap composed of 173 places in 164 ms of which 1 ms to minimize.
[2022-06-02 20:16:45] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:16:46] [INFO ] Deduced a trap composed of 192 places in 145 ms of which 0 ms to minimize.
[2022-06-02 20:16:46] [INFO ] Deduced a trap composed of 175 places in 146 ms of which 0 ms to minimize.
[2022-06-02 20:16:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 20:16:46] [INFO ] After 25151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 4438 ms.
Support contains 38 out of 757 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 395 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1512 edges and 751 vertex of which 742 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 742 transition count 510
Reduce places removed 151 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 159 rules applied. Total rules applied 312 place count 591 transition count 502
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 320 place count 583 transition count 502
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 320 place count 583 transition count 397
Deduced a syphon composed of 105 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 551 place count 457 transition count 397
Discarding 86 places :
Symmetric choice reduction at 3 with 86 rule applications. Total rules 637 place count 371 transition count 311
Iterating global reduction 3 with 86 rules applied. Total rules applied 723 place count 371 transition count 311
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 723 place count 371 transition count 302
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 744 place count 359 transition count 302
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 958 place count 251 transition count 196
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 961 place count 251 transition count 193
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 964 place count 248 transition count 193
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 969 place count 248 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 970 place count 247 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 971 place count 246 transition count 192
Applied a total of 971 rules in 172 ms. Remains 246 /757 variables (removed 511) and now considering 192/670 (removed 478) transitions.
Finished structural reductions, in 1 iterations. Remains : 246/757 places, 192/670 transitions.
Incomplete random walk after 1000000 steps, including 18228 resets, run finished after 5205 ms. (steps per millisecond=192 ) properties (out of 6) seen :5
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5448 resets, run finished after 2284 ms. (steps per millisecond=437 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 192 rows 246 cols
[2022-06-02 20:16:58] [INFO ] Computed 90 place invariants in 12 ms
[2022-06-02 20:16:58] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:16:58] [INFO ] [Nat]Absence check using 71 positive place invariants in 12 ms returned sat
[2022-06-02 20:16:58] [INFO ] [Nat]Absence check using 71 positive and 19 generalized place invariants in 4 ms returned sat
[2022-06-02 20:16:58] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:16:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-06-02 20:16:58] [INFO ] After 40ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:16:58] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2022-06-02 20:16:58] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2022-06-02 20:16:59] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2022-06-02 20:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 295 ms
[2022-06-02 20:16:59] [INFO ] After 371ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-02 20:16:59] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA BusinessProcesses-PT-19-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 40130 ms.

BK_STOP 1654201019141

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

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