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.r481-tall-167912692500841.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 marcie
Input is TwoPhaseLocking-PT-nC00100vN, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692500841
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.6K Feb 25 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 17:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 17:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:23 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-nC00100vN-CTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00100vN-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679868543617

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=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC00100vN
Not applying reductions.
Model is PT
CTLCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: TwoPhaseLocking_PT_nC00100vN
(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.900sec


RS generation: 0m 2.622sec


-> reachability set: #nodes 77010 (7.7e+04) #states 10,119,981 (7)



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

checking: EF [~ [EG [EF [haveA2<=52]]]]
normalized: E [true U ~ [EG [E [true U haveA2<=52]]]]

abstracting: (haveA2<=52)
states: 10,119,981 (7)

EG iterations: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.333sec

checking: EG [EF [71<=haveB]]
normalized: EG [E [true U 71<=haveB]]

abstracting: (71<=haveB)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.896sec

checking: EF [27<=haveAandB]
normalized: E [true U 27<=haveAandB]

abstracting: (27<=haveAandB)
states: 277,290 (5)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.299sec

checking: ~ [AG [~ [resB<=haveB]]]
normalized: E [true U resB<=haveB]

abstracting: (resB<=haveB)
states: 5,138,940 (6)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.361sec

checking: AX [AX [EF [E [[resB<=16 | 22<=resB] U [24<=haveAandB & haveA2<=haveA]]]]]
normalized: ~ [EX [EX [~ [E [true U E [[resB<=16 | 22<=resB] U [24<=haveAandB & haveA2<=haveA]]]]]]]

abstracting: (haveA2<=haveA)
states: 5,221,216 (6)
abstracting: (24<=haveAandB)
states: 482,328 (5)
abstracting: (22<=resB)
states: 3,513,168 (6)
abstracting: (resB<=16)
states: 5,245,860 (6)
..-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.153sec

checking: ~ [EF [~ [[[[[resA<=Clients | 42<=haveB] & EF [49<=resA]] | EX [22<=haveA]] | EG [[33<=haveA2 & 40<=haveA2]]]]]]
normalized: ~ [E [true U ~ [[EG [[33<=haveA2 & 40<=haveA2]] | [EX [22<=haveA] | [E [true U 49<=resA] & [resA<=Clients | 42<=haveB]]]]]]]

abstracting: (42<=haveB)
states: 243,555 (5)
abstracting: (resA<=Clients)
states: 10,118,706 (7)
abstracting: (49<=resA)
states: 258
abstracting: (22<=haveA)
states: 1,467,139 (6)
.abstracting: (40<=haveA2)
states: 48,037 (4)
abstracting: (33<=haveA2)
states: 270,504 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.123sec

checking: AG [EG [[AF [E [haveB<=86 U Clients<=33]] & AG [[[haveA2andB<=60 | haveA2andB<=resA] & [haveA2andB<=18 | haveA<=haveA2]]]]]]
normalized: ~ [E [true U ~ [EG [[~ [E [true U ~ [[[haveA2andB<=18 | haveA<=haveA2] & [haveA2andB<=60 | haveA2andB<=resA]]]]] & ~ [EG [~ [E [haveB<=86 U Clients<=33]]]]]]]]]

abstracting: (Clients<=33)
states: 2,258,688 (6)
abstracting: (haveB<=86)
states: 10,119,981 (7)
.
EG iterations: 1
abstracting: (haveA2andB<=resA)
states: 6,089,331 (6)
abstracting: (haveA2andB<=60)
states: 10,119,981 (7)
abstracting: (haveA<=haveA2)
states: 5,221,216 (6)
abstracting: (haveA2andB<=18)
states: 9,041,365 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.303sec

checking: EX [~ [AG [[[EX [haveA<=haveA] | AF [67<=haveA2]] | [[~ [haveA<=haveAandB] | AF [haveA2<=48]] & [haveA2andB<=26 | [resA<=33 | haveAandB<=62]]]]]]]
normalized: EX [E [true U ~ [[[[haveA2andB<=26 | [resA<=33 | haveAandB<=62]] & [~ [EG [~ [haveA2<=48]]] | ~ [haveA<=haveAandB]]] | [~ [EG [~ [67<=haveA2]]] | EX [haveA<=haveA]]]]]]

abstracting: (haveA<=haveA)
states: 10,119,981 (7)
.abstracting: (67<=haveA2)
states: 0

EG iterations: 0
abstracting: (haveA<=haveAandB)
states: 4,432,076 (6)
abstracting: (haveA2<=48)
states: 10,119,725 (7)
.
EG iterations: 1
abstracting: (haveAandB<=62)
states: 10,119,981 (7)
abstracting: (resA<=33)
states: 9,899,049 (6)
abstracting: (haveA2andB<=26)
states: 9,842,691 (6)
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.384sec

checking: AF [E [[AF [~ [[resB<=14 & 2<=resA]]] & E [[AG [42<=haveA2] | EG [haveA2<=haveA2]] U ~ [E [haveB<=14 U 29<=haveAandB]]]] U AG [EG [[haveB<=39 & Clients<=Clients]]]]]
normalized: ~ [EG [~ [E [[E [[EG [haveA2<=haveA2] | ~ [E [true U ~ [42<=haveA2]]]] U ~ [E [haveB<=14 U 29<=haveAandB]]] & ~ [EG [[resB<=14 & 2<=resA]]]] U ~ [E [true U ~ [EG [[haveB<=39 & Clients<=Clients]]]]]]]]]

abstracting: (Clients<=Clients)
states: 10,119,981 (7)
abstracting: (haveB<=39)
states: 9,733,464 (6)
..............
EG iterations: 14
abstracting: (2<=resA)
states: 8,879,780 (6)
abstracting: (resB<=14)
states: 4,663,998 (6)
..
EG iterations: 2
abstracting: (29<=haveAandB)
states: 184,690 (5)
abstracting: (haveB<=14)
states: 4,664,049 (6)
abstracting: (42<=haveA2)
states: 24,147 (4)
abstracting: (haveA2<=haveA2)
states: 10,119,981 (7)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.429sec

checking: ~ [EX [[[~ [EG [[17<=haveA & haveA2andB<=resB]]] & haveAandB<=76] & E [haveA2<=haveA2andB U [[AF [haveA2andB<=4] | haveB<=20] & E [haveAandB<=8 U Clients<=haveA2]]]]]]
normalized: ~ [EX [[E [haveA2<=haveA2andB U [E [haveAandB<=8 U Clients<=haveA2] & [haveB<=20 | ~ [EG [~ [haveA2andB<=4]]]]]] & [haveAandB<=76 & ~ [EG [[17<=haveA & haveA2andB<=resB]]]]]]]

abstracting: (haveA2andB<=resB)
states: 7,333,041 (6)
abstracting: (17<=haveA)
states: 2,562,512 (6)
...................................................................
EG iterations: 67
abstracting: (haveAandB<=76)
states: 10,119,981 (7)
abstracting: (haveA2andB<=4)
states: 3,975,577 (6)
..
EG iterations: 2
abstracting: (haveB<=20)
states: 6,347,208 (6)
abstracting: (Clients<=haveA2)
states: 546,221 (5)
abstracting: (haveAandB<=8)
states: 6,156,714 (6)
abstracting: (haveA2<=haveA2andB)
states: 4,432,076 (6)
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.630sec

checking: ~ [A [resB<=Clients U [AX [AG [EG [haveA2<=56]]] & [[[EG [38<=haveAandB] | ~ [[resB<=haveA2 & 40<=resB]]] | [EG [resB<=haveB] & EG [resA<=haveB]]] & EG [haveA2andB<=1]]]]]
normalized: ~ [[~ [EG [~ [[[EG [haveA2andB<=1] & [[EG [resA<=haveB] & EG [resB<=haveB]] | [~ [[resB<=haveA2 & 40<=resB]] | EG [38<=haveAandB]]]] & ~ [EX [E [true U ~ [EG [haveA2<=56]]]]]]]]] & ~ [E [~ [[[EG [haveA2andB<=1] & [[EG [resA<=haveB] & EG [resB<=haveB]] | [~ [[resB<=haveA2 & 40<=resB]] | EG [38<=haveAandB]]]] & ~ [EX [E [true U ~ [EG [haveA2<=56]]]]]]] U [~ [resB<=Clients] & ~ [[[EG [haveA2andB<=1] & [[EG [resA<=haveB] & EG [resB<=haveB]] | [~ [[resB<=haveA2 & 40<=resB]] | EG [38<=haveAandB]]]] & ~ [EX [E [true U ~ [EG [haveA2<=56]]]]]]]]]]]]

abstracting: (haveA2<=56)
states: 10,119,981 (7)

EG iterations: 0
.abstracting: (38<=haveAandB)
states: 16,744 (4)
..
EG iterations: 2
abstracting: (40<=resB)
states: 386,568 (5)
abstracting: (resB<=haveA2)
states: 3,478,710 (6)
abstracting: (resB<=haveB)
states: 5,138,940 (6)
.
EG iterations: 1
abstracting: (resA<=haveB)
states: 6,957,471 (6)
....................................................
EG iterations: 52
abstracting: (haveA2andB<=1)
states: 1,781,651 (6)
.
EG iterations: 1
abstracting: (resB<=Clients)
states: 10,117,380 (7)
abstracting: (haveA2<=56)
states: 10,119,981 (7)

EG iterations: 0
.abstracting: (38<=haveAandB)
states: 16,744 (4)
..
EG iterations: 2
abstracting: (40<=resB)
states: 386,568 (5)
abstracting: (resB<=haveA2)
states: 3,478,710 (6)
abstracting: (resB<=haveB)
states: 5,138,940 (6)
.
EG iterations: 1
abstracting: (resA<=haveB)
states: 6,957,471 (6)
....................................................
EG iterations: 52
abstracting: (haveA2andB<=1)
states: 1,781,651 (6)
.
EG iterations: 1
abstracting: (haveA2<=56)
states: 10,119,981 (7)

EG iterations: 0
.abstracting: (38<=haveAandB)
states: 16,744 (4)
..
EG iterations: 2
abstracting: (40<=resB)
states: 386,568 (5)
abstracting: (resB<=haveA2)
states: 3,478,710 (6)
abstracting: (resB<=haveB)
states: 5,138,940 (6)
.
EG iterations: 1
abstracting: (resA<=haveB)
states: 6,957,471 (6)
....................................................
EG iterations: 52
abstracting: (haveA2andB<=1)
states: 1,781,651 (6)
.
EG iterations: 1
...
EG iterations: 3
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.859sec

checking: EF [[[AG [~ [[E [haveA2<=50 U resA<=haveA] | [97<=haveB & haveA<=haveB]]]] & EF [~ [EF [49<=haveB]]]] & AX [~ [[AG [resB<=resA] & [[resA<=Clients & haveA2andB<=haveA2andB] | ~ [resA<=43]]]]]]]
normalized: E [true U [~ [EX [[[~ [resA<=43] | [resA<=Clients & haveA2andB<=haveA2andB]] & ~ [E [true U ~ [resB<=resA]]]]]] & [E [true U ~ [E [true U 49<=haveB]]] & ~ [E [true U [[97<=haveB & haveA<=haveB] | E [haveA2<=50 U resA<=haveA]]]]]]]

abstracting: (resA<=haveA)
states: 5,221,191 (6)
abstracting: (haveA2<=50)
states: 10,119,981 (7)
abstracting: (haveA<=haveB)
states: 6,957,471 (6)
abstracting: (97<=haveB)
states: 0
abstracting: (49<=haveB)
states: 12,702 (4)
abstracting: (resB<=resA)
states: 3,478,710 (6)
abstracting: (haveA2andB<=haveA2andB)
states: 10,119,981 (7)
abstracting: (resA<=Clients)
states: 10,118,706 (7)
abstracting: (resA<=43)
states: 10,109,565 (7)
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.065sec

checking: ~ [E [~ [EG [[E [90<=resA U haveA2andB<=95] & [[haveB<=22 | resA<=98] | [haveAandB<=haveA2andB & haveB<=resA]]]]] U ~ [[EF [~ [EX [haveB<=74]]] | [[EX [95<=haveA] & [AG [50<=haveA2andB] | [18<=resB | haveA2<=90]]] & haveAandB<=haveA2]]]]]
normalized: ~ [E [~ [EG [[[[haveAandB<=haveA2andB & haveB<=resA] | [haveB<=22 | resA<=98]] & E [90<=resA U haveA2andB<=95]]]] U ~ [[[haveAandB<=haveA2 & [[[18<=resB | haveA2<=90] | ~ [E [true U ~ [50<=haveA2andB]]]] & EX [95<=haveA]]] | E [true U ~ [EX [haveB<=74]]]]]]]

abstracting: (haveB<=74)
states: 10,119,981 (7)
.abstracting: (95<=haveA)
states: 0
.abstracting: (50<=haveA2andB)
states: 2
abstracting: (haveA2<=90)
states: 10,119,981 (7)
abstracting: (18<=resB)
states: 4,590,306 (6)
abstracting: (haveAandB<=haveA2)
states: 6,089,331 (6)
abstracting: (haveA2andB<=95)
states: 10,119,981 (7)
abstracting: (90<=resA)
states: 0
abstracting: (resA<=98)
states: 10,119,981 (7)
abstracting: (haveB<=22)
states: 6,859,359 (6)
abstracting: (haveB<=resA)
states: 3,478,761 (6)
abstracting: (haveAandB<=haveA2andB)
states: 5,300,166 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.720sec

checking: A [[~ [haveAandB<=haveAandB] | [[~ [E [haveA2<=24 U [93<=haveA2andB & haveA2<=resA]]] | EF [~ [[resB<=resA | 23<=resB]]]] & AG [[EX [Clients<=70] | ~ [[Clients<=28 & 51<=Clients]]]]]] U ~ [[EF [[[[35<=Clients & 41<=haveA2] & [32<=resA | 20<=haveA2andB]] | EG [65<=haveA2andB]]] & AF [~ [[haveAandB<=haveA2 & haveA2andB<=42]]]]]]
normalized: [~ [EG [[~ [EG [[haveAandB<=haveA2 & haveA2andB<=42]]] & E [true U [EG [65<=haveA2andB] | [[32<=resA | 20<=haveA2andB] & [35<=Clients & 41<=haveA2]]]]]]] & ~ [E [[~ [EG [[haveAandB<=haveA2 & haveA2andB<=42]]] & E [true U [EG [65<=haveA2andB] | [[32<=resA | 20<=haveA2andB] & [35<=Clients & 41<=haveA2]]]]] U [~ [[[~ [E [true U ~ [[~ [[Clients<=28 & 51<=Clients]] | EX [Clients<=70]]]]] & [E [true U ~ [[resB<=resA | 23<=resB]]] | ~ [E [haveA2<=24 U [93<=haveA2andB & haveA2<=resA]]]]] | ~ [haveAandB<=haveAandB]]] & [~ [EG [[haveAandB<=haveA2 & haveA2andB<=42]]] & E [true U [EG [65<=haveA2andB] | [[32<=resA | 20<=haveA2andB] & [35<=Clients & 41<=haveA2]]]]]]]]]

abstracting: (41<=haveA2)
states: 34,596 (4)
abstracting: (35<=Clients)
states: 7,652,502 (6)
abstracting: (20<=haveA2andB)
states: 927,520 (5)
abstracting: (32<=resA)
states: 327,712 (5)
abstracting: (65<=haveA2andB)
states: 0
.
EG iterations: 1
abstracting: (haveA2andB<=42)
states: 10,117,935 (7)
abstracting: (haveAandB<=haveA2)
states: 6,089,331 (6)
....................................................
EG iterations: 52
abstracting: (haveAandB<=haveAandB)
states: 10,119,981 (7)
abstracting: (haveA2<=resA)
states: 5,221,241 (6)
abstracting: (93<=haveA2andB)
states: 0
abstracting: (haveA2<=24)
states: 9,122,465 (6)
abstracting: (23<=resB)
states: 3,260,673 (6)
abstracting: (resB<=resA)
states: 3,478,710 (6)
abstracting: (Clients<=70)
states: 9,841,725 (6)
.abstracting: (51<=Clients)
states: 3,162,510 (6)
abstracting: (Clients<=28)
states: 1,374,861 (6)
abstracting: (41<=haveA2)
states: 34,596 (4)
abstracting: (35<=Clients)
states: 7,652,502 (6)
abstracting: (20<=haveA2andB)
states: 927,520 (5)
abstracting: (32<=resA)
states: 327,712 (5)
abstracting: (65<=haveA2andB)
states: 0
.
EG iterations: 1
abstracting: (haveA2andB<=42)
states: 10,117,935 (7)
abstracting: (haveAandB<=haveA2)
states: 6,089,331 (6)
....................................................
EG iterations: 52
abstracting: (41<=haveA2)
states: 34,596 (4)
abstracting: (35<=Clients)
states: 7,652,502 (6)
abstracting: (20<=haveA2andB)
states: 927,520 (5)
abstracting: (32<=resA)
states: 327,712 (5)
abstracting: (65<=haveA2andB)
states: 0
.
EG iterations: 1
abstracting: (haveA2andB<=42)
states: 10,117,935 (7)
abstracting: (haveAandB<=haveA2)
states: 6,089,331 (6)
....................................................
EG iterations: 52
.
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.549sec

checking: A [[resB<=haveA2andB | A [~ [[~ [[haveA2<=45 | haveA2andB<=haveAandB]] | resB<=49]] U ~ [haveA2andB<=87]]] U A [[EX [[~ [Clients<=14] | [56<=haveA2andB | resB<=haveAandB]]] & A [[resB<=resB | ~ [Clients<=84]] U AF [54<=resA]]] U [EF [[[60<=haveA2 | Clients<=Clients] & AG [6<=haveAandB]]] | [~ [haveB<=73] & E [AX [45<=resA] U ~ [78<=haveAandB]]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[[E [~ [EX [~ [45<=resA]]] U ~ [78<=haveAandB]] & ~ [haveB<=73]] | E [true U [~ [E [true U ~ [6<=haveAandB]]] & [60<=haveA2 | Clients<=Clients]]]]]]] & ~ [E [~ [[[E [~ [EX [~ [45<=resA]]] U ~ [78<=haveAandB]] & ~ [haveB<=73]] | E [true U [~ [E [true U ~ [6<=haveAandB]]] & [60<=haveA2 | Clients<=Clients]]]]] U [~ [[[~ [EG [EG [~ [54<=resA]]]] & ~ [E [EG [~ [54<=resA]] U [~ [[resB<=resB | ~ [Clients<=84]]] & EG [~ [54<=resA]]]]]] & EX [[[56<=haveA2andB | resB<=haveAandB] | ~ [Clients<=14]]]]] & ~ [[[E [~ [EX [~ [45<=resA]]] U ~ [78<=haveAandB]] & ~ [haveB<=73]] | E [true U [~ [E [true U ~ [6<=haveAandB]]] & [60<=haveA2 | Clients<=Clients]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[E [~ [EX [~ [45<=resA]]] U ~ [78<=haveAandB]] & ~ [haveB<=73]] | E [true U [~ [E [true U ~ [6<=haveAandB]]] & [60<=haveA2 | Clients<=Clients]]]]]]] & ~ [E [~ [[[E [~ [EX [~ [45<=resA]]] U ~ [78<=haveAandB]] & ~ [haveB<=73]] | E [true U [~ [E [true U ~ [6<=haveAandB]]] & [60<=haveA2 | Clients<=Clients]]]]] U [~ [[[~ [EG [EG [~ [54<=resA]]]] & ~ [E [EG [~ [54<=resA]] U [~ [[resB<=resB | ~ [Clients<=84]]] & EG [~ [54<=resA]]]]]] & EX [[[56<=haveA2andB | resB<=haveAandB] | ~ [Clients<=14]]]]] & ~ [[[E [~ [EX [~ [45<=resA]]] U ~ [78<=haveAandB]] & ~ [haveB<=73]] | E [true U [~ [E [true U ~ [6<=haveAandB]]] & [60<=haveA2 | Clients<=Clients]]]]]]]]]] U [~ [[resB<=haveA2andB | [~ [EG [haveA2andB<=87]] & ~ [E [haveA2andB<=87 U [haveA2andB<=87 & [resB<=49 | ~ [[haveA2<=45 | haveA2andB<=haveAandB]]]]]]]]] & ~ [[~ [EG [~ [[[E [~ [EX [~ [45<=resA]]] U ~ [78<=haveAandB]] & ~ [haveB<=73]] | E [true U [~ [E [true U ~ [6<=haveAandB]]] & [60<=haveA2 | Clients<=Clients]]]]]]] & ~ [E [~ [[[E [~ [EX [~ [45<=resA]]] U ~ [78<=haveAandB]] & ~ [haveB<=73]] | E [true U [~ [E [true U ~ [6<=haveAandB]]] & [60<=haveA2 | Clients<=Clients]]]]] U [~ [[[~ [EG [EG [~ [54<=resA]]]] & ~ [E [EG [~ [54<=resA]] U [~ [[resB<=resB | ~ [Clients<=84]]] & EG [~ [54<=resA]]]]]] & EX [[[56<=haveA2andB | resB<=haveAandB] | ~ [Clients<=14]]]]] & ~ [[[E [~ [EX [~ [45<=resA]]] U ~ [78<=haveAandB]] & ~ [haveB<=73]] | E [true U [~ [E [true U ~ [6<=haveAandB]]] & [60<=haveA2 | Clients<=Clients]]]]]]]]]]]]]]

abstracting: (Clients<=Clients)
states: 10,119,981 (7)
abstracting: (60<=haveA2)
states: 0
abstracting: (6<=haveAandB)
states: 5,526,072 (6)
abstracting: (haveB<=73)
states: 10,119,981 (7)
abstracting: (78<=haveAandB)
states: 0
abstracting: (45<=resA)
states: 6,300 (3)
.abstracting: (Clients<=14)
states: 162,741 (5)
abstracting: (resB<=haveAandB)
states: 3,065,115 (6)
abstracting: (56<=haveA2andB)
states: 0
.abstracting: (54<=resA)
states: 0

EG iterations: 0
abstracting: (Clients<=84)
states: 10,104,477 (7)
abstracting: (resB<=resB)
states: 10,119,981 (7)
abstracting: (54<=resA)
states: 0

EG iterations: 0
abstracting: (54<=resA)
states: 0

EG iterations: 0

EG iterations: 0
abstracting: (Clients<=Clients)
states: 10,119,981 (7)
abstracting: (60<=haveA2)
states: 0
abstracting: (6<=haveAandB)
states: 5,526,072 (6)
abstracting: (haveB<=73)
states: 10,119,981 (7)
abstracting: (78<=haveAandB)
states: 0
abstracting: (45<=resA)
states: 6,300 (3)
.abstracting: (Clients<=Clients)
states: 10,119,981 (7)
abstracting: (60<=haveA2)
states: 0
abstracting: (6<=haveAandB)
states: 5,526,072 (6)
abstracting: (haveB<=73)
states: 10,119,981 (7)
abstracting: (78<=haveAandB)
states: 0
abstracting: (45<=resA)
states: 6,300 (3)
.
EG iterations: 0
abstracting: (haveA2andB<=haveAandB)
states: 5,300,166 (6)
abstracting: (haveA2<=45)
states: 10,116,458 (7)
abstracting: (resB<=49)
states: 10,114,779 (7)
abstracting: (haveA2andB<=87)
states: 10,119,981 (7)
abstracting: (haveA2andB<=87)
states: 10,119,981 (7)
abstracting: (haveA2andB<=87)
states: 10,119,981 (7)

EG iterations: 0
abstracting: (resB<=haveA2andB)
states: 3,065,115 (6)
abstracting: (Clients<=Clients)
states: 10,119,981 (7)
abstracting: (60<=haveA2)
states: 0
abstracting: (6<=haveAandB)
states: 5,526,072 (6)
abstracting: (haveB<=73)
states: 10,119,981 (7)
abstracting: (78<=haveAandB)
states: 0
abstracting: (45<=resA)
states: 6,300 (3)
.abstracting: (Clients<=14)
states: 162,741 (5)
abstracting: (resB<=haveAandB)
states: 3,065,115 (6)
abstracting: (56<=haveA2andB)
states: 0
.abstracting: (54<=resA)
states: 0

EG iterations: 0
abstracting: (Clients<=84)
states: 10,104,477 (7)
abstracting: (resB<=resB)
states: 10,119,981 (7)
abstracting: (54<=resA)
states: 0

EG iterations: 0
abstracting: (54<=resA)
states: 0

EG iterations: 0

EG iterations: 0
abstracting: (Clients<=Clients)
states: 10,119,981 (7)
abstracting: (60<=haveA2)
states: 0
abstracting: (6<=haveAandB)
states: 5,526,072 (6)
abstracting: (haveB<=73)
states: 10,119,981 (7)
abstracting: (78<=haveAandB)
states: 0
abstracting: (45<=resA)
states: 6,300 (3)
.abstracting: (Clients<=Clients)
states: 10,119,981 (7)
abstracting: (60<=haveA2)
states: 0
abstracting: (6<=haveAandB)
states: 5,526,072 (6)
abstracting: (haveB<=73)
states: 10,119,981 (7)
abstracting: (78<=haveAandB)
states: 0
abstracting: (45<=resA)
states: 6,300 (3)
.
EG iterations: 0
abstracting: (Clients<=Clients)
states: 10,119,981 (7)
abstracting: (60<=haveA2)
states: 0
abstracting: (6<=haveAandB)
states: 5,526,072 (6)
abstracting: (haveB<=73)
states: 10,119,981 (7)
abstracting: (78<=haveAandB)
states: 0
abstracting: (45<=resA)
states: 6,300 (3)
.abstracting: (Clients<=14)
states: 162,741 (5)
abstracting: (resB<=haveAandB)
states: 3,065,115 (6)
abstracting: (56<=haveA2andB)
states: 0
.abstracting: (54<=resA)
states: 0

EG iterations: 0
abstracting: (Clients<=84)
states: 10,104,477 (7)
abstracting: (resB<=resB)
states: 10,119,981 (7)
abstracting: (54<=resA)
states: 0

EG iterations: 0
abstracting: (54<=resA)
states: 0

EG iterations: 0

EG iterations: 0
abstracting: (Clients<=Clients)
states: 10,119,981 (7)
abstracting: (60<=haveA2)
states: 0
abstracting: (6<=haveAandB)
states: 5,526,072 (6)
abstracting: (haveB<=73)
states: 10,119,981 (7)
abstracting: (78<=haveAandB)
states: 0
abstracting: (45<=resA)
states: 6,300 (3)
.abstracting: (Clients<=Clients)
states: 10,119,981 (7)
abstracting: (60<=haveA2)
states: 0
abstracting: (6<=haveAandB)
states: 5,526,072 (6)
abstracting: (haveB<=73)
states: 10,119,981 (7)
abstracting: (78<=haveAandB)
states: 0
abstracting: (45<=resA)
states: 6,300 (3)
.
EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.586sec

checking: A [[~ [AF [AX [[resA<=haveA2andB & haveA2andB<=6]]]] & [resB<=resA & ~ [[E [[haveAandB<=haveA | haveA2<=haveA2] U EX [resB<=resB]] | [[[84<=haveA2andB & resA<=haveA2andB] & AX [haveA2<=haveB]] & E [70<=haveB U resA<=Clients]]]]]] U [AG [EF [[A [Clients<=47 U resB<=72] & EG [74<=Clients]]]] | A [~ [EG [42<=haveA]] U 70<=haveA2andB]]]
normalized: [~ [EG [~ [[[~ [EG [~ [70<=haveA2andB]]] & ~ [E [~ [70<=haveA2andB] U [EG [42<=haveA] & ~ [70<=haveA2andB]]]]] | ~ [E [true U ~ [E [true U [EG [74<=Clients] & [~ [EG [~ [resB<=72]]] & ~ [E [~ [resB<=72] U [~ [Clients<=47] & ~ [resB<=72]]]]]]]]]]]]]] & ~ [E [~ [[[~ [EG [~ [70<=haveA2andB]]] & ~ [E [~ [70<=haveA2andB] U [EG [42<=haveA] & ~ [70<=haveA2andB]]]]] | ~ [E [true U ~ [E [true U [EG [74<=Clients] & [~ [EG [~ [resB<=72]]] & ~ [E [~ [resB<=72] U [~ [Clients<=47] & ~ [resB<=72]]]]]]]]]]]] U [~ [[[resB<=resA & ~ [[[[[84<=haveA2andB & resA<=haveA2andB] & ~ [EX [~ [haveA2<=haveB]]]] & E [70<=haveB U resA<=Clients]] | E [[haveAandB<=haveA | haveA2<=haveA2] U EX [resB<=resB]]]]] & EG [EX [~ [[resA<=haveA2andB & haveA2andB<=6]]]]]] & ~ [[[~ [EG [~ [70<=haveA2andB]]] & ~ [E [~ [70<=haveA2andB] U [EG [42<=haveA] & ~ [70<=haveA2andB]]]]] | ~ [E [true U ~ [E [true U [EG [74<=Clients] & [~ [EG [~ [resB<=72]]] & ~ [E [~ [resB<=72] U [~ [Clients<=47] & ~ [resB<=72]]]]]]]]]]]]]]]]

abstracting: (resB<=72)
states: 10,119,981 (7)
abstracting: (Clients<=47)
states: 6,010,044 (6)
abstracting: (resB<=72)
states: 10,119,981 (7)
abstracting: (resB<=72)
states: 10,119,981 (7)
.
EG iterations: 1
abstracting: (74<=Clients)
states: 169,911 (5)
.
EG iterations: 1
abstracting: (70<=haveA2andB)
states: 0
abstracting: (42<=haveA)
states: 24,147 (4)
.
EG iterations: 1
abstracting: (70<=haveA2andB)
states: 0
abstracting: (70<=haveA2andB)
states: 0

EG iterations: 0
abstracting: (haveA2andB<=6)
states: 5,161,434 (6)
abstracting: (resA<=haveA2andB)
states: 4,432,026 (6)
...
EG iterations: 2
abstracting: (resB<=resB)
states: 10,119,981 (7)
.abstracting: (haveA2<=haveA2)
states: 10,119,981 (7)
abstracting: (haveAandB<=haveA)
states: 6,089,331 (6)
abstracting: (resA<=Clients)
states: 10,118,706 (7)
abstracting: (70<=haveB)
states: 0
abstracting: (haveA2<=haveB)
states: 6,957,471 (6)
.abstracting: (resA<=haveA2andB)
states: 4,432,026 (6)
abstracting: (84<=haveA2andB)
states: 0
abstracting: (resB<=resA)
states: 3,478,710 (6)
abstracting: (resB<=72)
states: 10,119,981 (7)
abstracting: (Clients<=47)
states: 6,010,044 (6)
abstracting: (resB<=72)
states: 10,119,981 (7)
abstracting: (resB<=72)
states: 10,119,981 (7)
.
EG iterations: 1
abstracting: (74<=Clients)
states: 169,911 (5)
.
EG iterations: 1
abstracting: (70<=haveA2andB)
states: 0
abstracting: (42<=haveA)
states: 24,147 (4)
.
EG iterations: 1
abstracting: (70<=haveA2andB)
states: 0
abstracting: (70<=haveA2andB)
states: 0

EG iterations: 0
abstracting: (resB<=72)
states: 10,119,981 (7)
abstracting: (Clients<=47)
states: 6,010,044 (6)
abstracting: (resB<=72)
states: 10,119,981 (7)
abstracting: (resB<=72)
states: 10,119,981 (7)
.
EG iterations: 1
abstracting: (74<=Clients)
states: 169,911 (5)
.
EG iterations: 1
abstracting: (70<=haveA2andB)
states: 0
abstracting: (42<=haveA)
states: 24,147 (4)
.
EG iterations: 1
abstracting: (70<=haveA2andB)
states: 0
abstracting: (70<=haveA2andB)
states: 0

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00100vN-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.417sec

totally nodes used: 5891479 (5.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 162525630 18108843 180634473
used/not used/entry size/cache size: 19407956 47700908 16 1024MB
basic ops cache: hits/miss/sum: 55316244 20795656 76111900
used/not used/entry size/cache size: 13063376 3713840 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: 5497175 1754559 7251734
used/not used/entry size/cache size: 1513803 6874805 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 62148609
1 4621716
2 242172
3 36009
4 13042
5 8398
6 5056
7 3259
8 3960
9 2028
>= 10 24615

Total processing time: 1m19.389sec


BK_STOP 1679868623066

--------------------
content from stderr:

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:1256 (209), effective:400 (66)

initing FirstDep: 0m 0.000sec


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

iterations count:696 (116), effective:239 (39)

iterations count:265 (44), effective:152 (25)

iterations count:722 (120), effective:272 (45)

iterations count:32 (5), effective:16 (2)

iterations count:1500 (250), effective:458 (76)

iterations count:344 (57), effective:135 (22)

iterations count:774 (129), effective:254 (42)

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

iterations count:800 (133), effective:307 (51)

iterations count:267 (44), effective:116 (19)

iterations count:24 (4), effective:9 (1)

iterations count:251 (41), effective:82 (13)

iterations count:706 (117), effective:250 (41)

iterations count:500 (83), effective:158 (26)

iterations count:1691 (281), effective:514 (85)

iterations count:58 (9), effective:26 (4)

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

iterations count:692 (115), effective:245 (40)

iterations count:122 (20), effective:54 (9)

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

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

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

iterations count:209 (34), effective:112 (18)

iterations count:231 (38), effective:45 (7)

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

iterations count:231 (38), effective:45 (7)

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

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

iterations count:231 (38), effective:45 (7)

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

iterations count:16 (2), effective:6 (1)

iterations count:231 (38), effective:45 (7)

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

iterations count:231 (38), effective:45 (7)

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

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

iterations count:231 (38), effective:45 (7)

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

iterations count:122 (20), effective:29 (4)

iterations count:231 (38), effective:45 (7)

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

iterations count:231 (38), effective:45 (7)

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

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

iterations count:231 (38), effective:45 (7)

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

iterations count:1506 (251), effective:455 (75)

iterations count:552 (92), effective:168 (28)

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

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

iterations count:1506 (251), effective:455 (75)

iterations count:552 (92), effective:168 (28)

iterations count:1506 (251), effective:455 (75)

iterations count:552 (92), effective:168 (28)

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-nC00100vN"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is TwoPhaseLocking-PT-nC00100vN, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r481-tall-167912692500841"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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