About the Execution of LoLa+red for BusinessProcesses-PT-14
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
372.279 | 32067.00 | 50064.00 | 120.00 | FFFFTTTFTTTTFTTF | normal |
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-167813692700558.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-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700558
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 156K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678503343012
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-14
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:55:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:55:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:55:45] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-11 02:55:45] [INFO ] Transformed 624 places.
[2023-03-11 02:55:45] [INFO ] Transformed 564 transitions.
[2023-03-11 02:55:45] [INFO ] Found NUPN structural information;
[2023-03-11 02:55:45] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 67 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 13) seen :3
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 556 rows 616 cols
[2023-03-11 02:55:46] [INFO ] Computed 99 place invariants in 20 ms
[2023-03-11 02:55:46] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 02:55:47] [INFO ] [Nat]Absence check using 60 positive place invariants in 39 ms returned sat
[2023-03-11 02:55:47] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 57 ms returned sat
[2023-03-11 02:55:48] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-11 02:55:48] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 10 ms to minimize.
[2023-03-11 02:55:48] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 1 ms to minimize.
[2023-03-11 02:55:48] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:55:49] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 2 ms to minimize.
[2023-03-11 02:55:49] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 1 ms to minimize.
[2023-03-11 02:55:49] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2023-03-11 02:55:49] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2023-03-11 02:55:49] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2023-03-11 02:55:49] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:55:50] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:55:50] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 7 ms to minimize.
[2023-03-11 02:55:50] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2023-03-11 02:55:50] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2023-03-11 02:55:50] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 0 ms to minimize.
[2023-03-11 02:55:50] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 1 ms to minimize.
[2023-03-11 02:55:50] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2875 ms
[2023-03-11 02:55:51] [INFO ] Deduced a trap composed of 154 places in 268 ms of which 1 ms to minimize.
[2023-03-11 02:55:51] [INFO ] Deduced a trap composed of 92 places in 245 ms of which 1 ms to minimize.
[2023-03-11 02:55:51] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 1 ms to minimize.
[2023-03-11 02:55:52] [INFO ] Deduced a trap composed of 142 places in 236 ms of which 1 ms to minimize.
[2023-03-11 02:55:52] [INFO ] Deduced a trap composed of 144 places in 201 ms of which 1 ms to minimize.
[2023-03-11 02:55:52] [INFO ] Deduced a trap composed of 147 places in 244 ms of which 0 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 153 places in 346 ms of which 3 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 1 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 0 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 140 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 147 places in 123 ms of which 1 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 150 places in 124 ms of which 0 ms to minimize.
[2023-03-11 02:55:53] [INFO ] Deduced a trap composed of 145 places in 119 ms of which 0 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 150 places in 158 ms of which 0 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 0 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 136 places in 136 ms of which 1 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:55:54] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 2 ms to minimize.
[2023-03-11 02:55:55] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2023-03-11 02:55:55] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 1 ms to minimize.
[2023-03-11 02:55:55] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2023-03-11 02:55:55] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4365 ms
[2023-03-11 02:55:55] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 1 ms to minimize.
[2023-03-11 02:55:55] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:55:56] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 1 ms to minimize.
[2023-03-11 02:55:56] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2023-03-11 02:55:56] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 1 ms to minimize.
[2023-03-11 02:55:56] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:55:56] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2023-03-11 02:55:56] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:55:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1466 ms
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 0 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 0 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 0 ms to minimize.
[2023-03-11 02:55:57] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 0 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 4 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2023-03-11 02:55:58] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-11 02:55:59] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:55:59] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 0 ms to minimize.
[2023-03-11 02:55:59] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 1 ms to minimize.
[2023-03-11 02:55:59] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2023-03-11 02:55:59] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 0 ms to minimize.
[2023-03-11 02:55:59] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2023-03-11 02:55:59] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2023-03-11 02:55:59] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2023-03-11 02:56:00] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 0 ms to minimize.
[2023-03-11 02:56:00] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 1 ms to minimize.
[2023-03-11 02:56:00] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 0 ms to minimize.
[2023-03-11 02:56:00] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2023-03-11 02:56:00] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 0 ms to minimize.
[2023-03-11 02:56:00] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2023-03-11 02:56:00] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 0 ms to minimize.
[2023-03-11 02:56:00] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 0 ms to minimize.
[2023-03-11 02:56:01] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 0 ms to minimize.
[2023-03-11 02:56:01] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2023-03-11 02:56:01] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2023-03-11 02:56:01] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 0 ms to minimize.
[2023-03-11 02:56:01] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 4 ms to minimize.
[2023-03-11 02:56:01] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 0 ms to minimize.
[2023-03-11 02:56:01] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2023-03-11 02:56:01] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 4817 ms
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 1 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 127 places in 191 ms of which 1 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 56 places in 201 ms of which 1 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 132 places in 192 ms of which 0 ms to minimize.
[2023-03-11 02:56:02] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 0 ms to minimize.
[2023-03-11 02:56:03] [INFO ] Deduced a trap composed of 135 places in 179 ms of which 0 ms to minimize.
[2023-03-11 02:56:03] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 0 ms to minimize.
[2023-03-11 02:56:03] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 0 ms to minimize.
[2023-03-11 02:56:03] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 1 ms to minimize.
[2023-03-11 02:56:04] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 0 ms to minimize.
[2023-03-11 02:56:04] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 2 ms to minimize.
[2023-03-11 02:56:04] [INFO ] Deduced a trap composed of 63 places in 159 ms of which 1 ms to minimize.
[2023-03-11 02:56:04] [INFO ] Deduced a trap composed of 140 places in 184 ms of which 1 ms to minimize.
[2023-03-11 02:56:04] [INFO ] Deduced a trap composed of 151 places in 141 ms of which 1 ms to minimize.
[2023-03-11 02:56:04] [INFO ] Deduced a trap composed of 156 places in 151 ms of which 0 ms to minimize.
[2023-03-11 02:56:05] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 0 ms to minimize.
[2023-03-11 02:56:05] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 1 ms to minimize.
[2023-03-11 02:56:05] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 0 ms to minimize.
[2023-03-11 02:56:05] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 6 ms to minimize.
[2023-03-11 02:56:05] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 148 places in 179 ms of which 1 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 0 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 157 places in 158 ms of which 0 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:56:06] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 131 places in 226 ms of which 1 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 135 places in 199 ms of which 0 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 161 places in 136 ms of which 0 ms to minimize.
[2023-03-11 02:56:07] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 1 ms to minimize.
[2023-03-11 02:56:08] [INFO ] Deduced a trap composed of 138 places in 244 ms of which 1 ms to minimize.
[2023-03-11 02:56:08] [INFO ] Deduced a trap composed of 147 places in 200 ms of which 1 ms to minimize.
[2023-03-11 02:56:08] [INFO ] Deduced a trap composed of 153 places in 215 ms of which 3 ms to minimize.
[2023-03-11 02:56:09] [INFO ] Deduced a trap composed of 147 places in 1130 ms of which 26 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 1 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 151 places in 212 ms of which 1 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 143 places in 204 ms of which 0 ms to minimize.
[2023-03-11 02:56:10] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 1 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 149 places in 169 ms of which 0 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 132 places in 177 ms of which 1 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 152 places in 169 ms of which 1 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 149 places in 135 ms of which 0 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 0 ms to minimize.
[2023-03-11 02:56:11] [INFO ] Deduced a trap composed of 157 places in 130 ms of which 0 ms to minimize.
[2023-03-11 02:56:12] [INFO ] Deduced a trap composed of 140 places in 136 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:56:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:56:12] [INFO ] After 25149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 125 ms.
Support contains 49 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 309 edges and 616 vertex of which 7 / 616 are part of one of the 1 SCC in 13 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1252 edges and 610 vertex of which 604 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 604 transition count 440
Reduce places removed 107 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 125 rules applied. Total rules applied 234 place count 497 transition count 422
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 252 place count 479 transition count 422
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 252 place count 479 transition count 341
Deduced a syphon composed of 81 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 426 place count 386 transition count 341
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 491 place count 321 transition count 276
Iterating global reduction 3 with 65 rules applied. Total rules applied 556 place count 321 transition count 276
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 556 place count 321 transition count 271
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 567 place count 315 transition count 271
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 725 place count 235 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 727 place count 234 transition count 197
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 729 place count 234 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 731 place count 232 transition count 195
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 734 place count 232 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 735 place count 231 transition count 194
Applied a total of 735 rules in 174 ms. Remains 231 /616 variables (removed 385) and now considering 194/556 (removed 362) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 231/616 places, 194/556 transitions.
Incomplete random walk after 10000 steps, including 195 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 7) seen :4
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 2803 steps, including 11 resets, run visited all 1 properties in 6 ms. (steps per millisecond=467 )
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 27573 ms.
starting LoLA
BK_INPUT BusinessProcesses-PT-14
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityCardinality
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678503375079
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 1.000000 secs.
lola: Rule S: 8 transitions removed,8 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: 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: 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: LAUNCH task # 60 (type EXCL) for 21 BusinessProcesses-PT-14-ReachabilityCardinality-07
lola: time limit : 199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 49 (type FNDP) for 9 BusinessProcesses-PT-14-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 9 BusinessProcesses-PT-14-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type SRCH) for 9 BusinessProcesses-PT-14-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 49 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-03
lola: result : true
lola: fired transitions : 25
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 50 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 52 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-03 (obsolete)
lola: LAUNCH task # 63 (type FNDP) for 30 BusinessProcesses-PT-14-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 64 (type EQUN) for 30 BusinessProcesses-PT-14-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 66 (type SRCH) for 30 BusinessProcesses-PT-14-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 60 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-07
lola: result : true
lola: markings : 32
lola: fired transitions : 31
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 67 (type EXCL) for 30 BusinessProcesses-PT-14-ReachabilityCardinality-10
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: time limit : 211 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-50.sara.
lola: FINISHED task # 66 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-10
lola: result : false
lola: markings : 325
lola: fired transitions : 489
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 63 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 64 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 67 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-10 (obsolete)
lola: FINISHED task # 63 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-10
lola: result : unknown
lola: fired transitions : 13493
lola: tried executions : 1210
lola: time used : 0.000000
lola: memory pages used : 0
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-64.sara.
lola: FINISHED task # 50 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-03
lola: result : true
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: Created skeleton in 0.000000 secs.
sara: place or transition ordering is non-deterministic
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: 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: LAUNCH task # 80 (type EXCL) for 0 BusinessProcesses-PT-14-ReachabilityCardinality-00
lola: time limit : 299 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 73 (type FNDP) for 24 BusinessProcesses-PT-14-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 74 (type EQUN) for 24 BusinessProcesses-PT-14-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 76 (type SRCH) for 24 BusinessProcesses-PT-14-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 73 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-08
lola: result : true
lola: fired transitions : 1056
lola: tried executions : 100
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 74 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 76 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-08 (obsolete)
lola: LAUNCH task # 84 (type FNDP) for 18 BusinessProcesses-PT-14-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 85 (type EQUN) for 18 BusinessProcesses-PT-14-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 87 (type SRCH) for 18 BusinessProcesses-PT-14-ReachabilityCardinality-06
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: FINISHED task # 87 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-06
lola: result : false
lola: markings : 319
lola: fired transitions : 461
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 84 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 85 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-06 (obsolete)
lola: LAUNCH task # 70 (type FNDP) for 0 BusinessProcesses-PT-14-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 71 (type EQUN) for 0 BusinessProcesses-PT-14-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 79 (type SRCH) for 0 BusinessProcesses-PT-14-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 84 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-06
lola: result : unknown
lola: fired transitions : 4441
lola: tried executions : 339
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 70 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-00
lola: result : true
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 80 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-00
lola: result : true
lola: markings : 2
lola: fired transitions : 1
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 # 71 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 79 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-00 (obsolete)
lola: LAUNCH task # 97 (type EXCL) for 36 BusinessProcesses-PT-14-ReachabilityCardinality-12
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 93 (type FNDP) for 36 BusinessProcesses-PT-14-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 94 (type EQUN) for 36 BusinessProcesses-PT-14-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 96 (type SRCH) for 36 BusinessProcesses-PT-14-ReachabilityCardinality-12
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: FINISHED task # 97 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-12
lola: result : true
lola: markings : 47
lola: fired transitions : 46
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 93 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 94 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 96 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-12 (obsolete)
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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 108 (type EXCL) for 45 BusinessProcesses-PT-14-ReachabilityCardinality-15
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 102 (type FNDP) for 45 BusinessProcesses-PT-14-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-71.sara.
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 103 (type EQUN) for 45 BusinessProcesses-PT-14-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 107 (type SRCH) for 45 BusinessProcesses-PT-14-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 71 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-00
lola: result : true
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-85.sara.
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
lola: FINISHED task # 107 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-15
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:711
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-103.sara.
sara: place or transition ordering is non-deterministic
lola: CANCELED task # 102 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 103 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 108 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-15 (obsolete)
lola: LAUNCH task # 101 (type EXCL) for 39 BusinessProcesses-PT-14-ReachabilityCardinality-13
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 83 (type FNDP) for 39 BusinessProcesses-PT-14-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 90 (type EQUN) for 39 BusinessProcesses-PT-14-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 100 (type SRCH) for 39 BusinessProcesses-PT-14-ReachabilityCardinality-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: 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: FINISHED task # 102 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-15
lola: result : unknown
lola: fired transitions : 2128
lola: tried executions : 349
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: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: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 # 108 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-15
lola: result : true
lola: markings : 2475
lola: fired transitions : 3648
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 101 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-13
lola: result : true
lola: markings : 3310
lola: fired transitions : 4487
lola: time used : 0.000000
lola: memory pages used : 1
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-94.sara.
lola: CANCELED task # 83 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 90 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-13 (obsolete)
lola: CANCELED task # 100 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-13 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 153 (type EXCL) for 15 BusinessProcesses-PT-14-ReachabilityCardinality-05
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 122 (type FNDP) for 6 BusinessProcesses-PT-14-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 123 (type EQUN) for 6 BusinessProcesses-PT-14-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 125 (type SRCH) for 6 BusinessProcesses-PT-14-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-74.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 103 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-15
lola: result : true
lola: FINISHED task # 125 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-02
lola: result : true
lola: markings : 13
lola: fired transitions : 12
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 122 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-02
lola: result : true
lola: fired transitions : 11
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 123 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-02 (obsolete)
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-90.sara.
lola: LAUNCH task # 141 (type FNDP) for 3 BusinessProcesses-PT-14-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 142 (type EQUN) for 3 BusinessProcesses-PT-14-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 144 (type SRCH) for 3 BusinessProcesses-PT-14-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 153 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-05
lola: result : false
lola: markings : 3671
lola: fired transitions : 5051
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 # 147 (type EXCL) for 12 BusinessProcesses-PT-14-ReachabilityCardinality-04
lola: time limit : 719 sec
lola: memory limit: 32 pages
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-142.sara.
lola: FINISHED task # 141 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-01
lola: result : true
lola: fired transitions : 56
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 142 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 144 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-01 (obsolete)
lola: LAUNCH task # 133 (type FNDP) for 33 BusinessProcesses-PT-14-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 134 (type EQUN) for 33 BusinessProcesses-PT-14-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 136 (type SRCH) for 33 BusinessProcesses-PT-14-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 142 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-01
lola: result : unknown
lola: FINISHED task # 136 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-11
lola: result : true
lola: markings : 248
lola: fired transitions : 272
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 133 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 134 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-11 (obsolete)
lola: LAUNCH task # 104 (type FNDP) for 42 BusinessProcesses-PT-14-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 105 (type EQUN) for 42 BusinessProcesses-PT-14-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 115 (type SRCH) for 42 BusinessProcesses-PT-14-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 104 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-14
lola: result : true
lola: fired transitions : 5
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 105 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 115 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-14 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 120 (type FNDP) for 27 BusinessProcesses-PT-14-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 128 (type EQUN) for 27 BusinessProcesses-PT-14-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 130 (type SRCH) for 27 BusinessProcesses-PT-14-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-105.sara.
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 133 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-11
lola: result : unknown
lola: fired transitions : 876
lola: tried executions : 43
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 130 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-09
lola: result : true
lola: markings : 36
lola: fired transitions : 35
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 120 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-09
lola: result : true
lola: fired transitions : 3566
lola: tried executions : 392
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-134.sara.
lola: CANCELED task # 128 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-09 (obsolete)
lola: LAUNCH task # 117 (type FNDP) for 12 BusinessProcesses-PT-14-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 118 (type EQUN) for 12 BusinessProcesses-PT-14-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 146 (type SRCH) for 12 BusinessProcesses-PT-14-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 105 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-14
lola: result : true
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 147 (type EXCL) for BusinessProcesses-PT-14-ReachabilityCardinality-04
lola: result : false
lola: markings : 5078
lola: fired transitions : 7369
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 117 (type FNDP) for BusinessProcesses-PT-14-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 118 (type EQUN) for BusinessProcesses-PT-14-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 146 (type SRCH) for BusinessProcesses-PT-14-ReachabilityCardinality-04 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-14-ReachabilityCardinality-00: AG false findpath
BusinessProcesses-PT-14-ReachabilityCardinality-01: AG false findpath
BusinessProcesses-PT-14-ReachabilityCardinality-02: AG false findpath
BusinessProcesses-PT-14-ReachabilityCardinality-03: AG false findpath
BusinessProcesses-PT-14-ReachabilityCardinality-04: AG true tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-05: AG true tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-06: AG true tandem / insertion
BusinessProcesses-PT-14-ReachabilityCardinality-07: AG false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-08: EF true findpath
BusinessProcesses-PT-14-ReachabilityCardinality-09: EF true findpath
BusinessProcesses-PT-14-ReachabilityCardinality-10: AG true tandem / insertion
BusinessProcesses-PT-14-ReachabilityCardinality-11: EF true tandem / insertion
BusinessProcesses-PT-14-ReachabilityCardinality-12: AG false tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-13: EF true tandem / relaxed
BusinessProcesses-PT-14-ReachabilityCardinality-14: EF true findpath
BusinessProcesses-PT-14-ReachabilityCardinality-15: AG false tandem / insertion
Time elapsed: 3 secs. Pages in use: 3
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-118.sara.
sara: place or transition ordering is non-deterministic
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="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-14, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692700558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;