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.r043-tajo-167813697000559.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 smartxred
Input is BusinessProcesses-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697000559
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 156K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678793913702

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 11:38:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 11:38:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:38:35] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-14 11:38:35] [INFO ] Transformed 624 places.
[2023-03-14 11:38:35] [INFO ] Transformed 564 transitions.
[2023-03-14 11:38:35] [INFO ] Found NUPN structural information;
[2023-03-14 11:38:35] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 556 rows 616 cols
[2023-03-14 11:38:36] [INFO ] Computed 99 place invariants in 40 ms
[2023-03-14 11:38:36] [INFO ] [Real]Absence check using 60 positive place invariants in 18 ms returned sat
[2023-03-14 11:38:36] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2023-03-14 11:38:37] [INFO ] After 216ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-14 11:38:37] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 8 ms to minimize.
[2023-03-14 11:38:37] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 1 ms to minimize.
[2023-03-14 11:38:37] [INFO ] Deduced a trap composed of 109 places in 176 ms of which 1 ms to minimize.
[2023-03-14 11:38:38] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 2 ms to minimize.
[2023-03-14 11:38:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 974 ms
[2023-03-14 11:38:38] [INFO ] After 1216ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 11:38:38] [INFO ] After 1635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 11:38:38] [INFO ] [Nat]Absence check using 60 positive place invariants in 14 ms returned sat
[2023-03-14 11:38:38] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 8 ms returned sat
[2023-03-14 11:38:39] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-14 11:38:39] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2023-03-14 11:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-14 11:38:39] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 0 ms to minimize.
[2023-03-14 11:38:39] [INFO ] Deduced a trap composed of 113 places in 203 ms of which 1 ms to minimize.
[2023-03-14 11:38:40] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 1 ms to minimize.
[2023-03-14 11:38:40] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 1 ms to minimize.
[2023-03-14 11:38:40] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 0 ms to minimize.
[2023-03-14 11:38:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 1328 ms
[2023-03-14 11:38:40] [INFO ] Deduced a trap composed of 151 places in 158 ms of which 1 ms to minimize.
[2023-03-14 11:38:41] [INFO ] Deduced a trap composed of 146 places in 138 ms of which 1 ms to minimize.
[2023-03-14 11:38:41] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 1 ms to minimize.
[2023-03-14 11:38:41] [INFO ] Deduced a trap composed of 150 places in 140 ms of which 1 ms to minimize.
[2023-03-14 11:38:41] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 1 ms to minimize.
[2023-03-14 11:38:41] [INFO ] Deduced a trap composed of 132 places in 140 ms of which 1 ms to minimize.
[2023-03-14 11:38:41] [INFO ] Deduced a trap composed of 144 places in 159 ms of which 0 ms to minimize.
[2023-03-14 11:38:42] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 1 ms to minimize.
[2023-03-14 11:38:42] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 0 ms to minimize.
[2023-03-14 11:38:42] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 0 ms to minimize.
[2023-03-14 11:38:42] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2023-03-14 11:38:43] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:38:43] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 0 ms to minimize.
[2023-03-14 11:38:43] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 0 ms to minimize.
[2023-03-14 11:38:43] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 0 ms to minimize.
[2023-03-14 11:38:43] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 1 ms to minimize.
[2023-03-14 11:38:43] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 0 ms to minimize.
[2023-03-14 11:38:44] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 1 ms to minimize.
[2023-03-14 11:38:44] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:38:44] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 1 ms to minimize.
[2023-03-14 11:38:44] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:38:44] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 0 ms to minimize.
[2023-03-14 11:38:44] [INFO ] Deduced a trap composed of 150 places in 151 ms of which 1 ms to minimize.
[2023-03-14 11:38:45] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 1 ms to minimize.
[2023-03-14 11:38:45] [INFO ] Deduced a trap composed of 151 places in 131 ms of which 1 ms to minimize.
[2023-03-14 11:38:45] [INFO ] Deduced a trap composed of 150 places in 163 ms of which 1 ms to minimize.
[2023-03-14 11:38:45] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 0 ms to minimize.
[2023-03-14 11:38:45] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 1 ms to minimize.
[2023-03-14 11:38:46] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 1 ms to minimize.
[2023-03-14 11:38:46] [INFO ] Deduced a trap composed of 149 places in 158 ms of which 2 ms to minimize.
[2023-03-14 11:38:46] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 0 ms to minimize.
[2023-03-14 11:38:46] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 1 ms to minimize.
[2023-03-14 11:38:46] [INFO ] Deduced a trap composed of 148 places in 142 ms of which 1 ms to minimize.
[2023-03-14 11:38:46] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 1 ms to minimize.
[2023-03-14 11:38:47] [INFO ] Deduced a trap composed of 125 places in 175 ms of which 0 ms to minimize.
[2023-03-14 11:38:47] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 0 ms to minimize.
[2023-03-14 11:38:47] [INFO ] Deduced a trap composed of 149 places in 136 ms of which 1 ms to minimize.
[2023-03-14 11:38:47] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2023-03-14 11:38:47] [INFO ] Deduced a trap composed of 148 places in 145 ms of which 1 ms to minimize.
[2023-03-14 11:38:48] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 1 ms to minimize.
[2023-03-14 11:38:48] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 2 ms to minimize.
[2023-03-14 11:38:48] [INFO ] Deduced a trap composed of 144 places in 182 ms of which 1 ms to minimize.
[2023-03-14 11:38:48] [INFO ] Deduced a trap composed of 142 places in 130 ms of which 1 ms to minimize.
[2023-03-14 11:38:48] [INFO ] Deduced a trap composed of 133 places in 180 ms of which 1 ms to minimize.
[2023-03-14 11:38:49] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 0 ms to minimize.
[2023-03-14 11:38:49] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 1 ms to minimize.
[2023-03-14 11:38:49] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 1 ms to minimize.
[2023-03-14 11:38:49] [INFO ] Deduced a trap composed of 139 places in 137 ms of which 0 ms to minimize.
[2023-03-14 11:38:49] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2023-03-14 11:38:50] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 0 ms to minimize.
[2023-03-14 11:38:50] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 0 ms to minimize.
[2023-03-14 11:38:50] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:38:50] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 1 ms to minimize.
[2023-03-14 11:38:50] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 1 ms to minimize.
[2023-03-14 11:38:51] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 0 ms to minimize.
[2023-03-14 11:38:51] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 1 ms to minimize.
[2023-03-14 11:38:51] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 1 ms to minimize.
[2023-03-14 11:38:51] [INFO ] Deduced a trap composed of 143 places in 152 ms of which 1 ms to minimize.
[2023-03-14 11:38:51] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 1 ms to minimize.
[2023-03-14 11:38:52] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 1 ms to minimize.
[2023-03-14 11:38:52] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:38:52] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:38:52] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 1 ms to minimize.
[2023-03-14 11:38:52] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:38:53] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 0 ms to minimize.
[2023-03-14 11:38:53] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 1 ms to minimize.
[2023-03-14 11:38:53] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 0 ms to minimize.
[2023-03-14 11:38:53] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:38:53] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 0 ms to minimize.
[2023-03-14 11:38:54] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 1 ms to minimize.
[2023-03-14 11:38:54] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-14 11:38:54] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 1 ms to minimize.
[2023-03-14 11:38:54] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 1 ms to minimize.
[2023-03-14 11:38:54] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 1 ms to minimize.
[2023-03-14 11:38:55] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 0 ms to minimize.
[2023-03-14 11:38:55] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 1 ms to minimize.
[2023-03-14 11:38:55] [INFO ] Deduced a trap composed of 147 places in 169 ms of which 0 ms to minimize.
[2023-03-14 11:38:55] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 0 ms to minimize.
[2023-03-14 11:38:55] [INFO ] Deduced a trap composed of 148 places in 139 ms of which 1 ms to minimize.
[2023-03-14 11:38:55] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 1 ms to minimize.
[2023-03-14 11:38:56] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:38:56] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2023-03-14 11:38:56] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 0 ms to minimize.
[2023-03-14 11:38:56] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 1 ms to minimize.
[2023-03-14 11:38:56] [INFO ] Deduced a trap composed of 151 places in 174 ms of which 0 ms to minimize.
[2023-03-14 11:38:57] [INFO ] Deduced a trap composed of 150 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:38:57] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 1 ms to minimize.
[2023-03-14 11:38:57] [INFO ] Deduced a trap composed of 158 places in 140 ms of which 0 ms to minimize.
[2023-03-14 11:38:57] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 0 ms to minimize.
[2023-03-14 11:38:57] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 1 ms to minimize.
[2023-03-14 11:38:57] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 0 ms to minimize.
[2023-03-14 11:38:58] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 0 ms to minimize.
[2023-03-14 11:38:58] [INFO ] Deduced a trap composed of 132 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:38:58] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 0 ms to minimize.
[2023-03-14 11:38:58] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 1 ms to minimize.
[2023-03-14 11:38:58] [INFO ] Deduced a trap composed of 86 places in 171 ms of which 0 ms to minimize.
[2023-03-14 11:38:58] [INFO ] Deduced a trap composed of 145 places in 138 ms of which 0 ms to minimize.
[2023-03-14 11:38:59] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 1 ms to minimize.
[2023-03-14 11:38:59] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 1 ms to minimize.
[2023-03-14 11:38:59] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:38:59] [INFO ] Deduced a trap composed of 134 places in 171 ms of which 0 ms to minimize.
[2023-03-14 11:38:59] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 1 ms to minimize.
[2023-03-14 11:39:00] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 1 ms to minimize.
[2023-03-14 11:39:00] [INFO ] Deduced a trap composed of 132 places in 163 ms of which 0 ms to minimize.
[2023-03-14 11:39:00] [INFO ] Deduced a trap composed of 135 places in 176 ms of which 1 ms to minimize.
[2023-03-14 11:39:00] [INFO ] Deduced a trap composed of 132 places in 198 ms of which 1 ms to minimize.
[2023-03-14 11:39:00] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 0 ms to minimize.
[2023-03-14 11:39:01] [INFO ] Deduced a trap composed of 130 places in 143 ms of which 1 ms to minimize.
[2023-03-14 11:39:01] [INFO ] Deduced a trap composed of 133 places in 159 ms of which 1 ms to minimize.
[2023-03-14 11:39:01] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 0 ms to minimize.
[2023-03-14 11:39:01] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 1 ms to minimize.
[2023-03-14 11:39:01] [INFO ] Deduced a trap composed of 132 places in 146 ms of which 1 ms to minimize.
[2023-03-14 11:39:01] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 0 ms to minimize.
[2023-03-14 11:39:02] [INFO ] Deduced a trap composed of 143 places in 135 ms of which 1 ms to minimize.
[2023-03-14 11:39:02] [INFO ] Deduced a trap composed of 140 places in 176 ms of which 0 ms to minimize.
[2023-03-14 11:39:02] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 1 ms to minimize.
[2023-03-14 11:39:02] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 0 ms to minimize.
[2023-03-14 11:39:02] [INFO ] Deduced a trap composed of 136 places in 175 ms of which 1 ms to minimize.
[2023-03-14 11:39:03] [INFO ] Deduced a trap composed of 143 places in 157 ms of which 0 ms to minimize.
[2023-03-14 11:39:03] [INFO ] Deduced a trap composed of 136 places in 168 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-14 11:39:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 11:39:03] [INFO ] After 25094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 75 ms.
Support contains 46 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 610 transition count 474
Reduce places removed 81 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 88 rules applied. Total rules applied 170 place count 529 transition count 467
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 177 place count 522 transition count 467
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 177 place count 522 transition count 345
Deduced a syphon composed of 122 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 434 place count 387 transition count 345
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 511 place count 310 transition count 268
Iterating global reduction 3 with 77 rules applied. Total rules applied 588 place count 310 transition count 268
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 588 place count 310 transition count 261
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 605 place count 300 transition count 261
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 763 place count 220 transition count 183
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 764 place count 220 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 765 place count 219 transition count 182
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 770 place count 219 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 771 place count 218 transition count 181
Applied a total of 771 rules in 164 ms. Remains 218 /616 variables (removed 398) and now considering 181/556 (removed 375) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 218/616 places, 181/556 transitions.
Incomplete random walk after 10000 steps, including 316 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 181 rows 218 cols
[2023-03-14 11:39:04] [INFO ] Computed 76 place invariants in 4 ms
[2023-03-14 11:39:04] [INFO ] [Real]Absence check using 56 positive place invariants in 11 ms returned sat
[2023-03-14 11:39:04] [INFO ] [Real]Absence check using 56 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-14 11:39:04] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 11:39:04] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2023-03-14 11:39:04] [INFO ] [Nat]Absence check using 56 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-14 11:39:04] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 11:39:04] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2023-03-14 11:39:04] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2023-03-14 11:39:04] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 0 ms to minimize.
[2023-03-14 11:39:04] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2023-03-14 11:39:04] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2023-03-14 11:39:04] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-03-14 11:39:05] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2023-03-14 11:39:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 567 ms
[2023-03-14 11:39:05] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-14 11:39:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-14 11:39:05] [INFO ] After 1042ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-14 11:39:05] [INFO ] After 1269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 26 ms.
Support contains 45 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 181/181 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 217 transition count 180
Applied a total of 2 rules in 23 ms. Remains 217 /218 variables (removed 1) and now considering 180/181 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 217/218 places, 180/181 transitions.
Incomplete random walk after 10000 steps, including 306 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1304535 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 1304535 steps, saw 243049 distinct states, run finished after 3002 ms. (steps per millisecond=434 ) properties seen :3
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 180 rows 217 cols
[2023-03-14 11:39:08] [INFO ] Computed 76 place invariants in 9 ms
[2023-03-14 11:39:09] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 11:39:09] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-14 11:39:09] [INFO ] [Nat]Absence check using 55 positive and 21 generalized place invariants in 6 ms returned sat
[2023-03-14 11:39:09] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 11:39:09] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-14 11:39:09] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 180/180 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 217 transition count 178
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 215 transition count 178
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 0 with 2 rules applied. Total rules applied 6 place count 214 transition count 177
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 214 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 213 transition count 176
Applied a total of 8 rules in 28 ms. Remains 213 /217 variables (removed 4) and now considering 176/180 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 213/217 places, 176/180 transitions.
Incomplete random walk after 10000 steps, including 271 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1396121 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :{}
Probabilistic random walk after 1396121 steps, saw 261901 distinct states, run finished after 3004 ms. (steps per millisecond=464 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 213 cols
[2023-03-14 11:39:12] [INFO ] Computed 76 place invariants in 11 ms
[2023-03-14 11:39:12] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 11:39:12] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2023-03-14 11:39:12] [INFO ] [Nat]Absence check using 56 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-14 11:39:12] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 11:39:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 11:39:12] [INFO ] After 71ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 11:39:12] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-14 11:39:13] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 213 /213 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 213/213 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 213 /213 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-14 11:39:13] [INFO ] Invariant cache hit.
[2023-03-14 11:39:13] [INFO ] Implicit Places using invariants in 162 ms returned [26, 27, 49, 51, 53, 55, 57, 59, 61, 63, 185]
Discarding 11 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 165 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 202/213 places, 174/176 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 198 transition count 161
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 198 transition count 161
Applied a total of 8 rules in 10 ms. Remains 198 /202 variables (removed 4) and now considering 161/174 (removed 13) transitions.
// Phase 1: matrix 161 rows 198 cols
[2023-03-14 11:39:13] [INFO ] Computed 67 place invariants in 6 ms
[2023-03-14 11:39:13] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-14 11:39:13] [INFO ] Invariant cache hit.
[2023-03-14 11:39:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 11:39:13] [INFO ] Implicit Places using invariants and state equation in 262 ms returned [103, 105, 112, 114, 118, 119, 130, 132, 135, 136, 138]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 383 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 187/213 places, 161/176 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 187 transition count 158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 184 transition count 158
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 17 place count 178 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 177 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 177 transition count 152
Applied a total of 19 rules in 17 ms. Remains 177 /187 variables (removed 10) and now considering 152/161 (removed 9) transitions.
// Phase 1: matrix 152 rows 177 cols
[2023-03-14 11:39:13] [INFO ] Computed 55 place invariants in 5 ms
[2023-03-14 11:39:13] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-14 11:39:13] [INFO ] Invariant cache hit.
[2023-03-14 11:39:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-14 11:39:13] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [15, 18, 23, 24, 25, 26, 29, 30, 34]
Discarding 9 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 323 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 168/213 places, 150/176 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 167 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 167 transition count 146
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 167 transition count 146
Applied a total of 7 rules in 15 ms. Remains 167 /168 variables (removed 1) and now considering 146/150 (removed 4) transitions.
// Phase 1: matrix 146 rows 167 cols
[2023-03-14 11:39:13] [INFO ] Computed 48 place invariants in 2 ms
[2023-03-14 11:39:14] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-14 11:39:14] [INFO ] Invariant cache hit.
[2023-03-14 11:39:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-14 11:39:14] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 167/213 places, 146/176 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1222 ms. Remains : 167/213 places, 146/176 transitions.
Incomplete random walk after 10000 steps, including 265 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1800567 steps, run timeout after 3001 ms. (steps per millisecond=599 ) properties seen :{}
Probabilistic random walk after 1800567 steps, saw 303356 distinct states, run finished after 3001 ms. (steps per millisecond=599 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 11:39:17] [INFO ] Invariant cache hit.
[2023-03-14 11:39:17] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 11:39:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-14 11:39:17] [INFO ] [Nat]Absence check using 36 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 11:39:17] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 11:39:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-14 11:39:17] [INFO ] After 33ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 11:39:17] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-14 11:39:17] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 40 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 146/146 transitions.
Applied a total of 0 rules in 6 ms. Remains 167 /167 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 167/167 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 146/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 167 /167 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2023-03-14 11:39:17] [INFO ] Invariant cache hit.
[2023-03-14 11:39:17] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-14 11:39:17] [INFO ] Invariant cache hit.
[2023-03-14 11:39:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-14 11:39:17] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-14 11:39:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 11:39:17] [INFO ] Invariant cache hit.
[2023-03-14 11:39:17] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 386 ms. Remains : 167/167 places, 146/146 transitions.
Graph (complete) has 482 edges and 167 vertex of which 165 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 164 transition count 145
Applied a total of 3 rules in 8 ms. Remains 164 /167 variables (removed 3) and now considering 145/146 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 145 rows 164 cols
[2023-03-14 11:39:18] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-14 11:39:18] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 11:39:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-14 11:39:18] [INFO ] [Nat]Absence check using 34 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 11:39:18] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 11:39:18] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2023-03-14 11:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-14 11:39:18] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-14 11:39:18] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 11:39:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-14 11:39:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 167 places, 146 transitions and 609 arcs took 2 ms.
[2023-03-14 11:39:18] [INFO ] Flatten gal took : 45 ms
Total runtime 43208 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 14
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 167 places, 146 transitions, 609 arcs.
Final Score: 3080.845
Took : 7 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678793966930

--------------------
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
ERROR in file model.sm near line 936:
syntax error

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is BusinessProcesses-PT-14, 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 r043-tajo-167813697000559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "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 ;