About the Execution of Marcie for FlexibleBarrier-PT-12a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10189.436 | 2433258.00 | 2433060.00 | 0.00 | TTFFTFFFTTFTFTTF | normal |
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.r161-tall-167838845300505.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 FlexibleBarrier-PT-12a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838845300505
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 25 13:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 13:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 13:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 128K 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 FlexibleBarrier-PT-12a-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679858088043
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=FlexibleBarrier-PT-12a
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: FlexibleBarrier_PT_12a
(NrP: 147 NrTr: 448 NrArc: 2045)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.007sec
net check time: 0m 0.000sec
init dd package: 0m 2.863sec
RS generation: 0m39.251sec
-> reachability set: #nodes 354558 (3.5e+05) #states 8,916,100,448,257 (12)
starting MCC model checker
--------------------------
checking: EG [AG [p59<=1]]
normalized: EG [~ [E [true U ~ [p59<=1]]]]
abstracting: (p59<=1)
states: 8,916,100,448,257 (12)
EG iterations: 0
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EX [AG [~ [EG [AG [1<=p10]]]]]
normalized: EX [~ [E [true U EG [~ [E [true U ~ [1<=p10]]]]]]]
abstracting: (1<=p10)
states: 743,008,370,688 (11)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m41.399sec
checking: EF [1<=p25]
normalized: E [true U 1<=p25]
abstracting: (1<=p25)
states: 743,008,370,688 (11)
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m31.829sec
checking: AF [E [p23<=0 U [1<=p64 & AX [~ [EF [p18<=0]]]]]]
normalized: ~ [EG [~ [E [p23<=0 U [1<=p64 & ~ [EX [E [true U p18<=0]]]]]]]]
abstracting: (p18<=0)
states: 8,173,092,077,569 (12)
.abstracting: (1<=p64)
states: 743,008,370,688 (11)
abstracting: (p23<=0)
states: 8,173,092,077,569 (12)
EG iterations: 0
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.818sec
checking: AF [AX [[~ [[EX [p75<=p121] | ~ [1<=p70]]] | AG [EX [p102<=0]]]]]
normalized: ~ [EG [EX [~ [[~ [E [true U ~ [EX [p102<=0]]]] | ~ [[~ [1<=p70] | EX [p75<=p121]]]]]]]]
abstracting: (p75<=p121)
states: 8,235,009,441,793 (12)
.abstracting: (1<=p70)
states: 743,008,370,688 (11)
abstracting: (p102<=0)
states: 8,173,092,077,569 (12)
...
EG iterations: 1
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m30.300sec
checking: ~ [EG [[~ [AG [p29<=p59]] & p39<=p91]]]
normalized: ~ [EG [[p39<=p91 & E [true U ~ [p29<=p59]]]]]
abstracting: (p29<=p59)
states: 8,235,009,441,793 (12)
abstracting: (p39<=p91)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m 4.738sec
checking: E [EX [EG [[AF [p96<=p137] | p35<=1]]] U ~ [EG [EF [~ [EG [p2<=p35]]]]]]
normalized: E [EX [EG [[p35<=1 | ~ [EG [~ [p96<=p137]]]]]] U ~ [EG [E [true U ~ [EG [p2<=p35]]]]]]
abstracting: (p2<=p35)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
EG iterations: 0
abstracting: (p96<=p137)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
abstracting: (p35<=1)
states: 8,916,100,448,257 (12)
EG iterations: 0
.-> the formula is FALSE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m33.630sec
checking: AG [EG [[p95<=1 | ~ [[EF [1<=p49] & [AF [1<=p19] | p36<=p32]]]]]]
normalized: ~ [E [true U ~ [EG [[p95<=1 | ~ [[[p36<=p32 | ~ [EG [~ [1<=p19]]]] & E [true U 1<=p49]]]]]]]]
abstracting: (1<=p49)
states: 743,008,370,688 (11)
abstracting: (1<=p19)
states: 743,008,370,688 (11)
.
EG iterations: 1
abstracting: (p36<=p32)
states: 8,173,092,077,569 (12)
abstracting: (p95<=1)
states: 8,916,100,448,257 (12)
EG iterations: 0
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m58.118sec
checking: EX [[EG [[AX [[1<=p89 & 1<=p56]] & EF [EF [p70<=0]]]] | ~ [AF [[1<=p131 | [AF [p3<=0] & AG [p35<=1]]]]]]]
normalized: EX [[EG [~ [[1<=p131 | [~ [E [true U ~ [p35<=1]]] & ~ [EG [~ [p3<=0]]]]]]] | EG [[E [true U E [true U p70<=0]] & ~ [EX [~ [[1<=p89 & 1<=p56]]]]]]]]
abstracting: (1<=p56)
states: 743,008,370,688 (11)
abstracting: (1<=p89)
states: 743,008,370,688 (11)
.abstracting: (p70<=0)
states: 8,173,092,077,569 (12)
.
EG iterations: 1
abstracting: (p3<=0)
states: 8,173,092,077,569 (12)
.
EG iterations: 1
abstracting: (p35<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p131)
states: 743,008,370,688 (11)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m45.956sec
checking: [~ [EF [~ [p86<=p104]]] | ~ [EX [E [AF [~ [1<=p116]] U [[~ [p49<=p93] | EF [p94<=p90]] & EG [1<=p97]]]]]]
normalized: [~ [EX [E [~ [EG [1<=p116]] U [EG [1<=p97] & [E [true U p94<=p90] | ~ [p49<=p93]]]]]] | ~ [E [true U ~ [p86<=p104]]]]
abstracting: (p86<=p104)
states: 8,235,009,441,793 (12)
abstracting: (p49<=p93)
states: 8,235,009,441,793 (12)
abstracting: (p94<=p90)
states: 8,173,092,077,569 (12)
abstracting: (1<=p97)
states: 743,008,370,688 (11)
.
EG iterations: 1
abstracting: (1<=p116)
states: 743,008,370,688 (11)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m18.053sec
checking: EF [[~ [p135<=1] | A [AF [[~ [p35<=p135] | [p82<=p32 & p10<=p47]]] U ~ [[[p95<=p120 | [p33<=p88 | 1<=p139]] | AX [p1<=1]]]]]]
normalized: E [true U [[~ [EG [[~ [EX [~ [p1<=1]]] | [p95<=p120 | [p33<=p88 | 1<=p139]]]]] & ~ [E [[~ [EX [~ [p1<=1]]] | [p95<=p120 | [p33<=p88 | 1<=p139]]] U [EG [~ [[[p82<=p32 & p10<=p47] | ~ [p35<=p135]]]] & [~ [EX [~ [p1<=1]]] | [p95<=p120 | [p33<=p88 | 1<=p139]]]]]]] | ~ [p135<=1]]]
abstracting: (p135<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p139)
states: 743,008,370,688 (11)
abstracting: (p33<=p88)
states: 8,235,009,441,793 (12)
abstracting: (p95<=p120)
states: 8,235,009,441,793 (12)
abstracting: (p1<=1)
states: 8,916,100,448,257 (12)
.abstracting: (p35<=p135)
states: 8,235,009,441,793 (12)
abstracting: (p10<=p47)
states: 8,235,009,441,793 (12)
abstracting: (p82<=p32)
states: 8,235,009,441,793 (12)
before gc: list nodes free: 573567
after gc: idd nodes used:3856989, unused:60143011; list nodes free:275913763
.
EG iterations: 1
abstracting: (1<=p139)
states: 743,008,370,688 (11)
abstracting: (p33<=p88)
states: 8,235,009,441,793 (12)
abstracting: (p95<=p120)
states: 8,235,009,441,793 (12)
abstracting: (p1<=1)
states: 8,916,100,448,257 (12)
.abstracting: (1<=p139)
states: 743,008,370,688 (11)
abstracting: (p33<=p88)
states: 8,235,009,441,793 (12)
abstracting: (p95<=p120)
states: 8,235,009,441,793 (12)
abstracting: (p1<=1)
states: 8,916,100,448,257 (12)
.
EG iterations: 0
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m48.001sec
checking: [A [[AG [~ [1<=p122]] | E [AX [[p109<=1 | 1<=p75]] U E [EF [1<=p70] U [p112<=p15 | 1<=p35]]]] U AG [E [E [p88<=0 U p102<=p62] U [p123<=p25 & EF [p3<=p100]]]]] & AX [AF [p88<=p78]]]
normalized: [~ [EX [EG [~ [p88<=p78]]]] & [~ [EG [E [true U ~ [E [E [p88<=0 U p102<=p62] U [p123<=p25 & E [true U p3<=p100]]]]]]] & ~ [E [E [true U ~ [E [E [p88<=0 U p102<=p62] U [p123<=p25 & E [true U p3<=p100]]]]] U [~ [[E [~ [EX [~ [[p109<=1 | 1<=p75]]]] U E [E [true U 1<=p70] U [p112<=p15 | 1<=p35]]] | ~ [E [true U 1<=p122]]]] & E [true U ~ [E [E [p88<=0 U p102<=p62] U [p123<=p25 & E [true U p3<=p100]]]]]]]]]]
abstracting: (p3<=p100)
states: 8,235,009,441,793 (12)
abstracting: (p123<=p25)
states: 8,235,009,441,793 (12)
abstracting: (p102<=p62)
states: 8,235,009,441,793 (12)
abstracting: (p88<=0)
states: 8,173,092,077,569 (12)
abstracting: (1<=p122)
states: 743,008,370,688 (11)
abstracting: (1<=p35)
states: 743,008,370,688 (11)
abstracting: (p112<=p15)
states: 8,235,009,441,793 (12)
abstracting: (1<=p70)
states: 743,008,370,688 (11)
abstracting: (1<=p75)
states: 743,008,370,688 (11)
abstracting: (p109<=1)
states: 8,916,100,448,257 (12)
.abstracting: (p3<=p100)
states: 8,235,009,441,793 (12)
abstracting: (p123<=p25)
states: 8,235,009,441,793 (12)
abstracting: (p102<=p62)
states: 8,235,009,441,793 (12)
abstracting: (p88<=0)
states: 8,173,092,077,569 (12)
abstracting: (p3<=p100)
states: 8,235,009,441,793 (12)
abstracting: (p123<=p25)
states: 8,235,009,441,793 (12)
abstracting: (p102<=p62)
states: 8,235,009,441,793 (12)
abstracting: (p88<=0)
states: 8,173,092,077,569 (12)
EG iterations: 0
abstracting: (p88<=p78)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 6m14.997sec
checking: A [A [E [~ [AF [1<=p50]] U [~ [1<=p35] & ~ [p69<=1]]] U [1<=p15 | E [E [1<=p140 U p60<=0] U A [1<=p33 U 1<=p63]]]] U [~ [[[1<=p16 & [AG [p2<=1] & 1<=p69]] | p111<=1]] | [AG [p118<=1] | E [AF [A [1<=p64 U 1<=p39]] U [~ [AG [p51<=p14]] | ~ [p99<=1]]]]]]
normalized: [~ [EG [~ [[[E [~ [EG [~ [[~ [EG [~ [1<=p39]]] & ~ [E [~ [1<=p39] U [~ [1<=p64] & ~ [1<=p39]]]]]]]] U [~ [p99<=1] | E [true U ~ [p51<=p14]]]] | ~ [E [true U ~ [p118<=1]]]] | ~ [[p111<=1 | [1<=p16 & [1<=p69 & ~ [E [true U ~ [p2<=1]]]]]]]]]]] & ~ [E [~ [[[E [~ [EG [~ [[~ [EG [~ [1<=p39]]] & ~ [E [~ [1<=p39] U [~ [1<=p64] & ~ [1<=p39]]]]]]]] U [~ [p99<=1] | E [true U ~ [p51<=p14]]]] | ~ [E [true U ~ [p118<=1]]]] | ~ [[p111<=1 | [1<=p16 & [1<=p69 & ~ [E [true U ~ [p2<=1]]]]]]]]] U [~ [[~ [EG [~ [[1<=p15 | E [E [1<=p140 U p60<=0] U [~ [EG [~ [1<=p63]]] & ~ [E [~ [1<=p63] U [~ [1<=p33] & ~ [1<=p63]]]]]]]]]] & ~ [E [~ [[1<=p15 | E [E [1<=p140 U p60<=0] U [~ [EG [~ [1<=p63]]] & ~ [E [~ [1<=p63] U [~ [1<=p33] & ~ [1<=p63]]]]]]]] U [~ [E [EG [~ [1<=p50]] U [~ [p69<=1] & ~ [1<=p35]]]] & ~ [[1<=p15 | E [E [1<=p140 U p60<=0] U [~ [EG [~ [1<=p63]]] & ~ [E [~ [1<=p63] U [~ [1<=p33] & ~ [1<=p63]]]]]]]]]]]]] & ~ [[[E [~ [EG [~ [[~ [EG [~ [1<=p39]]] & ~ [E [~ [1<=p39] U [~ [1<=p64] & ~ [1<=p39]]]]]]]] U [~ [p99<=1] | E [true U ~ [p51<=p14]]]] | ~ [E [true U ~ [p118<=1]]]] | ~ [[p111<=1 | [1<=p16 & [1<=p69 & ~ [E [true U ~ [p2<=1]]]]]]]]]]]]]
abstracting: (p2<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p69)
states: 743,008,370,688 (11)
abstracting: (1<=p16)
states: 743,008,370,688 (11)
abstracting: (p111<=1)
states: 8,916,100,448,257 (12)
abstracting: (p118<=1)
states: 8,916,100,448,257 (12)
abstracting: (p51<=p14)
states: 8,235,009,441,793 (12)
abstracting: (p99<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p39)
states: 743,008,370,688 (11)
abstracting: (1<=p64)
states: 743,008,370,688 (11)
abstracting: (1<=p39)
states: 743,008,370,688 (11)
abstracting: (1<=p39)
states: 743,008,370,688 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p63)
states: 743,008,370,688 (11)
abstracting: (1<=p33)
states: 743,008,370,688 (11)
abstracting: (1<=p63)
states: 743,008,370,688 (11)
abstracting: (1<=p63)
states: 743,008,370,688 (11)
.
EG iterations: 1
abstracting: (p60<=0)
states: 8,173,092,077,569 (12)
abstracting: (1<=p140)
states: 743,008,370,688 (11)
abstracting: (1<=p15)
states: 743,008,370,688 (11)
abstracting: (1<=p35)
states: 743,008,370,688 (11)
abstracting: (p69<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p50)
states: 743,008,370,688 (11)
.
EG iterations: 1
abstracting: (1<=p63)
states: 743,008,370,688 (11)
abstracting: (1<=p33)
states: 743,008,370,688 (11)
abstracting: (1<=p63)
states: 743,008,370,688 (11)
abstracting: (1<=p63)
states: 743,008,370,688 (11)
.
EG iterations: 1
abstracting: (p60<=0)
states: 8,173,092,077,569 (12)
abstracting: (1<=p140)
states: 743,008,370,688 (11)
abstracting: (1<=p15)
states: 743,008,370,688 (11)
abstracting: (1<=p63)
states: 743,008,370,688 (11)
abstracting: (1<=p33)
states: 743,008,370,688 (11)
abstracting: (1<=p63)
states: 743,008,370,688 (11)
abstracting: (1<=p63)
states: 743,008,370,688 (11)
.
EG iterations: 1
abstracting: (p60<=0)
states: 8,173,092,077,569 (12)
abstracting: (1<=p140)
states: 743,008,370,688 (11)
abstracting: (1<=p15)
states: 743,008,370,688 (11)
.
EG iterations: 1
abstracting: (p2<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p69)
states: 743,008,370,688 (11)
abstracting: (1<=p16)
states: 743,008,370,688 (11)
abstracting: (p111<=1)
states: 8,916,100,448,257 (12)
abstracting: (p118<=1)
states: 8,916,100,448,257 (12)
abstracting: (p51<=p14)
states: 8,235,009,441,793 (12)
abstracting: (p99<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p39)
states: 743,008,370,688 (11)
abstracting: (1<=p64)
states: 743,008,370,688 (11)
abstracting: (1<=p39)
states: 743,008,370,688 (11)
abstracting: (1<=p39)
states: 743,008,370,688 (11)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p2<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p69)
states: 743,008,370,688 (11)
abstracting: (1<=p16)
states: 743,008,370,688 (11)
abstracting: (p111<=1)
states: 8,916,100,448,257 (12)
abstracting: (p118<=1)
states: 8,916,100,448,257 (12)
abstracting: (p51<=p14)
states: 8,235,009,441,793 (12)
abstracting: (p99<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p39)
states: 743,008,370,688 (11)
abstracting: (1<=p64)
states: 743,008,370,688 (11)
abstracting: (1<=p39)
states: 743,008,370,688 (11)
abstracting: (1<=p39)
states: 743,008,370,688 (11)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 5m54.613sec
checking: [AF [[EF [[1<=p111 | ~ [EX [1<=p112]]]] & [[[p114<=0 | ~ [1<=p140]] & [AX [p131<=1] | AX [1<=p21]]] | [A [~ [1<=p26] U ~ [p36<=p123]] & p134<=0]]]] & AF [[AG [[AX [p56<=p84] | A [p146<=p68 U p120<=p145]]] | [AG [~ [[1<=p103 | p95<=1]]] | 1<=p137]]]]
normalized: [~ [EG [~ [[[1<=p137 | ~ [E [true U [1<=p103 | p95<=1]]]] | ~ [E [true U ~ [[[~ [EG [~ [p120<=p145]]] & ~ [E [~ [p120<=p145] U [~ [p146<=p68] & ~ [p120<=p145]]]]] | ~ [EX [~ [p56<=p84]]]]]]]]]]] & ~ [EG [~ [[[[p134<=0 & [~ [EG [p36<=p123]] & ~ [E [p36<=p123 U [1<=p26 & p36<=p123]]]]] | [[~ [EX [~ [1<=p21]]] | ~ [EX [~ [p131<=1]]]] & [p114<=0 | ~ [1<=p140]]]] & E [true U [1<=p111 | ~ [EX [1<=p112]]]]]]]]]
abstracting: (1<=p112)
states: 743,008,370,688 (11)
.abstracting: (1<=p111)
states: 743,008,370,688 (11)
abstracting: (1<=p140)
states: 743,008,370,688 (11)
abstracting: (p114<=0)
states: 8,173,092,077,569 (12)
abstracting: (p131<=1)
states: 8,916,100,448,257 (12)
.abstracting: (1<=p21)
states: 743,008,370,688 (11)
before gc: list nodes free: 1342873
after gc: idd nodes used:5817942, unused:58182058; list nodes free:266895072
.abstracting: (p36<=p123)
states: 8,235,009,441,793 (12)
abstracting: (1<=p26)
states: 743,008,370,688 (11)
abstracting: (p36<=p123)
states: 8,235,009,441,793 (12)
abstracting: (p36<=p123)
states: 8,235,009,441,793 (12)
..
EG iterations: 2
abstracting: (p134<=0)
states: 8,173,092,077,569 (12)
.
EG iterations: 1
abstracting: (p56<=p84)
states: 8,235,009,441,793 (12)
.abstracting: (p120<=p145)
states: 8,916,100,448,257 (12)
abstracting: (p146<=p68)
states: 743,008,370,689 (11)
abstracting: (p120<=p145)
states: 8,916,100,448,257 (12)
abstracting: (p120<=p145)
states: 8,916,100,448,257 (12)
.
EG iterations: 1
abstracting: (p95<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p103)
states: 743,008,370,688 (11)
abstracting: (1<=p137)
states: 743,008,370,688 (11)
.
EG iterations: 1
-> the formula is TRUE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m56.535sec
checking: A [[[AX [[AG [1<=p103] | AF [p82<=p116]]] & [~ [[[[1<=p0 | p61<=p34] & [p41<=1 | 1<=p87]] | ~ [AF [1<=p11]]]] | EG [[[p79<=p126 | p10<=1] & p73<=0]]]] & [[p78<=0 & 1<=p107] & [1<=p30 | [E [p4<=0 U ~ [1<=p114]] & ~ [1<=p119]]]]] U EX [[EX [EF [1<=p114]] & E [A [p56<=p134 U p68<=p53] U AG [p62<=p16]]]]]
normalized: [~ [EG [~ [EX [[E [[~ [EG [~ [p68<=p53]]] & ~ [E [~ [p68<=p53] U [~ [p56<=p134] & ~ [p68<=p53]]]]] U ~ [E [true U ~ [p62<=p16]]]] & EX [E [true U 1<=p114]]]]]]] & ~ [E [~ [EX [[E [[~ [EG [~ [p68<=p53]]] & ~ [E [~ [p68<=p53] U [~ [p56<=p134] & ~ [p68<=p53]]]]] U ~ [E [true U ~ [p62<=p16]]]] & EX [E [true U 1<=p114]]]]] U [~ [[[[1<=p30 | [~ [1<=p119] & E [p4<=0 U ~ [1<=p114]]]] & [p78<=0 & 1<=p107]] & [[EG [[p73<=0 & [p79<=p126 | p10<=1]]] | ~ [[EG [~ [1<=p11]] | [[p41<=1 | 1<=p87] & [1<=p0 | p61<=p34]]]]] & ~ [EX [~ [[~ [EG [~ [p82<=p116]]] | ~ [E [true U ~ [1<=p103]]]]]]]]]] & ~ [EX [[E [[~ [EG [~ [p68<=p53]]] & ~ [E [~ [p68<=p53] U [~ [p56<=p134] & ~ [p68<=p53]]]]] U ~ [E [true U ~ [p62<=p16]]]] & EX [E [true U 1<=p114]]]]]]]]]
abstracting: (1<=p114)
states: 743,008,370,688 (11)
.abstracting: (p62<=p16)
states: 8,235,009,441,793 (12)
abstracting: (p68<=p53)
states: 8,235,009,441,793 (12)
abstracting: (p56<=p134)
states: 8,235,009,441,793 (12)
abstracting: (p68<=p53)
states: 8,235,009,441,793 (12)
abstracting: (p68<=p53)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
.abstracting: (1<=p103)
states: 743,008,370,688 (11)
abstracting: (p82<=p116)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
.abstracting: (p61<=p34)
states: 8,235,009,441,793 (12)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p87)
states: 743,008,370,688 (11)
abstracting: (p41<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p11)
states: 743,008,370,688 (11)
.
EG iterations: 1
abstracting: (p10<=1)
states: 8,916,100,448,257 (12)
abstracting: (p79<=p126)
states: 8,235,009,441,793 (12)
abstracting: (p73<=0)
states: 8,173,092,077,569 (12)
.
EG iterations: 1
abstracting: (1<=p107)
states: 743,008,370,688 (11)
abstracting: (p78<=0)
states: 8,173,092,077,569 (12)
abstracting: (1<=p114)
states: 743,008,370,688 (11)
abstracting: (p4<=0)
states: 8,173,092,077,569 (12)
abstracting: (1<=p119)
states: 743,008,370,688 (11)
abstracting: (1<=p30)
states: 743,008,370,688 (11)
abstracting: (1<=p114)
states: 743,008,370,688 (11)
.abstracting: (p62<=p16)
states: 8,235,009,441,793 (12)
abstracting: (p68<=p53)
states: 8,235,009,441,793 (12)
abstracting: (p56<=p134)
states: 8,235,009,441,793 (12)
abstracting: (p68<=p53)
states: 8,235,009,441,793 (12)
abstracting: (p68<=p53)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
.abstracting: (1<=p114)
states: 743,008,370,688 (11)
.abstracting: (p62<=p16)
states: 8,235,009,441,793 (12)
abstracting: (p68<=p53)
states: 8,235,009,441,793 (12)
abstracting: (p56<=p134)
states: 8,235,009,441,793 (12)
abstracting: (p68<=p53)
states: 8,235,009,441,793 (12)
abstracting: (p68<=p53)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
.
EG iterations: 0
-> the formula is FALSE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 8m42.432sec
checking: E [E [EX [EX [[p8<=p54 & 1<=p47]]] U [AG [A [1<=p120 U p45<=1]] | E [~ [[p117<=1 | 1<=p136]] U [AF [1<=p61] & A [p95<=1 U p16<=0]]]]] U A [[[[1<=p3 & ~ [[p55<=p4 | p111<=p142]]] & EX [~ [1<=p125]]] | [AG [[1<=p132 & p40<=1]] & [AX [p119<=p115] | ~ [[1<=p107 & p31<=0]]]]] U [E [[[p29<=0 | p81<=1] | [p87<=1 | 1<=p96]] U AF [p66<=p58]] & [AF [EF [p41<=p67]] & [[1<=p146 | AG [p20<=p38]] & ~ [1<=p41]]]]]]
normalized: E [E [EX [EX [[p8<=p54 & 1<=p47]]] U [E [~ [[p117<=1 | 1<=p136]] U [[~ [EG [~ [p16<=0]]] & ~ [E [~ [p16<=0] U [~ [p95<=1] & ~ [p16<=0]]]]] & ~ [EG [~ [1<=p61]]]]] | ~ [E [true U ~ [[~ [EG [~ [p45<=1]]] & ~ [E [~ [p45<=1] U [~ [1<=p120] & ~ [p45<=1]]]]]]]]]] U [~ [EG [~ [[[[~ [1<=p41] & [1<=p146 | ~ [E [true U ~ [p20<=p38]]]]] & ~ [EG [~ [E [true U p41<=p67]]]]] & E [[[p87<=1 | 1<=p96] | [p29<=0 | p81<=1]] U ~ [EG [~ [p66<=p58]]]]]]]] & ~ [E [~ [[[[~ [1<=p41] & [1<=p146 | ~ [E [true U ~ [p20<=p38]]]]] & ~ [EG [~ [E [true U p41<=p67]]]]] & E [[[p87<=1 | 1<=p96] | [p29<=0 | p81<=1]] U ~ [EG [~ [p66<=p58]]]]]] U [~ [[[[~ [[1<=p107 & p31<=0]] | ~ [EX [~ [p119<=p115]]]] & ~ [E [true U ~ [[1<=p132 & p40<=1]]]]] | [EX [~ [1<=p125]] & [1<=p3 & ~ [[p55<=p4 | p111<=p142]]]]]] & ~ [[[[~ [1<=p41] & [1<=p146 | ~ [E [true U ~ [p20<=p38]]]]] & ~ [EG [~ [E [true U p41<=p67]]]]] & E [[[p87<=1 | 1<=p96] | [p29<=0 | p81<=1]] U ~ [EG [~ [p66<=p58]]]]]]]]]]]
abstracting: (p66<=p58)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
abstracting: (p81<=1)
states: 8,916,100,448,257 (12)
abstracting: (p29<=0)
states: 8,173,092,077,569 (12)
abstracting: (1<=p96)
states: 743,008,370,688 (11)
abstracting: (p87<=1)
states: 8,916,100,448,257 (12)
abstracting: (p41<=p67)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
abstracting: (p20<=p38)
states: 8,235,009,441,793 (12)
abstracting: (1<=p146)
states: 8,916,100,448,256 (12)
abstracting: (1<=p41)
states: 743,008,370,688 (11)
abstracting: (p111<=p142)
states: 8,235,009,441,793 (12)
abstracting: (p55<=p4)
states: 8,235,009,441,793 (12)
abstracting: (1<=p3)
states: 743,008,370,688 (11)
abstracting: (1<=p125)
states: 743,008,370,688 (11)
.abstracting: (p40<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p132)
states: 743,008,370,688 (11)
abstracting: (p119<=p115)
states: 8,173,092,077,569 (12)
.abstracting: (p31<=0)
states: 8,173,092,077,569 (12)
abstracting: (1<=p107)
states: 743,008,370,688 (11)
abstracting: (p66<=p58)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
abstracting: (p81<=1)
states: 8,916,100,448,257 (12)
abstracting: (p29<=0)
states: 8,173,092,077,569 (12)
abstracting: (1<=p96)
states: 743,008,370,688 (11)
abstracting: (p87<=1)
states: 8,916,100,448,257 (12)
abstracting: (p41<=p67)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
abstracting: (p20<=p38)
states: 8,235,009,441,793 (12)
abstracting: (1<=p146)
states: 8,916,100,448,256 (12)
abstracting: (1<=p41)
states: 743,008,370,688 (11)
abstracting: (p66<=p58)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
abstracting: (p81<=1)
states: 8,916,100,448,257 (12)
abstracting: (p29<=0)
states: 8,173,092,077,569 (12)
abstracting: (1<=p96)
states: 743,008,370,688 (11)
abstracting: (p87<=1)
states: 8,916,100,448,257 (12)
abstracting: (p41<=p67)
states: 8,235,009,441,793 (12)
.
EG iterations: 1
abstracting: (p20<=p38)
states: 8,235,009,441,793 (12)
abstracting: (1<=p146)
states: 8,916,100,448,256 (12)
abstracting: (1<=p41)
states: 743,008,370,688 (11)
..
EG iterations: 2
abstracting: (p45<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p120)
states: 743,008,370,688 (11)
abstracting: (p45<=1)
states: 8,916,100,448,257 (12)
abstracting: (p45<=1)
states: 8,916,100,448,257 (12)
.
EG iterations: 1
abstracting: (1<=p61)
states: 743,008,370,688 (11)
before gc: list nodes free: 1396232
after gc: idd nodes used:8939263, unused:55060737; list nodes free:252533976
.
EG iterations: 1
abstracting: (p16<=0)
states: 8,173,092,077,569 (12)
abstracting: (p95<=1)
states: 8,916,100,448,257 (12)
abstracting: (p16<=0)
states: 8,173,092,077,569 (12)
abstracting: (p16<=0)
states: 8,173,092,077,569 (12)
.
EG iterations: 1
abstracting: (1<=p136)
states: 743,008,370,688 (11)
abstracting: (p117<=1)
states: 8,916,100,448,257 (12)
abstracting: (1<=p47)
states: 743,008,370,688 (11)
abstracting: (p8<=p54)
states: 8,235,009,441,793 (12)
..-> the formula is TRUE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 5m32.989sec
totally nodes used: 203839913 (2.0e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 1832516027 4032291899 1569840630
used/not used/entry size/cache size: 61215031 5893833 16 1024MB
basic ops cache: hits/miss/sum: 42109359 87562691 129672050
used/not used/entry size/cache size: 5696327 11080889 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: 5556866 11417074 16973940
used/not used/entry size/cache size: 774271 7614337 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 43448567
1 18083860
2 4541347
3 875976
4 138526
5 18253
6 2108
7 209
8 17
9 1
>= 10 0
Total processing time: 40m32.369sec
BK_STOP 1679860521301
--------------------
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.001sec
iterations count:13189 (29), effective:254 (0)
initing FirstDep: 0m 0.001sec
iterations count:449 (1), effective:1 (0)
iterations count:1968 (4), effective:23 (0)
iterations count:576 (1), effective:1 (0)
iterations count:2038 (4), effective:24 (0)
iterations count:2095 (4), effective:24 (0)
iterations count:2114 (4), effective:23 (0)
iterations count:527 (1), effective:1 (0)
iterations count:448 (1), effective:0 (0)
iterations count:2314 (5), effective:24 (0)
iterations count:519 (1), effective:1 (0)
iterations count:2506 (5), effective:23 (0)
iterations count:2587 (5), effective:36 (0)
iterations count:885 (1), effective:7 (0)
iterations count:691 (1), effective:5 (0)
iterations count:1583 (3), effective:22 (0)
iterations count:5513 (12), effective:69 (0)
iterations count:2682 (5), effective:23 (0)
iterations count:2119 (4), effective:23 (0)
iterations count:618 (1), effective:8 (0)
iterations count:448 (1), effective:0 (0)
iterations count:885 (1), effective:7 (0)
iterations count:691 (1), effective:5 (0)
iterations count:1583 (3), effective:22 (0)
iterations count:5513 (12), effective:69 (0)
iterations count:885 (1), effective:7 (0)
iterations count:691 (1), effective:5 (0)
iterations count:1583 (3), effective:22 (0)
iterations count:5513 (12), effective:69 (0)
iterations count:2017 (4), effective:24 (0)
iterations count:522 (1), effective:1 (0)
iterations count:448 (1), effective:0 (0)
iterations count:465 (1), effective:1 (0)
iterations count:2774 (6), effective:45 (0)
iterations count:4002 (8), effective:67 (0)
iterations count:465 (1), effective:1 (0)
iterations count:2774 (6), effective:45 (0)
iterations count:4002 (8), effective:67 (0)
iterations count:448 (1), effective:0 (0)
iterations count:465 (1), effective:1 (0)
iterations count:2774 (6), effective:45 (0)
iterations count:4002 (8), effective:67 (0)
iterations count:2017 (4), effective:24 (0)
iterations count:522 (1), effective:1 (0)
iterations count:448 (1), effective:0 (0)
iterations count:2017 (4), effective:24 (0)
iterations count:522 (1), effective:1 (0)
iterations count:448 (1), effective:0 (0)
iterations count:545 (1), effective:2 (0)
iterations count:3226 (7), effective:44 (0)
iterations count:448 (1), effective:0 (0)
iterations count:2471 (5), effective:23 (0)
iterations count:2142 (4), effective:24 (0)
iterations count:1645 (3), effective:20 (0)
iterations count:490 (1), effective:1 (0)
iterations count:532 (1), effective:1 (0)
iterations count:2471 (5), effective:23 (0)
iterations count:2142 (4), effective:24 (0)
iterations count:1645 (3), effective:20 (0)
iterations count:2940 (6), effective:48 (0)
iterations count:2471 (5), effective:23 (0)
iterations count:2142 (4), effective:24 (0)
iterations count:1645 (3), effective:20 (0)
iterations count:548 (1), effective:1 (0)
iterations count:464 (1), effective:1 (0)
iterations count:2021 (4), effective:24 (0)
iterations count:1296 (2), effective:12 (0)
iterations count:548 (1), effective:1 (0)
iterations count:464 (1), effective:1 (0)
iterations count:2021 (4), effective:24 (0)
iterations count:470 (1), effective:1 (0)
iterations count:548 (1), effective:1 (0)
iterations count:464 (1), effective:1 (0)
iterations count:2021 (4), effective:24 (0)
iterations count:448 (1), effective:0 (0)
iterations count:448 (1), effective:0 (0)
iterations count:849 (1), effective:2 (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="FlexibleBarrier-PT-12a"
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 FlexibleBarrier-PT-12a, 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 r161-tall-167838845300505"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12a.tgz
mv FlexibleBarrier-PT-12a 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 '
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 ;