Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694900558.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BusinessProcesses-PT-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900558
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 156K Mar 5 18:22 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-14-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678645563085

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:26:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 18:26:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:26:05] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-12 18:26:05] [INFO ] Transformed 624 places.
[2023-03-12 18:26:05] [INFO ] Transformed 564 transitions.
[2023-03-12 18:26:05] [INFO ] Found NUPN structural information;
[2023-03-12 18:26:05] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 68 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 13) seen :3
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 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 9 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 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 11 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 12 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 12 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 556 rows 616 cols
[2023-03-12 18:26:06] [INFO ] Computed 99 place invariants in 33 ms
[2023-03-12 18:26:06] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 18:26:07] [INFO ] [Nat]Absence check using 60 positive place invariants in 35 ms returned sat
[2023-03-12 18:26:07] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2023-03-12 18:26:07] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-12 18:26:08] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 6 ms to minimize.
[2023-03-12 18:26:08] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 1 ms to minimize.
[2023-03-12 18:26:08] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2023-03-12 18:26:08] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 2 ms to minimize.
[2023-03-12 18:26:08] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
[2023-03-12 18:26:08] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-12 18:26:09] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 1 ms to minimize.
[2023-03-12 18:26:09] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2023-03-12 18:26:09] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2023-03-12 18:26:09] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-03-12 18:26:09] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2023-03-12 18:26:09] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2023-03-12 18:26:10] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:26:10] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2023-03-12 18:26:10] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 0 ms to minimize.
[2023-03-12 18:26:10] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2484 ms
[2023-03-12 18:26:10] [INFO ] Deduced a trap composed of 154 places in 163 ms of which 1 ms to minimize.
[2023-03-12 18:26:10] [INFO ] Deduced a trap composed of 92 places in 258 ms of which 1 ms to minimize.
[2023-03-12 18:26:11] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 0 ms to minimize.
[2023-03-12 18:26:11] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 1 ms to minimize.
[2023-03-12 18:26:11] [INFO ] Deduced a trap composed of 144 places in 124 ms of which 1 ms to minimize.
[2023-03-12 18:26:11] [INFO ] Deduced a trap composed of 147 places in 228 ms of which 1 ms to minimize.
[2023-03-12 18:26:11] [INFO ] Deduced a trap composed of 153 places in 222 ms of which 1 ms to minimize.
[2023-03-12 18:26:12] [INFO ] Deduced a trap composed of 43 places in 561 ms of which 0 ms to minimize.
[2023-03-12 18:26:12] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 0 ms to minimize.
[2023-03-12 18:26:12] [INFO ] Deduced a trap composed of 140 places in 232 ms of which 1 ms to minimize.
[2023-03-12 18:26:14] [INFO ] Deduced a trap composed of 147 places in 1382 ms of which 0 ms to minimize.
[2023-03-12 18:26:14] [INFO ] Deduced a trap composed of 150 places in 130 ms of which 0 ms to minimize.
[2023-03-12 18:26:14] [INFO ] Deduced a trap composed of 145 places in 129 ms of which 1 ms to minimize.
[2023-03-12 18:26:14] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 1 ms to minimize.
[2023-03-12 18:26:15] [INFO ] Deduced a trap composed of 150 places in 209 ms of which 1 ms to minimize.
[2023-03-12 18:26:15] [INFO ] Deduced a trap composed of 144 places in 212 ms of which 1 ms to minimize.
[2023-03-12 18:26:15] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 1 ms to minimize.
[2023-03-12 18:26:15] [INFO ] Deduced a trap composed of 147 places in 223 ms of which 1 ms to minimize.
[2023-03-12 18:26:15] [INFO ] Deduced a trap composed of 156 places in 130 ms of which 1 ms to minimize.
[2023-03-12 18:26:16] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 5 ms to minimize.
[2023-03-12 18:26:16] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2023-03-12 18:26:16] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 0 ms to minimize.
[2023-03-12 18:26:16] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5872 ms
[2023-03-12 18:26:16] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 1 ms to minimize.
[2023-03-12 18:26:16] [INFO ] Deduced a trap composed of 139 places in 147 ms of which 0 ms to minimize.
[2023-03-12 18:26:16] [INFO ] Deduced a trap composed of 136 places in 138 ms of which 14 ms to minimize.
[2023-03-12 18:26:17] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2023-03-12 18:26:17] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:26:17] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:26:17] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:26:17] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2023-03-12 18:26:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1355 ms
[2023-03-12 18:26:17] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2023-03-12 18:26:17] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 0 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 0 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-03-12 18:26:18] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 4 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2023-03-12 18:26:19] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 0 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 1 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 3 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 0 ms to minimize.
[2023-03-12 18:26:20] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 0 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 0 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 0 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 0 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2023-03-12 18:26:21] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 4178 ms
[2023-03-12 18:26:22] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 0 ms to minimize.
[2023-03-12 18:26:22] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 1 ms to minimize.
[2023-03-12 18:26:22] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 0 ms to minimize.
[2023-03-12 18:26:22] [INFO ] Deduced a trap composed of 132 places in 163 ms of which 1 ms to minimize.
[2023-03-12 18:26:22] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 0 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 1 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 0 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 0 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 0 ms to minimize.
[2023-03-12 18:26:23] [INFO ] Deduced a trap composed of 144 places in 163 ms of which 0 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 0 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 151 places in 134 ms of which 0 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 156 places in 130 ms of which 0 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 1 ms to minimize.
[2023-03-12 18:26:24] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 1 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 1 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 1 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 148 places in 129 ms of which 0 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 1 ms to minimize.
[2023-03-12 18:26:25] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 157 places in 140 ms of which 1 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 0 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 0 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 0 ms to minimize.
[2023-03-12 18:26:26] [INFO ] Deduced a trap composed of 161 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 1 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 147 places in 133 ms of which 0 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 153 places in 143 ms of which 1 ms to minimize.
[2023-03-12 18:26:27] [INFO ] Deduced a trap composed of 147 places in 129 ms of which 1 ms to minimize.
[2023-03-12 18:26:28] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:26:28] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 0 ms to minimize.
[2023-03-12 18:26:28] [INFO ] Deduced a trap composed of 143 places in 149 ms of which 1 ms to minimize.
[2023-03-12 18:26:28] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 1 ms to minimize.
[2023-03-12 18:26:28] [INFO ] Deduced a trap composed of 149 places in 234 ms of which 1 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 132 places in 217 ms of which 2 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 152 places in 212 ms of which 1 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 149 places in 212 ms of which 1 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:26:29] [INFO ] Deduced a trap composed of 157 places in 148 ms of which 0 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 0 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 136 places in 126 ms of which 1 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 141 places in 129 ms of which 1 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 137 places in 121 ms of which 1 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 150 places in 134 ms of which 1 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 148 places in 147 ms of which 1 ms to minimize.
[2023-03-12 18:26:30] [INFO ] Deduced a trap composed of 145 places in 119 ms of which 0 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 140 places in 119 ms of which 1 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 0 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 149 places in 136 ms of which 1 ms to minimize.
[2023-03-12 18:26:31] [INFO ] Deduced a trap composed of 144 places in 151 ms of which 1 ms to minimize.
[2023-03-12 18:26:32] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 18:26:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 18:26:32] [INFO ] After 25115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 164 ms.
Support contains 49 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 309 edges and 616 vertex of which 7 / 616 are part of one of the 1 SCC in 19 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1252 edges and 610 vertex of which 604 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 604 transition count 440
Reduce places removed 107 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 125 rules applied. Total rules applied 234 place count 497 transition count 422
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 252 place count 479 transition count 422
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 252 place count 479 transition count 341
Deduced a syphon composed of 81 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 426 place count 386 transition count 341
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 491 place count 321 transition count 276
Iterating global reduction 3 with 65 rules applied. Total rules applied 556 place count 321 transition count 276
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 556 place count 321 transition count 271
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 567 place count 315 transition count 271
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 725 place count 235 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 727 place count 234 transition count 197
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 729 place count 234 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 731 place count 232 transition count 195
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 734 place count 232 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 735 place count 231 transition count 194
Applied a total of 735 rules in 198 ms. Remains 231 /616 variables (removed 385) and now considering 194/556 (removed 362) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 231/616 places, 194/556 transitions.
Incomplete random walk after 10000 steps, including 189 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 7) seen :4
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 231 cols
[2023-03-12 18:26:32] [INFO ] Computed 79 place invariants in 10 ms
[2023-03-12 18:26:32] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 18:26:32] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-12 18:26:32] [INFO ] [Nat]Absence check using 55 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-12 18:26:32] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 18:26:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 18:26:33] [INFO ] After 31ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 0 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 0 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 0 ms to minimize.
[2023-03-12 18:26:33] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 0 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 0 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 0 ms to minimize.
[2023-03-12 18:26:34] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1213 ms
[2023-03-12 18:26:34] [INFO ] After 1281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-12 18:26:34] [INFO ] After 1490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 29320 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/942/inv_0_ --invariant=/tmp/942/inv_1_ --invariant=/tmp/942/inv_2_ --invariant=/tmp/942/inv_3_ --invariant=/tmp/942/inv_4_ --invariant=/tmp/942/inv_5_ --invariant=/tmp/942/inv_6_ --invariant=/tmp/942/inv_7_ --invariant=/tmp/942/inv_8_ --invariant=/tmp/942/inv_9_ --invariant=/tmp/942/inv_10_ --invariant=/tmp/942/inv_11_ --invariant=/tmp/942/inv_12_ --invariant=/tmp/942/inv_13_ --invariant=/tmp/942/inv_14_ --invariant=/tmp/942/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 9758408 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16102960 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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-14"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-14, 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 r041-tajo-167813694900558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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