fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r042-tajo-167813695800465
Last Updated
May 14, 2023

About the Execution of Marcie+red for BusinessProcesses-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9619.163 3600000.00 3641600.00 708.90 ????????FT?????? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695800465.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-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:50 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:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 63K 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-03-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678727184985

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:06:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:06:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:06:26] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-13 17:06:26] [INFO ] Transformed 274 places.
[2023-03-13 17:06:26] [INFO ] Transformed 237 transitions.
[2023-03-13 17:06:26] [INFO ] Found NUPN structural information;
[2023-03-13 17:06:26] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-03-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 250 transition count 215
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 250 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 250 transition count 214
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 245 transition count 209
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 245 transition count 209
Applied a total of 55 rules in 49 ms. Remains 245 /273 variables (removed 28) and now considering 209/236 (removed 27) transitions.
// Phase 1: matrix 209 rows 245 cols
[2023-03-13 17:06:26] [INFO ] Computed 41 place invariants in 14 ms
[2023-03-13 17:06:27] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-13 17:06:27] [INFO ] Invariant cache hit.
[2023-03-13 17:06:27] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-13 17:06:27] [INFO ] Invariant cache hit.
[2023-03-13 17:06:27] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/273 places, 209/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 753 ms. Remains : 245/273 places, 209/236 transitions.
Support contains 92 out of 245 places after structural reductions.
[2023-03-13 17:06:27] [INFO ] Flatten gal took : 79 ms
[2023-03-13 17:06:27] [INFO ] Flatten gal took : 20 ms
[2023-03-13 17:06:28] [INFO ] Input system was already deterministic with 209 transitions.
Support contains 87 out of 245 places (down from 92) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 118 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 58) seen :41
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-13 17:06:28] [INFO ] Invariant cache hit.
[2023-03-13 17:06:28] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-13 17:06:29] [INFO ] [Nat]Absence check using 41 positive place invariants in 10 ms returned sat
[2023-03-13 17:06:29] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :14
[2023-03-13 17:06:29] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 6 ms to minimize.
[2023-03-13 17:06:29] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-13 17:06:29] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-03-13 17:06:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 198 ms
[2023-03-13 17:06:29] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2023-03-13 17:06:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-13 17:06:29] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2023-03-13 17:06:29] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2023-03-13 17:06:30] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2023-03-13 17:06:30] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2023-03-13 17:06:30] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2023-03-13 17:06:30] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2023-03-13 17:06:30] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2023-03-13 17:06:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 473 ms
[2023-03-13 17:06:30] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2023-03-13 17:06:30] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2023-03-13 17:06:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-03-13 17:06:30] [INFO ] After 1339ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :14
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-13 17:06:30] [INFO ] After 1721ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :14
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 11 properties in 67 ms.
Support contains 6 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 209/209 transitions.
Graph (trivial) has 137 edges and 245 vertex of which 6 / 245 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 484 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 239 transition count 157
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 196 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 195 transition count 156
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 90 place count 195 transition count 116
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 180 place count 145 transition count 116
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 202 place count 123 transition count 94
Iterating global reduction 3 with 22 rules applied. Total rules applied 224 place count 123 transition count 94
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 109 rules applied. Total rules applied 333 place count 68 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 67 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 335 place count 66 transition count 39
Applied a total of 335 rules in 28 ms. Remains 66 /245 variables (removed 179) and now considering 39/209 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 66/245 places, 39/209 transitions.
Finished random walk after 91 steps, including 3 resets, run visited all 3 properties in 3 ms. (steps per millisecond=30 )
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2023-03-13 17:06:30] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:06:30] [INFO ] Flatten gal took : 11 ms
[2023-03-13 17:06:30] [INFO ] Input system was already deterministic with 209 transitions.
Computed a total of 239 stabilizing places and 201 stable transitions
Graph (complete) has 491 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Graph (trivial) has 138 edges and 245 vertex of which 6 / 245 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 485 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 238 transition count 158
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 195 transition count 158
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 88 place count 195 transition count 118
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 89 rules applied. Total rules applied 177 place count 146 transition count 118
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 201 place count 122 transition count 94
Iterating global reduction 2 with 24 rules applied. Total rules applied 225 place count 122 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 225 place count 122 transition count 93
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 227 place count 121 transition count 93
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 327 place count 70 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 69 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 329 place count 68 transition count 43
Applied a total of 329 rules in 21 ms. Remains 68 /245 variables (removed 177) and now considering 43/209 (removed 166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 68/245 places, 43/209 transitions.
[2023-03-13 17:06:30] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:06:30] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:06:30] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 218 transition count 182
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 218 transition count 182
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 68 place count 204 transition count 168
Iterating global reduction 0 with 14 rules applied. Total rules applied 82 place count 204 transition count 168
Applied a total of 82 rules in 20 ms. Remains 204 /245 variables (removed 41) and now considering 168/209 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 204/245 places, 168/209 transitions.
[2023-03-13 17:06:30] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:06:30] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:06:30] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Graph (trivial) has 138 edges and 245 vertex of which 6 / 245 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 485 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 238 transition count 160
Reduce places removed 41 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 197 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 195 transition count 158
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 88 place count 195 transition count 117
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 180 place count 144 transition count 117
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 204 place count 120 transition count 93
Iterating global reduction 3 with 24 rules applied. Total rules applied 228 place count 120 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 228 place count 120 transition count 92
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 119 transition count 92
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 332 place count 67 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 333 place count 66 transition count 41
Applied a total of 333 rules in 21 ms. Remains 66 /245 variables (removed 179) and now considering 41/209 (removed 168) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 66/245 places, 41/209 transitions.
[2023-03-13 17:06:30] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:06:30] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:06:30] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 219 transition count 183
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 219 transition count 183
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 205 transition count 169
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 205 transition count 169
Applied a total of 80 rules in 10 ms. Remains 205 /245 variables (removed 40) and now considering 169/209 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 205/245 places, 169/209 transitions.
[2023-03-13 17:06:30] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:06:30] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:06:31] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 217 transition count 181
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 217 transition count 181
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 71 place count 202 transition count 166
Iterating global reduction 0 with 15 rules applied. Total rules applied 86 place count 202 transition count 166
Applied a total of 86 rules in 11 ms. Remains 202 /245 variables (removed 43) and now considering 166/209 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 202/245 places, 166/209 transitions.
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:06:31] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 218 transition count 182
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 218 transition count 182
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 68 place count 204 transition count 168
Iterating global reduction 0 with 14 rules applied. Total rules applied 82 place count 204 transition count 168
Applied a total of 82 rules in 12 ms. Remains 204 /245 variables (removed 41) and now considering 168/209 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 204/245 places, 168/209 transitions.
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:06:31] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 222 transition count 186
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 222 transition count 186
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 210 transition count 174
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 210 transition count 174
Applied a total of 70 rules in 11 ms. Remains 210 /245 variables (removed 35) and now considering 174/209 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 210/245 places, 174/209 transitions.
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:06:31] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 218 transition count 182
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 218 transition count 182
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 69 place count 203 transition count 167
Iterating global reduction 0 with 15 rules applied. Total rules applied 84 place count 203 transition count 167
Applied a total of 84 rules in 12 ms. Remains 203 /245 variables (removed 42) and now considering 167/209 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 203/245 places, 167/209 transitions.
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:06:31] [INFO ] Input system was already deterministic with 167 transitions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 219 transition count 183
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 219 transition count 183
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 205 transition count 169
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 205 transition count 169
Applied a total of 80 rules in 15 ms. Remains 205 /245 variables (removed 40) and now considering 169/209 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 205/245 places, 169/209 transitions.
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:06:31] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Graph (trivial) has 140 edges and 245 vertex of which 6 / 245 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 485 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 238 transition count 158
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 195 transition count 155
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 192 transition count 155
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 94 place count 192 transition count 117
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 83 rules applied. Total rules applied 177 place count 147 transition count 117
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 202 place count 122 transition count 92
Iterating global reduction 3 with 25 rules applied. Total rules applied 227 place count 122 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 227 place count 122 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 121 transition count 91
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 329 place count 70 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 330 place count 69 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 331 place count 68 transition count 41
Applied a total of 331 rules in 21 ms. Remains 68 /245 variables (removed 177) and now considering 41/209 (removed 168) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 68/245 places, 41/209 transitions.
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:06:31] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 219 transition count 183
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 219 transition count 183
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 206 transition count 170
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 206 transition count 170
Applied a total of 78 rules in 13 ms. Remains 206 /245 variables (removed 39) and now considering 170/209 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 206/245 places, 170/209 transitions.
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:06:31] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 220 transition count 184
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 220 transition count 184
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 65 place count 205 transition count 169
Iterating global reduction 0 with 15 rules applied. Total rules applied 80 place count 205 transition count 169
Applied a total of 80 rules in 16 ms. Remains 205 /245 variables (removed 40) and now considering 169/209 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 205/245 places, 169/209 transitions.
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:06:31] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 219 transition count 183
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 219 transition count 183
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 205 transition count 169
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 205 transition count 169
Applied a total of 80 rules in 12 ms. Remains 205 /245 variables (removed 40) and now considering 169/209 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 205/245 places, 169/209 transitions.
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:06:31] [INFO ] Input system was already deterministic with 169 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 245/245 places, 209/209 transitions.
Graph (trivial) has 140 edges and 245 vertex of which 6 / 245 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 485 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 238 transition count 158
Reduce places removed 43 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 195 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 193 transition count 156
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 92 place count 193 transition count 118
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 83 rules applied. Total rules applied 175 place count 148 transition count 118
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 201 place count 122 transition count 92
Iterating global reduction 3 with 26 rules applied. Total rules applied 227 place count 122 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 227 place count 122 transition count 91
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 121 transition count 91
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 333 place count 68 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 67 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 335 place count 66 transition count 39
Applied a total of 335 rules in 19 ms. Remains 66 /245 variables (removed 179) and now considering 39/209 (removed 170) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 66/245 places, 39/209 transitions.
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 1 ms
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:06:31] [INFO ] Input system was already deterministic with 39 transitions.
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 17:06:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:06:31] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 17:06:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 245 places, 209 transitions and 574 arcs took 1 ms.
Total runtime 4725 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 245 NrTr: 209 NrArc: 574)

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

net check time: 0m 0.000sec

init dd package: 0m 3.467sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6527520 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16102328 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLCardinality -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

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-03"
export BK_EXAMINATION="CTLCardinality"
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-03, examination is CTLCardinality"
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-167813695800465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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