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.r039-tajo-167813692700582.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 lolaxred
Input is BusinessProcesses-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:48 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:49 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 161K 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-17-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678503527581

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:58:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:58:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:58:49] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-11 02:58:49] [INFO ] Transformed 650 places.
[2023-03-11 02:58:49] [INFO ] Transformed 580 transitions.
[2023-03-11 02:58:49] [INFO ] Found NUPN structural information;
[2023-03-11 02:58:49] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 67 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 14) seen :2
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 576 rows 646 cols
[2023-03-11 02:58:50] [INFO ] Computed 108 place invariants in 22 ms
[2023-03-11 02:58:51] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 02:58:51] [INFO ] [Nat]Absence check using 62 positive place invariants in 25 ms returned sat
[2023-03-11 02:58:51] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 15 ms returned sat
[2023-03-11 02:58:51] [INFO ] After 571ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-11 02:58:52] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 6 ms to minimize.
[2023-03-11 02:58:52] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 1 ms to minimize.
[2023-03-11 02:58:52] [INFO ] Deduced a trap composed of 21 places in 225 ms of which 1 ms to minimize.
[2023-03-11 02:58:53] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2023-03-11 02:58:53] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 1 ms to minimize.
[2023-03-11 02:58:53] [INFO ] Deduced a trap composed of 133 places in 225 ms of which 1 ms to minimize.
[2023-03-11 02:58:53] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 2 ms to minimize.
[2023-03-11 02:58:54] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 1 ms to minimize.
[2023-03-11 02:58:54] [INFO ] Deduced a trap composed of 147 places in 139 ms of which 0 ms to minimize.
[2023-03-11 02:58:54] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:58:54] [INFO ] Deduced a trap composed of 141 places in 134 ms of which 0 ms to minimize.
[2023-03-11 02:58:54] [INFO ] Deduced a trap composed of 147 places in 135 ms of which 0 ms to minimize.
[2023-03-11 02:58:54] [INFO ] Deduced a trap composed of 151 places in 176 ms of which 1 ms to minimize.
[2023-03-11 02:58:55] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 1 ms to minimize.
[2023-03-11 02:58:55] [INFO ] Deduced a trap composed of 144 places in 200 ms of which 0 ms to minimize.
[2023-03-11 02:58:55] [INFO ] Deduced a trap composed of 146 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:58:55] [INFO ] Deduced a trap composed of 144 places in 136 ms of which 0 ms to minimize.
[2023-03-11 02:58:55] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:58:56] [INFO ] Deduced a trap composed of 147 places in 154 ms of which 1 ms to minimize.
[2023-03-11 02:58:56] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 0 ms to minimize.
[2023-03-11 02:58:56] [INFO ] Deduced a trap composed of 151 places in 132 ms of which 1 ms to minimize.
[2023-03-11 02:58:56] [INFO ] Deduced a trap composed of 159 places in 180 ms of which 1 ms to minimize.
[2023-03-11 02:58:56] [INFO ] Deduced a trap composed of 150 places in 181 ms of which 1 ms to minimize.
[2023-03-11 02:58:57] [INFO ] Deduced a trap composed of 149 places in 172 ms of which 0 ms to minimize.
[2023-03-11 02:58:57] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 1 ms to minimize.
[2023-03-11 02:58:57] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 1 ms to minimize.
[2023-03-11 02:58:57] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 0 ms to minimize.
[2023-03-11 02:58:57] [INFO ] Deduced a trap composed of 119 places in 163 ms of which 0 ms to minimize.
[2023-03-11 02:58:58] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:58:58] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 0 ms to minimize.
[2023-03-11 02:58:58] [INFO ] Deduced a trap composed of 133 places in 125 ms of which 1 ms to minimize.
[2023-03-11 02:58:58] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 1 ms to minimize.
[2023-03-11 02:58:58] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2023-03-11 02:58:58] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 1 ms to minimize.
[2023-03-11 02:58:59] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 13 ms to minimize.
[2023-03-11 02:58:59] [INFO ] Deduced a trap composed of 124 places in 122 ms of which 0 ms to minimize.
[2023-03-11 02:58:59] [INFO ] Deduced a trap composed of 139 places in 178 ms of which 1 ms to minimize.
[2023-03-11 02:58:59] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:58:59] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 1 ms to minimize.
[2023-03-11 02:59:00] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 2 ms to minimize.
[2023-03-11 02:59:00] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 1 ms to minimize.
[2023-03-11 02:59:00] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 0 ms to minimize.
[2023-03-11 02:59:00] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 1 ms to minimize.
[2023-03-11 02:59:00] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 1 ms to minimize.
[2023-03-11 02:59:00] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 1 ms to minimize.
[2023-03-11 02:59:01] [INFO ] Deduced a trap composed of 143 places in 129 ms of which 1 ms to minimize.
[2023-03-11 02:59:01] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 1 ms to minimize.
[2023-03-11 02:59:01] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2023-03-11 02:59:01] [INFO ] Deduced a trap composed of 140 places in 124 ms of which 1 ms to minimize.
[2023-03-11 02:59:01] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 1 ms to minimize.
[2023-03-11 02:59:01] [INFO ] Deduced a trap composed of 133 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:59:02] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 1 ms to minimize.
[2023-03-11 02:59:02] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:59:02] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:59:02] [INFO ] Deduced a trap composed of 143 places in 153 ms of which 1 ms to minimize.
[2023-03-11 02:59:02] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 1 ms to minimize.
[2023-03-11 02:59:03] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 1 ms to minimize.
[2023-03-11 02:59:03] [INFO ] Deduced a trap composed of 149 places in 150 ms of which 0 ms to minimize.
[2023-03-11 02:59:03] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 1 ms to minimize.
[2023-03-11 02:59:03] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 0 ms to minimize.
[2023-03-11 02:59:03] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 1 ms to minimize.
[2023-03-11 02:59:04] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 0 ms to minimize.
[2023-03-11 02:59:04] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 1 ms to minimize.
[2023-03-11 02:59:04] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:59:04] [INFO ] Deduced a trap composed of 125 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:59:04] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 0 ms to minimize.
[2023-03-11 02:59:04] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 0 ms to minimize.
[2023-03-11 02:59:05] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 2 ms to minimize.
[2023-03-11 02:59:05] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:59:05] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 0 ms to minimize.
[2023-03-11 02:59:05] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 0 ms to minimize.
[2023-03-11 02:59:05] [INFO ] Deduced a trap composed of 142 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:59:06] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 1 ms to minimize.
[2023-03-11 02:59:06] [INFO ] Deduced a trap composed of 130 places in 137 ms of which 1 ms to minimize.
[2023-03-11 02:59:06] [INFO ] Deduced a trap composed of 141 places in 132 ms of which 0 ms to minimize.
[2023-03-11 02:59:06] [INFO ] Deduced a trap composed of 129 places in 149 ms of which 1 ms to minimize.
[2023-03-11 02:59:06] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 0 ms to minimize.
[2023-03-11 02:59:07] [INFO ] Deduced a trap composed of 143 places in 152 ms of which 0 ms to minimize.
[2023-03-11 02:59:07] [INFO ] Deduced a trap composed of 158 places in 140 ms of which 1 ms to minimize.
[2023-03-11 02:59:07] [INFO ] Deduced a trap composed of 140 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:59:07] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 1 ms to minimize.
[2023-03-11 02:59:07] [INFO ] Deduced a trap composed of 134 places in 143 ms of which 1 ms to minimize.
[2023-03-11 02:59:07] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 1 ms to minimize.
[2023-03-11 02:59:08] [INFO ] Deduced a trap composed of 142 places in 160 ms of which 1 ms to minimize.
[2023-03-11 02:59:08] [INFO ] Deduced a trap composed of 135 places in 146 ms of which 1 ms to minimize.
[2023-03-11 02:59:08] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:59:08] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 1 ms to minimize.
[2023-03-11 02:59:08] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:59:09] [INFO ] Deduced a trap composed of 142 places in 148 ms of which 0 ms to minimize.
[2023-03-11 02:59:09] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 0 ms to minimize.
[2023-03-11 02:59:09] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 1 ms to minimize.
[2023-03-11 02:59:09] [INFO ] Deduced a trap composed of 127 places in 156 ms of which 1 ms to minimize.
[2023-03-11 02:59:09] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 0 ms to minimize.
[2023-03-11 02:59:10] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 0 ms to minimize.
[2023-03-11 02:59:10] [INFO ] Deduced a trap composed of 141 places in 119 ms of which 1 ms to minimize.
[2023-03-11 02:59:10] [INFO ] Deduced a trap composed of 120 places in 150 ms of which 0 ms to minimize.
[2023-03-11 02:59:10] [INFO ] Deduced a trap composed of 135 places in 103 ms of which 1 ms to minimize.
[2023-03-11 02:59:10] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:59:10] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 0 ms to minimize.
[2023-03-11 02:59:11] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 0 ms to minimize.
[2023-03-11 02:59:11] [INFO ] Deduced a trap composed of 127 places in 148 ms of which 1 ms to minimize.
[2023-03-11 02:59:11] [INFO ] Deduced a trap composed of 142 places in 139 ms of which 0 ms to minimize.
[2023-03-11 02:59:11] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 0 ms to minimize.
[2023-03-11 02:59:12] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-11 02:59:12] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 0 ms to minimize.
[2023-03-11 02:59:12] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2023-03-11 02:59:12] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2023-03-11 02:59:13] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 0 ms to minimize.
[2023-03-11 02:59:13] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 1 ms to minimize.
[2023-03-11 02:59:13] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 1 ms to minimize.
[2023-03-11 02:59:13] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2023-03-11 02:59:13] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 0 ms to minimize.
[2023-03-11 02:59:14] [INFO ] Deduced a trap composed of 140 places in 157 ms of which 0 ms to minimize.
[2023-03-11 02:59:14] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2023-03-11 02:59:14] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 0 ms to minimize.
[2023-03-11 02:59:14] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 0 ms to minimize.
[2023-03-11 02:59:14] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:59:15] [INFO ] Deduced a trap composed of 146 places in 146 ms of which 1 ms to minimize.
[2023-03-11 02:59:15] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 1 ms to minimize.
[2023-03-11 02:59:15] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 0 ms to minimize.
[2023-03-11 02:59:15] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 1 ms to minimize.
[2023-03-11 02:59:15] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 0 ms to minimize.
[2023-03-11 02:59:16] [INFO ] Deduced a trap composed of 141 places in 160 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-11 02:59:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:59:16] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 173 ms.
Support contains 58 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 309 edges and 646 vertex of which 4 / 646 are part of one of the 1 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1308 edges and 643 vertex of which 639 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 639 transition count 461
Reduce places removed 110 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 123 rules applied. Total rules applied 235 place count 529 transition count 448
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 248 place count 516 transition count 448
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 248 place count 516 transition count 359
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 439 place count 414 transition count 359
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 505 place count 348 transition count 293
Iterating global reduction 3 with 66 rules applied. Total rules applied 571 place count 348 transition count 293
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 571 place count 348 transition count 289
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 580 place count 343 transition count 289
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 769 place count 247 transition count 196
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 771 place count 246 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 773 place count 246 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 775 place count 244 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 776 place count 243 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 777 place count 242 transition count 197
Applied a total of 777 rules in 220 ms. Remains 242 /646 variables (removed 404) and now considering 197/576 (removed 379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 242/646 places, 197/576 transitions.
Incomplete random walk after 10000 steps, including 495 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 9) seen :2
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 197 rows 242 cols
[2023-03-11 02:59:17] [INFO ] Computed 87 place invariants in 4 ms
[2023-03-11 02:59:17] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 02:59:17] [INFO ] [Nat]Absence check using 60 positive place invariants in 24 ms returned sat
[2023-03-11 02:59:17] [INFO ] [Nat]Absence check using 60 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-11 02:59:17] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 02:59:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:59:17] [INFO ] After 108ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 02:59:17] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-11 02:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-11 02:59:17] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-11 02:59:18] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2023-03-11 02:59:18] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 0 ms to minimize.
[2023-03-11 02:59:18] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 0 ms to minimize.
[2023-03-11 02:59:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2023-03-11 02:59:18] [INFO ] After 704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-11 02:59:18] [INFO ] After 1176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 40 ms.
Support contains 55 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 197/197 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 240 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 239 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 239 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 237 transition count 192
Applied a total of 10 rules in 29 ms. Remains 237 /242 variables (removed 5) and now considering 192/197 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 237/242 places, 192/197 transitions.
Incomplete random walk after 10000 steps, including 492 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :3
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 88 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 192 rows 237 cols
[2023-03-11 02:59:19] [INFO ] Computed 87 place invariants in 2 ms
[2023-03-11 02:59:19] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 02:59:19] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-11 02:59:19] [INFO ] [Nat]Absence check using 58 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-11 02:59:19] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 02:59:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:59:19] [INFO ] After 114ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 02:59:19] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2023-03-11 02:59:19] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2023-03-11 02:59:19] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2023-03-11 02:59:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 179 ms
[2023-03-11 02:59:20] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2023-03-11 02:59:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-11 02:59:20] [INFO ] After 519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-11 02:59:20] [INFO ] After 934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 20 ms.
Support contains 49 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 192/192 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 191
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 236 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 235 transition count 190
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 10 place count 232 transition count 187
Applied a total of 10 rules in 24 ms. Remains 232 /237 variables (removed 5) and now considering 187/192 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 232/237 places, 187/192 transitions.
Incomplete random walk after 10000 steps, including 497 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 187 rows 232 cols
[2023-03-11 02:59:20] [INFO ] Computed 87 place invariants in 7 ms
[2023-03-11 02:59:20] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:59:20] [INFO ] [Nat]Absence check using 58 positive place invariants in 6 ms returned sat
[2023-03-11 02:59:20] [INFO ] [Nat]Absence check using 58 positive and 29 generalized place invariants in 5 ms returned sat
[2023-03-11 02:59:20] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:59:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:59:21] [INFO ] After 118ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 0 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 1 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
[2023-03-11 02:59:22] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:59:22] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2023-03-11 02:59:22] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2023-03-11 02:59:22] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2023-03-11 02:59:22] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2023-03-11 02:59:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1251 ms
[2023-03-11 02:59:22] [INFO ] After 1468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-11 02:59:22] [INFO ] After 1755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 47 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 187/187 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 186
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 186
Applied a total of 2 rules in 21 ms. Remains 231 /232 variables (removed 1) and now considering 186/187 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 231/232 places, 186/187 transitions.
Incomplete random walk after 10000 steps, including 518 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 186 rows 231 cols
[2023-03-11 02:59:22] [INFO ] Computed 87 place invariants in 7 ms
[2023-03-11 02:59:23] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:59:23] [INFO ] [Nat]Absence check using 59 positive place invariants in 8 ms returned sat
[2023-03-11 02:59:23] [INFO ] [Nat]Absence check using 59 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-11 02:59:23] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:59:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:59:23] [INFO ] After 100ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 02:59:23] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 0 ms to minimize.
[2023-03-11 02:59:23] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2023-03-11 02:59:23] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 0 ms to minimize.
[2023-03-11 02:59:23] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 0 ms to minimize.
[2023-03-11 02:59:23] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 0 ms to minimize.
[2023-03-11 02:59:24] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 0 ms to minimize.
[2023-03-11 02:59:24] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 0 ms to minimize.
[2023-03-11 02:59:24] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 0 ms to minimize.
[2023-03-11 02:59:24] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 0 ms to minimize.
[2023-03-11 02:59:24] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 0 ms to minimize.
[2023-03-11 02:59:24] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 0 ms to minimize.
[2023-03-11 02:59:24] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 0 ms to minimize.
[2023-03-11 02:59:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1132 ms
[2023-03-11 02:59:24] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2023-03-11 02:59:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-11 02:59:24] [INFO ] After 1450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 222 ms.
[2023-03-11 02:59:25] [INFO ] After 1970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 46 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 186/186 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 230 transition count 185
Applied a total of 2 rules in 20 ms. Remains 230 /231 variables (removed 1) and now considering 185/186 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 230/231 places, 185/186 transitions.
Incomplete random walk after 10000 steps, including 525 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 993871 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{0=1}
Probabilistic random walk after 993871 steps, saw 156789 distinct states, run finished after 3004 ms. (steps per millisecond=330 ) properties seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 230 cols
[2023-03-11 02:59:28] [INFO ] Computed 87 place invariants in 4 ms
[2023-03-11 02:59:28] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:59:28] [INFO ] [Nat]Absence check using 57 positive place invariants in 10 ms returned sat
[2023-03-11 02:59:28] [INFO ] [Nat]Absence check using 57 positive and 30 generalized place invariants in 10 ms returned sat
[2023-03-11 02:59:28] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 02:59:28] [INFO ] After 43ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:28] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-11 02:59:28] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 0 ms to minimize.
[2023-03-11 02:59:28] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 0 ms to minimize.
[2023-03-11 02:59:29] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2023-03-11 02:59:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 418 ms
[2023-03-11 02:59:29] [INFO ] After 532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-11 02:59:29] [INFO ] After 790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 26 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 185/185 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 184
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 229 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 228 transition count 183
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 4 place count 228 transition count 176
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 20 place count 219 transition count 176
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 216 transition count 173
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 216 transition count 173
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 40 place count 209 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 207 transition count 164
Applied a total of 42 rules in 55 ms. Remains 207 /230 variables (removed 23) and now considering 164/185 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 207/230 places, 164/185 transitions.
Incomplete random walk after 10000 steps, including 728 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 166 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished probabilistic random walk after 145327 steps, run visited all 1 properties in 450 ms. (steps per millisecond=322 )
Probabilistic random walk after 145327 steps, saw 30356 distinct states, run finished after 450 ms. (steps per millisecond=322 ) properties seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 40596 ms.
starting LoLA
BK_INPUT BusinessProcesses-PT-17
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityCardinality

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

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

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

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678503571053

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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
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: 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: 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: 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: 4 transitions removed,4 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: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: LAUNCH task # 59 (type EXCL) for 6 BusinessProcesses-PT-17-ReachabilityCardinality-02
lola: time limit : 224 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 48 (type FNDP) for 9 BusinessProcesses-PT-17-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 49 (type EQUN) for 9 BusinessProcesses-PT-17-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 51 (type SRCH) for 9 BusinessProcesses-PT-17-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 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: 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: 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: 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: FINISHED task # 48 (type FNDP) for BusinessProcesses-PT-17-ReachabilityCardinality-03
lola: result : true
lola: fired transitions : 2
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 49 (type EQUN) for BusinessProcesses-PT-17-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 51 (type SRCH) for BusinessProcesses-PT-17-ReachabilityCardinality-03 (obsolete)
lola: LAUNCH task # 99 (type FNDP) for 27 BusinessProcesses-PT-17-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 100 (type EQUN) for 27 BusinessProcesses-PT-17-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 102 (type SRCH) for 27 BusinessProcesses-PT-17-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: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: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 # 59 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-02
lola: result : true
lola: markings : 43
lola: fired transitions : 42
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 134 (type EXCL) for 24 BusinessProcesses-PT-17-ReachabilityCardinality-08
lola: time limit : 257 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-49.sara.
lola: FINISHED task # 134 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-08
lola: result : true
lola: markings : 134
lola: fired transitions : 135
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 71 (type EXCL) for 15 BusinessProcesses-PT-17-ReachabilityCardinality-05
lola: time limit : 276 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
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-100.sara.

lola: FINISHED task # 49 (type EQUN) for BusinessProcesses-PT-17-ReachabilityCardinality-03
lola: result : true
lola: FINISHED task # 71 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-05
lola: result : true
lola: markings : 54
lola: fired transitions : 53
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 144 (type EXCL) for 42 BusinessProcesses-PT-17-ReachabilityCardinality-14
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 # 144 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-14
lola: result : true
lola: markings : 41
lola: fired transitions : 40
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 65 (type EXCL) for 3 BusinessProcesses-PT-17-ReachabilityCardinality-01
lola: time limit : 327 sec
lola: memory limit: 32 pages
lola: FINISHED task # 65 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-01
lola: result : true
lola: markings : 16
lola: fired transitions : 15
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 110 (type EXCL) for 36 BusinessProcesses-PT-17-ReachabilityCardinality-12
lola: time limit : 359 sec
lola: memory limit: 32 pages
lola: FINISHED task # 110 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-12
lola: result : true
lola: markings : 53
lola: fired transitions : 52
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 97 (type EXCL) for 39 BusinessProcesses-PT-17-ReachabilityCardinality-13
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: FINISHED task # 97 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-13
lola: result : true
lola: markings : 16
lola: fired transitions : 15
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 137 (type EXCL) for 21 BusinessProcesses-PT-17-ReachabilityCardinality-07
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: FINISHED task # 137 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-07
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 151 (type EXCL) for 45 BusinessProcesses-PT-17-ReachabilityCardinality-15
lola: time limit : 514 sec
lola: memory limit: 32 pages
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 151 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-15
lola: result : false
lola: markings : 3581
lola: fired transitions : 4366
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 131 (type EXCL) for 30 BusinessProcesses-PT-17-ReachabilityCardinality-10
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 131 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-10
lola: result : false
lola: markings : 8631
lola: fired transitions : 11235
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 90 (type EXCL) for 18 BusinessProcesses-PT-17-ReachabilityCardinality-06
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: FINISHED task # 90 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-06
lola: result : false
lola: markings : 3751
lola: fired transitions : 4543
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 84 (type EXCL) for 12 BusinessProcesses-PT-17-ReachabilityCardinality-04
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 84 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-04
lola: result : false
lola: markings : 5408
lola: fired transitions : 6327
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 116 (type EXCL) for 33 BusinessProcesses-PT-17-ReachabilityCardinality-11
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 116 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-11
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 78 (type EXCL) for 0 BusinessProcesses-PT-17-ReachabilityCardinality-00
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: FINISHED task # 78 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-00
lola: result : true
lola: markings : 444
lola: fired transitions : 445
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 103 (type EXCL) for 27 BusinessProcesses-PT-17-ReachabilityCardinality-09
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: FINISHED task # 103 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-09
lola: result : true
lola: markings : 76
lola: fired transitions : 76
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 99 (type FNDP) for BusinessProcesses-PT-17-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 100 (type EQUN) for BusinessProcesses-PT-17-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 102 (type SRCH) for BusinessProcesses-PT-17-ReachabilityCardinality-09 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-17-ReachabilityCardinality-00: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-01: EF true tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-02: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-03: EF true findpath
BusinessProcesses-PT-17-ReachabilityCardinality-04: EF false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-05: EF true tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-06: EF false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-07: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-08: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-09: EF true tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-10: AG true tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-11: EF true tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-12: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-13: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-14: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-15: AG true 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-17"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BusinessProcesses-PT-17, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692700582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;