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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.2K Apr 29 23:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 23:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:58 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.3K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 29 23:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 23:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 29 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 29 23:59 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 161K 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-17-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654200895893

Running Version 202205111006
[2022-06-02 20:14:57] [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:14:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:14:57] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2022-06-02 20:14:57] [INFO ] Transformed 650 places.
[2022-06-02 20:14:57] [INFO ] Transformed 580 transitions.
[2022-06-02 20:14:57] [INFO ] Found NUPN structural information;
[2022-06-02 20:14:57] [INFO ] Parsed PT model containing 650 places and 580 transitions in 240 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 15) seen :3
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 576 rows 646 cols
[2022-06-02 20:14:58] [INFO ] Computed 108 place invariants in 36 ms
[2022-06-02 20:14:59] [INFO ] [Real]Absence check using 62 positive place invariants in 29 ms returned sat
[2022-06-02 20:14:59] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2022-06-02 20:14:59] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-02 20:14:59] [INFO ] [Nat]Absence check using 62 positive place invariants in 58 ms returned sat
[2022-06-02 20:14:59] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 26 ms returned sat
[2022-06-02 20:15:00] [INFO ] After 792ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :6
[2022-06-02 20:15:01] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 5 ms to minimize.
[2022-06-02 20:15:01] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 2 ms to minimize.
[2022-06-02 20:15:01] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 2 ms to minimize.
[2022-06-02 20:15:01] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 3 ms to minimize.
[2022-06-02 20:15:01] [INFO ] Deduced a trap composed of 159 places in 187 ms of which 1 ms to minimize.
[2022-06-02 20:15:02] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 2 ms to minimize.
[2022-06-02 20:15:02] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 1 ms to minimize.
[2022-06-02 20:15:02] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 1 ms to minimize.
[2022-06-02 20:15:02] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 1 ms to minimize.
[2022-06-02 20:15:03] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 0 ms to minimize.
[2022-06-02 20:15:03] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 2 ms to minimize.
[2022-06-02 20:15:03] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 0 ms to minimize.
[2022-06-02 20:15:03] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:15:03] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:15:03] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-06-02 20:15:04] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:15:04] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 1 ms to minimize.
[2022-06-02 20:15:04] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 0 ms to minimize.
[2022-06-02 20:15:04] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 1 ms to minimize.
[2022-06-02 20:15:04] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 0 ms to minimize.
[2022-06-02 20:15:05] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2022-06-02 20:15:05] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 1 ms to minimize.
[2022-06-02 20:15:05] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:15:05] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:15:05] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 0 ms to minimize.
[2022-06-02 20:15:05] [INFO ] Deduced a trap composed of 141 places in 149 ms of which 0 ms to minimize.
[2022-06-02 20:15:06] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 0 ms to minimize.
[2022-06-02 20:15:06] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:15:06] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:15:06] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:15:06] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:15:06] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 146 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 0 ms to minimize.
[2022-06-02 20:15:07] [INFO ] Deduced a trap composed of 149 places in 178 ms of which 1 ms to minimize.
[2022-06-02 20:15:08] [INFO ] Deduced a trap composed of 142 places in 139 ms of which 0 ms to minimize.
[2022-06-02 20:15:08] [INFO ] Deduced a trap composed of 146 places in 137 ms of which 1 ms to minimize.
[2022-06-02 20:15:08] [INFO ] Deduced a trap composed of 152 places in 149 ms of which 1 ms to minimize.
[2022-06-02 20:15:08] [INFO ] Deduced a trap composed of 143 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:15:08] [INFO ] Deduced a trap composed of 148 places in 149 ms of which 0 ms to minimize.
[2022-06-02 20:15:08] [INFO ] Deduced a trap composed of 150 places in 142 ms of which 0 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 146 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 8291 ms
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2022-06-02 20:15:09] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2022-06-02 20:15:10] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:15:10] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:15:10] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2022-06-02 20:15:10] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2022-06-02 20:15:10] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2022-06-02 20:15:10] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2022-06-02 20:15:11] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:15:11] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2022-06-02 20:15:11] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 4 ms to minimize.
[2022-06-02 20:15:11] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 1 ms to minimize.
[2022-06-02 20:15:11] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2022-06-02 20:15:11] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 1 ms to minimize.
[2022-06-02 20:15:11] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2022-06-02 20:15:12] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2022-06-02 20:15:12] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2022-06-02 20:15:12] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2022-06-02 20:15:12] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2022-06-02 20:15:12] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2022-06-02 20:15:12] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 0 ms to minimize.
[2022-06-02 20:15:12] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3437 ms
[2022-06-02 20:15:12] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 0 ms to minimize.
[2022-06-02 20:15:13] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:15:13] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:15:13] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:15:13] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:15:13] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:15:13] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2022-06-02 20:15:14] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 0 ms to minimize.
[2022-06-02 20:15:14] [INFO ] Deduced a trap composed of 141 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:15:14] [INFO ] Deduced a trap composed of 139 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:15:14] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 1 ms to minimize.
[2022-06-02 20:15:14] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 0 ms to minimize.
[2022-06-02 20:15:14] [INFO ] Deduced a trap composed of 141 places in 132 ms of which 0 ms to minimize.
[2022-06-02 20:15:15] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:15:15] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:15:15] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 1 ms to minimize.
[2022-06-02 20:15:15] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 1 ms to minimize.
[2022-06-02 20:15:15] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 0 ms to minimize.
[2022-06-02 20:15:15] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 1 ms to minimize.
[2022-06-02 20:15:16] [INFO ] Deduced a trap composed of 141 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:15:16] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 0 ms to minimize.
[2022-06-02 20:15:16] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 0 ms to minimize.
[2022-06-02 20:15:16] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 1 ms to minimize.
[2022-06-02 20:15:16] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 1 ms to minimize.
[2022-06-02 20:15:16] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 0 ms to minimize.
[2022-06-02 20:15:17] [INFO ] Deduced a trap composed of 141 places in 135 ms of which 0 ms to minimize.
[2022-06-02 20:15:17] [INFO ] Deduced a trap composed of 139 places in 134 ms of which 0 ms to minimize.
[2022-06-02 20:15:17] [INFO ] Deduced a trap composed of 143 places in 135 ms of which 1 ms to minimize.
[2022-06-02 20:15:17] [INFO ] Deduced a trap composed of 148 places in 134 ms of which 1 ms to minimize.
[2022-06-02 20:15:17] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 1 ms to minimize.
[2022-06-02 20:15:18] [INFO ] Deduced a trap composed of 150 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:15:18] [INFO ] Deduced a trap composed of 145 places in 131 ms of which 0 ms to minimize.
[2022-06-02 20:15:18] [INFO ] Deduced a trap composed of 136 places in 132 ms of which 1 ms to minimize.
[2022-06-02 20:15:18] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 1 ms to minimize.
[2022-06-02 20:15:18] [INFO ] Deduced a trap composed of 153 places in 125 ms of which 1 ms to minimize.
[2022-06-02 20:15:18] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5972 ms
[2022-06-02 20:15:19] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2022-06-02 20:15:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-06-02 20:15:19] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2022-06-02 20:15:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-06-02 20:15:19] [INFO ] After 19305ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :6
Attempting to minimize the solution found.
Minimization took 720 ms.
[2022-06-02 20:15:20] [INFO ] After 20606ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :6
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 5130 ms.
Support contains 52 out of 646 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 304 edges and 646 vertex of which 4 / 646 are part of one of the 1 SCC in 11 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1308 edges and 643 vertex of which 640 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 640 transition count 460
Reduce places removed 111 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 120 rules applied. Total rules applied 233 place count 529 transition count 451
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 242 place count 520 transition count 451
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 242 place count 520 transition count 367
Deduced a syphon composed of 84 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 420 place count 426 transition count 367
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 488 place count 358 transition count 299
Iterating global reduction 3 with 68 rules applied. Total rules applied 556 place count 358 transition count 299
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 556 place count 358 transition count 295
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 565 place count 353 transition count 295
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 754 place count 258 transition count 201
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 757 place count 258 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 760 place count 255 transition count 198
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 764 place count 255 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 765 place count 254 transition count 197
Applied a total of 765 rules in 179 ms. Remains 254 /646 variables (removed 392) and now considering 197/576 (removed 379) transitions.
Finished structural reductions, in 1 iterations. Remains : 254/646 places, 197/576 transitions.
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 20569 ms. (steps per millisecond=48 ) properties (out of 6) seen :2
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 242857 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=48 ) properties seen 0
Interrupted Best-First random walk after 252526 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=50 ) properties seen 0
Interrupted Best-First random walk after 246780 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=49 ) properties seen 0
Interrupted Best-First random walk after 248330 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=49 ) properties seen 0
Running SMT prover for 4 properties.
// Phase 1: matrix 197 rows 254 cols
[2022-06-02 20:16:05] [INFO ] Computed 94 place invariants in 4 ms
[2022-06-02 20:16:06] [INFO ] [Real]Absence check using 60 positive place invariants in 14 ms returned sat
[2022-06-02 20:16:06] [INFO ] [Real]Absence check using 60 positive and 34 generalized place invariants in 8 ms returned sat
[2022-06-02 20:16:06] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 20:16:06] [INFO ] [Nat]Absence check using 60 positive place invariants in 9 ms returned sat
[2022-06-02 20:16:06] [INFO ] [Nat]Absence check using 60 positive and 34 generalized place invariants in 6 ms returned sat
[2022-06-02 20:16:06] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 322 ms
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2022-06-02 20:16:06] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2022-06-02 20:16:07] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2022-06-02 20:16:07] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-06-02 20:16:07] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2022-06-02 20:16:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 429 ms
[2022-06-02 20:16:07] [INFO ] After 1222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 263 ms.
[2022-06-02 20:16:07] [INFO ] After 1593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 453 ms.
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 254/254 places, 197/197 transitions.
Graph (trivial) has 58 edges and 254 vertex of which 2 / 254 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 840 edges and 253 vertex of which 252 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 252 transition count 182
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 239 transition count 182
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 28 place count 239 transition count 160
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 82 place count 207 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 203 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 203 transition count 156
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 137 place count 178 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 176 transition count 155
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 176 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 175 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 175 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 174 transition count 153
Applied a total of 145 rules in 58 ms. Remains 174 /254 variables (removed 80) and now considering 153/197 (removed 44) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/254 places, 153/197 transitions.
Finished random walk after 927 steps, including 21 resets, run visited all 1 properties in 5 ms. (steps per millisecond=185 )
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 71097 ms.

BK_STOP 1654200968244

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

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