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.r042-tajo-167813696000599.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 marciexred
Input is BusinessProcesses-PT-19, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000599
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:45 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.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 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 189K 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-19-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678735336511

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:22:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:22:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:22:18] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-13 19:22:18] [INFO ] Transformed 772 places.
[2023-03-13 19:22:18] [INFO ] Transformed 685 transitions.
[2023-03-13 19:22:18] [INFO ] Found NUPN structural information;
[2023-03-13 19:22:18] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 34 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 54 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 15) seen :4
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 670 rows 757 cols
[2023-03-13 19:22:20] [INFO ] Computed 125 place invariants in 56 ms
[2023-03-13 19:22:20] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 19:22:21] [INFO ] [Nat]Absence check using 78 positive place invariants in 83 ms returned sat
[2023-03-13 19:22:21] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 24 ms returned sat
[2023-03-13 19:22:23] [INFO ] After 1742ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-13 19:22:23] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 5 ms to minimize.
[2023-03-13 19:22:23] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 1 ms to minimize.
[2023-03-13 19:22:24] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 1 ms to minimize.
[2023-03-13 19:22:24] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-13 19:22:24] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 2 ms to minimize.
[2023-03-13 19:22:24] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2023-03-13 19:22:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1386 ms
[2023-03-13 19:22:25] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 1 ms to minimize.
[2023-03-13 19:22:25] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 1 ms to minimize.
[2023-03-13 19:22:25] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 1 ms to minimize.
[2023-03-13 19:22:25] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2023-03-13 19:22:25] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 1 ms to minimize.
[2023-03-13 19:22:26] [INFO ] Deduced a trap composed of 177 places in 163 ms of which 0 ms to minimize.
[2023-03-13 19:22:26] [INFO ] Deduced a trap composed of 176 places in 167 ms of which 0 ms to minimize.
[2023-03-13 19:22:26] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 1 ms to minimize.
[2023-03-13 19:22:26] [INFO ] Deduced a trap composed of 173 places in 125 ms of which 1 ms to minimize.
[2023-03-13 19:22:26] [INFO ] Deduced a trap composed of 184 places in 131 ms of which 0 ms to minimize.
[2023-03-13 19:22:27] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 0 ms to minimize.
[2023-03-13 19:22:27] [INFO ] Deduced a trap composed of 174 places in 164 ms of which 1 ms to minimize.
[2023-03-13 19:22:27] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 1 ms to minimize.
[2023-03-13 19:22:27] [INFO ] Deduced a trap composed of 178 places in 168 ms of which 1 ms to minimize.
[2023-03-13 19:22:27] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2023-03-13 19:22:28] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 1 ms to minimize.
[2023-03-13 19:22:28] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 1 ms to minimize.
[2023-03-13 19:22:28] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 0 ms to minimize.
[2023-03-13 19:22:28] [INFO ] Deduced a trap composed of 170 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:22:28] [INFO ] Deduced a trap composed of 181 places in 131 ms of which 1 ms to minimize.
[2023-03-13 19:22:28] [INFO ] Deduced a trap composed of 178 places in 139 ms of which 0 ms to minimize.
[2023-03-13 19:22:29] [INFO ] Deduced a trap composed of 180 places in 123 ms of which 1 ms to minimize.
[2023-03-13 19:22:29] [INFO ] Deduced a trap composed of 169 places in 131 ms of which 0 ms to minimize.
[2023-03-13 19:22:29] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 1 ms to minimize.
[2023-03-13 19:22:29] [INFO ] Deduced a trap composed of 167 places in 143 ms of which 1 ms to minimize.
[2023-03-13 19:22:29] [INFO ] Deduced a trap composed of 169 places in 148 ms of which 0 ms to minimize.
[2023-03-13 19:22:29] [INFO ] Deduced a trap composed of 174 places in 149 ms of which 20 ms to minimize.
[2023-03-13 19:22:30] [INFO ] Deduced a trap composed of 177 places in 125 ms of which 1 ms to minimize.
[2023-03-13 19:22:30] [INFO ] Deduced a trap composed of 174 places in 131 ms of which 13 ms to minimize.
[2023-03-13 19:22:30] [INFO ] Deduced a trap composed of 171 places in 143 ms of which 0 ms to minimize.
[2023-03-13 19:22:30] [INFO ] Deduced a trap composed of 178 places in 128 ms of which 1 ms to minimize.
[2023-03-13 19:22:30] [INFO ] Deduced a trap composed of 179 places in 128 ms of which 0 ms to minimize.
[2023-03-13 19:22:30] [INFO ] Deduced a trap composed of 178 places in 145 ms of which 1 ms to minimize.
[2023-03-13 19:22:31] [INFO ] Deduced a trap composed of 175 places in 126 ms of which 1 ms to minimize.
[2023-03-13 19:22:31] [INFO ] Deduced a trap composed of 167 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:22:31] [INFO ] Deduced a trap composed of 180 places in 139 ms of which 1 ms to minimize.
[2023-03-13 19:22:31] [INFO ] Deduced a trap composed of 179 places in 124 ms of which 0 ms to minimize.
[2023-03-13 19:22:31] [INFO ] Deduced a trap composed of 169 places in 171 ms of which 0 ms to minimize.
[2023-03-13 19:22:31] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-13 19:22:32] [INFO ] Deduced a trap composed of 167 places in 129 ms of which 0 ms to minimize.
[2023-03-13 19:22:32] [INFO ] Deduced a trap composed of 168 places in 134 ms of which 0 ms to minimize.
[2023-03-13 19:22:32] [INFO ] Deduced a trap composed of 175 places in 151 ms of which 0 ms to minimize.
[2023-03-13 19:22:32] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 0 ms to minimize.
[2023-03-13 19:22:32] [INFO ] Deduced a trap composed of 178 places in 170 ms of which 1 ms to minimize.
[2023-03-13 19:22:33] [INFO ] Deduced a trap composed of 173 places in 144 ms of which 1 ms to minimize.
[2023-03-13 19:22:33] [INFO ] Deduced a trap composed of 169 places in 134 ms of which 1 ms to minimize.
[2023-03-13 19:22:33] [INFO ] Deduced a trap composed of 171 places in 136 ms of which 0 ms to minimize.
[2023-03-13 19:22:33] [INFO ] Deduced a trap composed of 175 places in 114 ms of which 1 ms to minimize.
[2023-03-13 19:22:33] [INFO ] Deduced a trap composed of 180 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:22:33] [INFO ] Deduced a trap composed of 172 places in 151 ms of which 5 ms to minimize.
[2023-03-13 19:22:34] [INFO ] Deduced a trap composed of 172 places in 170 ms of which 0 ms to minimize.
[2023-03-13 19:22:34] [INFO ] Deduced a trap composed of 182 places in 128 ms of which 1 ms to minimize.
[2023-03-13 19:22:34] [INFO ] Deduced a trap composed of 178 places in 136 ms of which 1 ms to minimize.
[2023-03-13 19:22:34] [INFO ] Deduced a trap composed of 173 places in 138 ms of which 1 ms to minimize.
[2023-03-13 19:22:35] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 1 ms to minimize.
[2023-03-13 19:22:35] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2023-03-13 19:22:35] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2023-03-13 19:22:35] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 10502 ms
[2023-03-13 19:22:35] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 21 ms to minimize.
[2023-03-13 19:22:35] [INFO ] Deduced a trap composed of 166 places in 140 ms of which 0 ms to minimize.
[2023-03-13 19:22:36] [INFO ] Deduced a trap composed of 178 places in 132 ms of which 13 ms to minimize.
[2023-03-13 19:22:36] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2023-03-13 19:22:36] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 2 ms to minimize.
[2023-03-13 19:22:36] [INFO ] Deduced a trap composed of 160 places in 138 ms of which 3 ms to minimize.
[2023-03-13 19:22:36] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 1 ms to minimize.
[2023-03-13 19:22:37] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2023-03-13 19:22:37] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 0 ms to minimize.
[2023-03-13 19:22:37] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 0 ms to minimize.
[2023-03-13 19:22:37] [INFO ] Deduced a trap composed of 159 places in 115 ms of which 0 ms to minimize.
[2023-03-13 19:22:37] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 1 ms to minimize.
[2023-03-13 19:22:37] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 1 ms to minimize.
[2023-03-13 19:22:37] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2246 ms
[2023-03-13 19:22:38] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2023-03-13 19:22:38] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2023-03-13 19:22:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2023-03-13 19:22:38] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 0 ms to minimize.
[2023-03-13 19:22:38] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 7 ms to minimize.
[2023-03-13 19:22:39] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 0 ms to minimize.
[2023-03-13 19:22:39] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:22:39] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 1 ms to minimize.
[2023-03-13 19:22:39] [INFO ] Deduced a trap composed of 153 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:22:39] [INFO ] Deduced a trap composed of 165 places in 109 ms of which 0 ms to minimize.
[2023-03-13 19:22:39] [INFO ] Deduced a trap composed of 167 places in 146 ms of which 1 ms to minimize.
[2023-03-13 19:22:40] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2023-03-13 19:22:40] [INFO ] Deduced a trap composed of 154 places in 136 ms of which 1 ms to minimize.
[2023-03-13 19:22:40] [INFO ] Deduced a trap composed of 161 places in 122 ms of which 1 ms to minimize.
[2023-03-13 19:22:40] [INFO ] Deduced a trap composed of 164 places in 143 ms of which 0 ms to minimize.
[2023-03-13 19:22:40] [INFO ] Deduced a trap composed of 156 places in 135 ms of which 1 ms to minimize.
[2023-03-13 19:22:40] [INFO ] Deduced a trap composed of 162 places in 135 ms of which 0 ms to minimize.
[2023-03-13 19:22:41] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 0 ms to minimize.
[2023-03-13 19:22:41] [INFO ] Deduced a trap composed of 154 places in 123 ms of which 1 ms to minimize.
[2023-03-13 19:22:41] [INFO ] Deduced a trap composed of 157 places in 129 ms of which 0 ms to minimize.
[2023-03-13 19:22:41] [INFO ] Deduced a trap composed of 160 places in 141 ms of which 1 ms to minimize.
[2023-03-13 19:22:41] [INFO ] Deduced a trap composed of 159 places in 132 ms of which 1 ms to minimize.
[2023-03-13 19:22:41] [INFO ] Deduced a trap composed of 161 places in 130 ms of which 0 ms to minimize.
[2023-03-13 19:22:42] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 0 ms to minimize.
[2023-03-13 19:22:42] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 1 ms to minimize.
[2023-03-13 19:22:42] [INFO ] Deduced a trap composed of 156 places in 138 ms of which 1 ms to minimize.
[2023-03-13 19:22:42] [INFO ] Deduced a trap composed of 167 places in 137 ms of which 1 ms to minimize.
[2023-03-13 19:22:42] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 0 ms to minimize.
[2023-03-13 19:22:42] [INFO ] Deduced a trap composed of 177 places in 137 ms of which 0 ms to minimize.
[2023-03-13 19:22:43] [INFO ] Deduced a trap composed of 169 places in 136 ms of which 0 ms to minimize.
[2023-03-13 19:22:43] [INFO ] Deduced a trap composed of 165 places in 122 ms of which 0 ms to minimize.
[2023-03-13 19:22:43] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 1 ms to minimize.
[2023-03-13 19:22:43] [INFO ] Deduced a trap composed of 161 places in 134 ms of which 0 ms to minimize.
[2023-03-13 19:22:43] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 0 ms to minimize.
[2023-03-13 19:22:43] [INFO ] Deduced a trap composed of 161 places in 130 ms of which 1 ms to minimize.
[2023-03-13 19:22:44] [INFO ] Deduced a trap composed of 166 places in 125 ms of which 1 ms to minimize.
[2023-03-13 19:22:44] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 0 ms to minimize.
[2023-03-13 19:22:44] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 0 ms to minimize.
[2023-03-13 19:22:44] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:22:45] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2023-03-13 19:22:45] [INFO ] Deduced a trap composed of 146 places in 147 ms of which 1 ms to minimize.
[2023-03-13 19:22:45] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 1 ms to minimize.
[2023-03-13 19:22:45] [INFO ] Deduced a trap composed of 162 places in 132 ms of which 0 ms to minimize.
[2023-03-13 19:22:45] [INFO ] Deduced a trap composed of 163 places in 137 ms of which 0 ms to minimize.
[2023-03-13 19:22:45] [INFO ] Deduced a trap composed of 144 places in 139 ms of which 0 ms to minimize.
[2023-03-13 19:22:45] [INFO ] Trap strengthening (SAT) tested/added 42/42 trap constraints in 7457 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-13 19:22:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 19:22:45] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 76 ms.
Support contains 82 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (complete) has 1520 edges and 757 vertex of which 748 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 748 transition count 581
Reduce places removed 88 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 96 rules applied. Total rules applied 185 place count 660 transition count 573
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 193 place count 652 transition count 573
Performed 127 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 127 Pre rules applied. Total rules applied 193 place count 652 transition count 446
Deduced a syphon composed of 127 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 265 rules applied. Total rules applied 458 place count 514 transition count 446
Discarding 84 places :
Symmetric choice reduction at 3 with 84 rule applications. Total rules 542 place count 430 transition count 362
Iterating global reduction 3 with 84 rules applied. Total rules applied 626 place count 430 transition count 362
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 626 place count 430 transition count 357
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 637 place count 424 transition count 357
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 638 place count 423 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 639 place count 423 transition count 356
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 853 place count 315 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 854 place count 315 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 856 place count 314 transition count 252
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 857 place count 314 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 858 place count 313 transition count 251
Applied a total of 858 rules in 270 ms. Remains 313 /757 variables (removed 444) and now considering 251/670 (removed 419) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 313/757 places, 251/670 transitions.
Incomplete random walk after 10000 steps, including 300 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1167292 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 1167292 steps, saw 197559 distinct states, run finished after 3003 ms. (steps per millisecond=388 ) properties seen :5
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 251 rows 313 cols
[2023-03-13 19:22:49] [INFO ] Computed 103 place invariants in 49 ms
[2023-03-13 19:22:49] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:22:50] [INFO ] [Nat]Absence check using 71 positive place invariants in 30 ms returned sat
[2023-03-13 19:22:50] [INFO ] [Nat]Absence check using 71 positive and 32 generalized place invariants in 9 ms returned sat
[2023-03-13 19:22:50] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:22:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 19:22:50] [INFO ] After 180ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:22:50] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-13 19:22:51] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2023-03-13 19:22:51] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2023-03-13 19:22:51] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-13 19:22:51] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2023-03-13 19:22:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 396 ms
[2023-03-13 19:22:51] [INFO ] After 861ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-13 19:22:51] [INFO ] After 1490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 45 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 251/251 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 313 transition count 248
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 310 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 309 transition count 247
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 8 place count 309 transition count 232
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 35 rules applied. Total rules applied 43 place count 289 transition count 232
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 285 transition count 228
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 285 transition count 228
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 92 place count 264 transition count 208
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 264 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 263 transition count 207
Applied a total of 94 rules in 64 ms. Remains 263 /313 variables (removed 50) and now considering 207/251 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 263/313 places, 207/251 transitions.
Incomplete random walk after 10000 steps, including 414 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1308330 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :{}
Probabilistic random walk after 1308330 steps, saw 224973 distinct states, run finished after 3001 ms. (steps per millisecond=435 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 207 rows 263 cols
[2023-03-13 19:22:54] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-13 19:22:54] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:22:54] [INFO ] [Nat]Absence check using 71 positive place invariants in 11 ms returned sat
[2023-03-13 19:22:54] [INFO ] [Nat]Absence check using 71 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-13 19:22:54] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:22:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 19:22:55] [INFO ] After 164ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:22:55] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-13 19:22:55] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-13 19:22:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2023-03-13 19:22:55] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2023-03-13 19:22:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 241 ms
[2023-03-13 19:22:55] [INFO ] After 493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-13 19:22:55] [INFO ] After 802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 45 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 207/207 transitions.
Applied a total of 0 rules in 6 ms. Remains 263 /263 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 263/263 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 207/207 transitions.
Applied a total of 0 rules in 6 ms. Remains 263 /263 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-13 19:22:55] [INFO ] Invariant cache hit.
[2023-03-13 19:22:55] [INFO ] Implicit Places using invariants in 354 ms returned [14, 23, 24, 84, 203, 207, 217]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 356 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 256/263 places, 207/207 transitions.
Applied a total of 0 rules in 20 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 383 ms. Remains : 256/263 places, 207/207 transitions.
Incomplete random walk after 10000 steps, including 420 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1328753 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :{}
Probabilistic random walk after 1328753 steps, saw 233834 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 207 rows 256 cols
[2023-03-13 19:22:59] [INFO ] Computed 90 place invariants in 8 ms
[2023-03-13 19:22:59] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:22:59] [INFO ] [Nat]Absence check using 69 positive place invariants in 11 ms returned sat
[2023-03-13 19:22:59] [INFO ] [Nat]Absence check using 69 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-13 19:22:59] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:22:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 19:22:59] [INFO ] After 128ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:22:59] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-03-13 19:22:59] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2023-03-13 19:22:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2023-03-13 19:22:59] [INFO ] After 348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-13 19:22:59] [INFO ] After 725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 45 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 9 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 256/256 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 10 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-13 19:22:59] [INFO ] Invariant cache hit.
[2023-03-13 19:23:00] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-13 19:23:00] [INFO ] Invariant cache hit.
[2023-03-13 19:23:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 19:23:00] [INFO ] Implicit Places using invariants and state equation in 279 ms returned [93, 165, 168, 170, 172, 173, 175, 177, 179, 181, 184]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 500 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 245/256 places, 207/207 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 245 transition count 203
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 241 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 240 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 240 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 237 transition count 199
Applied a total of 16 rules in 30 ms. Remains 237 /245 variables (removed 8) and now considering 199/207 (removed 8) transitions.
// Phase 1: matrix 199 rows 237 cols
[2023-03-13 19:23:00] [INFO ] Computed 79 place invariants in 2 ms
[2023-03-13 19:23:00] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-13 19:23:00] [INFO ] Invariant cache hit.
[2023-03-13 19:23:00] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 19:23:00] [INFO ] Implicit Places using invariants and state equation in 260 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 455 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 235/256 places, 199/207 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1011 ms. Remains : 235/256 places, 199/207 transitions.
Incomplete random walk after 10000 steps, including 423 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1562912 steps, run timeout after 3001 ms. (steps per millisecond=520 ) properties seen :{}
Probabilistic random walk after 1562912 steps, saw 272136 distinct states, run finished after 3001 ms. (steps per millisecond=520 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 199 rows 235 cols
[2023-03-13 19:23:03] [INFO ] Computed 77 place invariants in 21 ms
[2023-03-13 19:23:04] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:23:04] [INFO ] [Nat]Absence check using 57 positive place invariants in 7 ms returned sat
[2023-03-13 19:23:04] [INFO ] [Nat]Absence check using 57 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-13 19:23:04] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:23:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 19:23:04] [INFO ] After 88ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:23:04] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-13 19:23:04] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2023-03-13 19:23:04] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2023-03-13 19:23:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 185 ms
[2023-03-13 19:23:04] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-13 19:23:04] [INFO ] After 663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 45 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 199/199 transitions.
Applied a total of 0 rules in 15 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 235/235 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-13 19:23:04] [INFO ] Invariant cache hit.
[2023-03-13 19:23:04] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-13 19:23:04] [INFO ] Invariant cache hit.
[2023-03-13 19:23:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 19:23:05] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-13 19:23:05] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-13 19:23:05] [INFO ] Invariant cache hit.
[2023-03-13 19:23:05] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 526 ms. Remains : 235/235 places, 199/199 transitions.
Graph (complete) has 758 edges and 235 vertex of which 232 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 231 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 231 transition count 198
Applied a total of 3 rules in 8 ms. Remains 231 /235 variables (removed 4) and now considering 198/199 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 231 cols
[2023-03-13 19:23:05] [INFO ] Computed 74 place invariants in 8 ms
[2023-03-13 19:23:05] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:23:05] [INFO ] [Nat]Absence check using 56 positive place invariants in 7 ms returned sat
[2023-03-13 19:23:05] [INFO ] [Nat]Absence check using 56 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-13 19:23:05] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:23:05] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2023-03-13 19:23:05] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2023-03-13 19:23:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2023-03-13 19:23:05] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-13 19:23:05] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:23:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-13 19:23:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 235 places, 199 transitions and 937 arcs took 1 ms.
[2023-03-13 19:23:06] [INFO ] Flatten gal took : 85 ms
Total runtime 47525 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_19
(NrP: 235 NrTr: 199 NrArc: 937)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec

net check time: 0m 0.000sec

init dd package: 0m 2.938sec


RS generation: 0m 2.397sec


-> reachability set: #nodes 24016 (2.4e+04) #states 5,873,985,072 (9)



starting MCC model checker
--------------------------

checking: AG [[[[[[[[[[p197<=1 & 1<=p197] & [[p32<=1 & 1<=p32] & [p2<=1 & 1<=p2]]] & [[p24<=1 & 1<=p24] & [[p222<=1 & 1<=p222] & [p225<=1 & 1<=p225]]]] | [[p82<=1 & 1<=p82] & [p194<=0 & 0<=p194]]] | [[p55<=1 & 1<=p55] & [p201<=1 & 1<=p201]]] | [[p26<=0 & 0<=p26] | [p87<=0 & 0<=p87]]] & [p92<=0 & 0<=p92]] | [[[p110<=1 & 1<=p110] & [[p4<=1 & 1<=p4] & [p206<=1 & 1<=p206]]] & [[[p121<=1 & 1<=p121] | [[p181<=1 & 1<=p181] | [[[p8<=0 & 0<=p8] | [[p97<=0 & 0<=p97] | [p175<=0 & 0<=p175]]] & [[[p11<=0 & 0<=p11] | [p106<=0 & 0<=p106]] | [[p178<=0 & 0<=p178] | [[p222<=0 & 0<=p222] | [p225<=0 & 0<=p225]]]]]]] & [[[p51<=0 & 0<=p51] | [p186<=0 & 0<=p186]] & [[p154<=1 & 1<=p154] | [[[[p124<=1 & 1<=p124] & [p85<=1 & 1<=p85]] & [[[[p43<=0 & 0<=p43] | [p151<=0 & 0<=p151]] | [[p195<=0 & 0<=p195] | [p79<=0 & 0<=p79]]] & [[[p5<=0 & 0<=p5] | [p177<=0 & 0<=p177]] & [[[p47<=0 & 0<=p47] & [p16<=0 & 0<=p16]] | [[p82<=0 & 0<=p82] & [p190<=0 & 0<=p190]]]]]] | [[p31<=0 & 0<=p31] & [[[p49<=0 & 0<=p49] | [p158<=0 & 0<=p158]] | [[p210<=0 & 0<=p210] | [[p159<=0 & 0<=p159] | [p184<=0 & 0<=p184]]]]]]]]]]] | [0<=p40 & p40<=0]]]
normalized: ~ [E [true U ~ [[[0<=p40 & p40<=0] | [[[[[p121<=1 & 1<=p121] | [[p181<=1 & 1<=p181] | [[[p8<=0 & 0<=p8] | [[p175<=0 & 0<=p175] | [p97<=0 & 0<=p97]]] & [[[[p222<=0 & 0<=p222] | [p225<=0 & 0<=p225]] | [p178<=0 & 0<=p178]] | [[p106<=0 & 0<=p106] | [p11<=0 & 0<=p11]]]]]] & [[[p186<=0 & 0<=p186] | [p51<=0 & 0<=p51]] & [[[[[p124<=1 & 1<=p124] & [p85<=1 & 1<=p85]] & [[[[p43<=0 & 0<=p43] | [p151<=0 & 0<=p151]] | [[p195<=0 & 0<=p195] | [p79<=0 & 0<=p79]]] & [[[p5<=0 & 0<=p5] | [p177<=0 & 0<=p177]] & [[[p47<=0 & 0<=p47] & [p16<=0 & 0<=p16]] | [[p82<=0 & 0<=p82] & [p190<=0 & 0<=p190]]]]]] | [[p31<=0 & 0<=p31] & [[[p49<=0 & 0<=p49] | [p158<=0 & 0<=p158]] | [[p210<=0 & 0<=p210] | [[p159<=0 & 0<=p159] | [p184<=0 & 0<=p184]]]]]] | [p154<=1 & 1<=p154]]]] & [[p110<=1 & 1<=p110] & [[p206<=1 & 1<=p206] & [p4<=1 & 1<=p4]]]] | [[p92<=0 & 0<=p92] & [[[p87<=0 & 0<=p87] | [p26<=0 & 0<=p26]] | [[[p201<=1 & 1<=p201] & [p55<=1 & 1<=p55]] | [[[p194<=0 & 0<=p194] & [p82<=1 & 1<=p82]] | [[[[p225<=1 & 1<=p225] & [p222<=1 & 1<=p222]] & [p24<=1 & 1<=p24]] & [[[p2<=1 & 1<=p2] & [p32<=1 & 1<=p32]] & [p197<=1 & 1<=p197]]]]]]]]]]]]

abstracting: (1<=p197)
states: 6,488,064 (6)
abstracting: (p197<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p32)
states: 216,680,448 (8)
abstracting: (p32<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p2)
states: 2,508 (3)
abstracting: (p2<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p24)
states: 243,765,504 (8)
abstracting: (p24<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p222)
states: 10,813,440 (7)
abstracting: (p222<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p225)
states: 10,813,440 (7)
abstracting: (p225<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p82)
states: 1,589,219,328 (9)
abstracting: (p82<=1)
states: 5,873,985,072 (9)
abstracting: (0<=p194)
states: 5,873,985,072 (9)
abstracting: (p194<=0)
states: 5,588,510,256 (9)
abstracting: (1<=p55)
states: 4,325,376 (6)
abstracting: (p55<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p201)
states: 4,325,376 (6)
abstracting: (p201<=1)
states: 5,873,985,072 (9)
abstracting: (0<=p26)
states: 5,873,985,072 (9)
abstracting: (p26<=0)
states: 4,053,604,976 (9)
abstracting: (0<=p87)
states: 5,873,985,072 (9)
abstracting: (p87<=0)
states: 5,345,232,432 (9)
abstracting: (0<=p92)
states: 5,873,985,072 (9)
abstracting: (p92<=0)
states: 5,872,608,046 (9)
abstracting: (1<=p4)
states: 2,508 (3)
abstracting: (p4<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p206)
states: 1,769,472 (6)
abstracting: (p206<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p110)
states: 1,957,637,600 (9)
abstracting: (p110<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p154)
states: 2,100,781,056 (9)
abstracting: (p154<=1)
states: 5,873,985,072 (9)
abstracting: (0<=p184)
states: 5,873,985,072 (9)
abstracting: (p184<=0)
states: 5,873,067,568 (9)
abstracting: (0<=p159)
states: 5,873,985,072 (9)
abstracting: (p159<=0)
states: 5,792,889,660 (9)
abstracting: (0<=p210)
states: 5,873,985,072 (9)
abstracting: (p210<=0)
states: 5,440,620,483 (9)
abstracting: (0<=p158)
states: 5,873,985,072 (9)
abstracting: (p158<=0)
states: 5,854,385,712 (9)
abstracting: (0<=p49)
states: 5,873,985,072 (9)
abstracting: (p49<=0)
states: 3,515,600,156 (9)
abstracting: (0<=p31)
states: 5,873,985,072 (9)
abstracting: (p31<=0)
states: 5,657,304,624 (9)
abstracting: (0<=p190)
states: 5,873,985,072 (9)
abstracting: (p190<=0)
states: 5,766,932,016 (9)
abstracting: (0<=p82)
states: 5,873,985,072 (9)
abstracting: (p82<=0)
states: 4,284,765,744 (9)
abstracting: (0<=p16)
states: 5,873,985,072 (9)
abstracting: (p16<=0)
states: 2,945,284,656 (9)
abstracting: (0<=p47)
states: 5,873,985,072 (9)
abstracting: (p47<=0)
states: 5,722,596,912 (9)
abstracting: (0<=p177)
states: 5,873,985,072 (9)
abstracting: (p177<=0)
states: 5,873,690,160 (9)
abstracting: (0<=p5)
states: 5,873,985,072 (9)
abstracting: (p5<=0)
states: 5,873,982,564 (9)
abstracting: (0<=p79)
states: 5,873,985,072 (9)
abstracting: (p79<=0)
states: 2,996,325,936 (9)
abstracting: (0<=p195)
states: 5,873,985,072 (9)
abstracting: (p195<=0)
states: 5,683,668,528 (9)
abstracting: (0<=p151)
states: 5,873,985,072 (9)
abstracting: (p151<=0)
states: 3,202,327,356 (9)
abstracting: (0<=p43)
states: 5,873,985,072 (9)
abstracting: (p43<=0)
states: 5,683,668,528 (9)
abstracting: (1<=p85)
states: 1,587,437,568 (9)
abstracting: (p85<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p124)
states: 2,897,376 (6)
abstracting: (p124<=1)
states: 5,873,985,072 (9)
abstracting: (0<=p51)
states: 5,873,985,072 (9)
abstracting: (p51<=0)
states: 5,493,487,152 (9)
abstracting: (0<=p186)
states: 5,873,985,072 (9)
abstracting: (p186<=0)
states: 5,765,644,848 (9)
abstracting: (0<=p11)
states: 5,873,985,072 (9)
abstracting: (p11<=0)
states: 5,872,805,424 (9)
abstracting: (0<=p106)
states: 5,873,985,072 (9)
abstracting: (p106<=0)
states: 2,938,632,544 (9)
abstracting: (0<=p178)
states: 5,873,985,072 (9)
abstracting: (p178<=0)
states: 5,872,805,424 (9)
abstracting: (0<=p225)
states: 5,873,985,072 (9)
abstracting: (p225<=0)
states: 5,863,171,632 (9)
abstracting: (0<=p222)
states: 5,873,985,072 (9)
abstracting: (p222<=0)
states: 5,863,171,632 (9)
abstracting: (0<=p97)
states: 5,873,985,072 (9)
abstracting: (p97<=0)
states: 2,937,384,544 (9)
abstracting: (0<=p175)
states: 5,873,985,072 (9)
abstracting: (p175<=0)
states: 5,873,690,160 (9)
abstracting: (0<=p8)
states: 5,873,985,072 (9)
abstracting: (p8<=0)
states: 5,873,690,160 (9)
abstracting: (1<=p181)
states: 294,912 (5)
abstracting: (p181<=1)
states: 5,873,985,072 (9)
abstracting: (1<=p121)
states: 2,897,376 (6)
abstracting: (p121<=1)
states: 5,873,985,072 (9)
abstracting: (p40<=0)
states: 5,683,668,528 (9)
abstracting: (0<=p40)
states: 5,873,985,072 (9)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-19-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.152sec

totally nodes used: 1812815 (1.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2864898 16817976 19682874
used/not used/entry size/cache size: 16047358 51061506 16 1024MB
basic ops cache: hits/miss/sum: 336889 2115886 2452775
used/not used/entry size/cache size: 3282930 13494286 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 30698 174394 205092
used/not used/entry size/cache size: 173178 8215430 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 65572763
1 1308586
2 185869
3 35165
4 5551
5 832
6 80
7 13
8 4
9 0
>= 10 1

Total processing time: 0m 9.710sec


BK_STOP 1678735396009

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:49199 (247), effective:2569 (12)

initing FirstDep: 0m 0.000sec


iterations count:9607 (48), effective:390 (1)

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-19"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BusinessProcesses-PT-19, 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 r042-tajo-167813696000599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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