Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414900349.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r065-tajo-171620414900349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 156K May 18 16:42 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-2024-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716651304553

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-25 15:35:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 15:35:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:35:06] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-25 15:35:06] [INFO ] Transformed 624 places.
[2024-05-25 15:35:06] [INFO ] Transformed 564 transitions.
[2024-05-25 15:35:06] [INFO ] Found NUPN structural information;
[2024-05-25 15:35:06] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 67 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 13) seen :3
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 82 ms. (steps per millisecond=121 ) 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 10001 steps, including 11 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 556 rows 616 cols
[2024-05-25 15:35:08] [INFO ] Computed 99 invariants in 33 ms
[2024-05-25 15:35:09] [INFO ] After 902ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 15:35:09] [INFO ] [Nat]Absence check using 60 positive place invariants in 46 ms returned sat
[2024-05-25 15:35:09] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 28 ms returned sat
[2024-05-25 15:35:10] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2024-05-25 15:35:10] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 18 ms to minimize.
[2024-05-25 15:35:10] [INFO ] Deduced a trap composed of 18 places in 304 ms of which 2 ms to minimize.
[2024-05-25 15:35:10] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 2 ms to minimize.
[2024-05-25 15:35:11] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 2 ms to minimize.
[2024-05-25 15:35:11] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 2 ms to minimize.
[2024-05-25 15:35:11] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 1 ms to minimize.
[2024-05-25 15:35:12] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 2 ms to minimize.
[2024-05-25 15:35:12] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 21 ms to minimize.
[2024-05-25 15:35:12] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2024-05-25 15:35:12] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2024-05-25 15:35:12] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2024-05-25 15:35:12] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:35:13] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:35:13] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:35:13] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:35:13] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2024-05-25 15:35:13] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:35:13] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:35:13] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2024-05-25 15:35:13] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2024-05-25 15:35:13] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 0 ms to minimize.
[2024-05-25 15:35:13] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
[2024-05-25 15:35:14] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2024-05-25 15:35:14] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:35:14] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:35:14] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:35:14] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 39 ms to minimize.
[2024-05-25 15:35:14] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:35:14] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:35:14] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2024-05-25 15:35:14] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 0 ms to minimize.
[2024-05-25 15:35:14] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 0 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 4 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 0 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 0 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 0 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 0 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-25 15:35:15] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2024-05-25 15:35:16] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 0 ms to minimize.
[2024-05-25 15:35:16] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2024-05-25 15:35:16] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:35:16] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 0 ms to minimize.
[2024-05-25 15:35:16] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:35:16] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 0 ms to minimize.
[2024-05-25 15:35:16] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 2 ms to minimize.
[2024-05-25 15:35:16] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:35:16] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:35:16] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:35:16] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:35:17] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 19 ms to minimize.
[2024-05-25 15:35:17] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:35:17] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-25 15:35:17] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-25 15:35:17] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2024-05-25 15:35:17] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 0 ms to minimize.
[2024-05-25 15:35:17] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 0 ms to minimize.
[2024-05-25 15:35:17] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 0 ms to minimize.
[2024-05-25 15:35:17] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-25 15:35:17] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:35:17] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-25 15:35:18] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2024-05-25 15:35:18] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:35:18] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 4 ms to minimize.
[2024-05-25 15:35:18] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:35:18] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:35:18] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-25 15:35:18] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 0 ms to minimize.
[2024-05-25 15:35:18] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:35:18] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:35:18] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:35:19] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 0 ms to minimize.
[2024-05-25 15:35:19] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:35:19] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:35:19] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:35:19] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 15 ms to minimize.
[2024-05-25 15:35:19] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2024-05-25 15:35:19] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:35:19] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:35:20] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:35:20] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 0 ms to minimize.
[2024-05-25 15:35:20] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:35:20] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-25 15:35:20] [INFO ] Trap strengthening (SAT) tested/added 89/88 trap constraints in 10402 ms
[2024-05-25 15:35:20] [INFO ] Deduced a trap composed of 147 places in 167 ms of which 1 ms to minimize.
[2024-05-25 15:35:21] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 1 ms to minimize.
[2024-05-25 15:35:21] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 0 ms to minimize.
[2024-05-25 15:35:21] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 0 ms to minimize.
[2024-05-25 15:35:21] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:35:21] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 1 ms to minimize.
[2024-05-25 15:35:22] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:35:22] [INFO ] Deduced a trap composed of 145 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:35:22] [INFO ] Deduced a trap composed of 128 places in 179 ms of which 0 ms to minimize.
[2024-05-25 15:35:22] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 0 ms to minimize.
[2024-05-25 15:35:22] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 0 ms to minimize.
[2024-05-25 15:35:22] [INFO ] Deduced a trap composed of 127 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:35:23] [INFO ] Deduced a trap composed of 140 places in 177 ms of which 0 ms to minimize.
[2024-05-25 15:35:23] [INFO ] Deduced a trap composed of 132 places in 226 ms of which 1 ms to minimize.
[2024-05-25 15:35:23] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 1 ms to minimize.
[2024-05-25 15:35:23] [INFO ] Deduced a trap composed of 132 places in 209 ms of which 1 ms to minimize.
[2024-05-25 15:35:24] [INFO ] Deduced a trap composed of 126 places in 213 ms of which 1 ms to minimize.
[2024-05-25 15:35:24] [INFO ] Deduced a trap composed of 133 places in 204 ms of which 1 ms to minimize.
[2024-05-25 15:35:24] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 0 ms to minimize.
[2024-05-25 15:35:24] [INFO ] Deduced a trap composed of 145 places in 123 ms of which 0 ms to minimize.
[2024-05-25 15:35:24] [INFO ] Deduced a trap composed of 134 places in 147 ms of which 0 ms to minimize.
[2024-05-25 15:35:25] [INFO ] Deduced a trap composed of 148 places in 127 ms of which 0 ms to minimize.
[2024-05-25 15:35:25] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2024-05-25 15:35:25] [INFO ] Deduced a trap composed of 142 places in 127 ms of which 1 ms to minimize.
[2024-05-25 15:35:25] [INFO ] Deduced a trap composed of 138 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:35:25] [INFO ] Deduced a trap composed of 145 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:35:25] [INFO ] Deduced a trap composed of 157 places in 124 ms of which 1 ms to minimize.
[2024-05-25 15:35:25] [INFO ] Deduced a trap composed of 136 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:35:26] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 0 ms to minimize.
[2024-05-25 15:35:26] [INFO ] Deduced a trap composed of 144 places in 129 ms of which 2 ms to minimize.
[2024-05-25 15:35:26] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 0 ms to minimize.
[2024-05-25 15:35:26] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 0 ms to minimize.
[2024-05-25 15:35:26] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 1 ms to minimize.
[2024-05-25 15:35:26] [INFO ] Deduced a trap composed of 150 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:35:27] [INFO ] Deduced a trap composed of 150 places in 125 ms of which 1 ms to minimize.
[2024-05-25 15:35:27] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 1 ms to minimize.
[2024-05-25 15:35:27] [INFO ] Deduced a trap composed of 147 places in 135 ms of which 2 ms to minimize.
[2024-05-25 15:35:27] [INFO ] Deduced a trap composed of 140 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:35:27] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:35:27] [INFO ] Deduced a trap composed of 141 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:35:27] [INFO ] Deduced a trap composed of 133 places in 121 ms of which 1 ms to minimize.
[2024-05-25 15:35:28] [INFO ] Deduced a trap composed of 143 places in 125 ms of which 0 ms to minimize.
[2024-05-25 15:35:28] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 0 ms to minimize.
[2024-05-25 15:35:28] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 0 ms to minimize.
[2024-05-25 15:35:28] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 1 ms to minimize.
[2024-05-25 15:35:29] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2024-05-25 15:35:29] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 0 ms to minimize.
[2024-05-25 15:35:29] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:35:29] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 0 ms to minimize.
[2024-05-25 15:35:29] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:35:29] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:35:30] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 1 ms to minimize.
[2024-05-25 15:35:30] [INFO ] Deduced a trap composed of 145 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:35:30] [INFO ] Deduced a trap composed of 154 places in 148 ms of which 14 ms to minimize.
[2024-05-25 15:35:30] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 0 ms to minimize.
[2024-05-25 15:35:31] [INFO ] Deduced a trap composed of 143 places in 185 ms of which 0 ms to minimize.
[2024-05-25 15:35:31] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:35:31] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 1 ms to minimize.
[2024-05-25 15:35:31] [INFO ] Deduced a trap composed of 145 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:35:31] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 1 ms to minimize.
[2024-05-25 15:35:32] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:35:32] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:35:32] [INFO ] Deduced a trap composed of 142 places in 178 ms of which 1 ms to minimize.
[2024-05-25 15:35:32] [INFO ] Deduced a trap composed of 149 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:35:32] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 1 ms to minimize.
[2024-05-25 15:35:33] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:35:33] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 1 ms to minimize.
[2024-05-25 15:35:33] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 0 ms to minimize.
[2024-05-25 15:35:33] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2024-05-25 15:35:33] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 0 ms to minimize.
[2024-05-25 15:35:33] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 0 ms to minimize.
[2024-05-25 15:35:34] [INFO ] Deduced a trap composed of 150 places in 182 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 15:35:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:35:34] [INFO ] After 25138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 132 ms.
Support contains 13 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 348 edges and 616 vertex of which 7 / 616 are part of one of the 1 SCC in 16 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.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 136 place count 604 transition count 413
Reduce places removed 134 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 139 rules applied. Total rules applied 275 place count 470 transition count 408
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 280 place count 465 transition count 408
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 280 place count 465 transition count 321
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 471 place count 361 transition count 321
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 550 place count 282 transition count 242
Iterating global reduction 3 with 79 rules applied. Total rules applied 629 place count 282 transition count 242
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 629 place count 282 transition count 233
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 649 place count 271 transition count 233
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 831 place count 179 transition count 143
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 834 place count 179 transition count 140
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 837 place count 176 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 838 place count 175 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 839 place count 174 transition count 139
Applied a total of 839 rules in 196 ms. Remains 174 /616 variables (removed 442) and now considering 139/556 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 174/616 places, 139/556 transitions.
Incomplete random walk after 10000 steps, including 510 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :4
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 170 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 139 rows 174 cols
[2024-05-25 15:35:34] [INFO ] Computed 72 invariants in 4 ms
[2024-05-25 15:35:34] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:35:34] [INFO ] [Nat]Absence check using 54 positive place invariants in 23 ms returned sat
[2024-05-25 15:35:34] [INFO ] [Nat]Absence check using 54 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 15:35:35] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:35:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:35:35] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2024-05-25 15:35:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 610 ms
[2024-05-25 15:35:35] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-25 15:35:35] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-04 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 29158 ms.
starting LoLA
BK_INPUT BusinessProcesses-PT-14
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityCardinality

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-2024-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716651337331

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/ReachabilityCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:156
lola: rewrite Frontend/Parser/formula_rewrite.k:147
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 8 transitions removed,8 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH INITIAL
lola: LAUNCH task # 28 (type CNST) for 27 BusinessProcesses-PT-14-ReachabilityCardinality-2024-09
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 28 (type CNST) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-09
lola: result : false
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 73 (type EXCL) for 12 BusinessProcesses-PT-14-ReachabilityCardinality-2024-04
lola: time limit : 163 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 54 (type FNDP) for 9 BusinessProcesses-PT-14-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 55 (type EQUN) for 9 BusinessProcesses-PT-14-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 68 (type SRCH) for 9 BusinessProcesses-PT-14-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-55.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 73 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-04
lola: result : false
lola: markings : 3274
lola: fired transitions : 4577
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 77 (type EXCL) for 3 BusinessProcesses-PT-14-ReachabilityCardinality-2024-01
lola: time limit : 179 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 77 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-01
lola: result : true
lola: markings : 19
lola: fired transitions : 18
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 86 (type EXCL) for 24 BusinessProcesses-PT-14-ReachabilityCardinality-2024-08
lola: time limit : 189 sec
lola: memory limit: 32 pages

lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 86 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-08
lola: result : false
lola: markings : 2892
lola: fired transitions : 4197
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 80 (type EXCL) for 6 BusinessProcesses-PT-14-ReachabilityCardinality-2024-02
lola: time limit : 239 sec
lola: memory limit: 32 pages
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 80 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-02
lola: result : true
lola: markings : 636
lola: fired transitions : 742
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 125 (type EXCL) for 36 BusinessProcesses-PT-14-ReachabilityCardinality-2024-12
lola: time limit : 299 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 55 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-03
lola: result : false
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 54 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 68 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-03 (obsolete)
lola: LAUNCH task # 109 (type FNDP) for 39 BusinessProcesses-PT-14-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 127 (type EQUN) for 39 BusinessProcesses-PT-14-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 129 (type SRCH) for 39 BusinessProcesses-PT-14-ReachabilityCardinality-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 54 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-03
lola: result : unknown
lola: fired transitions : 16101
lola: tried executions : 1586
lola: time used : 0.000000
lola: memory pages used : 0
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 125 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-12
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 98 (type EXCL) for 21 BusinessProcesses-PT-14-ReachabilityCardinality-2024-07
lola: time limit : 399 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-127.sara.
lola: FINISHED task # 98 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-07
lola: result : true
lola: markings : 2352
lola: fired transitions : 3499
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 114 (type EXCL) for 42 BusinessProcesses-PT-14-ReachabilityCardinality-2024-14
lola: time limit : 449 sec
lola: memory limit: 32 pages
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 114 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-14
lola: result : true
lola: markings : 12
lola: fired transitions : 11
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 122 (type EXCL) for 15 BusinessProcesses-PT-14-ReachabilityCardinality-2024-05
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: FINISHED task # 122 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-05
lola: result : true
lola: markings : 2440
lola: fired transitions : 3604
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 92 (type EXCL) for 30 BusinessProcesses-PT-14-ReachabilityCardinality-2024-10
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 92 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-10
lola: result : true
lola: markings : 2912
lola: fired transitions : 4057
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 145 (type EXCL) for 45 BusinessProcesses-PT-14-ReachabilityCardinality-2024-15
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: FINISHED task # 145 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-15
lola: result : true
lola: markings : 26
lola: fired transitions : 25
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 64 (type EXCL) for 0 BusinessProcesses-PT-14-ReachabilityCardinality-2024-00
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 64 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-00
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 138 (type EXCL) for 33 BusinessProcesses-PT-14-ReachabilityCardinality-2024-11
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 138 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-11
lola: result : true
lola: markings : 21
lola: fired transitions : 20
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 130 (type EXCL) for 39 BusinessProcesses-PT-14-ReachabilityCardinality-2024-13
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 130 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-13
lola: result : false
lola: markings : 6647
lola: fired transitions : 8690
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 109 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-13 (obsolete)
lola: CANCELED task # 127 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-13 (obsolete)
lola: CANCELED task # 129 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-13 (obsolete)
lola: LAUNCH task # 105 (type EXCL) for 18 BusinessProcesses-PT-14-ReachabilityCardinality-2024-06
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 101 (type FNDP) for 18 BusinessProcesses-PT-14-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 102 (type EQUN) for 18 BusinessProcesses-PT-14-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 104 (type SRCH) for 18 BusinessProcesses-PT-14-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 109 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-13
lola: result : unknown
lola: fired transitions : 68987
lola: tried executions : 2598
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 127 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-13
lola: result : unknown
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-102.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 105 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-06
lola: result : false
lola: markings : 59409
lola: fired transitions : 76331
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 101 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 102 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 104 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-2024-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-14-ReachabilityCardinality-2024-00: EF true tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-01: AG false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-02: AG false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-03: AG true state equation
BusinessProcesses-PT-14-ReachabilityCardinality-2024-04: AG true tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-05: AG false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-06: EF false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-07: AG false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-08: EF false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-09: INITIAL false preprocessing
BusinessProcesses-PT-14-ReachabilityCardinality-2024-10: EF true tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-11: AG false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-12: EF true tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-13: AG true tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-14: EF true tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-2024-15: AG false tandem / relaxed


Time elapsed: 2 secs. Pages in use: 2

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r065-tajo-171620414900349"
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 ;