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-167912692500801.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-nC00020vD, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692500801
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 17:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 17:36 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-nC00020vD-CTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00020vD-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679868303777

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-nC00020vD
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_nC00020vD
(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.867sec


RS generation: 0m 0.007sec


-> reachability set: #nodes 1122 (1.1e+03) #states 7,006 (3)



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

checking: AF [AG [~ [AG [AF [haveA<=2]]]]]
normalized: ~ [EG [E [true U ~ [E [true U EG [~ [haveA<=2]]]]]]]

abstracting: (haveA<=2)
states: 4,300 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.015sec

checking: EF [~ [haveA2andB<=13]]
normalized: E [true U ~ [haveA2andB<=13]]

abstracting: (haveA2andB<=13)
states: 7,006 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [4<=Clients]
normalized: E [true U 4<=Clients]

abstracting: (4<=Clients)
states: 6,685 (3)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00020vD-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [AF [[9<=haveB | ~ [EF [AF [resB<=15]]]]]]
normalized: ~ [E [true U EG [~ [[~ [E [true U ~ [EG [~ [resB<=15]]]]] | 9<=haveB]]]]]

abstracting: (9<=haveB)
states: 241
abstracting: (resB<=15)
states: 7,006 (3)
.
EG iterations: 1
....
EG iterations: 4
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: E [[haveA2<=12 & haveA2andB<=haveB] U ~ [AF [AF [~ [9<=haveA2andB]]]]]
normalized: E [[haveA2<=12 & haveA2andB<=haveB] U EG [EG [9<=haveA2andB]]]

abstracting: (9<=haveA2andB)
states: 8
..
EG iterations: 2
.
EG iterations: 1
abstracting: (haveA2andB<=haveB)
states: 5,298 (3)
abstracting: (haveA2<=12)
states: 7,006 (3)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00020vD-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [~ [[haveAandB<=20 & AG [[haveAandB<=Clients | ~ [haveB<=10]]]]]]
normalized: ~ [EX [[~ [E [true U ~ [[~ [haveB<=10] | haveAandB<=Clients]]]] & haveAandB<=20]]]

abstracting: (haveAandB<=20)
states: 7,006 (3)
abstracting: (haveAandB<=Clients)
states: 7,006 (3)
abstracting: (haveB<=10)
states: 7,006 (3)
.-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: AX [[[[1<=haveAandB | ~ [E [9<=haveAandB U AX [2<=haveAandB]]]] | haveAandB<=2] | 8<=haveA2andB]]
normalized: ~ [EX [~ [[[[~ [E [9<=haveAandB U ~ [EX [~ [2<=haveAandB]]]]] | 1<=haveAandB] | haveAandB<=2] | 8<=haveA2andB]]]]

abstracting: (8<=haveA2andB)
states: 33
abstracting: (haveAandB<=2)
states: 5,290 (3)
abstracting: (1<=haveAandB)
states: 4,576 (3)
abstracting: (2<=haveAandB)
states: 2,871 (3)
.abstracting: (9<=haveAandB)
states: 8
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00020vD-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[~ [AX [resB<=14]] & ~ [AF [[[AF [haveA2<=haveAandB] | ~ [haveA<=2]] | haveA2<=resA]]]]]
normalized: E [true U [EG [~ [[[~ [haveA<=2] | ~ [EG [~ [haveA2<=haveAandB]]]] | haveA2<=resA]]] & EX [~ [resB<=14]]]]

abstracting: (resB<=14)
states: 7,006 (3)
.abstracting: (haveA2<=resA)
states: 3,969 (3)
abstracting: (haveA2<=haveAandB)
states: 3,486 (3)
...........
EG iterations: 11
abstracting: (haveA<=2)
states: 4,300 (3)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: ~ [[EG [AF [A [haveA2andB<=6 U [18<=resB & haveA2<=resA]]]] | ~ [EF [[~ [EG [resA<=18]] & ~ [[AX [2<=Clients] | ~ [18<=haveAandB]]]]]]]]
normalized: ~ [[EG [~ [EG [~ [[~ [EG [~ [[18<=resB & haveA2<=resA]]]] & ~ [E [~ [[18<=resB & haveA2<=resA]] U [~ [haveA2andB<=6] & ~ [[18<=resB & haveA2<=resA]]]]]]]]]] | ~ [E [true U [~ [[~ [18<=haveAandB] | ~ [EX [~ [2<=Clients]]]]] & ~ [EG [resA<=18]]]]]]]

abstracting: (resA<=18)
states: 7,006 (3)

EG iterations: 0
abstracting: (2<=Clients)
states: 6,955 (3)
.abstracting: (18<=haveAandB)
states: 0
abstracting: (haveA2<=resA)
states: 3,969 (3)
abstracting: (18<=resB)
states: 0
abstracting: (haveA2andB<=6)
states: 6,908 (3)
abstracting: (haveA2<=resA)
states: 3,969 (3)
abstracting: (18<=resB)
states: 0
abstracting: (haveA2<=resA)
states: 3,969 (3)
abstracting: (18<=resB)
states: 0

EG iterations: 0

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

FORMULA TwoPhaseLocking-PT-nC00020vD-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AX [EX [~ [[[AX [5<=haveA] | ~ [EF [Clients<=haveA2andB]]] & [[haveA2andB<=resA | ~ [haveB<=haveA2andB]] | EF [haveA<=haveAandB]]]]]]
normalized: ~ [EX [~ [EX [~ [[[E [true U haveA<=haveAandB] | [~ [haveB<=haveA2andB] | haveA2andB<=resA]] & [~ [E [true U Clients<=haveA2andB]] | ~ [EX [~ [5<=haveA]]]]]]]]]]

abstracting: (5<=haveA)
states: 1,134 (3)
.abstracting: (Clients<=haveA2andB)
states: 65
abstracting: (haveA2andB<=resA)
states: 4,696 (3)
abstracting: (haveB<=haveA2andB)
states: 2,569 (3)
abstracting: (haveA<=haveAandB)
states: 3,485 (3)
..-> the formula is TRUE

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

MC time: 0m 0.015sec

checking: A [EF [A [[haveA2<=17 | A [haveA<=15 U resA<=resA]] U AX [[haveB<=haveB & Clients<=3]]]] U ~ [AX [haveA2andB<=haveA2]]]
normalized: [~ [EG [~ [EX [~ [haveA2andB<=haveA2]]]]] & ~ [E [~ [EX [~ [haveA2andB<=haveA2]]] U [~ [E [true U [~ [EG [EX [~ [[haveB<=haveB & Clients<=3]]]]] & ~ [E [EX [~ [[haveB<=haveB & Clients<=3]]] U [~ [[haveA2<=17 | [~ [EG [~ [resA<=resA]]] & ~ [E [~ [resA<=resA] U [~ [haveA<=15] & ~ [resA<=resA]]]]]]] & EX [~ [[haveB<=haveB & Clients<=3]]]]]]]]] & ~ [EX [~ [haveA2andB<=haveA2]]]]]]]

abstracting: (haveA2andB<=haveA2)
states: 4,696 (3)
.abstracting: (Clients<=3)
states: 321
abstracting: (haveB<=haveB)
states: 7,006 (3)
.abstracting: (resA<=resA)
states: 7,006 (3)
abstracting: (haveA<=15)
states: 7,006 (3)
abstracting: (resA<=resA)
states: 7,006 (3)
abstracting: (resA<=resA)
states: 7,006 (3)
.
EG iterations: 1
abstracting: (haveA2<=17)
states: 7,006 (3)
abstracting: (Clients<=3)
states: 321
abstracting: (haveB<=haveB)
states: 7,006 (3)
.abstracting: (Clients<=3)
states: 321
abstracting: (haveB<=haveB)
states: 7,006 (3)
..
EG iterations: 1
abstracting: (haveA2andB<=haveA2)
states: 4,696 (3)
.abstracting: (haveA2andB<=haveA2)
states: 4,696 (3)
..........................................
EG iterations: 41
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00020vD-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: [AX [[~ [AX [~ [[haveAandB<=haveA2 & haveA2andB<=11]]]] & ~ [AF [AG [resA<=18]]]]] & A [resA<=7 U [[AF [[~ [Clients<=Clients] & [8<=haveA | resB<=resA]]] | AG [haveA2<=haveA2]] & ~ [EG [A [resA<=7 U 20<=haveAandB]]]]]]
normalized: [[~ [EG [~ [[~ [EG [[~ [EG [~ [20<=haveAandB]]] & ~ [E [~ [20<=haveAandB] U [~ [resA<=7] & ~ [20<=haveAandB]]]]]]] & [~ [E [true U ~ [haveA2<=haveA2]]] | ~ [EG [~ [[[8<=haveA | resB<=resA] & ~ [Clients<=Clients]]]]]]]]]] & ~ [E [~ [[~ [EG [[~ [EG [~ [20<=haveAandB]]] & ~ [E [~ [20<=haveAandB] U [~ [resA<=7] & ~ [20<=haveAandB]]]]]]] & [~ [E [true U ~ [haveA2<=haveA2]]] | ~ [EG [~ [[[8<=haveA | resB<=resA] & ~ [Clients<=Clients]]]]]]]] U [~ [resA<=7] & ~ [[~ [EG [[~ [EG [~ [20<=haveAandB]]] & ~ [E [~ [20<=haveAandB] U [~ [resA<=7] & ~ [20<=haveAandB]]]]]]] & [~ [E [true U ~ [haveA2<=haveA2]]] | ~ [EG [~ [[[8<=haveA | resB<=resA] & ~ [Clients<=Clients]]]]]]]]]]]] & ~ [EX [~ [[EG [E [true U ~ [resA<=18]]] & EX [[haveAandB<=haveA2 & haveA2andB<=11]]]]]]]

abstracting: (haveA2andB<=11)
states: 7,006 (3)
abstracting: (haveAandB<=haveA2)
states: 4,696 (3)
.abstracting: (resA<=18)
states: 7,006 (3)
.
EG iterations: 1
.abstracting: (Clients<=Clients)
states: 7,006 (3)
abstracting: (resB<=resA)
states: 3,002 (3)
abstracting: (8<=haveA)
states: 153

EG iterations: 0
abstracting: (haveA2<=haveA2)
states: 7,006 (3)
abstracting: (20<=haveAandB)
states: 0
abstracting: (resA<=7)
states: 6,853 (3)
abstracting: (20<=haveAandB)
states: 0
abstracting: (20<=haveAandB)
states: 0

EG iterations: 0
.
EG iterations: 1
abstracting: (resA<=7)
states: 6,853 (3)
abstracting: (Clients<=Clients)
states: 7,006 (3)
abstracting: (resB<=resA)
states: 3,002 (3)
abstracting: (8<=haveA)
states: 153

EG iterations: 0
abstracting: (haveA2<=haveA2)
states: 7,006 (3)
abstracting: (20<=haveAandB)
states: 0
abstracting: (resA<=7)
states: 6,853 (3)
abstracting: (20<=haveAandB)
states: 0
abstracting: (20<=haveAandB)
states: 0

EG iterations: 0
.
EG iterations: 1
abstracting: (Clients<=Clients)
states: 7,006 (3)
abstracting: (resB<=resA)
states: 3,002 (3)
abstracting: (8<=haveA)
states: 153

EG iterations: 0
abstracting: (haveA2<=haveA2)
states: 7,006 (3)
abstracting: (20<=haveAandB)
states: 0
abstracting: (resA<=7)
states: 6,853 (3)
abstracting: (20<=haveAandB)
states: 0
abstracting: (20<=haveAandB)
states: 0

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

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

MC time: 0m 0.016sec

checking: A [[Clients<=haveAandB & A [AG [7<=resA] U [[[[resB<=haveA2andB | resB<=4] | ~ [haveA2<=Clients]] | [[haveAandB<=Clients & resA<=Clients] | EG [haveAandB<=haveA]]] | AF [AF [haveA2andB<=17]]]]] U [EG [EF [EX [resA<=1]]] & 14<=Clients]]
normalized: [~ [EG [~ [[14<=Clients & EG [E [true U EX [resA<=1]]]]]]] & ~ [E [~ [[14<=Clients & EG [E [true U EX [resA<=1]]]]] U [~ [[Clients<=haveAandB & [~ [EG [~ [[~ [EG [EG [~ [haveA2andB<=17]]]] | [[EG [haveAandB<=haveA] | [haveAandB<=Clients & resA<=Clients]] | [~ [haveA2<=Clients] | [resB<=haveA2andB | resB<=4]]]]]]] & ~ [E [~ [[~ [EG [EG [~ [haveA2andB<=17]]]] | [[EG [haveAandB<=haveA] | [haveAandB<=Clients & resA<=Clients]] | [~ [haveA2<=Clients] | [resB<=haveA2andB | resB<=4]]]]] U [E [true U ~ [7<=resA]] & ~ [[~ [EG [EG [~ [haveA2andB<=17]]]] | [[EG [haveAandB<=haveA] | [haveAandB<=Clients & resA<=Clients]] | [~ [haveA2<=Clients] | [resB<=haveA2andB | resB<=4]]]]]]]]]]] & ~ [[14<=Clients & EG [E [true U EX [resA<=1]]]]]]]]]

abstracting: (resA<=1)
states: 3,145 (3)
..
EG iterations: 1
abstracting: (14<=Clients)
states: 462
abstracting: (resB<=4)
states: 4,682 (3)
abstracting: (resB<=haveA2andB)
states: 2,568 (3)
abstracting: (haveA2<=Clients)
states: 6,573 (3)
abstracting: (resA<=Clients)
states: 7,006 (3)
abstracting: (haveAandB<=Clients)
states: 7,006 (3)
abstracting: (haveAandB<=haveA)
states: 4,696 (3)
.
EG iterations: 1
abstracting: (haveA2andB<=17)
states: 7,006 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (7<=resA)
states: 343
abstracting: (resB<=4)
states: 4,682 (3)
abstracting: (resB<=haveA2andB)
states: 2,568 (3)
abstracting: (haveA2<=Clients)
states: 6,573 (3)
abstracting: (resA<=Clients)
states: 7,006 (3)
abstracting: (haveAandB<=Clients)
states: 7,006 (3)
abstracting: (haveAandB<=haveA)
states: 4,696 (3)
.
EG iterations: 1
abstracting: (haveA2andB<=17)
states: 7,006 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (resB<=4)
states: 4,682 (3)
abstracting: (resB<=haveA2andB)
states: 2,568 (3)
abstracting: (haveA2<=Clients)
states: 6,573 (3)
abstracting: (resA<=Clients)
states: 7,006 (3)
abstracting: (haveAandB<=Clients)
states: 7,006 (3)
abstracting: (haveAandB<=haveA)
states: 4,696 (3)
.
EG iterations: 1
abstracting: (haveA2andB<=17)
states: 7,006 (3)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (Clients<=haveAandB)
states: 65
abstracting: (resA<=1)
states: 3,145 (3)
..
EG iterations: 1
abstracting: (14<=Clients)
states: 462
abstracting: (resA<=1)
states: 3,145 (3)
..
EG iterations: 1
abstracting: (14<=Clients)
states: 462
.
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00020vD-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: [EG [[EX [[AF [13<=Clients] | [[20<=resA & 3<=resA] | AF [haveAandB<=15]]]] & ~ [[E [[haveA2<=resB & haveA2<=18] U EF [haveA<=haveA]] | [AF [haveA2<=1] & [[haveA2andB<=5 | haveA<=5] & 12<=haveA]]]]]] & EG [~ [AF [[~ [A [8<=resB U Clients<=2]] & [[haveB<=0 | haveB<=8] | AG [haveAandB<=haveA2andB]]]]]]]
normalized: [EG [EG [~ [[[~ [E [true U ~ [haveAandB<=haveA2andB]]] | [haveB<=0 | haveB<=8]] & ~ [[~ [EG [~ [Clients<=2]]] & ~ [E [~ [Clients<=2] U [~ [8<=resB] & ~ [Clients<=2]]]]]]]]]] & EG [[~ [[[[12<=haveA & [haveA2andB<=5 | haveA<=5]] & ~ [EG [~ [haveA2<=1]]]] | E [[haveA2<=resB & haveA2<=18] U E [true U haveA<=haveA]]]] & EX [[[~ [EG [~ [haveAandB<=15]]] | [20<=resA & 3<=resA]] | ~ [EG [~ [13<=Clients]]]]]]]]

abstracting: (13<=Clients)
states: 792
.
EG iterations: 1
abstracting: (3<=resA)
states: 2,706 (3)
abstracting: (20<=resA)
states: 0
abstracting: (haveAandB<=15)
states: 7,006 (3)
.
EG iterations: 1
.abstracting: (haveA<=haveA)
states: 7,006 (3)
abstracting: (haveA2<=18)
states: 7,006 (3)
abstracting: (haveA2<=resB)
states: 5,005 (3)
abstracting: (haveA2<=1)
states: 3,146 (3)
..
EG iterations: 2
abstracting: (haveA<=5)
states: 6,348 (3)
abstracting: (haveA2andB<=5)
states: 6,768 (3)
abstracting: (12<=haveA)
states: 0
.
EG iterations: 1
abstracting: (Clients<=2)
states: 146
abstracting: (8<=resB)
states: 553
abstracting: (Clients<=2)
states: 146
abstracting: (Clients<=2)
states: 146
.
EG iterations: 1
abstracting: (haveB<=8)
states: 6,765 (3)
abstracting: (haveB<=0)
states: 1,001 (3)
abstracting: (haveAandB<=haveA2andB)
states: 4,213 (3)
....
EG iterations: 4
.
EG iterations: 1
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00020vD-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: [A [EG [[[EX [haveA2andB<=19] | EF [resA<=haveAandB]] | [A [6<=haveA U 14<=Clients] | AG [resB<=resB]]]] U [[AG [haveAandB<=haveAandB] & [EF [EF [haveA2andB<=7]] | [haveA2andB<=haveAandB & A [haveAandB<=haveAandB U 12<=resB]]]] | [[resA<=resA & [~ [AF [haveB<=haveA2]] | [19<=haveA2 | haveA<=haveAandB]]] & 14<=resA]]] & A [Clients<=haveB U [[[~ [EX [15<=resA]] & [[~ [5<=haveA2andB] | haveA2<=2] | [[14<=Clients & 7<=Clients] | ~ [5<=haveB]]]] | ~ [2<=haveA2andB]] & haveAandB<=haveB]]]
normalized: [[~ [EG [~ [[haveAandB<=haveB & [~ [2<=haveA2andB] | [[[~ [5<=haveB] | [14<=Clients & 7<=Clients]] | [haveA2<=2 | ~ [5<=haveA2andB]]] & ~ [EX [15<=resA]]]]]]]] & ~ [E [~ [[haveAandB<=haveB & [~ [2<=haveA2andB] | [[[~ [5<=haveB] | [14<=Clients & 7<=Clients]] | [haveA2<=2 | ~ [5<=haveA2andB]]] & ~ [EX [15<=resA]]]]]] U [~ [Clients<=haveB] & ~ [[haveAandB<=haveB & [~ [2<=haveA2andB] | [[[~ [5<=haveB] | [14<=Clients & 7<=Clients]] | [haveA2<=2 | ~ [5<=haveA2andB]]] & ~ [EX [15<=resA]]]]]]]]]] & [~ [EG [~ [[[14<=resA & [resA<=resA & [[19<=haveA2 | haveA<=haveAandB] | EG [~ [haveB<=haveA2]]]]] | [[[haveA2andB<=haveAandB & [~ [EG [~ [12<=resB]]] & ~ [E [~ [12<=resB] U [~ [haveAandB<=haveAandB] & ~ [12<=resB]]]]]] | E [true U E [true U haveA2andB<=7]]] & ~ [E [true U ~ [haveAandB<=haveAandB]]]]]]]] & ~ [E [~ [[[14<=resA & [resA<=resA & [[19<=haveA2 | haveA<=haveAandB] | EG [~ [haveB<=haveA2]]]]] | [[[haveA2andB<=haveAandB & [~ [EG [~ [12<=resB]]] & ~ [E [~ [12<=resB] U [~ [haveAandB<=haveAandB] & ~ [12<=resB]]]]]] | E [true U E [true U haveA2andB<=7]]] & ~ [E [true U ~ [haveAandB<=haveAandB]]]]]] U [~ [EG [[[~ [E [true U ~ [resB<=resB]]] | [~ [EG [~ [14<=Clients]]] & ~ [E [~ [14<=Clients] U [~ [6<=haveA] & ~ [14<=Clients]]]]]] | [E [true U resA<=haveAandB] | EX [haveA2andB<=19]]]]] & ~ [[[14<=resA & [resA<=resA & [[19<=haveA2 | haveA<=haveAandB] | EG [~ [haveB<=haveA2]]]]] | [[[haveA2andB<=haveAandB & [~ [EG [~ [12<=resB]]] & ~ [E [~ [12<=resB] U [~ [haveAandB<=haveAandB] & ~ [12<=resB]]]]]] | E [true U E [true U haveA2andB<=7]]] & ~ [E [true U ~ [haveAandB<=haveAandB]]]]]]]]]]]

abstracting: (haveAandB<=haveAandB)
states: 7,006 (3)
abstracting: (haveA2andB<=7)
states: 6,973 (3)
abstracting: (12<=resB)
states: 0
abstracting: (haveAandB<=haveAandB)
states: 7,006 (3)
abstracting: (12<=resB)
states: 0
abstracting: (12<=resB)
states: 0

EG iterations: 0
abstracting: (haveA2andB<=haveAandB)
states: 4,213 (3)
abstracting: (haveB<=haveA2)
states: 3,002 (3)
...
EG iterations: 3
abstracting: (haveA<=haveAandB)
states: 3,485 (3)
abstracting: (19<=haveA2)
states: 0
abstracting: (resA<=resA)
states: 7,006 (3)
abstracting: (14<=resA)
states: 0
abstracting: (haveA2andB<=19)
states: 7,006 (3)
.abstracting: (resA<=haveAandB)
states: 3,485 (3)
abstracting: (14<=Clients)
states: 462
abstracting: (6<=haveA)
states: 658
abstracting: (14<=Clients)
states: 462
abstracting: (14<=Clients)
states: 462
.
EG iterations: 1
abstracting: (resB<=resB)
states: 7,006 (3)

EG iterations: 0
abstracting: (haveAandB<=haveAandB)
states: 7,006 (3)
abstracting: (haveA2andB<=7)
states: 6,973 (3)
abstracting: (12<=resB)
states: 0
abstracting: (haveAandB<=haveAandB)
states: 7,006 (3)
abstracting: (12<=resB)
states: 0
abstracting: (12<=resB)
states: 0

EG iterations: 0
abstracting: (haveA2andB<=haveAandB)
states: 4,213 (3)
abstracting: (haveB<=haveA2)
states: 3,002 (3)
...
EG iterations: 3
abstracting: (haveA<=haveAandB)
states: 3,485 (3)
abstracting: (19<=haveA2)
states: 0
abstracting: (resA<=resA)
states: 7,006 (3)
abstracting: (14<=resA)
states: 0
abstracting: (haveAandB<=haveAandB)
states: 7,006 (3)
abstracting: (haveA2andB<=7)
states: 6,973 (3)
abstracting: (12<=resB)
states: 0
abstracting: (haveAandB<=haveAandB)
states: 7,006 (3)
abstracting: (12<=resB)
states: 0
abstracting: (12<=resB)
states: 0

EG iterations: 0
abstracting: (haveA2andB<=haveAandB)
states: 4,213 (3)
abstracting: (haveB<=haveA2)
states: 3,002 (3)
...
EG iterations: 3
abstracting: (haveA<=haveAandB)
states: 3,485 (3)
abstracting: (19<=haveA2)
states: 0
abstracting: (resA<=resA)
states: 7,006 (3)
abstracting: (14<=resA)
states: 0
.
EG iterations: 1
abstracting: (15<=resA)
states: 0
.abstracting: (5<=haveA2andB)
states: 504
abstracting: (haveA2<=2)
states: 4,301 (3)
abstracting: (7<=Clients)
states: 5,453 (3)
abstracting: (14<=Clients)
states: 462
abstracting: (5<=haveB)
states: 2,323 (3)
abstracting: (2<=haveA2andB)
states: 2,871 (3)
abstracting: (haveAandB<=haveB)
states: 5,298 (3)
abstracting: (Clients<=haveB)
states: 1,357 (3)
abstracting: (15<=resA)
states: 0
.abstracting: (5<=haveA2andB)
states: 504
abstracting: (haveA2<=2)
states: 4,301 (3)
abstracting: (7<=Clients)
states: 5,453 (3)
abstracting: (14<=Clients)
states: 462
abstracting: (5<=haveB)
states: 2,323 (3)
abstracting: (2<=haveA2andB)
states: 2,871 (3)
abstracting: (haveAandB<=haveB)
states: 5,298 (3)
abstracting: (15<=resA)
states: 0
.abstracting: (5<=haveA2andB)
states: 504
abstracting: (haveA2<=2)
states: 4,301 (3)
abstracting: (7<=Clients)
states: 5,453 (3)
abstracting: (14<=Clients)
states: 462
abstracting: (5<=haveB)
states: 2,323 (3)
abstracting: (2<=haveA2andB)
states: 2,871 (3)
abstracting: (haveAandB<=haveB)
states: 5,298 (3)
......
EG iterations: 6
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00020vD-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: [A [[[E [haveA2<=haveB U ~ [haveA<=0]] | EX [[~ [haveAandB<=haveB] | AX [haveA2andB<=4]]]] | [[~ [[haveAandB<=Clients & E [2<=haveA2andB U haveA2andB<=haveB]]] | [[[16<=haveA & haveA<=5] | E [haveAandB<=16 U haveA2andB<=4]] | E [20<=haveB U resB<=haveA2]]] | ~ [haveA2andB<=Clients]]] U [A [~ [5<=haveA2] U [~ [[haveA2andB<=3 | haveA2<=15]] | EF [16<=haveAandB]]] & ~ [A [EG [5<=resA] U EG [12<=haveA]]]]] & EF [[~ [[13<=haveA2andB & resA<=12]] | [AF [[AF [haveA<=16] | [haveA2<=8 | haveA<=haveB]]] | ~ [[EX [haveA2andB<=15] | [[12<=haveA | 20<=haveA2] | AX [resA<=16]]]]]]]]
normalized: [E [true U [[~ [[[~ [EX [~ [resA<=16]]] | [12<=haveA | 20<=haveA2]] | EX [haveA2andB<=15]]] | ~ [EG [~ [[[haveA2<=8 | haveA<=haveB] | ~ [EG [~ [haveA<=16]]]]]]]] | ~ [[13<=haveA2andB & resA<=12]]]] & [~ [EG [~ [[~ [[~ [EG [~ [EG [12<=haveA]]]] & ~ [E [~ [EG [12<=haveA]] U [~ [EG [5<=resA]] & ~ [EG [12<=haveA]]]]]]] & [~ [EG [~ [[E [true U 16<=haveAandB] | ~ [[haveA2andB<=3 | haveA2<=15]]]]]] & ~ [E [~ [[E [true U 16<=haveAandB] | ~ [[haveA2andB<=3 | haveA2<=15]]]] U [5<=haveA2 & ~ [[E [true U 16<=haveAandB] | ~ [[haveA2andB<=3 | haveA2<=15]]]]]]]]]]]] & ~ [E [~ [[~ [[~ [EG [~ [EG [12<=haveA]]]] & ~ [E [~ [EG [12<=haveA]] U [~ [EG [5<=resA]] & ~ [EG [12<=haveA]]]]]]] & [~ [EG [~ [[E [true U 16<=haveAandB] | ~ [[haveA2andB<=3 | haveA2<=15]]]]]] & ~ [E [~ [[E [true U 16<=haveAandB] | ~ [[haveA2andB<=3 | haveA2<=15]]]] U [5<=haveA2 & ~ [[E [true U 16<=haveAandB] | ~ [[haveA2andB<=3 | haveA2<=15]]]]]]]]]] U [~ [[[~ [haveA2andB<=Clients] | [[E [20<=haveB U resB<=haveA2] | [E [haveAandB<=16 U haveA2andB<=4] | [16<=haveA & haveA<=5]]] | ~ [[haveAandB<=Clients & E [2<=haveA2andB U haveA2andB<=haveB]]]]] | [EX [[~ [EX [~ [haveA2andB<=4]]] | ~ [haveAandB<=haveB]]] | E [haveA2<=haveB U ~ [haveA<=0]]]]] & ~ [[~ [[~ [EG [~ [EG [12<=haveA]]]] & ~ [E [~ [EG [12<=haveA]] U [~ [EG [5<=resA]] & ~ [EG [12<=haveA]]]]]]] & [~ [EG [~ [[E [true U 16<=haveAandB] | ~ [[haveA2andB<=3 | haveA2<=15]]]]]] & ~ [E [~ [[E [true U 16<=haveAandB] | ~ [[haveA2andB<=3 | haveA2<=15]]]] U [5<=haveA2 & ~ [[E [true U 16<=haveAandB] | ~ [[haveA2andB<=3 | haveA2<=15]]]]]]]]]]]]]]]

abstracting: (haveA2<=15)
states: 7,006 (3)
abstracting: (haveA2andB<=3)
states: 6,040 (3)
abstracting: (16<=haveAandB)
states: 0
abstracting: (5<=haveA2)
states: 1,133 (3)
abstracting: (haveA2<=15)
states: 7,006 (3)
abstracting: (haveA2andB<=3)
states: 6,040 (3)
abstracting: (16<=haveAandB)
states: 0
abstracting: (haveA2<=15)
states: 7,006 (3)
abstracting: (haveA2andB<=3)
states: 6,040 (3)
abstracting: (16<=haveAandB)
states: 0

EG iterations: 0
abstracting: (12<=haveA)
states: 0
.
EG iterations: 1
abstracting: (5<=resA)
states: 1,134 (3)
..
EG iterations: 2
abstracting: (12<=haveA)
states: 0
.
EG iterations: 1
abstracting: (12<=haveA)
states: 0
.
EG iterations: 1

EG iterations: 0
abstracting: (haveA<=0)
states: 1,715 (3)
abstracting: (haveA2<=haveB)
states: 5,004 (3)
abstracting: (haveAandB<=haveB)
states: 5,298 (3)
abstracting: (haveA2andB<=4)
states: 6,502 (3)
..abstracting: (haveA2andB<=haveB)
states: 5,298 (3)
abstracting: (2<=haveA2andB)
states: 2,871 (3)
abstracting: (haveAandB<=Clients)
states: 7,006 (3)
abstracting: (haveA<=5)
states: 6,348 (3)
abstracting: (16<=haveA)
states: 0
abstracting: (haveA2andB<=4)
states: 6,502 (3)
abstracting: (haveAandB<=16)
states: 7,006 (3)
abstracting: (resB<=haveA2)
states: 3,002 (3)
abstracting: (20<=haveB)
states: 0
abstracting: (haveA2andB<=Clients)
states: 7,006 (3)
abstracting: (haveA2<=15)
states: 7,006 (3)
abstracting: (haveA2andB<=3)
states: 6,040 (3)
abstracting: (16<=haveAandB)
states: 0
abstracting: (5<=haveA2)
states: 1,133 (3)
abstracting: (haveA2<=15)
states: 7,006 (3)
abstracting: (haveA2andB<=3)
states: 6,040 (3)
abstracting: (16<=haveAandB)
states: 0
abstracting: (haveA2<=15)
states: 7,006 (3)
abstracting: (haveA2andB<=3)
states: 6,040 (3)
abstracting: (16<=haveAandB)
states: 0

EG iterations: 0
abstracting: (12<=haveA)
states: 0
.
EG iterations: 1
abstracting: (5<=resA)
states: 1,134 (3)
..
EG iterations: 2
abstracting: (12<=haveA)
states: 0
.
EG iterations: 1
abstracting: (12<=haveA)
states: 0
.
EG iterations: 1

EG iterations: 0
abstracting: (haveA2<=15)
states: 7,006 (3)
abstracting: (haveA2andB<=3)
states: 6,040 (3)
abstracting: (16<=haveAandB)
states: 0
abstracting: (5<=haveA2)
states: 1,133 (3)
abstracting: (haveA2<=15)
states: 7,006 (3)
abstracting: (haveA2andB<=3)
states: 6,040 (3)
abstracting: (16<=haveAandB)
states: 0
abstracting: (haveA2<=15)
states: 7,006 (3)
abstracting: (haveA2andB<=3)
states: 6,040 (3)
abstracting: (16<=haveAandB)
states: 0

EG iterations: 0
abstracting: (12<=haveA)
states: 0
.
EG iterations: 1
abstracting: (5<=resA)
states: 1,134 (3)
..
EG iterations: 2
abstracting: (12<=haveA)
states: 0
.
EG iterations: 1
abstracting: (12<=haveA)
states: 0
.
EG iterations: 1

EG iterations: 0

EG iterations: 0
abstracting: (resA<=12)
states: 7,006 (3)
abstracting: (13<=haveA2andB)
states: 0
abstracting: (haveA<=16)
states: 7,006 (3)
.
EG iterations: 1
abstracting: (haveA<=haveB)
states: 5,004 (3)
abstracting: (haveA2<=8)
states: 6,954 (3)
.
EG iterations: 1
abstracting: (haveA2andB<=15)
states: 7,006 (3)
.abstracting: (20<=haveA2)
states: 0
abstracting: (12<=haveA)
states: 0
abstracting: (resA<=16)
states: 7,006 (3)
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00020vD-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

totally nodes used: 31897 (3.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 254268 91867 346135
used/not used/entry size/cache size: 120148 66988716 16 1024MB
basic ops cache: hits/miss/sum: 127986 110339 238325
used/not used/entry size/cache size: 155825 16621391 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: 23560 9445 33005
used/not used/entry size/cache size: 9445 8379163 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 67080710
1 26316
2 1345
3 183
4 139
5 44
6 11
7 16
8 48
9 7
>= 10 45

Total processing time: 0m 4.726sec


BK_STOP 1679868308550

--------------------
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:268 (44), effective:87 (14)

initing FirstDep: 0m 0.000sec


iterations count:45 (7), effective:12 (2)

iterations count:69 (11), effective:20 (3)

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

iterations count:36 (6), effective:9 (1)

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

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

iterations count:247 (41), effective:77 (12)

iterations count:126 (21), effective:50 (8)

iterations count:98 (16), effective:30 (5)

iterations count:144 (24), effective:55 (9)

iterations count:233 (38), effective:70 (11)

iterations count:233 (38), effective:70 (11)

iterations count:233 (38), effective:70 (11)

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

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

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

iterations count:13 (2), effective:2 (0)

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

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

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

iterations count:21 (3), effective:9 (1)

iterations count:62 (10), effective:23 (3)

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

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

iterations count:31 (5), effective:15 (2)

iterations count:83 (13), effective:26 (4)

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

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

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

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

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

iterations count:115 (19), effective:33 (5)

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

iterations count:15 (2), effective:3 (0)

iterations count:52 (8), effective:13 (2)

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

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

iterations count:115 (19), effective:33 (5)

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

iterations count:115 (19), effective:33 (5)

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

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-nC00020vD"
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-nC00020vD, 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-167912692500801"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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