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.r225-tall-167856407300241.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 Kanban-PT-00010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407300241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.9K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 11:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 11:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-00010-CTLCardinality-00
FORMULA_NAME Kanban-PT-00010-CTLCardinality-01
FORMULA_NAME Kanban-PT-00010-CTLCardinality-02
FORMULA_NAME Kanban-PT-00010-CTLCardinality-03
FORMULA_NAME Kanban-PT-00010-CTLCardinality-04
FORMULA_NAME Kanban-PT-00010-CTLCardinality-05
FORMULA_NAME Kanban-PT-00010-CTLCardinality-06
FORMULA_NAME Kanban-PT-00010-CTLCardinality-07
FORMULA_NAME Kanban-PT-00010-CTLCardinality-08
FORMULA_NAME Kanban-PT-00010-CTLCardinality-09
FORMULA_NAME Kanban-PT-00010-CTLCardinality-10
FORMULA_NAME Kanban-PT-00010-CTLCardinality-11
FORMULA_NAME Kanban-PT-00010-CTLCardinality-12
FORMULA_NAME Kanban-PT-00010-CTLCardinality-13
FORMULA_NAME Kanban-PT-00010-CTLCardinality-14
FORMULA_NAME Kanban-PT-00010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678613778663

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=Kanban-PT-00010
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: Kanban_PT_00010
(NrP: 16 NrTr: 16 NrArc: 40)

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

net check time: 0m 0.000sec

init dd package: 0m 2.736sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 256 (2.6e+02) #states 1,005,927,208 (9)



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

checking: AG [EF [AX [~ [AG [2<=Pout3]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [~ [E [true U ~ [2<=Pout3]]]]]]]]]

abstracting: (2<=Pout3)
states: 631,628,712 (8)
.-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: EG [6<=Pm4]
normalized: EG [6<=Pm4]

abstracting: (6<=Pm4)
states: 123,102,980 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [~ [E [EF [[E [6<=Pback1 U Pback4<=10] & 2<=Pback3]] U AX [AX [5<=Pback1]]]]]
normalized: EX [~ [E [E [true U [E [6<=Pback1 U Pback4<=10] & 2<=Pback3]] U ~ [EX [EX [~ [5<=Pback1]]]]]]]

abstracting: (5<=Pback1)
states: 196,964,768 (8)
..abstracting: (2<=Pback3)
states: 631,628,712 (8)
abstracting: (Pback4<=10)
states: 1,005,927,208 (9)
abstracting: (6<=Pback1)
states: 123,102,980 (8)
.-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [[[~ [[Pout4<=Pout1 | ~ [Pback1<=10]]] & Pm3<=P2] | AX [AX [~ [9<=Pout4]]]]]]
normalized: E [true U ~ [[~ [EX [EX [9<=Pout4]]] | [~ [[~ [Pback1<=10] | Pout4<=Pout1]] & Pm3<=P2]]]]

abstracting: (Pm3<=P2)
states: 433,437,004 (8)
abstracting: (Pout4<=Pout1)
states: 578,584,006 (8)
abstracting: (Pback1<=10)
states: 1,005,927,208 (9)
abstracting: (9<=Pout4)
states: 14,068,912 (7)
..-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: AG [EF [EF [[A [10<=P3 U Pm4<=Pback2] | E [Pout2<=4 U Pout2<=Pm2]]]]]
normalized: ~ [E [true U ~ [E [true U E [true U [E [Pout2<=4 U Pout2<=Pm2] | [~ [EG [~ [Pm4<=Pback2]]] & ~ [E [~ [Pm4<=Pback2] U [~ [10<=P3] & ~ [Pm4<=Pback2]]]]]]]]]]]

abstracting: (Pm4<=Pback2)
states: 612,243,060 (8)
abstracting: (10<=P3)
states: 81,796 (4)
abstracting: (Pm4<=Pback2)
states: 612,243,060 (8)
abstracting: (Pm4<=Pback2)
states: 612,243,060 (8)
.
EG iterations: 1
abstracting: (Pout2<=Pm2)
states: 555,967,412 (8)
abstracting: (Pout2<=4)
states: 762,011,536 (8)
-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [EF [[AG [[A [Pout3<=2 U Pback2<=Pback3] | [8<=Pm4 | 8<=Pout3]]] & [7<=Pm3 | P2<=P1]]]]
normalized: ~ [E [true U ~ [E [true U [[7<=Pm3 | P2<=P1] & ~ [E [true U ~ [[[8<=Pm4 | 8<=Pout3] | [~ [EG [~ [Pback2<=Pback3]]] & ~ [E [~ [Pback2<=Pback3] U [~ [Pout3<=2] & ~ [Pback2<=Pback3]]]]]]]]]]]]]]

abstracting: (Pback2<=Pback3)
states: 573,144,572 (8)
abstracting: (Pout3<=2)
states: 526,439,056 (8)
abstracting: (Pback2<=Pback3)
states: 573,144,572 (8)
abstracting: (Pback2<=Pback3)
states: 573,144,572 (8)
.
EG iterations: 1
abstracting: (8<=Pout3)
states: 49,568,376 (7)
abstracting: (8<=Pm4)
states: 35,172,280 (7)
abstracting: (P2<=P1)
states: 715,510,510 (8)
abstracting: (7<=Pm3)
states: 94,965,156 (7)
-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: E [EG [Pout2<=4] U ~ [[EX [EX [~ [Pm3<=Pm1]]] | [~ [[~ [[Pout4<=P1 | Pback2<=3]] & EG [Pout1<=Pm2]]] & 3<=P1]]]]
normalized: E [EG [Pout2<=4] U ~ [[[~ [[EG [Pout1<=Pm2] & ~ [[Pout4<=P1 | Pback2<=3]]]] & 3<=P1] | EX [EX [~ [Pm3<=Pm1]]]]]]

abstracting: (Pm3<=Pm1)
states: 535,886,494 (8)
..abstracting: (3<=P1)
states: 422,067,360 (8)
abstracting: (Pback2<=3)
states: 655,513,144 (8)
abstracting: (Pout4<=P1)
states: 578,584,006 (8)
abstracting: (Pout1<=Pm2)
states: 612,243,060 (8)
.
EG iterations: 1
abstracting: (Pout2<=4)
states: 762,011,536 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.092sec

checking: E [EX [AF [AX [A [P2<=2 U 5<=P2]]]] U [[AF [~ [[3<=Pback4 & EF [8<=Pm3]]]] | 9<=Pback2] & E [AX [[~ [P3<=P2] & [Pback2<=Pback2 | P1<=9]]] U 8<=Pout2]]]
normalized: E [EX [~ [EG [EX [~ [[~ [EG [~ [5<=P2]]] & ~ [E [~ [5<=P2] U [~ [P2<=2] & ~ [5<=P2]]]]]]]]]] U [E [~ [EX [~ [[[Pback2<=Pback2 | P1<=9] & ~ [P3<=P2]]]]] U 8<=Pout2] & [9<=Pback2 | ~ [EG [[3<=Pback4 & E [true U 8<=Pm3]]]]]]]

abstracting: (8<=Pm3)
states: 49,568,376 (7)
abstracting: (3<=Pback4)
states: 422,067,360 (8)
.
EG iterations: 1
abstracting: (9<=Pback2)
states: 20,694,388 (7)
abstracting: (8<=Pout2)
states: 49,568,376 (7)
abstracting: (P3<=P2)
states: 1,005,927,208 (9)
abstracting: (P1<=9)
states: 1,002,409,980 (9)
abstracting: (Pback2<=Pback2)
states: 1,005,927,208 (9)
.abstracting: (5<=P2)
states: 66,418,352 (7)
abstracting: (P2<=2)
states: 769,373,176 (8)
abstracting: (5<=P2)
states: 66,418,352 (7)
abstracting: (5<=P2)
states: 66,418,352 (7)
.
EG iterations: 1
..
EG iterations: 1
.-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: [~ [EG [[[[~ [Pout3<=Pm3] & AF [Pback3<=1]] & AX [Pout3<=Pback3]] & [[[4<=Pout2 & Pm3<=4] | [P2<=Pout1 & 6<=Pout1]] | ~ [EG [9<=Pm4]]]]]] & ~ [AG [[EF [[[3<=Pm2 & Pm3<=1] & EF [Pback2<=1]]] & ~ [4<=Pback3]]]]]
normalized: [E [true U ~ [[~ [4<=Pback3] & E [true U [E [true U Pback2<=1] & [3<=Pm2 & Pm3<=1]]]]]] & ~ [EG [[[~ [EG [9<=Pm4]] | [[P2<=Pout1 & 6<=Pout1] | [4<=Pout2 & Pm3<=4]]] & [~ [EX [~ [Pout3<=Pback3]]] & [~ [EG [~ [Pback3<=1]]] & ~ [Pout3<=Pm3]]]]]]]

abstracting: (Pout3<=Pm3)
states: 555,967,412 (8)
abstracting: (Pback3<=1)
states: 374,298,496 (8)
.
EG iterations: 1
abstracting: (Pout3<=Pback3)
states: 555,967,412 (8)
.abstracting: (Pm3<=4)
states: 762,011,536 (8)
abstracting: (4<=Pout2)
states: 350,414,064 (8)
abstracting: (6<=Pout1)
states: 123,102,980 (8)
abstracting: (P2<=Pout1)
states: 715,510,510 (8)
abstracting: (9<=Pm4)
states: 14,068,912 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (Pm3<=1)
states: 374,298,496 (8)
abstracting: (3<=Pm2)
states: 479,488,152 (8)
abstracting: (Pback2<=1)
states: 374,298,496 (8)
abstracting: (4<=Pback3)
states: 350,414,064 (8)
-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: [EG [EG [AF [[AG [Pout4<=Pm2] | ~ [4<=Pout3]]]]] & [~ [E [2<=Pout1 U 1<=Pout2]] | EX [[[E [[Pout4<=Pback1 & 9<=P1] U [8<=Pout1 | 1<=Pout3]] & [A [6<=Pout1 U 6<=Pm4] | [~ [Pout3<=5] | [Pout4<=4 | Pback3<=Pback4]]]] & 8<=P3]]]]
normalized: [[EX [[8<=P3 & [[[[Pout4<=4 | Pback3<=Pback4] | ~ [Pout3<=5]] | [~ [EG [~ [6<=Pm4]]] & ~ [E [~ [6<=Pm4] U [~ [6<=Pout1] & ~ [6<=Pm4]]]]]] & E [[Pout4<=Pback1 & 9<=P1] U [8<=Pout1 | 1<=Pout3]]]]] | ~ [E [2<=Pout1 U 1<=Pout2]]] & EG [EG [~ [EG [~ [[~ [4<=Pout3] | ~ [E [true U ~ [Pout4<=Pm2]]]]]]]]]]

abstracting: (Pout4<=Pm2)
states: 612,243,060 (8)
abstracting: (4<=Pout3)
states: 350,414,064 (8)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=Pout2)
states: 807,081,132 (8)
abstracting: (2<=Pout1)
states: 580,342,620 (8)
abstracting: (1<=Pout3)
states: 807,081,132 (8)
abstracting: (8<=Pout1)
states: 35,172,280 (7)
abstracting: (9<=P1)
states: 14,068,912 (7)
abstracting: (Pout4<=Pback1)
states: 578,584,006 (8)
abstracting: (6<=Pm4)
states: 123,102,980 (8)
abstracting: (6<=Pout1)
states: 123,102,980 (8)
abstracting: (6<=Pm4)
states: 123,102,980 (8)
abstracting: (6<=Pm4)
states: 123,102,980 (8)
.
EG iterations: 1
abstracting: (Pout3<=5)
states: 846,752,192 (8)
abstracting: (Pback3<=Pback4)
states: 535,886,494 (8)
abstracting: (Pout4<=4)
states: 808,962,440 (8)
abstracting: (8<=P3)
states: 3,762,616 (6)
.-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: [AG [[[[[~ [AF [Pm4<=4]] & EG [Pout3<=4]] | ~ [[Pback1<=Pout3 | ~ [10<=P3]]]] & E [[~ [Pm2<=Pback4] & ~ [3<=Pm3]] U [~ [Pback2<=Pback3] | ~ [Pm2<=7]]]] | EF [EG [EX [Pout2<=Pout3]]]]] | AG [[EF [~ [[[Pout4<=6 | P4<=4] | 9<=Pback4]]] | ~ [AG [Pback2<=Pout1]]]]]
normalized: [~ [E [true U ~ [[E [true U ~ [Pback2<=Pout1]] | E [true U ~ [[9<=Pback4 | [Pout4<=6 | P4<=4]]]]]]]] | ~ [E [true U ~ [[E [true U EG [EX [Pout2<=Pout3]]] | [E [[~ [3<=Pm3] & ~ [Pm2<=Pback4]] U [~ [Pm2<=7] | ~ [Pback2<=Pback3]]] & [~ [[Pback1<=Pout3 | ~ [10<=P3]]] | [EG [Pout3<=4] & EG [~ [Pm4<=4]]]]]]]]]]

abstracting: (Pm4<=4)
states: 808,962,440 (8)
.
EG iterations: 1
abstracting: (Pout3<=4)
states: 762,011,536 (8)
.
EG iterations: 1
abstracting: (10<=P3)
states: 81,796 (4)
abstracting: (Pback1<=Pout3)
states: 612,243,060 (8)
abstracting: (Pback2<=Pback3)
states: 573,144,572 (8)
abstracting: (Pm2<=7)
states: 956,358,832 (8)
abstracting: (Pm2<=Pback4)
states: 535,886,494 (8)
abstracting: (3<=Pm3)
states: 479,488,152 (8)
abstracting: (Pout2<=Pout3)
states: 573,144,572 (8)
..
EG iterations: 1
abstracting: (P4<=4)
states: 808,962,440 (8)
abstracting: (Pout4<=6)
states: 935,582,648 (8)
abstracting: (9<=Pback4)
states: 14,068,912 (7)
abstracting: (Pback2<=Pout1)
states: 535,886,494 (8)
-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.064sec

checking: EF [[E [[Pm2<=9 | [[[Pm3<=9 & Pm2<=2] & [Pm3<=9 | Pback4<=Pout2]] & [~ [2<=Pm1] | ~ [Pm1<=P3]]]] U E [Pout1<=Pout4 U [E [P4<=P3 U 8<=P4] | EF [Pout2<=9]]]] & ~ [E [~ [[10<=Pout2 & Pback1<=0]] U EF [[Pout3<=0 | 3<=P1]]]]]]
normalized: E [true U [~ [E [~ [[10<=Pout2 & Pback1<=0]] U E [true U [Pout3<=0 | 3<=P1]]]] & E [[Pm2<=9 | [[~ [Pm1<=P3] | ~ [2<=Pm1]] & [[Pm3<=9 | Pback4<=Pout2] & [Pm3<=9 & Pm2<=2]]]] U E [Pout1<=Pout4 U [E [true U Pout2<=9] | E [P4<=P3 U 8<=P4]]]]]]

abstracting: (8<=P4)
states: 35,172,280 (7)
abstracting: (P4<=P3)
states: 469,877,122 (8)
abstracting: (Pout2<=9)
states: 1,000,528,672 (9)
abstracting: (Pout1<=Pout4)
states: 578,584,006 (8)
abstracting: (Pm2<=2)
states: 526,439,056 (8)
abstracting: (Pm3<=9)
states: 1,000,528,672 (9)
abstracting: (Pback4<=Pout2)
states: 612,243,060 (8)
abstracting: (Pm3<=9)
states: 1,000,528,672 (9)
abstracting: (2<=Pm1)
states: 580,342,620 (8)
abstracting: (Pm1<=P3)
states: 469,877,122 (8)
abstracting: (Pm2<=9)
states: 1,000,528,672 (9)
abstracting: (3<=P1)
states: 422,067,360 (8)
abstracting: (Pout3<=0)
states: 198,846,076 (8)
abstracting: (Pback1<=0)
states: 232,137,048 (8)
abstracting: (10<=Pout2)
states: 5,398,536 (6)
-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: [AF [[AX [EF [[Pout2<=2 & Pm4<=3]]] & [[E [~ [Pm1<=3] U P1<=6] & [A [P4<=7 U P2<=Pm1] & ~ [E [Pout3<=Pout4 U 9<=Pback2]]]] & AX [[~ [P2<=1] & [3<=Pout2 | Pout3<=Pback1]]]]]] | [EF [AG [[EF [Pout2<=8] | E [Pm3<=Pout4 U Pout2<=9]]]] & [AF [EX [EF [P1<=4]]] | ~ [AX [Pout3<=2]]]]]
normalized: [[[EX [~ [Pout3<=2]] | ~ [EG [~ [EX [E [true U P1<=4]]]]]] & E [true U ~ [E [true U ~ [[E [Pm3<=Pout4 U Pout2<=9] | E [true U Pout2<=8]]]]]]] | ~ [EG [~ [[[~ [EX [~ [[[3<=Pout2 | Pout3<=Pback1] & ~ [P2<=1]]]]] & [[~ [E [Pout3<=Pout4 U 9<=Pback2]] & [~ [EG [~ [P2<=Pm1]]] & ~ [E [~ [P2<=Pm1] U [~ [P4<=7] & ~ [P2<=Pm1]]]]]] & E [~ [Pm1<=3] U P1<=6]]] & ~ [EX [~ [E [true U [Pout2<=2 & Pm4<=3]]]]]]]]]]

abstracting: (Pm4<=3)
states: 710,480,056 (8)
abstracting: (Pout2<=2)
states: 526,439,056 (8)
.abstracting: (P1<=6)
states: 935,582,648 (8)
abstracting: (Pm1<=3)
states: 710,480,056 (8)
abstracting: (P2<=Pm1)
states: 715,510,510 (8)
abstracting: (P4<=7)
states: 970,754,928 (8)
abstracting: (P2<=Pm1)
states: 715,510,510 (8)
abstracting: (P2<=Pm1)
states: 715,510,510 (8)
..
EG iterations: 2
abstracting: (9<=Pback2)
states: 20,694,388 (7)
abstracting: (Pout3<=Pout4)
states: 535,886,494 (8)
abstracting: (P2<=1)
states: 603,736,276 (8)
abstracting: (Pout3<=Pback1)
states: 535,886,494 (8)
abstracting: (3<=Pout2)
states: 479,488,152 (8)
..
EG iterations: 1
abstracting: (Pout2<=8)
states: 985,232,820 (8)
abstracting: (Pout2<=9)
states: 1,000,528,672 (9)
abstracting: (Pm3<=Pout4)
states: 535,886,494 (8)
abstracting: (P1<=4)
states: 808,962,440 (8)
..
EG iterations: 1
abstracting: (Pout3<=2)
states: 526,439,056 (8)
.-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.090sec

checking: E [AG [[~ [[A [Pout3<=9 U 4<=Pback2] | EG [8<=Pm3]]] | [[[6<=Pout2 & 7<=P1] & AG [Pm2<=7]] & [[AX [Pback4<=Pout3] | [Pm2<=1 & P1<=Pout3]] & [~ [9<=P2] | ~ [P2<=9]]]]]] U [AF [AX [[~ [2<=P3] & [P1<=P2 & Pback3<=Pout3]]]] | [EX [P3<=Pback2] & EF [~ [EG [Pm1<=8]]]]]]
normalized: E [~ [E [true U ~ [[[[[~ [P2<=9] | ~ [9<=P2]] & [[Pm2<=1 & P1<=Pout3] | ~ [EX [~ [Pback4<=Pout3]]]]] & [~ [E [true U ~ [Pm2<=7]]] & [6<=Pout2 & 7<=P1]]] | ~ [[EG [8<=Pm3] | [~ [EG [~ [4<=Pback2]]] & ~ [E [~ [4<=Pback2] U [~ [Pout3<=9] & ~ [4<=Pback2]]]]]]]]]]] U [[E [true U ~ [EG [Pm1<=8]]] & EX [P3<=Pback2]] | ~ [EG [EX [~ [[[P1<=P2 & Pback3<=Pout3] & ~ [2<=P3]]]]]]]]

abstracting: (2<=P3)
states: 402,190,932 (8)
abstracting: (Pback3<=Pout3)
states: 555,967,412 (8)
abstracting: (P1<=P2)
states: 469,877,122 (8)
..
EG iterations: 1
abstracting: (P3<=Pback2)
states: 721,440,720 (8)
.abstracting: (Pm1<=8)
states: 991,858,296 (8)
.
EG iterations: 1
abstracting: (4<=Pback2)
states: 350,414,064 (8)
abstracting: (Pout3<=9)
states: 1,000,528,672 (9)
abstracting: (4<=Pback2)
states: 350,414,064 (8)
abstracting: (4<=Pback2)
states: 350,414,064 (8)
.
EG iterations: 1
abstracting: (8<=Pm3)
states: 49,568,376 (7)
.
EG iterations: 1
abstracting: (7<=P1)
states: 70,344,560 (7)
abstracting: (6<=Pout2)
states: 159,175,016 (8)
abstracting: (Pm2<=7)
states: 956,358,832 (8)
abstracting: (Pback4<=Pout3)
states: 612,243,060 (8)
.abstracting: (P1<=Pout3)
states: 612,243,060 (8)
abstracting: (Pm2<=1)
states: 374,298,496 (8)
abstracting: (9<=P2)
states: 817,960 (5)
abstracting: (P2<=9)
states: 1,005,845,412 (9)
-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: AF [[A [A [~ [AF [Pout2<=Pback4]] U A [Pout2<=Pout1 U 1<=P1]] U [Pback4<=Pm3 & [AF [P2<=Pout1] | 10<=Pback3]]] | ~ [[[[EF [Pout2<=Pm1] & [A [Pout3<=Pm2 U 1<=Pback3] & Pback4<=Pout1]] | [[~ [Pback2<=Pout3] & ~ [P2<=Pout2]] | [E [Pout4<=Pm1 U 10<=Pm2] & EF [Pm4<=Pm3]]]] | 10<=Pout1]]]]
normalized: ~ [EG [~ [[~ [[10<=Pout1 | [[[E [true U Pm4<=Pm3] & E [Pout4<=Pm1 U 10<=Pm2]] | [~ [P2<=Pout2] & ~ [Pback2<=Pout3]]] | [[Pback4<=Pout1 & [~ [EG [~ [1<=Pback3]]] & ~ [E [~ [1<=Pback3] U [~ [Pout3<=Pm2] & ~ [1<=Pback3]]]]]] & E [true U Pout2<=Pm1]]]]] | [~ [EG [~ [[Pback4<=Pm3 & [10<=Pback3 | ~ [EG [~ [P2<=Pout1]]]]]]]] & ~ [E [~ [[Pback4<=Pm3 & [10<=Pback3 | ~ [EG [~ [P2<=Pout1]]]]]] U [~ [[~ [EG [~ [[~ [EG [~ [1<=P1]]] & ~ [E [~ [1<=P1] U [~ [Pout2<=Pout1] & ~ [1<=P1]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=P1]]] & ~ [E [~ [1<=P1] U [~ [Pout2<=Pout1] & ~ [1<=P1]]]]]] U [~ [EG [~ [Pout2<=Pback4]]] & ~ [[~ [EG [~ [1<=P1]]] & ~ [E [~ [1<=P1] U [~ [Pout2<=Pout1] & ~ [1<=P1]]]]]]]]]]] & ~ [[Pback4<=Pm3 & [10<=Pback3 | ~ [EG [~ [P2<=Pout1]]]]]]]]]]]]]]

abstracting: (P2<=Pout1)
states: 715,510,510 (8)
.
EG iterations: 1
abstracting: (10<=Pback3)
states: 5,398,536 (6)
abstracting: (Pback4<=Pm3)
states: 612,243,060 (8)
abstracting: (1<=P1)
states: 773,790,160 (8)
abstracting: (Pout2<=Pout1)
states: 535,886,494 (8)
abstracting: (1<=P1)
states: 773,790,160 (8)
abstracting: (1<=P1)
states: 773,790,160 (8)
..
EG iterations: 2
abstracting: (Pout2<=Pback4)
states: 535,886,494 (8)
.
EG iterations: 1
abstracting: (1<=P1)
states: 773,790,160 (8)
abstracting: (Pout2<=Pout1)
states: 535,886,494 (8)
abstracting: (1<=P1)
states: 773,790,160 (8)
abstracting: (1<=P1)
states: 773,790,160 (8)
..
EG iterations: 2
abstracting: (1<=P1)
states: 773,790,160 (8)
abstracting: (Pout2<=Pout1)
states: 535,886,494 (8)
abstracting: (1<=P1)
states: 773,790,160 (8)
abstracting: (1<=P1)
states: 773,790,160 (8)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (P2<=Pout1)
states: 715,510,510 (8)
.
EG iterations: 1
abstracting: (10<=Pback3)
states: 5,398,536 (6)
abstracting: (Pback4<=Pm3)
states: 612,243,060 (8)
abstracting: (P2<=Pout1)
states: 715,510,510 (8)
.
EG iterations: 1
abstracting: (10<=Pback3)
states: 5,398,536 (6)
abstracting: (Pback4<=Pm3)
states: 612,243,060 (8)
............
EG iterations: 12
abstracting: (Pout2<=Pm1)
states: 535,886,494 (8)
abstracting: (1<=Pback3)
states: 807,081,132 (8)
abstracting: (Pout3<=Pm2)
states: 573,144,572 (8)
abstracting: (1<=Pback3)
states: 807,081,132 (8)
abstracting: (1<=Pback3)
states: 807,081,132 (8)
.
EG iterations: 1
abstracting: (Pback4<=Pout1)
states: 578,584,006 (8)
abstracting: (Pback2<=Pout3)
states: 573,144,572 (8)
abstracting: (P2<=Pout2)
states: 721,440,720 (8)
abstracting: (10<=Pm2)
states: 5,398,536 (6)
abstracting: (Pout4<=Pm1)
states: 578,584,006 (8)
abstracting: (Pm4<=Pm3)
states: 612,243,060 (8)
abstracting: (10<=Pout1)
states: 3,517,228 (6)
..................
EG iterations: 18
-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.677sec

checking: [[E [P1<=7 U [Pout2<=Pm1 | [[EF [Pback3<=Pback2] | [[9<=Pout4 | Pback3<=P2] & ~ [6<=Pm4]]] & AG [[Pback2<=4 & 9<=P2]]]]] & [AF [Pm1<=6] | [E [E [E [3<=Pm1 U 7<=Pm1] U A [P2<=8 U P4<=Pm3]] U [[Pout2<=Pm3 & [Pout3<=7 | P4<=1]] | ~ [AG [7<=Pout3]]]] & E [[~ [AX [Pback3<=0]] & Pm2<=10] U ~ [A [7<=Pback3 U Pout2<=2]]]]]] & AF [A [~ [A [AG [P1<=Pm3] U [1<=Pm2 | P2<=5]]] U [[[~ [P2<=3] | Pm4<=4] | ~ [[Pm4<=7 & 6<=Pout1]]] & ~ [[[4<=Pm2 & 7<=Pback2] | EF [6<=Pback3]]]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [[~ [[E [true U 6<=Pback3] | [4<=Pm2 & 7<=Pback2]]] & [~ [[Pm4<=7 & 6<=Pout1]] | [Pm4<=4 | ~ [P2<=3]]]]]]] & ~ [E [~ [[~ [[E [true U 6<=Pback3] | [4<=Pm2 & 7<=Pback2]]] & [~ [[Pm4<=7 & 6<=Pout1]] | [Pm4<=4 | ~ [P2<=3]]]]] U [[~ [EG [~ [[1<=Pm2 | P2<=5]]]] & ~ [E [~ [[1<=Pm2 | P2<=5]] U [E [true U ~ [P1<=Pm3]] & ~ [[1<=Pm2 | P2<=5]]]]]] & ~ [[~ [[E [true U 6<=Pback3] | [4<=Pm2 & 7<=Pback2]]] & [~ [[Pm4<=7 & 6<=Pout1]] | [Pm4<=4 | ~ [P2<=3]]]]]]]]]]]] & [[[E [[Pm2<=10 & EX [~ [Pback3<=0]]] U ~ [[~ [EG [~ [Pout2<=2]]] & ~ [E [~ [Pout2<=2] U [~ [7<=Pback3] & ~ [Pout2<=2]]]]]]] & E [E [E [3<=Pm1 U 7<=Pm1] U [~ [EG [~ [P4<=Pm3]]] & ~ [E [~ [P4<=Pm3] U [~ [P2<=8] & ~ [P4<=Pm3]]]]]] U [E [true U ~ [7<=Pout3]] | [Pout2<=Pm3 & [Pout3<=7 | P4<=1]]]]] | ~ [EG [~ [Pm1<=6]]]] & E [P1<=7 U [Pout2<=Pm1 | [~ [E [true U ~ [[Pback2<=4 & 9<=P2]]]] & [[~ [6<=Pm4] & [9<=Pout4 | Pback3<=P2]] | E [true U Pback3<=Pback2]]]]]]]

abstracting: (Pback3<=Pback2)
states: 573,144,572 (8)
abstracting: (Pback3<=P2)
states: 433,437,004 (8)
abstracting: (9<=Pout4)
states: 14,068,912 (7)
abstracting: (6<=Pm4)
states: 123,102,980 (8)
abstracting: (9<=P2)
states: 817,960 (5)
abstracting: (Pback2<=4)
states: 762,011,536 (8)
abstracting: (Pout2<=Pm1)
states: 535,886,494 (8)
abstracting: (P1<=7)
states: 970,754,928 (8)
abstracting: (Pm1<=6)
states: 935,582,648 (8)
.
EG iterations: 1
abstracting: (P4<=1)
states: 425,584,588 (8)
abstracting: (Pout3<=7)
states: 956,358,832 (8)
abstracting: (Pout2<=Pm3)
states: 573,144,572 (8)
abstracting: (7<=Pout3)
states: 94,965,156 (7)
abstracting: (P4<=Pm3)
states: 612,243,060 (8)
abstracting: (P2<=8)
states: 1,005,109,248 (9)
abstracting: (P4<=Pm3)
states: 612,243,060 (8)
abstracting: (P4<=Pm3)
states: 612,243,060 (8)
............
EG iterations: 12
abstracting: (7<=Pm1)
states: 70,344,560 (7)
abstracting: (3<=Pm1)
states: 422,067,360 (8)
abstracting: (Pout2<=2)
states: 526,439,056 (8)
abstracting: (7<=Pback3)
states: 94,965,156 (7)
abstracting: (Pout2<=2)
states: 526,439,056 (8)
abstracting: (Pout2<=2)
states: 526,439,056 (8)
.
EG iterations: 1
abstracting: (Pback3<=0)
states: 198,846,076 (8)
.abstracting: (Pm2<=10)
states: 1,005,927,208 (9)
abstracting: (P2<=3)
states: 875,380,792 (8)
abstracting: (Pm4<=4)
states: 808,962,440 (8)
abstracting: (6<=Pout1)
states: 123,102,980 (8)
abstracting: (Pm4<=7)
states: 970,754,928 (8)
abstracting: (7<=Pback2)
states: 94,965,156 (7)
abstracting: (4<=Pm2)
states: 350,414,064 (8)
abstracting: (6<=Pback3)
states: 159,175,016 (8)
abstracting: (P2<=5)
states: 975,580,892 (8)
abstracting: (1<=Pm2)
states: 807,081,132 (8)
abstracting: (P1<=Pm3)
states: 612,243,060 (8)
abstracting: (P2<=5)
states: 975,580,892 (8)
abstracting: (1<=Pm2)
states: 807,081,132 (8)
abstracting: (P2<=5)
states: 975,580,892 (8)
abstracting: (1<=Pm2)
states: 807,081,132 (8)
............
EG iterations: 12
abstracting: (P2<=3)
states: 875,380,792 (8)
abstracting: (Pm4<=4)
states: 808,962,440 (8)
abstracting: (6<=Pout1)
states: 123,102,980 (8)
abstracting: (Pm4<=7)
states: 970,754,928 (8)
abstracting: (7<=Pback2)
states: 94,965,156 (7)
abstracting: (4<=Pm2)
states: 350,414,064 (8)
abstracting: (6<=Pback3)
states: 159,175,016 (8)
abstracting: (P2<=3)
states: 875,380,792 (8)
abstracting: (Pm4<=4)
states: 808,962,440 (8)
abstracting: (6<=Pout1)
states: 123,102,980 (8)
abstracting: (Pm4<=7)
states: 970,754,928 (8)
abstracting: (7<=Pback2)
states: 94,965,156 (7)
abstracting: (4<=Pm2)
states: 350,414,064 (8)
abstracting: (6<=Pback3)
states: 159,175,016 (8)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

totally nodes used: 515097 (5.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2596608 1019652 3616260
used/not used/entry size/cache size: 1382547 65726317 16 1024MB
basic ops cache: hits/miss/sum: 1698700 676862 2375562
used/not used/entry size/cache size: 1180514 15596702 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: 41819 19389 61208
used/not used/entry size/cache size: 19374 8369234 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 66675871
1 409364
2 15789
3 3268
4 1488
5 604
6 434
7 461
8 269
9 202
>= 10 1114

Total processing time: 0m 7.864sec


BK_STOP 1678613787825

--------------------
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.002sec


iterations count:726 (45), effective:220 (13)

initing FirstDep: 0m 0.000sec


iterations count:527 (32), effective:138 (8)

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

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

iterations count:120 (7), effective:29 (1)

iterations count:275 (17), effective:77 (4)

iterations count:206 (12), effective:60 (3)

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

iterations count:88 (5), effective:20 (1)

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

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

iterations count:57 (3), effective:13 (0)

iterations count:183 (11), effective:56 (3)

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

iterations count:414 (25), effective:138 (8)

iterations count:592 (37), effective:161 (10)

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

iterations count:124 (7), effective:34 (2)

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

iterations count:43 (2), effective:9 (0)

iterations count:161 (10), effective:48 (3)

iterations count:280 (17), effective:73 (4)

iterations count:108 (6), effective:31 (1)

iterations count:38 (2), effective:6 (0)

iterations count:38 (2), effective:7 (0)

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

iterations count:215 (13), effective:74 (4)

iterations count:53 (3), effective:19 (1)

iterations count:215 (13), effective:66 (4)

iterations count:799 (49), effective:228 (14)

iterations count:35 (2), effective:6 (0)

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

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

iterations count:368 (23), effective:98 (6)

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

iterations count:231 (14), effective:76 (4)

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

iterations count:376 (23), effective:102 (6)

iterations count:404 (25), effective:123 (7)

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

iterations count:35 (2), effective:6 (0)

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

iterations count:214 (13), effective:54 (3)

iterations count:358 (22), effective:99 (6)

iterations count:206 (12), effective:60 (3)

iterations count:368 (23), effective:109 (6)

iterations count:284 (17), effective:79 (4)

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

iterations count:236 (14), effective:60 (3)

iterations count:236 (14), effective:60 (3)

iterations count:86 (5), effective:25 (1)

iterations count:236 (14), effective:60 (3)

iterations count:931 (58), effective:405 (25)

iterations count:203 (12), effective:62 (3)

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

iterations count:519 (32), effective:148 (9)

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

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

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

iterations count:203 (12), effective:62 (3)

iterations count:212 (13), effective:53 (3)

iterations count:787 (49), effective:217 (13)

iterations count:168 (10), effective:44 (2)

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

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

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

iterations count:82 (5), effective:18 (1)

iterations count:440 (27), effective:117 (7)

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

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

iterations count:440 (27), effective:117 (7)

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

iterations count:440 (27), effective:117 (7)

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="Kanban-PT-00010"
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 Kanban-PT-00010, 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 r225-tall-167856407300241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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