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-167813692800606.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-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692800606
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 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.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 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 192K 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-20-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678503873053

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-20
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:04:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:04:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:04:34] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-11 03:04:34] [INFO ] Transformed 782 places.
[2023-03-11 03:04:34] [INFO ] Transformed 697 transitions.
[2023-03-11 03:04:34] [INFO ] Found NUPN structural information;
[2023-03-11 03:04:34] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 16 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 50 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 9) seen :3
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 638 rows 719 cols
[2023-03-11 03:04:35] [INFO ] Computed 121 place invariants in 30 ms
[2023-03-11 03:04:35] [INFO ] [Real]Absence check using 78 positive place invariants in 24 ms returned sat
[2023-03-11 03:04:35] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2023-03-11 03:04:35] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:04:36] [INFO ] [Nat]Absence check using 78 positive place invariants in 22 ms returned sat
[2023-03-11 03:04:36] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2023-03-11 03:04:36] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:04:37] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 7 ms to minimize.
[2023-03-11 03:04:37] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2023-03-11 03:04:37] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 1 ms to minimize.
[2023-03-11 03:04:37] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 1 ms to minimize.
[2023-03-11 03:04:38] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2023-03-11 03:04:38] [INFO ] Deduced a trap composed of 132 places in 203 ms of which 1 ms to minimize.
[2023-03-11 03:04:38] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 1 ms to minimize.
[2023-03-11 03:04:38] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 0 ms to minimize.
[2023-03-11 03:04:38] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 0 ms to minimize.
[2023-03-11 03:04:39] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 0 ms to minimize.
[2023-03-11 03:04:39] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 0 ms to minimize.
[2023-03-11 03:04:39] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 0 ms to minimize.
[2023-03-11 03:04:39] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 0 ms to minimize.
[2023-03-11 03:04:39] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 1 ms to minimize.
[2023-03-11 03:04:40] [INFO ] Deduced a trap composed of 127 places in 141 ms of which 0 ms to minimize.
[2023-03-11 03:04:40] [INFO ] Deduced a trap composed of 130 places in 129 ms of which 0 ms to minimize.
[2023-03-11 03:04:40] [INFO ] Deduced a trap composed of 129 places in 136 ms of which 1 ms to minimize.
[2023-03-11 03:04:40] [INFO ] Deduced a trap composed of 127 places in 112 ms of which 0 ms to minimize.
[2023-03-11 03:04:40] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 0 ms to minimize.
[2023-03-11 03:04:40] [INFO ] Deduced a trap composed of 124 places in 140 ms of which 0 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 124 places in 157 ms of which 1 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 1 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 0 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 1 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2023-03-11 03:04:41] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 0 ms to minimize.
[2023-03-11 03:04:42] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2023-03-11 03:04:42] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
[2023-03-11 03:04:42] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2023-03-11 03:04:42] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2023-03-11 03:04:42] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2023-03-11 03:04:42] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 0 ms to minimize.
[2023-03-11 03:04:42] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2023-03-11 03:04:42] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 5823 ms
[2023-03-11 03:04:42] [INFO ] Deduced a trap composed of 159 places in 213 ms of which 2 ms to minimize.
[2023-03-11 03:04:43] [INFO ] Deduced a trap composed of 167 places in 164 ms of which 0 ms to minimize.
[2023-03-11 03:04:43] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 1 ms to minimize.
[2023-03-11 03:04:43] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 0 ms to minimize.
[2023-03-11 03:04:43] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 1 ms to minimize.
[2023-03-11 03:04:43] [INFO ] Deduced a trap composed of 157 places in 163 ms of which 1 ms to minimize.
[2023-03-11 03:04:44] [INFO ] Deduced a trap composed of 157 places in 151 ms of which 1 ms to minimize.
[2023-03-11 03:04:44] [INFO ] Deduced a trap composed of 156 places in 158 ms of which 0 ms to minimize.
[2023-03-11 03:04:44] [INFO ] Deduced a trap composed of 185 places in 145 ms of which 1 ms to minimize.
[2023-03-11 03:04:44] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2023-03-11 03:04:44] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2023-03-11 03:04:44] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2023-03-11 03:04:44] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2023-03-11 03:04:44] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2023-03-11 03:04:45] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2023-03-11 03:04:45] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2023-03-11 03:04:45] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2444 ms
[2023-03-11 03:04:45] [INFO ] Deduced a trap composed of 146 places in 204 ms of which 1 ms to minimize.
[2023-03-11 03:04:45] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 0 ms to minimize.
[2023-03-11 03:04:45] [INFO ] Deduced a trap composed of 154 places in 167 ms of which 2 ms to minimize.
[2023-03-11 03:04:46] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 1 ms to minimize.
[2023-03-11 03:04:46] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 0 ms to minimize.
[2023-03-11 03:04:46] [INFO ] Deduced a trap composed of 144 places in 189 ms of which 0 ms to minimize.
[2023-03-11 03:04:46] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 6 ms to minimize.
[2023-03-11 03:04:47] [INFO ] Deduced a trap composed of 57 places in 195 ms of which 1 ms to minimize.
[2023-03-11 03:04:47] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 1 ms to minimize.
[2023-03-11 03:04:47] [INFO ] Deduced a trap composed of 163 places in 195 ms of which 2 ms to minimize.
[2023-03-11 03:04:47] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 1 ms to minimize.
[2023-03-11 03:04:48] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 1 ms to minimize.
[2023-03-11 03:04:48] [INFO ] Deduced a trap composed of 169 places in 200 ms of which 1 ms to minimize.
[2023-03-11 03:04:48] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 1 ms to minimize.
[2023-03-11 03:04:49] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2023-03-11 03:04:49] [INFO ] Deduced a trap composed of 165 places in 223 ms of which 6 ms to minimize.
[2023-03-11 03:04:49] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 0 ms to minimize.
[2023-03-11 03:04:50] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 2 ms to minimize.
[2023-03-11 03:04:50] [INFO ] Deduced a trap composed of 56 places in 243 ms of which 1 ms to minimize.
[2023-03-11 03:04:50] [INFO ] Deduced a trap composed of 161 places in 180 ms of which 1 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Deduced a trap composed of 167 places in 184 ms of which 1 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Deduced a trap composed of 59 places in 172 ms of which 0 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 1 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 1 ms to minimize.
[2023-03-11 03:04:51] [INFO ] Deduced a trap composed of 81 places in 188 ms of which 0 ms to minimize.
[2023-03-11 03:04:52] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 1 ms to minimize.
[2023-03-11 03:04:52] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-11 03:04:52] [INFO ] Deduced a trap composed of 150 places in 170 ms of which 0 ms to minimize.
[2023-03-11 03:04:52] [INFO ] Deduced a trap composed of 84 places in 195 ms of which 1 ms to minimize.
[2023-03-11 03:04:53] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 1 ms to minimize.
[2023-03-11 03:04:53] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 0 ms to minimize.
[2023-03-11 03:04:53] [INFO ] Deduced a trap composed of 80 places in 171 ms of which 1 ms to minimize.
[2023-03-11 03:04:53] [INFO ] Deduced a trap composed of 155 places in 167 ms of which 1 ms to minimize.
[2023-03-11 03:04:54] [INFO ] Deduced a trap composed of 86 places in 205 ms of which 1 ms to minimize.
[2023-03-11 03:04:54] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 1 ms to minimize.
[2023-03-11 03:04:54] [INFO ] Deduced a trap composed of 56 places in 201 ms of which 1 ms to minimize.
[2023-03-11 03:04:54] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 1 ms to minimize.
[2023-03-11 03:04:54] [INFO ] Deduced a trap composed of 149 places in 199 ms of which 1 ms to minimize.
[2023-03-11 03:04:55] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 1 ms to minimize.
[2023-03-11 03:04:55] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 0 ms to minimize.
[2023-03-11 03:04:55] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 1 ms to minimize.
[2023-03-11 03:04:55] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 0 ms to minimize.
[2023-03-11 03:04:55] [INFO ] Deduced a trap composed of 151 places in 127 ms of which 1 ms to minimize.
[2023-03-11 03:04:56] [INFO ] Deduced a trap composed of 150 places in 125 ms of which 0 ms to minimize.
[2023-03-11 03:04:56] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 0 ms to minimize.
[2023-03-11 03:04:56] [INFO ] Deduced a trap composed of 153 places in 132 ms of which 0 ms to minimize.
[2023-03-11 03:04:56] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 11190 ms
[2023-03-11 03:04:56] [INFO ] Deduced a trap composed of 146 places in 182 ms of which 0 ms to minimize.
[2023-03-11 03:04:56] [INFO ] Deduced a trap composed of 149 places in 134 ms of which 1 ms to minimize.
[2023-03-11 03:04:57] [INFO ] Deduced a trap composed of 177 places in 131 ms of which 1 ms to minimize.
[2023-03-11 03:04:57] [INFO ] Deduced a trap composed of 160 places in 158 ms of which 1 ms to minimize.
[2023-03-11 03:04:57] [INFO ] Deduced a trap composed of 153 places in 118 ms of which 0 ms to minimize.
[2023-03-11 03:04:57] [INFO ] Deduced a trap composed of 160 places in 126 ms of which 1 ms to minimize.
[2023-03-11 03:04:57] [INFO ] Deduced a trap composed of 152 places in 129 ms of which 1 ms to minimize.
[2023-03-11 03:04:57] [INFO ] Deduced a trap composed of 153 places in 129 ms of which 1 ms to minimize.
[2023-03-11 03:04:58] [INFO ] Deduced a trap composed of 155 places in 131 ms of which 0 ms to minimize.
[2023-03-11 03:04:58] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 0 ms to minimize.
[2023-03-11 03:04:58] [INFO ] Deduced a trap composed of 154 places in 152 ms of which 0 ms to minimize.
[2023-03-11 03:04:58] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 0 ms to minimize.
[2023-03-11 03:04:58] [INFO ] Deduced a trap composed of 156 places in 141 ms of which 0 ms to minimize.
[2023-03-11 03:04:58] [INFO ] Deduced a trap composed of 136 places in 140 ms of which 1 ms to minimize.
[2023-03-11 03:04:59] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 0 ms to minimize.
[2023-03-11 03:04:59] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 1 ms to minimize.
[2023-03-11 03:04:59] [INFO ] Deduced a trap composed of 153 places in 124 ms of which 1 ms to minimize.
[2023-03-11 03:04:59] [INFO ] Deduced a trap composed of 133 places in 141 ms of which 0 ms to minimize.
[2023-03-11 03:04:59] [INFO ] Deduced a trap composed of 158 places in 127 ms of which 0 ms to minimize.
[2023-03-11 03:04:59] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 1 ms to minimize.
[2023-03-11 03:05:00] [INFO ] Deduced a trap composed of 136 places in 136 ms of which 1 ms to minimize.
[2023-03-11 03:05:00] [INFO ] Deduced a trap composed of 139 places in 137 ms of which 0 ms to minimize.
[2023-03-11 03:05:00] [INFO ] Deduced a trap composed of 142 places in 141 ms of which 0 ms to minimize.
[2023-03-11 03:05:00] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 0 ms to minimize.
[2023-03-11 03:05:00] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 1 ms to minimize.
[2023-03-11 03:05:00] [INFO ] Deduced a trap composed of 136 places in 127 ms of which 1 ms to minimize.
[2023-03-11 03:05:01] [INFO ] Deduced a trap composed of 156 places in 183 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 03:05:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:05:01] [INFO ] After 25161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 95 ms.
Support contains 59 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 350 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 11 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 692 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 692 transition count 498
Reduce places removed 124 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 144 rules applied. Total rules applied 270 place count 568 transition count 478
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 290 place count 548 transition count 478
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 290 place count 548 transition count 385
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 493 place count 438 transition count 385
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 561 place count 370 transition count 317
Iterating global reduction 3 with 68 rules applied. Total rules applied 629 place count 370 transition count 317
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 629 place count 370 transition count 313
Deduced a syphon composed of 4 places in 0 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 638 place count 365 transition count 313
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 820 place count 274 transition count 222
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 823 place count 274 transition count 219
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 826 place count 271 transition count 219
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 830 place count 271 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 831 place count 270 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 832 place count 269 transition count 218
Applied a total of 832 rules in 206 ms. Remains 269 /719 variables (removed 450) and now considering 218/638 (removed 420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 269/719 places, 218/638 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 6) seen :4
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 218 rows 269 cols
[2023-03-11 03:05:01] [INFO ] Computed 89 place invariants in 4 ms
[2023-03-11 03:05:01] [INFO ] [Real]Absence check using 65 positive place invariants in 47 ms returned sat
[2023-03-11 03:05:01] [INFO ] [Real]Absence check using 65 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-11 03:05:01] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:05:01] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-11 03:05:01] [INFO ] [Nat]Absence check using 65 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-11 03:05:02] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:05:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 03:05:02] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:05:02] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 0 ms to minimize.
[2023-03-11 03:05:02] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-11 03:05:02] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2023-03-11 03:05:02] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2023-03-11 03:05:02] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-11 03:05:02] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 0 ms to minimize.
[2023-03-11 03:05:02] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
[2023-03-11 03:05:02] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 0 ms to minimize.
[2023-03-11 03:05:02] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2023-03-11 03:05:02] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2023-03-11 03:05:02] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 0 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 0 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 0 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 0 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 0 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 0 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2023-03-11 03:05:03] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
[2023-03-11 03:05:04] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2023-03-11 03:05:04] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2023-03-11 03:05:04] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
[2023-03-11 03:05:04] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2025 ms
[2023-03-11 03:05:04] [INFO ] After 2091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-11 03:05:04] [INFO ] After 2278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 14 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 218/218 transitions.
Graph (complete) has 816 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 268 transition count 204
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 255 transition count 204
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 255 transition count 193
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 54 place count 239 transition count 193
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 232 transition count 186
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 232 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 68 place count 232 transition count 185
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 231 transition count 185
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 128 place count 201 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 200 transition count 160
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 200 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 199 transition count 159
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 199 transition count 159
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 197 transition count 157
Applied a total of 135 rules in 79 ms. Remains 197 /269 variables (removed 72) and now considering 157/218 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 197/269 places, 157/218 transitions.
Incomplete random walk after 10000 steps, including 314 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 7268 steps, including 51 resets, run visited all 1 properties in 12 ms. (steps per millisecond=605 )
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 29848 ms.
starting LoLA
BK_INPUT BusinessProcesses-PT-20
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityCardinality

FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

BK_STOP 1678503906680

--------------------
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: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:159
lola: rewrite Frontend/Parser/formula_rewrite.k:150
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: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:159
lola: rewrite Frontend/Parser/formula_rewrite.k:150
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: 59 transitions removed,63 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH INITIAL
lola: LAUNCH task # 7 (type CNST) for 6 BusinessProcesses-PT-20-ReachabilityCardinality-02
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 7 (type CNST) for BusinessProcesses-PT-20-ReachabilityCardinality-02
lola: result : true
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH INITIAL
lola: LAUNCH task # 22 (type CNST) for 21 BusinessProcesses-PT-20-ReachabilityCardinality-07
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: LAUNCH INITIAL
lola: LAUNCH task # 31 (type CNST) for 30 BusinessProcesses-PT-20-ReachabilityCardinality-10
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: LAUNCH INITIAL
lola: LAUNCH task # 34 (type CNST) for 33 BusinessProcesses-PT-20-ReachabilityCardinality-11
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 34 (type CNST) for BusinessProcesses-PT-20-ReachabilityCardinality-11
lola: result : false
lola: FINISHED task # 31 (type CNST) for BusinessProcesses-PT-20-ReachabilityCardinality-10
lola: result : true
lola: FINISHED task # 22 (type CNST) for BusinessProcesses-PT-20-ReachabilityCardinality-07
lola: result : false
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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 57 (type EXCL) for 15 BusinessProcesses-PT-20-ReachabilityCardinality-05
lola: time limit : 239 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 49 (type FNDP) for 15 BusinessProcesses-PT-20-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 15 BusinessProcesses-PT-20-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 56 (type SRCH) for 15 BusinessProcesses-PT-20-ReachabilityCardinality-05
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
lola: FINISHED task # 56 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-05
lola: result : true
lola: markings : 69
lola: fired transitions : 69
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 49 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 50 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 57 (type EXCL) for BusinessProcesses-PT-20-ReachabilityCardinality-05 (obsolete)
lola: LAUNCH task # 60 (type EXCL) for 12 BusinessProcesses-PT-20-ReachabilityCardinality-04
lola: time limit : 257 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 52 (type FNDP) for 12 BusinessProcesses-PT-20-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 54 (type EQUN) for 12 BusinessProcesses-PT-20-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 59 (type SRCH) for 12 BusinessProcesses-PT-20-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 59 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-04
lola: result : true
lola: markings : 45
lola: fired transitions : 44
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 57 (type EXCL) for BusinessProcesses-PT-20-ReachabilityCardinality-05
lola: result : true
lola: markings : 348
lola: fired transitions : 392
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 49 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-05
lola: result : true
lola: fired transitions : 70
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 60 (type EXCL) for BusinessProcesses-PT-20-ReachabilityCardinality-04
lola: result : true
lola: markings : 237
lola: fired transitions : 246
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 52 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 54 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-04 (obsolete)
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 # 52 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 43
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: LAUNCH task # 67 (type EXCL) for 24 BusinessProcesses-PT-20-ReachabilityCardinality-08
lola: time limit : 327 sec
lola: memory limit: 32 pages
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 63 (type FNDP) for 24 BusinessProcesses-PT-20-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 64 (type EQUN) for 24 BusinessProcesses-PT-20-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 66 (type SRCH) for 24 BusinessProcesses-PT-20-ReachabilityCardinality-08
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: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
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-54.sara.
lola: sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-50.sara.FINISHED task # 66 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-08

lola: result : false
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 63 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 64 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 67 (type EXCL) for BusinessProcesses-PT-20-ReachabilityCardinality-08 (obsolete)
lola: LAUNCH task # 79 (type EXCL) for 39 BusinessProcesses-PT-20-ReachabilityCardinality-13
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 75 (type FNDP) for 39 BusinessProcesses-PT-20-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 76 (type EQUN) for 39 BusinessProcesses-PT-20-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 78 (type SRCH) for 39 BusinessProcesses-PT-20-ReachabilityCardinality-13
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
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 79 (type EXCL) for BusinessProcesses-PT-20-ReachabilityCardinality-13
lola: result : true
lola: markings : 21
lola: fired transitions : 20
lola: time used : 0.000000
lola: memory pages used : 1

lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 75 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 76 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 78 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-13 (obsolete)
lola: LAUNCH task # 88 (type EXCL) for 36 BusinessProcesses-PT-20-ReachabilityCardinality-12
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 70 (type FNDP) for 42 BusinessProcesses-PT-20-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 73 (type EQUN) for 42 BusinessProcesses-PT-20-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 90 (type SRCH) for 42 BusinessProcesses-PT-20-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 75 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-13
lola: result : true
lola: fired transitions : 3
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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: FINISHED task # 54 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-04
lola: result : true
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-76.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-64.sara.
lola: FINISHED task # 90 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-14
lola: result : true
lola: markings : 248
lola: fired transitions : 482
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 70 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 73 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-14 (obsolete)
lola: LAUNCH task # 101 (type FNDP) for 18 BusinessProcesses-PT-20-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 102 (type EQUN) for 18 BusinessProcesses-PT-20-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 104 (type SRCH) for 18 BusinessProcesses-PT-20-ReachabilityCardinality-06
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: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
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 88 (type EXCL) for BusinessProcesses-PT-20-ReachabilityCardinality-12
lola: result : true
lola: markings : 207
lola: fired transitions : 217
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 113 (type EXCL) for 9 BusinessProcesses-PT-20-ReachabilityCardinality-03
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-102.sara.

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 # 104 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-06
lola: result : false
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 101 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 102 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-06 (obsolete)
lola: LAUNCH task # 95 (type FNDP) for 45 BusinessProcesses-PT-20-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 96 (type EQUN) for 45 BusinessProcesses-PT-20-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 98 (type SRCH) for 45 BusinessProcesses-PT-20-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 98 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-15
lola: result : true
lola: markings : 78
lola: fired transitions : 89
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 95 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 96 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-15 (obsolete)
lola: LAUNCH task # 81 (type FNDP) for 3 BusinessProcesses-PT-20-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 82 (type EQUN) for 3 BusinessProcesses-PT-20-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 108 (type SRCH) for 3 BusinessProcesses-PT-20-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 76 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-13
lola: result : true
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 101 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-06
lola: result : unknown
lola: fired transitions : 34557
lola: tried executions : 17280
lola: time used : 0.000000
lola: memory pages used : 0
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: FINISHED task # 95 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-15
lola: result : true
lola: fired transitions : 695
lola: tried executions : 27
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 102 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-06
lola: result : false
lola: FINISHED task # 70 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-14
lola: result : true
lola: fired transitions : 6047
lola: tried executions : 216
lola: time used : 1.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-73.sara.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-82.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-96.sara.
lola: FINISHED task # 82 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-01
lola: result : false
lola: CANCELED task # 81 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 108 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-01 (obsolete)
sara: place or transition ordering is non-deterministic
lola: LAUNCH task # 116 (type FNDP) for 0 BusinessProcesses-PT-20-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 118 (type EQUN) for 0 BusinessProcesses-PT-20-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 120 (type SRCH) for 0 BusinessProcesses-PT-20-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 120 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-00
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 116 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 118 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-00 (obsolete)
lola: LAUNCH task # 93 (type FNDP) for 27 BusinessProcesses-PT-20-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 107 (type EQUN) for 27 BusinessProcesses-PT-20-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 122 (type SRCH) for 27 BusinessProcesses-PT-20-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-118.sara.

lola: FINISHED task # 81 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-01
lola: result : unknown
lola: fired transitions : 26369
lola: tried executions : 2513
lola: time used : 1.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 118 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-00
lola: result : true
lola: FINISHED task # 93 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-09
lola: result : true
lola: fired transitions : 37
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 107 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 122 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-09 (obsolete)
lola: LAUNCH task # 94 (type FNDP) for 9 BusinessProcesses-PT-20-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 110 (type EQUN) for 9 BusinessProcesses-PT-20-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 112 (type SRCH) for 9 BusinessProcesses-PT-20-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 116 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-00
lola: result : true
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-107.sara.
sara: place or transition ordering is non-deterministic

sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-110.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 107 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-09
lola: result : true
lola: FINISHED task # 110 (type EQUN) for BusinessProcesses-PT-20-ReachabilityCardinality-03
lola: result : true
lola: CANCELED task # 94 (type FNDP) for BusinessProcesses-PT-20-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 112 (type SRCH) for BusinessProcesses-PT-20-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 113 (type EXCL) for BusinessProcesses-PT-20-ReachabilityCardinality-03 (obsolete)
lola: Portfolio finished: no open formulas

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


Time elapsed: 2 secs. Pages in use: 3

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

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