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.r041-tajo-167813694900583.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 ltsminxred
Input is BusinessProcesses-PT-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900583
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 161K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678647856796

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:04:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 19:04:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:04:19] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-12 19:04:19] [INFO ] Transformed 650 places.
[2023-03-12 19:04:19] [INFO ] Transformed 580 transitions.
[2023-03-12 19:04:19] [INFO ] Found NUPN structural information;
[2023-03-12 19:04:19] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 576 rows 646 cols
[2023-03-12 19:04:21] [INFO ] Computed 108 place invariants in 40 ms
[2023-03-12 19:04:22] [INFO ] [Real]Absence check using 62 positive place invariants in 61 ms returned sat
[2023-03-12 19:04:22] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 25 ms returned sat
[2023-03-12 19:04:22] [INFO ] After 372ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-12 19:04:23] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 10 ms to minimize.
[2023-03-12 19:04:23] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 1 ms to minimize.
[2023-03-12 19:04:23] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2023-03-12 19:04:23] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 3 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 1 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 0 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 0 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2023-03-12 19:04:24] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 1 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 1 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 0 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 0 ms to minimize.
[2023-03-12 19:04:25] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2023-03-12 19:04:26] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2023-03-12 19:04:26] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 0 ms to minimize.
[2023-03-12 19:04:26] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2023-03-12 19:04:26] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2023-03-12 19:04:26] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2023-03-12 19:04:26] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 1 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 0 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2023-03-12 19:04:27] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4896 ms
[2023-03-12 19:04:27] [INFO ] After 5315ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 19:04:27] [INFO ] After 6069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 19:04:28] [INFO ] [Nat]Absence check using 62 positive place invariants in 77 ms returned sat
[2023-03-12 19:04:28] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 15 ms returned sat
[2023-03-12 19:04:29] [INFO ] After 1310ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-12 19:04:29] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2023-03-12 19:04:30] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 0 ms to minimize.
[2023-03-12 19:04:30] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2023-03-12 19:04:30] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2023-03-12 19:04:30] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2023-03-12 19:04:30] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2023-03-12 19:04:30] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 1 ms to minimize.
[2023-03-12 19:04:30] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 5 ms to minimize.
[2023-03-12 19:04:31] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2023-03-12 19:04:31] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2023-03-12 19:04:31] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2023-03-12 19:04:31] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2023-03-12 19:04:31] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 2 ms to minimize.
[2023-03-12 19:04:31] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2023-03-12 19:04:32] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2023-03-12 19:04:32] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 1 ms to minimize.
[2023-03-12 19:04:32] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 1 ms to minimize.
[2023-03-12 19:04:32] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2023-03-12 19:04:32] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 0 ms to minimize.
[2023-03-12 19:04:32] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 0 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 1 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 0 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 1 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 0 ms to minimize.
[2023-03-12 19:04:33] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 0 ms to minimize.
[2023-03-12 19:04:34] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 1 ms to minimize.
[2023-03-12 19:04:34] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2023-03-12 19:04:34] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4346 ms
[2023-03-12 19:04:34] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2023-03-12 19:04:34] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2023-03-12 19:04:34] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2023-03-12 19:04:35] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2023-03-12 19:04:35] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 0 ms to minimize.
[2023-03-12 19:04:35] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 0 ms to minimize.
[2023-03-12 19:04:35] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 0 ms to minimize.
[2023-03-12 19:04:35] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 1 ms to minimize.
[2023-03-12 19:04:36] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 1 ms to minimize.
[2023-03-12 19:04:36] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 2 ms to minimize.
[2023-03-12 19:04:36] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 1 ms to minimize.
[2023-03-12 19:04:36] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 8 ms to minimize.
[2023-03-12 19:04:36] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 1 ms to minimize.
[2023-03-12 19:04:36] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 1 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 1 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 1 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 1 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 1 ms to minimize.
[2023-03-12 19:04:37] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2023-03-12 19:04:38] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 1 ms to minimize.
[2023-03-12 19:04:38] [INFO ] Deduced a trap composed of 93 places in 80 ms of which 0 ms to minimize.
[2023-03-12 19:04:38] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2023-03-12 19:04:38] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 0 ms to minimize.
[2023-03-12 19:04:38] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4268 ms
[2023-03-12 19:04:38] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 3 ms to minimize.
[2023-03-12 19:04:38] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2023-03-12 19:04:39] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2023-03-12 19:04:39] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
[2023-03-12 19:04:39] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2023-03-12 19:04:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 556 ms
[2023-03-12 19:04:39] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 1 ms to minimize.
[2023-03-12 19:04:39] [INFO ] Deduced a trap composed of 119 places in 202 ms of which 1 ms to minimize.
[2023-03-12 19:04:40] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 1 ms to minimize.
[2023-03-12 19:04:40] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 0 ms to minimize.
[2023-03-12 19:04:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 894 ms
[2023-03-12 19:04:40] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 0 ms to minimize.
[2023-03-12 19:04:40] [INFO ] Deduced a trap composed of 145 places in 172 ms of which 1 ms to minimize.
[2023-03-12 19:04:41] [INFO ] Deduced a trap composed of 151 places in 192 ms of which 1 ms to minimize.
[2023-03-12 19:04:41] [INFO ] Deduced a trap composed of 145 places in 213 ms of which 0 ms to minimize.
[2023-03-12 19:04:41] [INFO ] Deduced a trap composed of 146 places in 222 ms of which 1 ms to minimize.
[2023-03-12 19:04:41] [INFO ] Deduced a trap composed of 150 places in 277 ms of which 1 ms to minimize.
[2023-03-12 19:04:42] [INFO ] Deduced a trap composed of 161 places in 275 ms of which 1 ms to minimize.
[2023-03-12 19:04:42] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 1 ms to minimize.
[2023-03-12 19:04:42] [INFO ] Deduced a trap composed of 143 places in 298 ms of which 1 ms to minimize.
[2023-03-12 19:04:43] [INFO ] Deduced a trap composed of 148 places in 265 ms of which 1 ms to minimize.
[2023-03-12 19:04:43] [INFO ] Deduced a trap composed of 155 places in 274 ms of which 1 ms to minimize.
[2023-03-12 19:04:43] [INFO ] Deduced a trap composed of 37 places in 184 ms of which 1 ms to minimize.
[2023-03-12 19:04:44] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 0 ms to minimize.
[2023-03-12 19:04:44] [INFO ] Deduced a trap composed of 166 places in 322 ms of which 1 ms to minimize.
[2023-03-12 19:04:44] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 1 ms to minimize.
[2023-03-12 19:04:44] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 0 ms to minimize.
[2023-03-12 19:04:45] [INFO ] Deduced a trap composed of 155 places in 170 ms of which 0 ms to minimize.
[2023-03-12 19:04:45] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 0 ms to minimize.
[2023-03-12 19:04:45] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 0 ms to minimize.
[2023-03-12 19:04:45] [INFO ] Deduced a trap composed of 151 places in 167 ms of which 1 ms to minimize.
[2023-03-12 19:04:46] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 1 ms to minimize.
[2023-03-12 19:04:46] [INFO ] Deduced a trap composed of 148 places in 162 ms of which 1 ms to minimize.
[2023-03-12 19:04:46] [INFO ] Deduced a trap composed of 159 places in 165 ms of which 1 ms to minimize.
[2023-03-12 19:04:46] [INFO ] Deduced a trap composed of 150 places in 176 ms of which 1 ms to minimize.
[2023-03-12 19:04:47] [INFO ] Deduced a trap composed of 157 places in 197 ms of which 1 ms to minimize.
[2023-03-12 19:04:47] [INFO ] Deduced a trap composed of 159 places in 231 ms of which 1 ms to minimize.
[2023-03-12 19:04:47] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 1 ms to minimize.
[2023-03-12 19:04:48] [INFO ] Deduced a trap composed of 144 places in 181 ms of which 0 ms to minimize.
[2023-03-12 19:04:48] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 1 ms to minimize.
[2023-03-12 19:04:48] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 1 ms to minimize.
[2023-03-12 19:04:48] [INFO ] Deduced a trap composed of 146 places in 139 ms of which 1 ms to minimize.
[2023-03-12 19:04:49] [INFO ] Deduced a trap composed of 143 places in 156 ms of which 0 ms to minimize.
[2023-03-12 19:04:49] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 0 ms to minimize.
[2023-03-12 19:04:49] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 1 ms to minimize.
[2023-03-12 19:04:50] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 0 ms to minimize.
[2023-03-12 19:04:50] [INFO ] Deduced a trap composed of 147 places in 215 ms of which 1 ms to minimize.
[2023-03-12 19:04:50] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 0 ms to minimize.
[2023-03-12 19:04:50] [INFO ] Deduced a trap composed of 137 places in 321 ms of which 1 ms to minimize.
[2023-03-12 19:04:51] [INFO ] Deduced a trap composed of 136 places in 273 ms of which 1 ms to minimize.
[2023-03-12 19:04:51] [INFO ] Deduced a trap composed of 142 places in 199 ms of which 0 ms to minimize.
[2023-03-12 19:04:51] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 1 ms to minimize.
[2023-03-12 19:04:51] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-12 19:04:52] [INFO ] Deduced a trap composed of 139 places in 150 ms of which 1 ms to minimize.
[2023-03-12 19:04:52] [INFO ] Deduced a trap composed of 140 places in 307 ms of which 2 ms to minimize.
[2023-03-12 19:04:52] [INFO ] Deduced a trap composed of 141 places in 158 ms of which 0 ms to minimize.
[2023-03-12 19:04:52] [INFO ] Deduced a trap composed of 140 places in 265 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-12 19:04:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 19:04:52] [INFO ] After 25240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 152 ms.
Support contains 123 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 642 transition count 518
Reduce places removed 57 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 71 rules applied. Total rules applied 129 place count 585 transition count 504
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 143 place count 571 transition count 504
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 143 place count 571 transition count 403
Deduced a syphon composed of 101 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 356 place count 459 transition count 403
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 411 place count 404 transition count 348
Iterating global reduction 3 with 55 rules applied. Total rules applied 466 place count 404 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 466 place count 404 transition count 347
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 468 place count 403 transition count 347
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 602 place count 336 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 603 place count 336 transition count 279
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 604 place count 336 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 605 place count 335 transition count 278
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 609 place count 335 transition count 278
Applied a total of 609 rules in 258 ms. Remains 335 /646 variables (removed 311) and now considering 278/576 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 335/646 places, 278/576 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 283701 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{0=1, 3=1, 4=1, 7=1}
Probabilistic random walk after 283701 steps, saw 50874 distinct states, run finished after 3002 ms. (steps per millisecond=94 ) properties seen :4
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 278 rows 335 cols
[2023-03-12 19:04:57] [INFO ] Computed 94 place invariants in 8 ms
[2023-03-12 19:04:57] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 19:04:57] [INFO ] [Nat]Absence check using 62 positive place invariants in 13 ms returned sat
[2023-03-12 19:04:57] [INFO ] [Nat]Absence check using 62 positive and 32 generalized place invariants in 6 ms returned sat
[2023-03-12 19:04:57] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 19:04:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 19:04:58] [INFO ] After 310ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 19:04:58] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2023-03-12 19:04:58] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2023-03-12 19:04:58] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-12 19:04:58] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 0 ms to minimize.
[2023-03-12 19:04:59] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2023-03-12 19:04:59] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2023-03-12 19:04:59] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 1 ms to minimize.
[2023-03-12 19:04:59] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 0 ms to minimize.
[2023-03-12 19:04:59] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 1 ms to minimize.
[2023-03-12 19:04:59] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2023-03-12 19:04:59] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 0 ms to minimize.
[2023-03-12 19:04:59] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 0 ms to minimize.
[2023-03-12 19:05:00] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2023-03-12 19:05:00] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2023-03-12 19:05:00] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1755 ms
[2023-03-12 19:05:00] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2023-03-12 19:05:00] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2023-03-12 19:05:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-12 19:05:00] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 0 ms to minimize.
[2023-03-12 19:05:00] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2023-03-12 19:05:00] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2023-03-12 19:05:00] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2023-03-12 19:05:01] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 1 ms to minimize.
[2023-03-12 19:05:01] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 1 ms to minimize.
[2023-03-12 19:05:01] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2023-03-12 19:05:01] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2023-03-12 19:05:01] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-12 19:05:01] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2023-03-12 19:05:01] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 0 ms to minimize.
[2023-03-12 19:05:02] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2023-03-12 19:05:02] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 0 ms to minimize.
[2023-03-12 19:05:02] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2023-03-12 19:05:02] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2023-03-12 19:05:02] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 0 ms to minimize.
[2023-03-12 19:05:02] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 1 ms to minimize.
[2023-03-12 19:05:02] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 0 ms to minimize.
[2023-03-12 19:05:03] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 1 ms to minimize.
[2023-03-12 19:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 2733 ms
[2023-03-12 19:05:03] [INFO ] After 5241ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-12 19:05:03] [INFO ] After 5943ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 64 out of 335 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 335/335 places, 278/278 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 335 transition count 270
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 327 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 326 transition count 269
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 18 place count 326 transition count 257
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 44 place count 312 transition count 257
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 52 place count 304 transition count 249
Iterating global reduction 3 with 8 rules applied. Total rules applied 60 place count 304 transition count 249
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 142 place count 262 transition count 209
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 262 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 261 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 260 transition count 208
Applied a total of 145 rules in 166 ms. Remains 260 /335 variables (removed 75) and now considering 208/278 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 260/335 places, 208/278 transitions.
Incomplete random walk after 10000 steps, including 260 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 430297 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 430297 steps, saw 74825 distinct states, run finished after 3004 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 208 rows 260 cols
[2023-03-12 19:05:06] [INFO ] Computed 89 place invariants in 31 ms
[2023-03-12 19:05:07] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 19:05:07] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-12 19:05:07] [INFO ] [Nat]Absence check using 58 positive and 31 generalized place invariants in 10 ms returned sat
[2023-03-12 19:05:07] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 19:05:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:05:07] [INFO ] After 103ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 19:05:07] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2023-03-12 19:05:08] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2023-03-12 19:05:08] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2023-03-12 19:05:08] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2023-03-12 19:05:08] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2023-03-12 19:05:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 763 ms
[2023-03-12 19:05:08] [INFO ] After 1049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-12 19:05:08] [INFO ] After 1523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 64 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 208/208 transitions.
Applied a total of 0 rules in 7 ms. Remains 260 /260 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 260/260 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 208/208 transitions.
Applied a total of 0 rules in 7 ms. Remains 260 /260 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2023-03-12 19:05:08] [INFO ] Invariant cache hit.
[2023-03-12 19:05:08] [INFO ] Implicit Places using invariants in 177 ms returned [34, 39, 41, 43, 45, 47, 49, 51, 76, 78, 80, 82, 85, 89, 90, 91, 92, 93, 198, 210, 214]
Discarding 21 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 186 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 239/260 places, 206/208 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 237 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 237 transition count 201
Applied a total of 4 rules in 12 ms. Remains 237 /239 variables (removed 2) and now considering 201/206 (removed 5) transitions.
// Phase 1: matrix 201 rows 237 cols
[2023-03-12 19:05:08] [INFO ] Computed 70 place invariants in 2 ms
[2023-03-12 19:05:08] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-12 19:05:08] [INFO ] Invariant cache hit.
[2023-03-12 19:05:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:05:09] [INFO ] Implicit Places using invariants and state equation in 292 ms returned [157, 159, 161, 163]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 474 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 233/260 places, 201/208 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 232 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 231 transition count 199
Applied a total of 4 rules in 22 ms. Remains 231 /233 variables (removed 2) and now considering 199/201 (removed 2) transitions.
// Phase 1: matrix 199 rows 231 cols
[2023-03-12 19:05:09] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-12 19:05:09] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-12 19:05:09] [INFO ] Invariant cache hit.
[2023-03-12 19:05:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:05:09] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 231/260 places, 199/208 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1099 ms. Remains : 231/260 places, 199/208 transitions.
Incomplete random walk after 10000 steps, including 261 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 832573 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :{}
Probabilistic random walk after 832573 steps, saw 138881 distinct states, run finished after 3001 ms. (steps per millisecond=277 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 19:05:12] [INFO ] Invariant cache hit.
[2023-03-12 19:05:12] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 19:05:12] [INFO ] [Nat]Absence check using 48 positive place invariants in 7 ms returned sat
[2023-03-12 19:05:12] [INFO ] [Nat]Absence check using 48 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-12 19:05:13] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 19:05:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:05:13] [INFO ] After 113ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 19:05:13] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 0 ms to minimize.
[2023-03-12 19:05:13] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 0 ms to minimize.
[2023-03-12 19:05:13] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 0 ms to minimize.
[2023-03-12 19:05:13] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 0 ms to minimize.
[2023-03-12 19:05:13] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2023-03-12 19:05:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 674 ms
[2023-03-12 19:05:13] [INFO ] After 906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-12 19:05:14] [INFO ] After 1239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 64 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 199/199 transitions.
Applied a total of 0 rules in 9 ms. Remains 231 /231 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 231/231 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 199/199 transitions.
Applied a total of 0 rules in 9 ms. Remains 231 /231 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-12 19:05:14] [INFO ] Invariant cache hit.
[2023-03-12 19:05:14] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-12 19:05:14] [INFO ] Invariant cache hit.
[2023-03-12 19:05:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:05:14] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-12 19:05:14] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-12 19:05:14] [INFO ] Invariant cache hit.
[2023-03-12 19:05:14] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 572 ms. Remains : 231/231 places, 199/199 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 230 transition count 198
Applied a total of 2 rules in 11 ms. Remains 230 /231 variables (removed 1) and now considering 198/199 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 198 rows 230 cols
[2023-03-12 19:05:14] [INFO ] Computed 66 place invariants in 15 ms
[2023-03-12 19:05:14] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 19:05:14] [INFO ] [Nat]Absence check using 48 positive place invariants in 8 ms returned sat
[2023-03-12 19:05:14] [INFO ] [Nat]Absence check using 48 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-12 19:05:15] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 19:05:15] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2023-03-12 19:05:15] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2023-03-12 19:05:15] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2023-03-12 19:05:15] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2023-03-12 19:05:15] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2023-03-12 19:05:15] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2023-03-12 19:05:15] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
[2023-03-12 19:05:15] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 0 ms to minimize.
[2023-03-12 19:05:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 721 ms
[2023-03-12 19:05:15] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2023-03-12 19:05:16] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2023-03-12 19:05:16] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2023-03-12 19:05:16] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2023-03-12 19:05:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 159 ms
[2023-03-12 19:05:16] [INFO ] After 1169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-12 19:05:16] [INFO ] After 1345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 19:05:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-12 19:05:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 231 places, 199 transitions and 815 arcs took 1 ms.
[2023-03-12 19:05:16] [INFO ] Flatten gal took : 60 ms
Total runtime 56959 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/1124/inv_0_ --invariant=/tmp/1124/inv_1_ --inv-par
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678647993677

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name BusinessProcesses-PT-17-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/1124/inv_0_
rfs formula name BusinessProcesses-PT-17-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/1124/inv_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 231 places, 199 transitions and 815 arcs
pnml2lts-sym: Petri net BusinessProcesses_PT_17 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 199->196 groups
pnml2lts-sym: Regrouping took 0.040 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 231; there are 196 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/1124/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 2830532 group checks and 0 next state calls
pnml2lts-sym: reachability took 66.310 real 264.100 user 0.500 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.080 real 0.310 user 0.000 sys
pnml2lts-sym: state space has 3569589881 states, 240376 nodes
pnml2lts-sym: group_next: 1452 nodes total
pnml2lts-sym: group_explored: 2492 nodes, 1897 short vectors total
pnml2lts-sym: max token count: 2

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-17"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-17, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694900583"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;