About the Execution of LoLa+red for BusinessProcesses-PT-16
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
312.451 | 30309.00 | 43515.00 | 70.60 | TTFTTTFTTFFFFFFF | 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-167813692700574.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-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692700574
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K 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:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K 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.4K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K 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 159K 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-16-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678503462579
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-16
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:57:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:57:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:57:44] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-11 02:57:44] [INFO ] Transformed 638 places.
[2023-03-11 02:57:44] [INFO ] Transformed 578 transitions.
[2023-03-11 02:57:44] [INFO ] Found NUPN structural information;
[2023-03-11 02:57:44] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 67 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 13) seen :6
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 570 rows 630 cols
[2023-03-11 02:57:45] [INFO ] Computed 100 place invariants in 39 ms
[2023-03-11 02:57:45] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 02:57:45] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2023-03-11 02:57:45] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2023-03-11 02:57:46] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-11 02:57:46] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 6 ms to minimize.
[2023-03-11 02:57:46] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:57:47] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:57:47] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2023-03-11 02:57:47] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 2 ms to minimize.
[2023-03-11 02:57:47] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 0 ms to minimize.
[2023-03-11 02:57:47] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 1 ms to minimize.
[2023-03-11 02:57:47] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2023-03-11 02:57:48] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2023-03-11 02:57:48] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 0 ms to minimize.
[2023-03-11 02:57:48] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2023-03-11 02:57:48] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:57:48] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2023-03-11 02:57:48] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 0 ms to minimize.
[2023-03-11 02:57:49] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 1 ms to minimize.
[2023-03-11 02:57:49] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 0 ms to minimize.
[2023-03-11 02:57:49] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 0 ms to minimize.
[2023-03-11 02:57:49] [INFO ] Deduced a trap composed of 142 places in 126 ms of which 1 ms to minimize.
[2023-03-11 02:57:49] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 0 ms to minimize.
[2023-03-11 02:57:49] [INFO ] Deduced a trap composed of 146 places in 148 ms of which 0 ms to minimize.
[2023-03-11 02:57:50] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 1 ms to minimize.
[2023-03-11 02:57:50] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 0 ms to minimize.
[2023-03-11 02:57:50] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2023-03-11 02:57:50] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 0 ms to minimize.
[2023-03-11 02:57:50] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 2 ms to minimize.
[2023-03-11 02:57:50] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2023-03-11 02:57:50] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 0 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 0 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 154 places in 134 ms of which 1 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 1 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 1 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 1 ms to minimize.
[2023-03-11 02:57:51] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 0 ms to minimize.
[2023-03-11 02:57:52] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 5575 ms
[2023-03-11 02:57:52] [INFO ] Deduced a trap composed of 133 places in 169 ms of which 4 ms to minimize.
[2023-03-11 02:57:52] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2023-03-11 02:57:52] [INFO ] Deduced a trap composed of 144 places in 183 ms of which 1 ms to minimize.
[2023-03-11 02:57:52] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 1 ms to minimize.
[2023-03-11 02:57:53] [INFO ] Deduced a trap composed of 163 places in 174 ms of which 1 ms to minimize.
[2023-03-11 02:57:53] [INFO ] Deduced a trap composed of 145 places in 170 ms of which 1 ms to minimize.
[2023-03-11 02:57:53] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 0 ms to minimize.
[2023-03-11 02:57:53] [INFO ] Deduced a trap composed of 150 places in 171 ms of which 1 ms to minimize.
[2023-03-11 02:57:53] [INFO ] Deduced a trap composed of 151 places in 147 ms of which 1 ms to minimize.
[2023-03-11 02:57:54] [INFO ] Deduced a trap composed of 143 places in 171 ms of which 0 ms to minimize.
[2023-03-11 02:57:54] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 1 ms to minimize.
[2023-03-11 02:57:54] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 1 ms to minimize.
[2023-03-11 02:57:54] [INFO ] Deduced a trap composed of 141 places in 172 ms of which 1 ms to minimize.
[2023-03-11 02:57:54] [INFO ] Deduced a trap composed of 147 places in 184 ms of which 1 ms to minimize.
[2023-03-11 02:57:55] [INFO ] Deduced a trap composed of 148 places in 154 ms of which 1 ms to minimize.
[2023-03-11 02:57:55] [INFO ] Deduced a trap composed of 151 places in 162 ms of which 0 ms to minimize.
[2023-03-11 02:57:55] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 1 ms to minimize.
[2023-03-11 02:57:55] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 0 ms to minimize.
[2023-03-11 02:57:55] [INFO ] Deduced a trap composed of 146 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:57:56] [INFO ] Deduced a trap composed of 152 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:57:56] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 0 ms to minimize.
[2023-03-11 02:57:56] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 1 ms to minimize.
[2023-03-11 02:57:56] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 0 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 0 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 0 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 1 ms to minimize.
[2023-03-11 02:57:57] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2023-03-11 02:57:58] [INFO ] Deduced a trap composed of 145 places in 167 ms of which 1 ms to minimize.
[2023-03-11 02:57:58] [INFO ] Deduced a trap composed of 145 places in 164 ms of which 1 ms to minimize.
[2023-03-11 02:57:58] [INFO ] Deduced a trap composed of 141 places in 149 ms of which 1 ms to minimize.
[2023-03-11 02:57:58] [INFO ] Deduced a trap composed of 146 places in 211 ms of which 2 ms to minimize.
[2023-03-11 02:57:58] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 1 ms to minimize.
[2023-03-11 02:57:58] [INFO ] Deduced a trap composed of 142 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:57:59] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 0 ms to minimize.
[2023-03-11 02:57:59] [INFO ] Deduced a trap composed of 157 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:57:59] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 1 ms to minimize.
[2023-03-11 02:57:59] [INFO ] Deduced a trap composed of 146 places in 147 ms of which 1 ms to minimize.
[2023-03-11 02:57:59] [INFO ] Deduced a trap composed of 147 places in 158 ms of which 0 ms to minimize.
[2023-03-11 02:58:00] [INFO ] Deduced a trap composed of 146 places in 155 ms of which 1 ms to minimize.
[2023-03-11 02:58:00] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 1 ms to minimize.
[2023-03-11 02:58:00] [INFO ] Deduced a trap composed of 149 places in 160 ms of which 0 ms to minimize.
[2023-03-11 02:58:00] [INFO ] Deduced a trap composed of 149 places in 155 ms of which 1 ms to minimize.
[2023-03-11 02:58:00] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:58:01] [INFO ] Deduced a trap composed of 150 places in 160 ms of which 0 ms to minimize.
[2023-03-11 02:58:01] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 0 ms to minimize.
[2023-03-11 02:58:01] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 1 ms to minimize.
[2023-03-11 02:58:01] [INFO ] Deduced a trap composed of 145 places in 135 ms of which 1 ms to minimize.
[2023-03-11 02:58:01] [INFO ] Deduced a trap composed of 150 places in 141 ms of which 0 ms to minimize.
[2023-03-11 02:58:01] [INFO ] Deduced a trap composed of 145 places in 140 ms of which 0 ms to minimize.
[2023-03-11 02:58:02] [INFO ] Deduced a trap composed of 147 places in 178 ms of which 1 ms to minimize.
[2023-03-11 02:58:02] [INFO ] Deduced a trap composed of 146 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:58:02] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 0 ms to minimize.
[2023-03-11 02:58:02] [INFO ] Deduced a trap composed of 146 places in 137 ms of which 1 ms to minimize.
[2023-03-11 02:58:02] [INFO ] Deduced a trap composed of 150 places in 166 ms of which 0 ms to minimize.
[2023-03-11 02:58:03] [INFO ] Deduced a trap composed of 140 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:58:03] [INFO ] Deduced a trap composed of 148 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:58:03] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 1 ms to minimize.
[2023-03-11 02:58:03] [INFO ] Deduced a trap composed of 140 places in 126 ms of which 0 ms to minimize.
[2023-03-11 02:58:03] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 0 ms to minimize.
[2023-03-11 02:58:03] [INFO ] Deduced a trap composed of 142 places in 105 ms of which 0 ms to minimize.
[2023-03-11 02:58:03] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:58:04] [INFO ] Deduced a trap composed of 149 places in 166 ms of which 1 ms to minimize.
[2023-03-11 02:58:04] [INFO ] Deduced a trap composed of 152 places in 118 ms of which 1 ms to minimize.
[2023-03-11 02:58:04] [INFO ] Deduced a trap composed of 149 places in 113 ms of which 0 ms to minimize.
[2023-03-11 02:58:04] [INFO ] Deduced a trap composed of 148 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:58:04] [INFO ] Deduced a trap composed of 144 places in 123 ms of which 1 ms to minimize.
[2023-03-11 02:58:04] [INFO ] Deduced a trap composed of 143 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:58:05] [INFO ] Deduced a trap composed of 151 places in 104 ms of which 1 ms to minimize.
[2023-03-11 02:58:05] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 1 ms to minimize.
[2023-03-11 02:58:05] [INFO ] Deduced a trap composed of 147 places in 110 ms of which 0 ms to minimize.
[2023-03-11 02:58:05] [INFO ] Deduced a trap composed of 143 places in 121 ms of which 1 ms to minimize.
[2023-03-11 02:58:05] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2023-03-11 02:58:05] [INFO ] Deduced a trap composed of 150 places in 115 ms of which 1 ms to minimize.
[2023-03-11 02:58:06] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2023-03-11 02:58:06] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2023-03-11 02:58:06] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2023-03-11 02:58:06] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2023-03-11 02:58:06] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2023-03-11 02:58:06] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 0 ms to minimize.
[2023-03-11 02:58:06] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2023-03-11 02:58:06] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 1 ms to minimize.
[2023-03-11 02:58:07] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2023-03-11 02:58:07] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2023-03-11 02:58:07] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 0 ms to minimize.
[2023-03-11 02:58:07] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 0 ms to minimize.
[2023-03-11 02:58:07] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2023-03-11 02:58:07] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 0 ms to minimize.
[2023-03-11 02:58:07] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 0 ms to minimize.
[2023-03-11 02:58:07] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2023-03-11 02:58:08] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 1 ms to minimize.
[2023-03-11 02:58:08] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 0 ms to minimize.
[2023-03-11 02:58:08] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 1 ms to minimize.
[2023-03-11 02:58:08] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 0 ms to minimize.
[2023-03-11 02:58:08] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2023-03-11 02:58:08] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-03-11 02:58:08] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2023-03-11 02:58:08] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2023-03-11 02:58:09] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2023-03-11 02:58:09] [INFO ] Trap strengthening (SAT) tested/added 100/99 trap constraints in 16934 ms
[2023-03-11 02:58:09] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2023-03-11 02:58:09] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 0 ms to minimize.
[2023-03-11 02:58:09] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 0 ms to minimize.
[2023-03-11 02:58:09] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 0 ms to minimize.
[2023-03-11 02:58:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 626 ms
[2023-03-11 02:58:10] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2023-03-11 02:58:10] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:58:10] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 0 ms to minimize.
[2023-03-11 02:58:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 663 ms
[2023-03-11 02:58:10] [INFO ] After 24665ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-11 02:58:10] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 43 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 326 edges and 630 vertex of which 7 / 630 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 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 618 transition count 440
Reduce places removed 121 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 128 rules applied. Total rules applied 251 place count 497 transition count 433
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 258 place count 490 transition count 433
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 258 place count 490 transition count 347
Deduced a syphon composed of 86 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 185 rules applied. Total rules applied 443 place count 391 transition count 347
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 520 place count 314 transition count 270
Iterating global reduction 3 with 77 rules applied. Total rules applied 597 place count 314 transition count 270
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 597 place count 314 transition count 263
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 612 place count 306 transition count 263
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 774 place count 224 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 776 place count 223 transition count 187
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 778 place count 223 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 780 place count 221 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 781 place count 221 transition count 185
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 782 place count 220 transition count 184
Applied a total of 782 rules in 196 ms. Remains 220 /630 variables (removed 410) and now considering 184/570 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 220/630 places, 184/570 transitions.
Finished random walk after 5617 steps, including 115 resets, run visited all 6 properties in 42 ms. (steps per millisecond=133 )
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27052 ms.
starting LoLA
BK_INPUT BusinessProcesses-PT-16
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityCardinality
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678503492888
--------------------
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: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:156
lola: rewrite Frontend/Parser/formula_rewrite.k:147
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 8 transitions removed,8 places removed
lola: LAUNCH INITIAL
lola: LAUNCH task # 40 (type CNST) for 39 BusinessProcesses-PT-16-ReachabilityCardinality-13
lola: time limit : 0 sec
lola: memory limit: 0 pages
lola: FINISHED task # 40 (type CNST) for BusinessProcesses-PT-16-ReachabilityCardinality-13
lola: result : false
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k: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: LAUNCH task # 65 (type EXCL) for 3 BusinessProcesses-PT-16-ReachabilityCardinality-01
lola: time limit : 171 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 61 (type FNDP) for 3 BusinessProcesses-PT-16-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 62 (type EQUN) for 3 BusinessProcesses-PT-16-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 64 (type SRCH) for 3 BusinessProcesses-PT-16-ReachabilityCardinality-01
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 64 (type SRCH) for BusinessProcesses-PT-16-ReachabilityCardinality-01
lola: result : false
lola: markings : 69
lola: fired transitions : 90
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 61 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 62 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 65 (type EXCL) for BusinessProcesses-PT-16-ReachabilityCardinality-01 (obsolete)
lola: LAUNCH task # 84 (type EXCL) for 36 BusinessProcesses-PT-16-ReachabilityCardinality-12
lola: time limit : 171 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 56 (type FNDP) for 15 BusinessProcesses-PT-16-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 57 (type EQUN) for 15 BusinessProcesses-PT-16-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 59 (type SRCH) for 15 BusinessProcesses-PT-16-ReachabilityCardinality-05
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 59 (type SRCH) for BusinessProcesses-PT-16-ReachabilityCardinality-05
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 56 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 57 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-05 (obsolete)
lola: LAUNCH task # 93 (type FNDP) for 0 BusinessProcesses-PT-16-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 94 (type EQUN) for 0 BusinessProcesses-PT-16-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 96 (type SRCH) for 0 BusinessProcesses-PT-16-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 56 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-05
lola: result : true
lola: fired transitions : 2
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: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: Created skeleton in 0.000000 secs.
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-62.sara.
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-57.sara.
lola: FINISHED task # 84 (type EXCL) for BusinessProcesses-PT-16-ReachabilityCardinality-12
lola: result : true
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 67 (type EXCL) for 12 BusinessProcesses-PT-16-ReachabilityCardinality-04
lola: time limit : 211 sec
lola: memory limit: 32 pages
lola: FINISHED task # 67 (type EXCL) for BusinessProcesses-PT-16-ReachabilityCardinality-04
lola: result : true
lola: markings : 10
lola: fired transitions : 9
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 77 (type EXCL) for 21 BusinessProcesses-PT-16-ReachabilityCardinality-07
lola: time limit : 239 sec
lola: memory limit: 32 pages
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 77 (type EXCL) for BusinessProcesses-PT-16-ReachabilityCardinality-07
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 70 (type EXCL) for 6 BusinessProcesses-PT-16-ReachabilityCardinality-02
lola: time limit : 276 sec
lola: memory limit: 32 pages
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 96 (type SRCH) for BusinessProcesses-PT-16-ReachabilityCardinality-00
lola: result : false
lola: markings : 4476
lola: fired transitions : 10908
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 93 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 94 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-00 (obsolete)
lola: LAUNCH task # 86 (type FNDP) for 45 BusinessProcesses-PT-16-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 87 (type EQUN) for 45 BusinessProcesses-PT-16-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 89 (type SRCH) for 45 BusinessProcesses-PT-16-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 93 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-00
lola: result : unknown
lola: fired transitions : 11272
lola: tried executions : 595
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 89 (type SRCH) for BusinessProcesses-PT-16-ReachabilityCardinality-15
lola: result : false
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 86 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 87 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-15 (obsolete)
lola: LAUNCH task # 49 (type FNDP) for 6 BusinessProcesses-PT-16-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 6 BusinessProcesses-PT-16-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 69 (type SRCH) for 6 BusinessProcesses-PT-16-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
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: FINISHED task # 70 (type EXCL) for BusinessProcesses-PT-16-ReachabilityCardinality-02
lola: result : true
lola: markings : 33
lola: fired transitions : 32
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 49 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 50 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 69 (type SRCH) for BusinessProcesses-PT-16-ReachabilityCardinality-02 (obsolete)
lola: LAUNCH task # 107 (type EXCL) for 24 BusinessProcesses-PT-16-ReachabilityCardinality-08
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 103 (type FNDP) for 24 BusinessProcesses-PT-16-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
sara: place or transition ordering is non-deterministic
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 104 (type EQUN) for 24 BusinessProcesses-PT-16-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 106 (type SRCH) for 24 BusinessProcesses-PT-16-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 49 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-02
lola: result : true
lola: fired transitions : 1451
lola: tried executions : 76
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 107 (type EXCL) for BusinessProcesses-PT-16-ReachabilityCardinality-08
lola: result : true
lola: markings : 25
lola: fired transitions : 24
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 103 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 104 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 106 (type SRCH) for BusinessProcesses-PT-16-ReachabilityCardinality-08 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-50.sara.
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-87.sara.
lola: LAUNCH task # 112 (type EXCL) for 9 BusinessProcesses-PT-16-ReachabilityCardinality-03
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 101 (type FNDP) for 9 BusinessProcesses-PT-16-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 109 (type EQUN) for 9 BusinessProcesses-PT-16-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 111 (type SRCH) for 9 BusinessProcesses-PT-16-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: 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 # 103 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-08
lola: result : true
lola: fired transitions : 22
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
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: FINISHED task # 111 (type SRCH) for BusinessProcesses-PT-16-ReachabilityCardinality-03
lola: result : true
lola: markings : 69
lola: fired transitions : 68
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 101 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 109 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 112 (type EXCL) for BusinessProcesses-PT-16-ReachabilityCardinality-03 (obsolete)
lola: LAUNCH task # 121 (type EXCL) for 18 BusinessProcesses-PT-16-ReachabilityCardinality-06
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 124 (type FNDP) for 33 BusinessProcesses-PT-16-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 125 (type EQUN) for 33 BusinessProcesses-PT-16-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 127 (type SRCH) for 33 BusinessProcesses-PT-16-ReachabilityCardinality-11
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: Created skeleton in 0.000000 secs.
lola: FINISHED task # 112 (type EXCL) for BusinessProcesses-PT-16-ReachabilityCardinality-03
lola: result : true
lola: markings : 55
lola: fired transitions : 54
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
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-104.sara.
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-109.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: FINISHED task # 121 (type EXCL) for BusinessProcesses-PT-16-ReachabilityCardinality-06
lola: result : true
lola: markings : 2344
lola: fired transitions : 3489
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 128 (type EXCL) for 33 BusinessProcesses-PT-16-ReachabilityCardinality-11
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: 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 # 127 (type SRCH) for BusinessProcesses-PT-16-ReachabilityCardinality-11
lola: result : true
lola: markings : 20
lola: fired transitions : 19
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 124 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 125 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 128 (type EXCL) for BusinessProcesses-PT-16-ReachabilityCardinality-11 (obsolete)
lola: LAUNCH task # 144 (type EXCL) for 30 BusinessProcesses-PT-16-ReachabilityCardinality-10
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 113 (type FNDP) for 27 BusinessProcesses-PT-16-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 115 (type EQUN) for 27 BusinessProcesses-PT-16-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 130 (type SRCH) for 27 BusinessProcesses-PT-16-ReachabilityCardinality-09
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 # 124 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-11
lola: result : unknown
lola: fired transitions : 1313
lola: tried executions : 119
lola: time used : 0.000000
lola: memory pages used : 0
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 62 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-01
lola: result : false
lola: FINISHED task # 130 (type SRCH) for BusinessProcesses-PT-16-ReachabilityCardinality-09
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 113 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 115 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-09 (obsolete)
lola: LAUNCH task # 136 (type FNDP) for 42 BusinessProcesses-PT-16-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 137 (type EQUN) for 42 BusinessProcesses-PT-16-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 141 (type SRCH) for 42 BusinessProcesses-PT-16-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 115 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-09
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 113 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-09
lola: result : true
lola: fired transitions : 3
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 141 (type SRCH) for BusinessProcesses-PT-16-ReachabilityCardinality-14
lola: result : true
lola: markings : 75
lola: fired transitions : 77
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 144 (type EXCL) for BusinessProcesses-PT-16-ReachabilityCardinality-10
lola: result : true
lola: markings : 2508
lola: fired transitions : 3685
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 136 (type FNDP) for BusinessProcesses-PT-16-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 137 (type EQUN) for BusinessProcesses-PT-16-ReachabilityCardinality-14 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-16-ReachabilityCardinality-00: AG true tandem / insertion
BusinessProcesses-PT-16-ReachabilityCardinality-01: AG true tandem / insertion
BusinessProcesses-PT-16-ReachabilityCardinality-02: AG false tandem / relaxed
BusinessProcesses-PT-16-ReachabilityCardinality-03: EF true tandem / insertion
BusinessProcesses-PT-16-ReachabilityCardinality-04: EF true tandem / relaxed
BusinessProcesses-PT-16-ReachabilityCardinality-05: EF true tandem / insertion
BusinessProcesses-PT-16-ReachabilityCardinality-06: AG false tandem / relaxed
BusinessProcesses-PT-16-ReachabilityCardinality-07: EF true tandem / relaxed
BusinessProcesses-PT-16-ReachabilityCardinality-08: EF true tandem / relaxed
BusinessProcesses-PT-16-ReachabilityCardinality-09: AG false tandem / insertion
BusinessProcesses-PT-16-ReachabilityCardinality-10: AG false tandem / relaxed
BusinessProcesses-PT-16-ReachabilityCardinality-11: AG false tandem / insertion
BusinessProcesses-PT-16-ReachabilityCardinality-12: AG false tandem / relaxed
BusinessProcesses-PT-16-ReachabilityCardinality-13: INITIAL false preprocessing
BusinessProcesses-PT-16-ReachabilityCardinality-14: AG false tandem / insertion
BusinessProcesses-PT-16-ReachabilityCardinality-15: EF false tandem / insertion
Time elapsed: 1 secs. Pages in use: 2
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-16"
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-16, 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-167813692700574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 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 ;