Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r490-tall-167912709100774.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is TwoPhaseLocking-PT-nC00004vD, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709100774
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 8.5K Feb 25 17:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 17:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 17:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 17:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 25 17:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.6K Mar 5 18:23 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 TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679338852908

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC00004vD
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:00:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 19:00:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:00:54] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-03-20 19:00:54] [INFO ] Transformed 8 places.
[2023-03-20 19:00:54] [INFO ] Transformed 6 transitions.
[2023-03-20 19:00:54] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 311 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :9
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 500 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6 rows 8 cols
[2023-03-20 19:00:54] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-20 19:00:55] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 19:00:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 19:00:55] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 803 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: TwoPhaseLocking_PT_nC00004vD
(NrP: 8 NrTr: 6 NrArc: 18)

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

net check time: 0m 0.000sec

init dd package: 0m 2.736sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 54 (5.4e+01) #states 32



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

checking: AG [4<=haveA2]
normalized: ~ [E [true U ~ [4<=haveA2]]]

abstracting: (4<=haveA2)
states: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [haveA2andB<=0]
normalized: ~ [E [true U ~ [haveA2andB<=0]]]

abstracting: (haveA2andB<=0)
states: 24
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [haveA<=0]
normalized: ~ [E [true U ~ [haveA<=0]]]

abstracting: (haveA<=0)
states: 19
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[haveB<=haveA2 | haveAandB<=haveA]]
normalized: ~ [E [true U ~ [[haveB<=haveA2 | haveAandB<=haveA]]]]

abstracting: (haveAandB<=haveA)
states: 26
abstracting: (haveB<=haveA2)
states: 20
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[~ [[Clients<=haveAandB | haveA2andB<=haveB]] | ~ [[resB<=haveA & [3<=haveAandB | ~ [[1<=resA | haveAandB<=0]]]]]]]]
normalized: E [true U ~ [[~ [[[~ [[1<=resA | haveAandB<=0]] | 3<=haveAandB] & resB<=haveA]] | ~ [[Clients<=haveAandB | haveA2andB<=haveB]]]]]

abstracting: (haveA2andB<=haveB)
states: 27
abstracting: (Clients<=haveAandB)
states: 5
abstracting: (resB<=haveA)
states: 20
abstracting: (3<=haveAandB)
states: 0
abstracting: (haveAandB<=0)
states: 24
abstracting: (1<=resA)
states: 13
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[haveB<=1 & ~ [[[haveA2<=1 & 2<=resB] | [resB<=haveA2 & [4<=haveB | ~ [[resA<=0 | 2<=haveA2andB]]]]]]] | ~ [haveA2<=haveA2andB]]]
normalized: ~ [E [true U ~ [[~ [haveA2<=haveA2andB] | [~ [[[[~ [[resA<=0 | 2<=haveA2andB]] | 4<=haveB] & resB<=haveA2] | [haveA2<=1 & 2<=resB]]] & haveB<=1]]]]]

abstracting: (haveB<=1)
states: 27
abstracting: (2<=resB)
states: 6
abstracting: (haveA2<=1)
states: 30
abstracting: (resB<=haveA2)
states: 20
abstracting: (4<=haveB)
states: 0
abstracting: (2<=haveA2andB)
states: 1
abstracting: (resA<=0)
states: 19
abstracting: (haveA2<=haveA2andB)
states: 22
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[[resB<=haveB | haveA2<=resA] & ~ [[~ [[haveA2andB<=resB & resB<=haveA]] | [4<=resB | 4<=haveA2]]]] | [~ [haveAandB<=3] & 4<=haveA2andB]]]]
normalized: ~ [E [true U [[~ [[[4<=resB | 4<=haveA2] | ~ [[haveA2andB<=resB & resB<=haveA]]]] & [resB<=haveB | haveA2<=resA]] | [~ [haveAandB<=3] & 4<=haveA2andB]]]]

abstracting: (4<=haveA2andB)
states: 0
abstracting: (haveAandB<=3)
states: 32
abstracting: (haveA2<=resA)
states: 23
abstracting: (resB<=haveB)
states: 20
abstracting: (resB<=haveA)
states: 20
abstracting: (haveA2andB<=resB)
states: 27
abstracting: (4<=haveA2)
states: 0
abstracting: (4<=resB)
states: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[haveA<=1 & ~ [[[4<=haveB | [[3<=Clients & ~ [haveA2andB<=3]] & [[resA<=0 & haveAandB<=haveA] | ~ [haveA<=3]]]] & [3<=haveA2 | ~ [haveAandB<=resB]]]]] & haveB<=4] & haveAandB<=haveA]]
normalized: ~ [E [true U ~ [[[[~ [[[~ [haveAandB<=resB] | 3<=haveA2] & [[[~ [haveA<=3] | [resA<=0 & haveAandB<=haveA]] & [~ [haveA2andB<=3] & 3<=Clients]] | 4<=haveB]]] & haveA<=1] & haveB<=4] & haveAandB<=haveA]]]]

abstracting: (haveAandB<=haveA)
states: 26
abstracting: (haveB<=4)
states: 32
abstracting: (haveA<=1)
states: 29
abstracting: (4<=haveB)
states: 0
abstracting: (3<=Clients)
states: 6
abstracting: (haveA2andB<=3)
states: 32
abstracting: (haveAandB<=haveA)
states: 26
abstracting: (resA<=0)
states: 19
abstracting: (haveA<=3)
states: 32
abstracting: (3<=haveA2)
states: 0
abstracting: (haveAandB<=resB)
states: 27
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[~ [[~ [[haveAandB<=haveA2andB & ~ [haveA<=resB]]] & 3<=Clients]] | ~ [[3<=resB & haveAandB<=resB]]] & ~ [[~ [resA<=haveA2] | ~ [[[haveA<=0 & [2<=Clients & haveB<=1]] | [4<=resA | [4<=haveA2andB | 1<=Clients]]]]]]]]
normalized: E [true U [~ [[~ [[[[4<=haveA2andB | 1<=Clients] | 4<=resA] | [[2<=Clients & haveB<=1] & haveA<=0]]] | ~ [resA<=haveA2]]] & [~ [[3<=resB & haveAandB<=resB]] | ~ [[~ [[~ [haveA<=resB] & haveAandB<=haveA2andB]] & 3<=Clients]]]]]

abstracting: (3<=Clients)
states: 6
abstracting: (haveAandB<=haveA2andB)
states: 25
abstracting: (haveA<=resB)
states: 26
abstracting: (haveAandB<=resB)
states: 27
abstracting: (3<=resB)
states: 0
abstracting: (resA<=haveA2)
states: 22
abstracting: (haveA<=0)
states: 19
abstracting: (haveB<=1)
states: 27
abstracting: (2<=Clients)
states: 21
abstracting: (4<=resA)
states: 0
abstracting: (1<=Clients)
states: 30
abstracting: (4<=haveA2andB)
states: 0
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[~ [[[haveAandB<=2 & [[~ [2<=Clients] | [[haveA2andB<=4 & 4<=haveA] | [Clients<=4 | Clients<=4]]] | [~ [resB<=haveAandB] | ~ [resB<=3]]]] & [[1<=haveA2 | ~ [resA<=2]] & ~ [[~ [[haveA<=2 & 3<=resB]] & [[resB<=haveA2 & haveA2andB<=2] & [Clients<=haveAandB | 1<=resA]]]]]]] & ~ [4<=haveB]]]]
normalized: E [true U ~ [[~ [[[[[[[haveA2andB<=4 & 4<=haveA] | [Clients<=4 | Clients<=4]] | ~ [2<=Clients]] | [~ [resB<=3] | ~ [resB<=haveAandB]]] & haveAandB<=2] & [~ [[[[Clients<=haveAandB | 1<=resA] & [resB<=haveA2 & haveA2andB<=2]] & ~ [[haveA<=2 & 3<=resB]]]] & [~ [resA<=2] | 1<=haveA2]]]] & ~ [4<=haveB]]]]

abstracting: (4<=haveB)
states: 0
abstracting: (1<=haveA2)
states: 12
abstracting: (resA<=2)
states: 32
abstracting: (3<=resB)
states: 0
abstracting: (haveA<=2)
states: 32
abstracting: (haveA2andB<=2)
states: 32
abstracting: (resB<=haveA2)
states: 20
abstracting: (1<=resA)
states: 13
abstracting: (Clients<=haveAandB)
states: 5
abstracting: (haveAandB<=2)
states: 32
abstracting: (resB<=haveAandB)
states: 17
abstracting: (resB<=3)
states: 32
abstracting: (2<=Clients)
states: 21
abstracting: (Clients<=4)
states: 32
abstracting: (Clients<=4)
states: 32
abstracting: (4<=haveA)
states: 0
abstracting: (haveA2andB<=4)
states: 32
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[[~ [[2<=haveA & [2<=Clients | 4<=resA]]] | Clients<=resB] | [2<=Clients | [~ [[[[haveA2<=resB | resA<=3] & ~ [4<=resB]] & 4<=haveB]] | [~ [4<=haveB] | ~ [[[4<=haveA | haveB<=1] | haveAandB<=2]]]]]] & [[haveB<=haveAandB & ~ [[~ [3<=resA] & ~ [3<=haveAandB]]]] | 2<=haveAandB]]]]
normalized: E [true U ~ [[[[~ [[~ [3<=haveAandB] & ~ [3<=resA]]] & haveB<=haveAandB] | 2<=haveAandB] & [[[[~ [[[4<=haveA | haveB<=1] | haveAandB<=2]] | ~ [4<=haveB]] | ~ [[[~ [4<=resB] & [haveA2<=resB | resA<=3]] & 4<=haveB]]] | 2<=Clients] | [~ [[[2<=Clients | 4<=resA] & 2<=haveA]] | Clients<=resB]]]]]

abstracting: (Clients<=resB)
states: 8
abstracting: (2<=haveA)
states: 3
abstracting: (4<=resA)
states: 0
abstracting: (2<=Clients)
states: 21
abstracting: (2<=Clients)
states: 21
abstracting: (4<=haveB)
states: 0
abstracting: (resA<=3)
states: 32
abstracting: (haveA2<=resB)
states: 27
abstracting: (4<=resB)
states: 0
abstracting: (4<=haveB)
states: 0
abstracting: (haveAandB<=2)
states: 32
abstracting: (haveB<=1)
states: 27
abstracting: (4<=haveA)
states: 0
abstracting: (2<=haveAandB)
states: 1
abstracting: (haveB<=haveAandB)
states: 18
abstracting: (3<=resA)
states: 0
abstracting: (3<=haveAandB)
states: 0
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[~ [[~ [1<=resB] | 3<=haveB]] | [Clients<=resB & resA<=haveA]] | [[3<=haveA2andB & [~ [[Clients<=4 | haveA<=haveA2andB]] & resB<=1]] | [[~ [[[[resA<=1 | 1<=haveA2andB] & haveB<=haveA2andB] & [~ [4<=haveB] | [2<=resB | Clients<=Clients]]]] & [[[1<=resB & [haveA2<=Clients | 1<=Clients]] | [~ [haveA2<=1] | ~ [haveB<=resA]]] | ~ [[[resA<=2 | resB<=resB] & haveA2andB<=4]]]] | haveAandB<=4]]] & ~ [3<=Clients]]]
normalized: E [true U [[[[[~ [[[[resA<=1 | 1<=haveA2andB] & haveB<=haveA2andB] & [[2<=resB | Clients<=Clients] | ~ [4<=haveB]]]] & [~ [[[resA<=2 | resB<=resB] & haveA2andB<=4]] | [[~ [haveB<=resA] | ~ [haveA2<=1]] | [[haveA2<=Clients | 1<=Clients] & 1<=resB]]]] | haveAandB<=4] | [[~ [[Clients<=4 | haveA<=haveA2andB]] & resB<=1] & 3<=haveA2andB]] | [[Clients<=resB & resA<=haveA] | ~ [[~ [1<=resB] | 3<=haveB]]]] & ~ [3<=Clients]]]

abstracting: (3<=Clients)
states: 6
abstracting: (3<=haveB)
states: 0
abstracting: (1<=resB)
states: 18
abstracting: (resA<=haveA)
states: 22
abstracting: (Clients<=resB)
states: 8
abstracting: (3<=haveA2andB)
states: 0
abstracting: (resB<=1)
states: 26
abstracting: (haveA<=haveA2andB)
states: 21
abstracting: (Clients<=4)
states: 32
abstracting: (haveAandB<=4)
states: 32
abstracting: (1<=resB)
states: 18
abstracting: (1<=Clients)
states: 30
abstracting: (haveA2<=Clients)
states: 30
abstracting: (haveA2<=1)
states: 30
abstracting: (haveB<=resA)
states: 21
abstracting: (haveA2andB<=4)
states: 32
abstracting: (resB<=resB)
states: 32
abstracting: (resA<=2)
states: 32
abstracting: (4<=haveB)
states: 0
abstracting: (Clients<=Clients)
states: 32
abstracting: (2<=resB)
states: 6
abstracting: (haveB<=haveA2andB)
states: 18
abstracting: (1<=haveA2andB)
states: 8
abstracting: (resA<=1)
states: 29
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[[[haveB<=haveAandB & ~ [[[2<=Clients | 2<=haveA2] | 1<=haveA2]]] & [~ [[[resA<=4 & 2<=resB] | [4<=haveA2andB | 1<=resA]]] | [3<=resA & [4<=haveB | [[resA<=Clients | resB<=Clients] | [haveA2andB<=haveA2andB & 2<=haveB]]]]]] | ~ [haveA2<=resB]] | [[[haveA<=haveA & [[~ [haveAandB<=resA] | [[Clients<=haveA2 & Clients<=haveAandB] | ~ [haveB<=resA]]] & 1<=haveB]] & haveA2andB<=0] & Clients<=haveA]] & 2<=haveAandB]]
normalized: E [true U [[[[[[[[~ [haveB<=resA] | [Clients<=haveA2 & Clients<=haveAandB]] | ~ [haveAandB<=resA]] & 1<=haveB] & haveA<=haveA] & haveA2andB<=0] & Clients<=haveA] | [~ [haveA2<=resB] | [[[[[[haveA2andB<=haveA2andB & 2<=haveB] | [resA<=Clients | resB<=Clients]] | 4<=haveB] & 3<=resA] | ~ [[[4<=haveA2andB | 1<=resA] | [resA<=4 & 2<=resB]]]] & [~ [[[2<=Clients | 2<=haveA2] | 1<=haveA2]] & haveB<=haveAandB]]]] & 2<=haveAandB]]

abstracting: (2<=haveAandB)
states: 1
abstracting: (haveB<=haveAandB)
states: 18
abstracting: (1<=haveA2)
states: 12
abstracting: (2<=haveA2)
states: 2
abstracting: (2<=Clients)
states: 21
abstracting: (2<=resB)
states: 6
abstracting: (resA<=4)
states: 32
abstracting: (1<=resA)
states: 13
abstracting: (4<=haveA2andB)
states: 0
abstracting: (3<=resA)
states: 0
abstracting: (4<=haveB)
states: 0
abstracting: (resB<=Clients)
states: 32
abstracting: (resA<=Clients)
states: 32
abstracting: (2<=haveB)
states: 5
abstracting: (haveA2andB<=haveA2andB)
states: 32
abstracting: (haveA2<=resB)
states: 27
abstracting: (Clients<=haveA)
states: 8
abstracting: (haveA2andB<=0)
states: 24
abstracting: (haveA<=haveA)
states: 32
abstracting: (1<=haveB)
states: 17
abstracting: (haveAandB<=resA)
states: 26
abstracting: (Clients<=haveAandB)
states: 5
abstracting: (Clients<=haveA2)
states: 8
abstracting: (haveB<=resA)
states: 21
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[3<=resA & haveA2andB<=4]] | [~ [[[~ [[[~ [4<=resB] & [haveA<=1 | Clients<=Clients]] | [[4<=resA | haveAandB<=4] & [haveB<=4 & resA<=haveA]]]] & [[[[haveA2andB<=0 & Clients<=haveAandB] & ~ [4<=haveA]] & [[2<=resA | resB<=4] | [haveAandB<=1 | haveA<=haveA2]]] | ~ [[[resB<=resA | haveB<=resB] | ~ [resA<=haveAandB]]]]] & [~ [[~ [haveA2<=3] | [[haveA2andB<=2 | 1<=haveB] & ~ [haveA<=2]]]] & [[[[resA<=Clients & Clients<=resA] & ~ [haveA<=0]] | [[3<=haveA2andB | Clients<=4] | [haveA<=2 & haveA<=3]]] & ~ [3<=haveAandB]]]]] & [2<=haveB & [~ [Clients<=resB] & ~ [[~ [1<=resB] | [haveB<=1 & haveAandB<=haveA2]]]]]]]]
normalized: E [true U [[[[~ [[[haveB<=1 & haveAandB<=haveA2] | ~ [1<=resB]]] & ~ [Clients<=resB]] & 2<=haveB] & ~ [[[[~ [3<=haveAandB] & [[[haveA<=2 & haveA<=3] | [3<=haveA2andB | Clients<=4]] | [~ [haveA<=0] & [resA<=Clients & Clients<=resA]]]] & ~ [[[~ [haveA<=2] & [haveA2andB<=2 | 1<=haveB]] | ~ [haveA2<=3]]]] & [[~ [[~ [resA<=haveAandB] | [resB<=resA | haveB<=resB]]] | [[[haveAandB<=1 | haveA<=haveA2] | [2<=resA | resB<=4]] & [~ [4<=haveA] & [haveA2andB<=0 & Clients<=haveAandB]]]] & ~ [[[[haveB<=4 & resA<=haveA] & [4<=resA | haveAandB<=4]] | [[haveA<=1 | Clients<=Clients] & ~ [4<=resB]]]]]]]] | ~ [[3<=resA & haveA2andB<=4]]]]

abstracting: (haveA2andB<=4)
states: 32
abstracting: (3<=resA)
states: 0
abstracting: (4<=resB)
states: 0
abstracting: (Clients<=Clients)
states: 32
abstracting: (haveA<=1)
states: 29
abstracting: (haveAandB<=4)
states: 32
abstracting: (4<=resA)
states: 0
abstracting: (resA<=haveA)
states: 22
abstracting: (haveB<=4)
states: 32
abstracting: (Clients<=haveAandB)
states: 5
abstracting: (haveA2andB<=0)
states: 24
abstracting: (4<=haveA)
states: 0
abstracting: (resB<=4)
states: 32
abstracting: (2<=resA)
states: 3
abstracting: (haveA<=haveA2)
states: 22
abstracting: (haveAandB<=1)
states: 31
abstracting: (haveB<=resB)
states: 21
abstracting: (resB<=resA)
states: 20
abstracting: (resA<=haveAandB)
states: 21
abstracting: (haveA2<=3)
states: 32
abstracting: (1<=haveB)
states: 17
abstracting: (haveA2andB<=2)
states: 32
abstracting: (haveA<=2)
states: 32
abstracting: (Clients<=resA)
states: 5
abstracting: (resA<=Clients)
states: 32
abstracting: (haveA<=0)
states: 19
abstracting: (Clients<=4)
states: 32
abstracting: (3<=haveA2andB)
states: 0
abstracting: (haveA<=3)
states: 32
abstracting: (haveA<=2)
states: 32
abstracting: (3<=haveAandB)
states: 0
abstracting: (2<=haveB)
states: 5
abstracting: (Clients<=resB)
states: 8
abstracting: (1<=resB)
states: 18
abstracting: (haveAandB<=haveA2)
states: 26
abstracting: (haveB<=1)
states: 27
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[~ [[[Clients<=haveB | haveB<=Clients] & [~ [[[[haveB<=4 | 4<=haveA] & 4<=resA] & [2<=Clients & ~ [haveAandB<=1]]]] | [[1<=resB & 1<=haveAandB] & [[[haveAandB<=haveA & 1<=resA] & ~ [4<=Clients]] & ~ [Clients<=haveB]]]]]] | [[[3<=haveAandB | [4<=resB & ~ [haveA2andB<=haveA2]]] & ~ [[[4<=haveB & haveA2andB<=0] | ~ [resB<=3]]]] | [[[[[~ [haveAandB<=4] | [haveA2andB<=haveA2andB & haveAandB<=Clients]] | 2<=haveB] & [4<=resB & haveA<=3]] & ~ [[[[Clients<=3 & Clients<=resA] | ~ [resB<=3]] | [~ [haveA2<=resB] | ~ [Clients<=1]]]]] | [[2<=haveA2andB & [~ [[haveA2<=1 & haveAandB<=0]] & ~ [[resA<=2 | 2<=Clients]]]] & [~ [[2<=haveA2 & resA<=1]] & ~ [haveA<=2]]]]]] & resA<=0]]
normalized: E [true U [[[[[[~ [haveA<=2] & ~ [[2<=haveA2 & resA<=1]]] & [[~ [[resA<=2 | 2<=Clients]] & ~ [[haveA2<=1 & haveAandB<=0]]] & 2<=haveA2andB]] | [~ [[[~ [Clients<=1] | ~ [haveA2<=resB]] | [~ [resB<=3] | [Clients<=3 & Clients<=resA]]]] & [[4<=resB & haveA<=3] & [[[haveA2andB<=haveA2andB & haveAandB<=Clients] | ~ [haveAandB<=4]] | 2<=haveB]]]] | [~ [[~ [resB<=3] | [4<=haveB & haveA2andB<=0]]] & [[~ [haveA2andB<=haveA2] & 4<=resB] | 3<=haveAandB]]] | ~ [[[[[~ [Clients<=haveB] & [~ [4<=Clients] & [haveAandB<=haveA & 1<=resA]]] & [1<=resB & 1<=haveAandB]] | ~ [[[2<=Clients & ~ [haveAandB<=1]] & [4<=resA & [haveB<=4 | 4<=haveA]]]]] & [Clients<=haveB | haveB<=Clients]]]] & resA<=0]]

abstracting: (resA<=0)
states: 19
abstracting: (haveB<=Clients)
states: 28
abstracting: (Clients<=haveB)
states: 12
abstracting: (4<=haveA)
states: 0
abstracting: (haveB<=4)
states: 32
abstracting: (4<=resA)
states: 0
abstracting: (haveAandB<=1)
states: 31
abstracting: (2<=Clients)
states: 21
abstracting: (1<=haveAandB)
states: 8
abstracting: (1<=resB)
states: 18
abstracting: (1<=resA)
states: 13
abstracting: (haveAandB<=haveA)
states: 26
abstracting: (4<=Clients)
states: 1
abstracting: (Clients<=haveB)
states: 12
abstracting: (3<=haveAandB)
states: 0
abstracting: (4<=resB)
states: 0
abstracting: (haveA2andB<=haveA2)
states: 26
abstracting: (haveA2andB<=0)
states: 24
abstracting: (4<=haveB)
states: 0
abstracting: (resB<=3)
states: 32
abstracting: (2<=haveB)
states: 5
abstracting: (haveAandB<=4)
states: 32
abstracting: (haveAandB<=Clients)
states: 32
abstracting: (haveA2andB<=haveA2andB)
states: 32
abstracting: (haveA<=3)
states: 32
abstracting: (4<=resB)
states: 0
abstracting: (Clients<=resA)
states: 5
abstracting: (Clients<=3)
states: 31
abstracting: (resB<=3)
states: 32
abstracting: (haveA2<=resB)
states: 27
abstracting: (Clients<=1)
states: 11
abstracting: (2<=haveA2andB)
states: 1
abstracting: (haveAandB<=0)
states: 24
abstracting: (haveA2<=1)
states: 30
abstracting: (2<=Clients)
states: 21
abstracting: (resA<=2)
states: 32
abstracting: (resA<=1)
states: 29
abstracting: (2<=haveA2)
states: 2
abstracting: (haveA<=2)
states: 32
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[haveAandB<=haveB | ~ [[[[~ [resA<=haveAandB] & 3<=Clients] & [haveA2andB<=1 | [[~ [4<=haveAandB] & haveA<=haveAandB] | resB<=haveA2andB]]] & [[[[[[resA<=3 & haveA2<=resB] & [4<=haveAandB & haveA2<=haveAandB]] & [1<=resB & haveAandB<=haveA]] & [~ [resA<=1] & [[1<=resA & 4<=haveA] & ~ [haveA2andB<=4]]]] & [[[haveB<=Clients | ~ [haveA2<=Clients]] & [haveA2andB<=1 | [1<=Clients & resB<=0]]] & [haveA2andB<=haveAandB | [[resA<=2 & 4<=haveAandB] | ~ [3<=haveA]]]]] | [[haveA<=3 | ~ [[[Clients<=haveA2 | 1<=haveA2andB] & ~ [3<=Clients]]]] & [4<=haveA2 & [[2<=resB & ~ [haveA2<=Clients]] & [4<=Clients & ~ [haveAandB<=resB]]]]]]]]]]
normalized: E [true U [~ [[[[[[[~ [haveAandB<=resB] & 4<=Clients] & [~ [haveA2<=Clients] & 2<=resB]] & 4<=haveA2] & [~ [[~ [3<=Clients] & [Clients<=haveA2 | 1<=haveA2andB]]] | haveA<=3]] | [[[[~ [3<=haveA] | [resA<=2 & 4<=haveAandB]] | haveA2andB<=haveAandB] & [[[1<=Clients & resB<=0] | haveA2andB<=1] & [~ [haveA2<=Clients] | haveB<=Clients]]] & [[[~ [haveA2andB<=4] & [1<=resA & 4<=haveA]] & ~ [resA<=1]] & [[1<=resB & haveAandB<=haveA] & [[4<=haveAandB & haveA2<=haveAandB] & [resA<=3 & haveA2<=resB]]]]]] & [[[[~ [4<=haveAandB] & haveA<=haveAandB] | resB<=haveA2andB] | haveA2andB<=1] & [~ [resA<=haveAandB] & 3<=Clients]]]] | haveAandB<=haveB]]

abstracting: (haveAandB<=haveB)
states: 27
abstracting: (3<=Clients)
states: 6
abstracting: (resA<=haveAandB)
states: 21
abstracting: (haveA2andB<=1)
states: 31
abstracting: (resB<=haveA2andB)
states: 17
abstracting: (haveA<=haveAandB)
states: 21
abstracting: (4<=haveAandB)
states: 0
abstracting: (haveA2<=resB)
states: 27
abstracting: (resA<=3)
states: 32
abstracting: (haveA2<=haveAandB)
states: 22
abstracting: (4<=haveAandB)
states: 0
abstracting: (haveAandB<=haveA)
states: 26
abstracting: (1<=resB)
states: 18
abstracting: (resA<=1)
states: 29
abstracting: (4<=haveA)
states: 0
abstracting: (1<=resA)
states: 13
abstracting: (haveA2andB<=4)
states: 32
abstracting: (haveB<=Clients)
states: 28
abstracting: (haveA2<=Clients)
states: 30
abstracting: (haveA2andB<=1)
states: 31
abstracting: (resB<=0)
states: 14
abstracting: (1<=Clients)
states: 30
abstracting: (haveA2andB<=haveAandB)
states: 25
abstracting: (4<=haveAandB)
states: 0
abstracting: (resA<=2)
states: 32
abstracting: (3<=haveA)
states: 0
abstracting: (haveA<=3)
states: 32
abstracting: (1<=haveA2andB)
states: 8
abstracting: (Clients<=haveA2)
states: 8
abstracting: (3<=Clients)
states: 6
abstracting: (4<=haveA2)
states: 0
abstracting: (2<=resB)
states: 6
abstracting: (haveA2<=Clients)
states: 30
abstracting: (4<=Clients)
states: 1
abstracting: (haveAandB<=resB)
states: 27
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vD-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 1148 (1.1e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1115 1426 2541
used/not used/entry size/cache size: 1737 67107127 16 1024MB
basic ops cache: hits/miss/sum: 1910 4253 6163
used/not used/entry size/cache size: 6459 16770757 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: 566 379 945
used/not used/entry size/cache size: 379 8388229 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 67107857
1 944
2 32
3 7
4 11
5 9
6 1
7 2
8 0
9 0
>= 10 1

Total processing time: 0m 4.347sec


BK_STOP 1679338860359

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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:52 (8), effective:15 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:23 (3), effective:6 (1)

iterations count:19 (3), effective:4 (0)

iterations count:44 (7), effective:14 (2)

iterations count:30 (5), effective:9 (1)

iterations count:27 (4), effective:8 (1)

iterations count:18 (3), effective:5 (0)

iterations count:22 (3), effective:6 (1)

iterations count:17 (2), effective:4 (0)

iterations count:27 (4), effective:7 (1)

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

iterations count:10 (1), effective:2 (0)

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

iterations count:6 (1), effective:0 (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="TwoPhaseLocking-PT-nC00004vD"
export BK_EXAMINATION="ReachabilityCardinality"
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 TwoPhaseLocking-PT-nC00004vD, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r490-tall-167912709100774"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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