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-167813695400161.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 BridgeAndVehicles-PT-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695400161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 12:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 25 12:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 12:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K 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 BridgeAndVehicles-PT-V04P05N02-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678698925844

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=BridgeAndVehicles-PT-V04P05N02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:15:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:15:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:15:28] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-13 09:15:28] [INFO ] Transformed 28 places.
[2023-03-13 09:15:28] [INFO ] Transformed 52 transitions.
[2023-03-13 09:15:28] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 112 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Applied a total of 0 rules in 7 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-13 09:15:28] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2023-03-13 09:15:28] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-13 09:15:28] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
[2023-03-13 09:15:28] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 09:15:28] [INFO ] Invariant cache hit.
[2023-03-13 09:15:28] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-13 09:15:28] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 09:15:28] [INFO ] Invariant cache hit.
[2023-03-13 09:15:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 09:15:28] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-13 09:15:28] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 09:15:28] [INFO ] Invariant cache hit.
[2023-03-13 09:15:28] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 28/28 places, 52/52 transitions.
Support contains 26 out of 28 places after structural reductions.
[2023-03-13 09:15:28] [INFO ] Flatten gal took : 36 ms
[2023-03-13 09:15:28] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:15:28] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 89) seen :42
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 47) seen :0
Running SMT prover for 47 properties.
[2023-03-13 09:15:29] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 09:15:29] [INFO ] Invariant cache hit.
[2023-03-13 09:15:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 09:15:29] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :15 sat :0 real:32
[2023-03-13 09:15:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 09:15:30] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :44 sat :3
[2023-03-13 09:15:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 09:15:30] [INFO ] After 28ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :44 sat :3
[2023-03-13 09:15:30] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :44 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-13 09:15:30] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :44 sat :3
Fused 47 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 146 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2023-03-13 09:15:30] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2023-03-13 09:15:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 09:15:30] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 26/28 places, 52/52 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 47 ms. (steps per millisecond=213 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 20 ms. (steps per millisecond=501 ) properties seen :0
Successfully simplified 47 atomic propositions for a total of 15 simplifications.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:15:30] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2023-03-13 09:15:30] [INFO ] Flatten gal took : 27 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:15:30] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:15:30] [INFO ] Input system was already deterministic with 52 transitions.
Support contains 20 out of 28 places (down from 23) after GAL structural reductions.
Computed a total of 19 stabilizing places and 20 stable transitions
Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 52
Applied a total of 1 rules in 3 ms. Remains 27 /28 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2023-03-13 09:15:30] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2023-03-13 09:15:30] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-13 09:15:30] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 27/28 places, 52/52 transitions.
[2023-03-13 09:15:30] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:15:30] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:15:30] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Applied a total of 2 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2023-03-13 09:15:30] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2023-03-13 09:15:30] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-13 09:15:31] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 26/28 places, 52/52 transitions.
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:15:31] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 214 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 5 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2023-03-13 09:15:31] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-13 09:15:31] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-13 09:15:31] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 101 ms. Remains : 25/28 places, 51/52 transitions.
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:15:31] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 51
Applied a total of 4 rules in 15 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2023-03-13 09:15:31] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-13 09:15:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 09:15:31] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 25/28 places, 51/52 transitions.
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:15:31] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Applied a total of 2 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
[2023-03-13 09:15:31] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2023-03-13 09:15:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 09:15:31] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 26/28 places, 52/52 transitions.
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:15:31] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 51
Applied a total of 4 rules in 1 ms. Remains 25 /28 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2023-03-13 09:15:31] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-13 09:15:31] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-13 09:15:31] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 25/28 places, 51/52 transitions.
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:15:31] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 52
Applied a total of 1 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2023-03-13 09:15:31] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2023-03-13 09:15:31] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-13 09:15:31] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 27/28 places, 52/52 transitions.
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:15:31] [INFO ] Input system was already deterministic with 52 transitions.
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:15:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:15:31] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-13 09:15:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 28 places, 52 transitions and 326 arcs took 1 ms.
Total runtime 3693 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: 28 NrTr: 52 NrArc: 326)

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

net check time: 0m 0.000sec

init dd package: 0m 3.060sec


RS generation: 0m 0.015sec


-> reachability set: #nodes 1717 (1.7e+03) #states 2,874 (3)



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

checking: EG [EX [EX [EG [p23<=1]]]]
normalized: EG [EX [EX [EG [p23<=1]]]]

abstracting: (p23<=1)
states: 1,596 (3)
............................................
EG iterations: 44
...
EG iterations: 1
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.093sec

checking: EG [AG [AX [AF [1<=p4]]]]
normalized: EG [~ [E [true U EX [EG [~ [1<=p4]]]]]]

abstracting: (1<=p4)
states: 312
...............
EG iterations: 15
..
EG iterations: 1
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: EX [EF [AG [~ [p0<=p7]]]]
normalized: EX [E [true U ~ [E [true U p0<=p7]]]]

abstracting: (p0<=p7)
states: 1,323 (3)
.-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EG [p15<=p20]
normalized: EG [p15<=p20]

abstracting: (p15<=p20)
states: 2,599 (3)
.....
EG iterations: 5
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [[EG [p6<=p18] & [EF [EX [0<=0]] | EG [AF [~ [p6<=p4]]]]]]
normalized: EG [[[EG [~ [EG [p6<=p4]]] | E [true U EX [0<=0]]] & EG [p6<=p18]]]

abstracting: (p6<=p18)
states: 1,217 (3)
..............................
EG iterations: 30
abstracting: (0<=0)
states: 2,874 (3)
.abstracting: (p6<=p4)
states: 1,012 (3)
..............................
EG iterations: 30
........................................................
EG iterations: 56
.............................
EG iterations: 29
-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.261sec

checking: ~ [A [[[p2<=p25 | EF [[~ [2<=p1] & [1<=p14 | p25<=p12]]]] | AX [1<=0]] U [[[[AX [p10<=p7] | AX [p25<=p1]] | EX [p21<=p0]] & p19<=0] & [[[~ [p12<=5] | ~ [p16<=p2]] | EX [0<=0]] & AF [AG [p12<=p14]]]]]]
normalized: ~ [[~ [EG [~ [[[~ [EG [E [true U ~ [p12<=p14]]]] & [EX [0<=0] | [~ [p16<=p2] | ~ [p12<=5]]]] & [p19<=0 & [EX [p21<=p0] | [~ [EX [~ [p25<=p1]]] | ~ [EX [~ [p10<=p7]]]]]]]]]] & ~ [E [~ [[[~ [EG [E [true U ~ [p12<=p14]]]] & [EX [0<=0] | [~ [p16<=p2] | ~ [p12<=5]]]] & [p19<=0 & [EX [p21<=p0] | [~ [EX [~ [p25<=p1]]] | ~ [EX [~ [p10<=p7]]]]]]]] U [~ [[~ [EX [~ [1<=0]]] | [p2<=p25 | E [true U [[1<=p14 | p25<=p12] & ~ [2<=p1]]]]]] & ~ [[[~ [EG [E [true U ~ [p12<=p14]]]] & [EX [0<=0] | [~ [p16<=p2] | ~ [p12<=5]]]] & [p19<=0 & [EX [p21<=p0] | [~ [EX [~ [p25<=p1]]] | ~ [EX [~ [p10<=p7]]]]]]]]]]]]]

abstracting: (p10<=p7)
states: 2,581 (3)
.abstracting: (p25<=p1)
states: 2,172 (3)
.abstracting: (p21<=p0)
states: 2,749 (3)
.abstracting: (p19<=0)
states: 2,216 (3)
abstracting: (p12<=5)
states: 2,874 (3)
abstracting: (p16<=p2)
states: 2,795 (3)
abstracting: (0<=0)
states: 2,874 (3)
.abstracting: (p12<=p14)
states: 1,874 (3)

EG iterations: 0
abstracting: (2<=p1)
states: 0
abstracting: (p25<=p12)
states: 2,164 (3)
abstracting: (1<=p14)
states: 594
abstracting: (p2<=p25)
states: 2,334 (3)
abstracting: (1<=0)
states: 0
.abstracting: (p10<=p7)
states: 2,581 (3)
.abstracting: (p25<=p1)
states: 2,172 (3)
.abstracting: (p21<=p0)
states: 2,749 (3)
.abstracting: (p19<=0)
states: 2,216 (3)
abstracting: (p12<=5)
states: 2,874 (3)
abstracting: (p16<=p2)
states: 2,795 (3)
abstracting: (0<=0)
states: 2,874 (3)
.abstracting: (p12<=p14)
states: 1,874 (3)

EG iterations: 0
abstracting: (p10<=p7)
states: 2,581 (3)
.abstracting: (p25<=p1)
states: 2,172 (3)
.abstracting: (p21<=p0)
states: 2,749 (3)
.abstracting: (p19<=0)
states: 2,216 (3)
abstracting: (p12<=5)
states: 2,874 (3)
abstracting: (p16<=p2)
states: 2,795 (3)
abstracting: (0<=0)
states: 2,874 (3)
.abstracting: (p12<=p14)
states: 1,874 (3)

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.102sec

checking: [~ [E [AX [AF [E [p21<=p11 U p1<=p21]]] U AG [[AG [p6<=2] & [A [p25<=0 U p7<=p2] & [p7<=p0 | 2<=p13]]]]]] & [E [EF [p24<=p25] U E [1<=p15 U [p23<=p10 & p7<=p14]]] | EX [0<=0]]]
normalized: [[EX [0<=0] | E [E [true U p24<=p25] U E [1<=p15 U [p23<=p10 & p7<=p14]]]] & ~ [E [~ [EX [EG [~ [E [p21<=p11 U p1<=p21]]]]] U ~ [E [true U ~ [[[[p7<=p0 | 2<=p13] & [~ [EG [~ [p7<=p2]]] & ~ [E [~ [p7<=p2] U [~ [p25<=0] & ~ [p7<=p2]]]]]] & ~ [E [true U ~ [p6<=2]]]]]]]]]]

abstracting: (p6<=2)
states: 2,454 (3)
abstracting: (p7<=p2)
states: 2,390 (3)
abstracting: (p25<=0)
states: 1,841 (3)
abstracting: (p7<=p2)
states: 2,390 (3)
abstracting: (p7<=p2)
states: 2,390 (3)
...........
EG iterations: 11
abstracting: (2<=p13)
states: 0
abstracting: (p7<=p0)
states: 2,550 (3)
abstracting: (p1<=p21)
states: 1,946 (3)
abstracting: (p21<=p11)
states: 2,528 (3)
.
EG iterations: 1
.abstracting: (p7<=p14)
states: 2,344 (3)
abstracting: (p23<=p10)
states: 886
abstracting: (1<=p15)
states: 315
abstracting: (p24<=p25)
states: 1,403 (3)
abstracting: (0<=0)
states: 2,874 (3)
.-> the formula is FALSE

FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.166sec

totally nodes used: 357881 (3.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 443546 1332384 1775930
used/not used/entry size/cache size: 1582411 65526453 16 1024MB
basic ops cache: hits/miss/sum: 118979 224882 343861
used/not used/entry size/cache size: 425865 16351351 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: 2488 8749 11237
used/not used/entry size/cache size: 8746 8379862 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 66788227
1 297604
2 19206
3 2385
4 558
5 112
6 77
7 124
8 39
9 44
>= 10 488

Total processing time: 0m 5.803sec


BK_STOP 1678698937755

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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


iterations count:2852 (54), effective:176 (3)

initing FirstDep: 0m 0.000sec


iterations count:670 (12), effective:35 (0)

iterations count:87 (1), effective:4 (0)

iterations count:52 (1), effective:0 (0)

iterations count:2700 (51), effective:146 (2)

iterations count:152 (2), effective:8 (0)

iterations count:2700 (51), effective:146 (2)

iterations count:2700 (51), effective:146 (2)

iterations count:86 (1), effective:3 (0)

iterations count:407 (7), effective:13 (0)

iterations count:1034 (19), effective:51 (0)

iterations count:956 (18), effective:42 (0)

iterations count:1994 (38), effective:121 (2)

iterations count:99 (1), effective:5 (0)

iterations count:2410 (46), effective:124 (2)

iterations count:297 (5), effective:25 (0)

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="BridgeAndVehicles-PT-V04P05N02"
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 BridgeAndVehicles-PT-V04P05N02, 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-167813695400161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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