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-167838844800209.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 FMS-PT-00020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838844800209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.8K Feb 25 20:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 20:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 20:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:10 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:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 20:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 20:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 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 16K 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 FMS-PT-00020-CTLCardinality-00
FORMULA_NAME FMS-PT-00020-CTLCardinality-01
FORMULA_NAME FMS-PT-00020-CTLCardinality-02
FORMULA_NAME FMS-PT-00020-CTLCardinality-03
FORMULA_NAME FMS-PT-00020-CTLCardinality-04
FORMULA_NAME FMS-PT-00020-CTLCardinality-05
FORMULA_NAME FMS-PT-00020-CTLCardinality-06
FORMULA_NAME FMS-PT-00020-CTLCardinality-07
FORMULA_NAME FMS-PT-00020-CTLCardinality-08
FORMULA_NAME FMS-PT-00020-CTLCardinality-09
FORMULA_NAME FMS-PT-00020-CTLCardinality-10
FORMULA_NAME FMS-PT-00020-CTLCardinality-11
FORMULA_NAME FMS-PT-00020-CTLCardinality-12
FORMULA_NAME FMS-PT-00020-CTLCardinality-13
FORMULA_NAME FMS-PT-00020-CTLCardinality-14
FORMULA_NAME FMS-PT-00020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679420440662

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=FMS-PT-00020
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: FMS_PT_00020
(NrP: 22 NrTr: 20 NrArc: 50)

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

net check time: 0m 0.000sec

init dd package: 0m 2.806sec


RS generation: 0m 1.316sec


-> reachability set: #nodes 25410 (2.5e+04) #states 6,029,168,852,784 (12)



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

checking: EG [AX [EF [10<=P12s]]]
normalized: EG [~ [EX [~ [E [true U 10<=P12s]]]]]

abstracting: (10<=P12s)
states: 8,754,946,200 (9)
.
EG iterations: 0
-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.576sec

checking: EF [~ [AX [P1d<=M1]]]
normalized: E [true U EX [~ [P1d<=M1]]]

abstracting: (P1d<=M1)
states: 3,107,441,661,324 (12)
.-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.097sec

checking: AX [~ [EX [~ [E [P12wM3<=P2s U 11<=P1s]]]]]
normalized: ~ [EX [EX [~ [E [P12wM3<=P2s U 11<=P1s]]]]]

abstracting: (11<=P1s)
states: 100,162,725,432 (11)
abstracting: (P12wM3<=P2s)
states: 4,474,086,660,120 (12)
..-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.909sec

checking: E [~ [EG [[AX [P1wP2<=1] & EF [[P2<=8 & P2d<=P1wP2]]]]] U ~ [M1<=13]]
normalized: E [~ [EG [[E [true U [P2<=8 & P2d<=P1wP2]] & ~ [EX [~ [P1wP2<=1]]]]]] U ~ [M1<=13]]

abstracting: (M1<=13)
states: 6,029,168,852,784 (12)
abstracting: (P1wP2<=1)
states: 2,505,032,402,565 (12)
.abstracting: (P2d<=P1wP2)
states: 3,357,035,509,674 (12)
abstracting: (P2<=8)
states: 5,700,431,145,486 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.605sec

checking: [AX [AG [EG [[[16<=P1 | P2d<=P1s] & [5<=P2s & 2<=P12s]]]]] | AG [AX [P2M2<=9]]]
normalized: [~ [E [true U EX [~ [P2M2<=9]]]] | ~ [EX [E [true U ~ [EG [[[5<=P2s & 2<=P12s] & [16<=P1 | P2d<=P1s]]]]]]]]

abstracting: (P2d<=P1s)
states: 3,357,035,509,674 (12)
abstracting: (16<=P1)
states: 2,392,045,656 (9)
abstracting: (2<=P12s)
states: 2,139,295,219,446 (12)
abstracting: (5<=P2s)
states: 1,490,099,505,972 (12)
..................................................................
EG iterations: 66
.abstracting: (P2M2<=9)
states: 6,029,168,852,784 (12)
.-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.327sec

checking: ~ [AG [[P2wP1<=7 | EF [~ [[[12<=P2wM2 & P2s<=P1s] | E [15<=P1 U P12wM3<=P2wM2]]]]]]]
normalized: E [true U ~ [[P2wP1<=7 | E [true U ~ [[E [15<=P1 U P12wM3<=P2wM2] | [12<=P2wM2 & P2s<=P1s]]]]]]]

abstracting: (P2s<=P1s)
states: 3,357,035,509,674 (12)
abstracting: (12<=P2wM2)
states: 72,105,539,583 (10)
abstracting: (P12wM3<=P2wM2)
states: 4,474,086,660,120 (12)
abstracting: (15<=P1)
states: 6,141,748,998 (9)
abstracting: (P2wP1<=7)
states: 5,527,642,267,224 (12)
-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.088sec

checking: AF [~ [A [[P1s<=P1wP2 & ~ [[P12s<=P2wM2 & [11<=P1d & 19<=P2]]]] U AG [AX [P12s<=12]]]]]
normalized: ~ [EG [[~ [EG [E [true U EX [~ [P12s<=12]]]]] & ~ [E [E [true U EX [~ [P12s<=12]]] U [~ [[P1s<=P1wP2 & ~ [[P12s<=P2wM2 & [11<=P1d & 19<=P2]]]]] & E [true U EX [~ [P12s<=12]]]]]]]]]

abstracting: (P12s<=12)
states: 6,028,746,079,356 (12)
.abstracting: (19<=P2)
states: 70,382,466 (7)
abstracting: (11<=P1d)
states: 100,162,725,432 (11)
abstracting: (P12s<=P2wM2)
states: 4,474,086,660,120 (12)
abstracting: (P1s<=P1wP2)
states: 3,396,001,327,950 (12)
abstracting: (P12s<=12)
states: 6,028,746,079,356 (12)
.abstracting: (P12s<=12)
states: 6,028,746,079,356 (12)
.
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.339sec

checking: AF [EF [~ [[EX [[6<=P1d | 5<=P12]] | ~ [[[M3<=P1s & P2M2<=P1wP2] & A [P2M2<=9 U P2<=P2s]]]]]]]
normalized: ~ [EG [~ [E [true U ~ [[~ [[[~ [EG [~ [P2<=P2s]]] & ~ [E [~ [P2<=P2s] U [~ [P2M2<=9] & ~ [P2<=P2s]]]]] & [M3<=P1s & P2M2<=P1wP2]]] | EX [[6<=P1d | 5<=P12]]]]]]]]

abstracting: (5<=P12)
states: 367,739,422,512 (11)
abstracting: (6<=P1d)
states: 965,364,682,128 (11)
.abstracting: (P2M2<=P1wP2)
states: 5,423,142,995,424 (12)
abstracting: (M3<=P1s)
states: 4,361,585,458,923 (12)
abstracting: (P2<=P2s)
states: 3,377,140,895,205 (12)
abstracting: (P2M2<=9)
states: 6,029,168,852,784 (12)
abstracting: (P2<=P2s)
states: 3,377,140,895,205 (12)
abstracting: (P2<=P2s)
states: 3,377,140,895,205 (12)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.771sec

checking: E [AG [[~ [P1d<=20] | [~ [[[P3s<=4 & P2d<=2] & [P2wP1<=5 & M3<=11]]] | [~ [6<=P1s] | P1wP2<=P3s]]]] U 5<=P3M2]
normalized: E [~ [E [true U ~ [[[[P1wP2<=P3s | ~ [6<=P1s]] | ~ [[[P2wP1<=5 & M3<=11] & [P3s<=4 & P2d<=2]]]] | ~ [P1d<=20]]]]] U 5<=P3M2]

abstracting: (5<=P3M2)
states: 3,549,640,536,704 (12)
abstracting: (P1d<=20)
states: 6,029,168,852,784 (12)
abstracting: (P2d<=2)
states: 3,285,873,603,474 (12)
abstracting: (P3s<=4)
states: 2,479,528,316,080 (12)
abstracting: (M3<=11)
states: 6,029,168,852,784 (12)
abstracting: (P2wP1<=5)
states: 4,965,369,449,964 (12)
abstracting: (6<=P1s)
states: 965,364,682,128 (11)
abstracting: (P1wP2<=P3s)
states: 4,664,582,459,690 (12)
-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.512sec

checking: ~ [E [A [AF [AG [P2M2<=M3]] U EF [[E [P12<=7 U P1<=P2s] & P1wP2<=4]]] U EG [[[P2wP1<=P2s & ~ [AG [16<=M2]]] & A [~ [P1M1<=P1wM1] U ~ [M3<=2]]]]]]
normalized: ~ [E [[~ [EG [~ [E [true U [P1wP2<=4 & E [P12<=7 U P1<=P2s]]]]]] & ~ [E [~ [E [true U [P1wP2<=4 & E [P12<=7 U P1<=P2s]]]] U [EG [E [true U ~ [P2M2<=M3]]] & ~ [E [true U [P1wP2<=4 & E [P12<=7 U P1<=P2s]]]]]]]] U EG [[[~ [EG [M3<=2]] & ~ [E [M3<=2 U [P1M1<=P1wM1 & M3<=2]]]] & [P2wP1<=P2s & E [true U ~ [16<=M2]]]]]]]

abstracting: (16<=M2)
states: 0
abstracting: (P2wP1<=P2s)
states: 3,377,140,895,205 (12)
abstracting: (M3<=2)
states: 6,029,168,852,784 (12)
abstracting: (P1M1<=P1wM1)
states: 4,512,423,037,353 (12)
abstracting: (M3<=2)
states: 6,029,168,852,784 (12)
abstracting: (M3<=2)
states: 6,029,168,852,784 (12)

EG iterations: 0
.
EG iterations: 1
abstracting: (P1<=P2s)
states: 3,518,954,295,780 (12)
abstracting: (P12<=7)
states: 5,983,723,300,632 (12)
abstracting: (P1wP2<=4)
states: 4,650,080,924,412 (12)
abstracting: (P2M2<=M3)
states: 5,541,891,929,805 (12)

EG iterations: 0
abstracting: (P1<=P2s)
states: 3,518,954,295,780 (12)
abstracting: (P12<=7)
states: 5,983,723,300,632 (12)
abstracting: (P1wP2<=4)
states: 4,650,080,924,412 (12)
abstracting: (P1<=P2s)
states: 3,518,954,295,780 (12)
abstracting: (P12<=7)
states: 5,983,723,300,632 (12)
abstracting: (P1wP2<=4)
states: 4,650,080,924,412 (12)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.544sec

checking: A [[P12M3<=P12s | ~ [[[~ [A [P2M2<=P1s U P3<=P2]] | 15<=P1wP2] & P3<=P12wM3]]] U AG [[E [~ [EF [P3M2<=P1wP2]] U AX [14<=P2wM2]] | P1wM1<=P2]]]
normalized: [~ [EG [E [true U ~ [[P1wM1<=P2 | E [~ [E [true U P3M2<=P1wP2]] U ~ [EX [~ [14<=P2wM2]]]]]]]]] & ~ [E [E [true U ~ [[P1wM1<=P2 | E [~ [E [true U P3M2<=P1wP2]] U ~ [EX [~ [14<=P2wM2]]]]]]] U [~ [[P12M3<=P12s | ~ [[P3<=P12wM3 & [15<=P1wP2 | ~ [[~ [EG [~ [P3<=P2]]] & ~ [E [~ [P3<=P2] U [~ [P2M2<=P1s] & ~ [P3<=P2]]]]]]]]]]] & E [true U ~ [[P1wM1<=P2 | E [~ [E [true U P3M2<=P1wP2]] U ~ [EX [~ [14<=P2wM2]]]]]]]]]]]

abstracting: (14<=P2wM2)
states: 19,539,717,582 (10)
.abstracting: (P3M2<=P1wP2)
states: 1,839,892,059,620 (12)
abstracting: (P1wM1<=P2)
states: 3,518,954,295,780 (12)
abstracting: (P3<=P2)
states: 1,900,384,486,005 (12)
abstracting: (P2M2<=P1s)
states: 5,423,142,995,424 (12)
abstracting: (P3<=P2)
states: 1,900,384,486,005 (12)
abstracting: (P3<=P2)
states: 1,900,384,486,005 (12)
.
EG iterations: 1
abstracting: (15<=P1wP2)
states: 6,141,748,998 (9)
abstracting: (P3<=P12wM3)
states: 1,232,469,654,105 (12)
abstracting: (P12M3<=P12s)
states: 4,533,491,787,825 (12)
abstracting: (14<=P2wM2)
states: 19,539,717,582 (10)
.abstracting: (P3M2<=P1wP2)
states: 1,839,892,059,620 (12)
abstracting: (P1wM1<=P2)
states: 3,518,954,295,780 (12)
abstracting: (14<=P2wM2)
states: 19,539,717,582 (10)
.abstracting: (P3M2<=P1wP2)
states: 1,839,892,059,620 (12)
abstracting: (P1wM1<=P2)
states: 3,518,954,295,780 (12)

EG iterations: 0
-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.205sec

checking: [A [AG [AF [[[P1s<=16 & 4<=P2wP1] | AX [M3<=0]]]] U AG [AG [[[P3M2<=P1M1 | P2M2<=2] | E [3<=P3s U P2wP1<=P12wM3]]]]] & [~ [AX [~ [[[[P2d<=13 | P2wP1<=9] & EF [P1M1<=19]] & ~ [[16<=P2d & 20<=P1s]]]]]] & AG [P1M1<=14]]]
normalized: [[~ [E [true U ~ [P1M1<=14]]] & EX [[~ [[16<=P2d & 20<=P1s]] & [E [true U P1M1<=19] & [P2d<=13 | P2wP1<=9]]]]] & [~ [EG [E [true U E [true U ~ [[E [3<=P3s U P2wP1<=P12wM3] | [P3M2<=P1M1 | P2M2<=2]]]]]]] & ~ [E [E [true U E [true U ~ [[E [3<=P3s U P2wP1<=P12wM3] | [P3M2<=P1M1 | P2M2<=2]]]]] U [E [true U EG [~ [[~ [EX [~ [M3<=0]]] | [P1s<=16 & 4<=P2wP1]]]]] & E [true U E [true U ~ [[E [3<=P3s U P2wP1<=P12wM3] | [P3M2<=P1M1 | P2M2<=2]]]]]]]]]]

abstracting: (P2M2<=2)
states: 6,029,168,852,784 (12)
abstracting: (P3M2<=P1M1)
states: 1,148,705,521,774 (12)
abstracting: (P2wP1<=P12wM3)
states: 2,555,867,709,549 (12)
abstracting: (3<=P3s)
states: 4,463,150,968,944 (12)
abstracting: (4<=P2wP1)
states: 2,041,762,584,939 (12)
abstracting: (P1s<=16)
states: 6,028,371,213,018 (12)
abstracting: (M3<=0)
states: 1,117,007,022,054 (12)
..
EG iterations: 1
abstracting: (P2M2<=2)
states: 6,029,168,852,784 (12)
abstracting: (P3M2<=P1M1)
states: 1,148,705,521,774 (12)
abstracting: (P2wP1<=P12wM3)
states: 2,555,867,709,549 (12)
abstracting: (3<=P3s)
states: 4,463,150,968,944 (12)
abstracting: (P2M2<=2)
states: 6,029,168,852,784 (12)
abstracting: (P3M2<=P1M1)
states: 1,148,705,521,774 (12)
abstracting: (P2wP1<=P12wM3)
states: 2,555,867,709,549 (12)
abstracting: (3<=P3s)
states: 4,463,150,968,944 (12)
.
EG iterations: 1
abstracting: (P2wP1<=9)
states: 5,821,574,405,724 (12)
abstracting: (P2d<=13)
states: 6,009,629,135,202 (12)
abstracting: (P1M1<=19)
states: 6,029,168,852,784 (12)
abstracting: (20<=P1s)
states: 4,500,111 (6)
abstracting: (16<=P2d)
states: 3,629,130,120 (9)
.abstracting: (P1M1<=14)
states: 6,029,168,852,784 (12)
-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.499sec

checking: [~ [AX [[[P1d<=P12s & EX [[15<=M1 & P2d<=M3]]] | EX [P12s<=P1]]]] | ~ [[EF [~ [[~ [P3M2<=1] | AX [P2d<=20]]]] | [AF [[[M2<=P12s & [P1d<=17 & P12M3<=1]] | EX [P12wM3<=17]]] & AF [EF [E [2<=P1s U 20<=P12M3]]]]]]]
normalized: [~ [[[~ [EG [~ [E [true U E [2<=P1s U 20<=P12M3]]]]] & ~ [EG [~ [[EX [P12wM3<=17] | [M2<=P12s & [P1d<=17 & P12M3<=1]]]]]]] | E [true U ~ [[~ [EX [~ [P2d<=20]]] | ~ [P3M2<=1]]]]]] | EX [~ [[EX [P12s<=P1] | [P1d<=P12s & EX [[15<=M1 & P2d<=M3]]]]]]]

abstracting: (P2d<=M3)
states: 2,635,844,230,173 (12)
abstracting: (15<=M1)
states: 0
.abstracting: (P1d<=P12s)
states: 2,639,844,392,724 (12)
abstracting: (P12s<=P1)
states: 4,421,411,310,855 (12)
..abstracting: (P3M2<=1)
states: 1,070,112,220,624 (12)
abstracting: (P2d<=20)
states: 6,029,168,852,784 (12)
.abstracting: (P12M3<=1)
states: 4,912,161,830,730 (12)
abstracting: (P1d<=17)
states: 6,028,953,980,973 (12)
abstracting: (M2<=P12s)
states: 4,698,030,057,798 (12)
abstracting: (P12wM3<=17)
states: 6,029,168,720,190 (12)
..
EG iterations: 1
abstracting: (20<=P12M3)
states: 0
abstracting: (2<=P1s)
states: 3,524,136,450,219 (12)

EG iterations: 0
-> the formula is TRUE

FORMULA FMS-PT-00020-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.134sec

checking: EF [[EF [[[[[14<=P3M2 & 13<=P2s] | AX [P1wM1<=5]] | EG [P3<=M2]] & E [P1M1<=P3M2 U AG [P3M2<=11]]]] | [~ [[AF [A [12<=M3 U P3s<=4]] & [AG [P1d<=P1wP2] | [EX [P1wM1<=P2M2] | [10<=P1wM1 & P12M3<=20]]]]] & [AG [~ [18<=P1wP2]] & EX [3<=P12wM3]]]]]
normalized: E [true U [[[EX [3<=P12wM3] & ~ [E [true U 18<=P1wP2]]] & ~ [[[[[10<=P1wM1 & P12M3<=20] | EX [P1wM1<=P2M2]] | ~ [E [true U ~ [P1d<=P1wP2]]]] & ~ [EG [~ [[~ [EG [~ [P3s<=4]]] & ~ [E [~ [P3s<=4] U [~ [12<=M3] & ~ [P3s<=4]]]]]]]]]]] | E [true U [E [P1M1<=P3M2 U ~ [E [true U ~ [P3M2<=11]]]] & [EG [P3<=M2] | [~ [EX [~ [P1wM1<=5]]] | [14<=P3M2 & 13<=P2s]]]]]]]

abstracting: (13<=P2s)
states: 38,960,194,350 (10)
abstracting: (14<=P3M2)
states: 730,808,345,792 (11)
abstracting: (P1wM1<=5)
states: 5,063,804,170,656 (12)
.abstracting: (P3<=M2)
states: 840,499,410,444 (11)
.
EG iterations: 1
abstracting: (P3M2<=11)
states: 4,854,655,439,904 (12)
abstracting: (P1M1<=P3M2)
states: 5,397,628,708,380 (12)
abstracting: (P3s<=4)
states: 2,479,528,316,080 (12)
abstracting: (12<=M3)
states: 0
abstracting: (P3s<=4)
states: 2,479,528,316,080 (12)
abstracting: (P3s<=4)
states: 2,479,528,316,080 (12)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (P1d<=P1wP2)
states: 3,396,001,327,950 (12)
abstracting: (P1wM1<=P2M2)
states: 1,875,651,407,784 (12)
.abstracting: (P12M3<=20)
states: 6,029,168,852,784 (12)
abstracting: (10<=P1wM1)
states: 170,774,023,035 (11)
abstracting: (18<=P1wP2)
states: 214,871,811 (8)
abstracting: (3<=P12wM3)
states: 1,226,112,110,916 (12)
.-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.008sec

checking: [A [E [[E [EG [P12s<=0] U [M2<=P2wP1 | 17<=P2wP1]] | P1M1<=P1M1] U P12M3<=P1d] U E [EG [[[P12<=P2d | 1<=P1M1] & P1d<=P1wM1]] U [AX [~ [13<=P2wP1]] | [AX [P2s<=18] & AF [P1wP2<=14]]]]] & [[~ [EF [[E [P2<=9 U 5<=P2s] & [20<=P3M2 | EX [20<=P2s]]]]] & A [~ [P2d<=M2] U [~ [[[12<=P1wP2 & P2<=3] | ~ [9<=P1d]]] | ~ [2<=P12wM3]]]] & ~ [A [~ [AG [~ [P3M2<=P2d]]] U ~ [A [[P2d<=15 & M1<=20] U ~ [M2<=P1d]]]]]]]
normalized: [[~ [[~ [EG [[~ [EG [M2<=P1d]] & ~ [E [M2<=P1d U [M2<=P1d & ~ [[P2d<=15 & M1<=20]]]]]]]] & ~ [E [[~ [EG [M2<=P1d]] & ~ [E [M2<=P1d U [M2<=P1d & ~ [[P2d<=15 & M1<=20]]]]]] U [~ [E [true U P3M2<=P2d]] & [~ [EG [M2<=P1d]] & ~ [E [M2<=P1d U [M2<=P1d & ~ [[P2d<=15 & M1<=20]]]]]]]]]]] & [[~ [EG [~ [[~ [2<=P12wM3] | ~ [[~ [9<=P1d] | [12<=P1wP2 & P2<=3]]]]]]] & ~ [E [~ [[~ [2<=P12wM3] | ~ [[~ [9<=P1d] | [12<=P1wP2 & P2<=3]]]]] U [P2d<=M2 & ~ [[~ [2<=P12wM3] | ~ [[~ [9<=P1d] | [12<=P1wP2 & P2<=3]]]]]]]]] & ~ [E [true U [[20<=P3M2 | EX [20<=P2s]] & E [P2<=9 U 5<=P2s]]]]]] & [~ [EG [~ [E [EG [[P1d<=P1wM1 & [P12<=P2d | 1<=P1M1]]] U [[~ [EG [~ [P1wP2<=14]]] & ~ [EX [~ [P2s<=18]]]] | ~ [EX [13<=P2wP1]]]]]]] & ~ [E [~ [E [EG [[P1d<=P1wM1 & [P12<=P2d | 1<=P1M1]]] U [[~ [EG [~ [P1wP2<=14]]] & ~ [EX [~ [P2s<=18]]]] | ~ [EX [13<=P2wP1]]]]] U [~ [E [[P1M1<=P1M1 | E [EG [P12s<=0] U [M2<=P2wP1 | 17<=P2wP1]]] U P12M3<=P1d]] & ~ [E [EG [[P1d<=P1wM1 & [P12<=P2d | 1<=P1M1]]] U [[~ [EG [~ [P1wP2<=14]]] & ~ [EX [~ [P2s<=18]]]] | ~ [EX [13<=P2wP1]]]]]]]]]]

abstracting: (13<=P2wP1)
states: 38,960,194,350 (10)
.abstracting: (P2s<=18)
states: 6,029,098,470,318 (12)
.abstracting: (P1wP2<=14)
states: 6,023,027,103,786 (12)
.
EG iterations: 1
abstracting: (1<=P1M1)
states: 3,914,577,133,929 (12)
abstracting: (P12<=P2d)
states: 4,474,086,660,120 (12)
abstracting: (P1d<=P1wM1)
states: 3,396,001,327,950 (12)
.
EG iterations: 1
abstracting: (P12M3<=P1d)
states: 5,108,245,755,690 (12)
abstracting: (17<=P2wP1)
states: 1,260,766,584 (9)
abstracting: (M2<=P2wP1)
states: 5,304,055,915,158 (12)
abstracting: (P12s<=0)
states: 2,394,196,568,379 (12)
.
EG iterations: 1
abstracting: (P1M1<=P1M1)
states: 6,029,168,852,784 (12)
abstracting: (13<=P2wP1)
states: 38,960,194,350 (10)
.abstracting: (P2s<=18)
states: 6,029,098,470,318 (12)
.abstracting: (P1wP2<=14)
states: 6,023,027,103,786 (12)
.
EG iterations: 1
abstracting: (1<=P1M1)
states: 3,914,577,133,929 (12)
abstracting: (P12<=P2d)
states: 4,474,086,660,120 (12)
abstracting: (P1d<=P1wM1)
states: 3,396,001,327,950 (12)
.
EG iterations: 1
abstracting: (13<=P2wP1)
states: 38,960,194,350 (10)
.abstracting: (P2s<=18)
states: 6,029,098,470,318 (12)
.abstracting: (P1wP2<=14)
states: 6,023,027,103,786 (12)
.
EG iterations: 1
abstracting: (1<=P1M1)
states: 3,914,577,133,929 (12)
abstracting: (P12<=P2d)
states: 4,474,086,660,120 (12)
abstracting: (P1d<=P1wM1)
states: 3,396,001,327,950 (12)
.
EG iterations: 1
.................................................................
EG iterations: 65
abstracting: (5<=P2s)
states: 1,490,099,505,972 (12)
abstracting: (P2<=9)
states: 5,821,574,405,724 (12)
abstracting: (20<=P2s)
states: 7,572,411 (6)
.abstracting: (20<=P3M2)
states: 26,100,298,064 (10)
abstracting: (P2<=3)
states: 3,987,406,267,845 (12)
abstracting: (12<=P1wP2)
states: 55,660,807,587 (10)
abstracting: (9<=P1d)
states: 278,070,352,560 (11)
abstracting: (2<=P12wM3)
states: 2,139,295,219,446 (12)
abstracting: (P2d<=M2)
states: 1,920,576,892,542 (12)
abstracting: (P2<=3)
states: 3,987,406,267,845 (12)
abstracting: (12<=P1wP2)
states: 55,660,807,587 (10)
abstracting: (9<=P1d)
states: 278,070,352,560 (11)
abstracting: (2<=P12wM3)
states: 2,139,295,219,446 (12)
abstracting: (P2<=3)
states: 3,987,406,267,845 (12)
abstracting: (12<=P1wP2)
states: 55,660,807,587 (10)
abstracting: (9<=P1d)
states: 278,070,352,560 (11)
abstracting: (2<=P12wM3)
states: 2,139,295,219,446 (12)
.
EG iterations: 1
abstracting: (M1<=20)
states: 6,029,168,852,784 (12)
abstracting: (P2d<=15)
states: 6,025,539,722,664 (12)
abstracting: (M2<=P1d)
states: 5,251,034,789,154 (12)
abstracting: (M2<=P1d)
states: 5,251,034,789,154 (12)
abstracting: (M2<=P1d)
states: 5,251,034,789,154 (12)
................................................................................
EG iterations: 80
abstracting: (P3M2<=P2d)
states: 1,900,384,486,005 (12)
abstracting: (M1<=20)
states: 6,029,168,852,784 (12)
abstracting: (P2d<=15)
states: 6,025,539,722,664 (12)
abstracting: (M2<=P1d)
states: 5,251,034,789,154 (12)
abstracting: (M2<=P1d)
states: 5,251,034,789,154 (12)
abstracting: (M2<=P1d)
states: 5,251,034,789,154 (12)
................................................................................
EG iterations: 80
abstracting: (M1<=20)
states: 6,029,168,852,784 (12)
abstracting: (P2d<=15)
states: 6,025,539,722,664 (12)
abstracting: (M2<=P1d)
states: 5,251,034,789,154 (12)
abstracting: (M2<=P1d)
states: 5,251,034,789,154 (12)
abstracting: (M2<=P1d)
states: 5,251,034,789,154 (12)
................................................................................
EG iterations: 80
.
EG iterations: 1
-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.450sec

checking: [A [AX [EG [M1<=P1d]] U [AG [P12<=13] | [AF [~ [AX [P2d<=P2wM2]]] & [~ [[AF [P2M2<=P12M3] | [P2wM2<=16 | P1<=P1d]]] | P2s<=5]]]] & [[EG [EF [[A [P1s<=P2 U P3s<=19] | E [P1<=P1wP2 U 13<=P2d]]]] | EX [A [[AX [P12wM3<=P12M3] | AG [7<=P1M1]] U ~ [[P2d<=P3s | P2s<=P12M3]]]]] | EF [[[[[[15<=P1wM1 & P2M2<=P1d] | [P2wP1<=13 | P2d<=6]] & [M2<=3 | 18<=P12M3]] & [EF [M3<=3] | P2d<=1]] | ~ [EX [~ [P2s<=19]]]]]]]
normalized: [[E [true U [~ [EX [~ [P2s<=19]]] | [[P2d<=1 | E [true U M3<=3]] & [[M2<=3 | 18<=P12M3] & [[P2wP1<=13 | P2d<=6] | [15<=P1wM1 & P2M2<=P1d]]]]]] | [EX [[~ [EG [[P2d<=P3s | P2s<=P12M3]]] & ~ [E [[P2d<=P3s | P2s<=P12M3] U [~ [[~ [E [true U ~ [7<=P1M1]]] | ~ [EX [~ [P12wM3<=P12M3]]]]] & [P2d<=P3s | P2s<=P12M3]]]]]] | EG [E [true U [E [P1<=P1wP2 U 13<=P2d] | [~ [EG [~ [P3s<=19]]] & ~ [E [~ [P3s<=19] U [~ [P1s<=P2] & ~ [P3s<=19]]]]]]]]]] & [~ [EG [~ [[[[P2s<=5 | ~ [[[P2wM2<=16 | P1<=P1d] | ~ [EG [~ [P2M2<=P12M3]]]]]] & ~ [EG [~ [EX [~ [P2d<=P2wM2]]]]]] | ~ [E [true U ~ [P12<=13]]]]]]] & ~ [E [~ [[[[P2s<=5 | ~ [[[P2wM2<=16 | P1<=P1d] | ~ [EG [~ [P2M2<=P12M3]]]]]] & ~ [EG [~ [EX [~ [P2d<=P2wM2]]]]]] | ~ [E [true U ~ [P12<=13]]]]] U [EX [~ [EG [M1<=P1d]]] & ~ [[[[P2s<=5 | ~ [[[P2wM2<=16 | P1<=P1d] | ~ [EG [~ [P2M2<=P12M3]]]]]] & ~ [EG [~ [EX [~ [P2d<=P2wM2]]]]]] | ~ [E [true U ~ [P12<=13]]]]]]]]]]

abstracting: (P12<=13)
states: 6,029,044,059,654 (12)
abstracting: (P2d<=P2wM2)
states: 3,377,140,895,205 (12)
..
EG iterations: 1
abstracting: (P2M2<=P12M3)
states: 4,683,696,099,159 (12)
...................................................................................................
EG iterations: 99
abstracting: (P1<=P1d)
states: 3,396,001,327,950 (12)
abstracting: (P2wM2<=16)
states: 6,027,908,086,200 (12)
abstracting: (P2s<=5)
states: 4,965,369,449,964 (12)
abstracting: (M1<=P1d)
states: 3,902,713,985,940 (12)
.
EG iterations: 1
.abstracting: (P12<=13)
states: 6,029,044,059,654 (12)
abstracting: (P2d<=P2wM2)
states: 3,377,140,895,205 (12)
..
EG iterations: 1
abstracting: (P2M2<=P12M3)
states: 4,683,696,099,159 (12)
...................................................................................................
EG iterations: 99
abstracting: (P1<=P1d)
states: 3,396,001,327,950 (12)
abstracting: (P2wM2<=16)
states: 6,027,908,086,200 (12)
abstracting: (P2s<=5)
states: 4,965,369,449,964 (12)
abstracting: (P12<=13)
states: 6,029,044,059,654 (12)
abstracting: (P2d<=P2wM2)
states: 3,377,140,895,205 (12)
..
EG iterations: 1
abstracting: (P2M2<=P12M3)
states: 4,683,696,099,159 (12)
...................................................................................................
EG iterations: 99
abstracting: (P1<=P1d)
states: 3,396,001,327,950 (12)
abstracting: (P2wM2<=16)
states: 6,027,908,086,200 (12)
abstracting: (P2s<=5)
states: 4,965,369,449,964 (12)
.
EG iterations: 1
abstracting: (P3s<=19)
states: 6,003,068,554,720 (12)
abstracting: (P1s<=P2)
states: 3,518,954,295,780 (12)
abstracting: (P3s<=19)
states: 6,003,068,554,720 (12)
abstracting: (P3s<=19)
states: 6,003,068,554,720 (12)
.
EG iterations: 1
abstracting: (13<=P2d)
states: 38,960,194,350 (10)
abstracting: (P1<=P1wP2)
states: 3,396,001,327,950 (12)

EG iterations: 0
abstracting: (P2s<=P12M3)
states: 2,038,113,507,969 (12)
abstracting: (P2d<=P3s)
states: 4,600,197,985,012 (12)
abstracting: (P12wM3<=P12M3)
states: 3,307,379,676,909 (12)
.abstracting: (7<=P1M1)
states: 0
abstracting: (P2s<=P12M3)
states: 2,038,113,507,969 (12)
abstracting: (P2d<=P3s)
states: 4,600,197,985,012 (12)
abstracting: (P2s<=P12M3)
states: 2,038,113,507,969 (12)
abstracting: (P2d<=P3s)
states: 4,600,197,985,012 (12)
.
EG iterations: 1
.abstracting: (P2M2<=P1d)
states: 5,423,142,995,424 (12)
abstracting: (15<=P1wM1)
states: 6,141,748,998 (9)
abstracting: (P2d<=6)
states: 5,288,356,654,812 (12)
abstracting: (P2wP1<=13)
states: 6,009,629,135,202 (12)
abstracting: (18<=P12M3)
states: 0
abstracting: (M2<=3)
states: 6,029,168,852,784 (12)
abstracting: (M3<=3)
states: 6,029,168,852,784 (12)
abstracting: (P2d<=1)
states: 2,407,499,768,058 (12)
abstracting: (P2s<=19)
states: 6,029,161,280,373 (12)
.-> the formula is FALSE

FORMULA FMS-PT-00020-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.322sec

totally nodes used: 28972666 (2.9e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 386511973 84713238 471225211
used/not used/entry size/cache size: 53765698 13343166 16 1024MB
basic ops cache: hits/miss/sum: 147313163 33145327 180458490
used/not used/entry size/cache size: 15610418 1166798 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: 10232181 2150222 12382403
used/not used/entry size/cache size: 1894264 6494344 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 44298377
1 18300069
2 3822732
3 550794
4 76376
5 16867
6 6522
7 4136
8 2752
9 2187
>= 10 28052

Total processing time: 1m37.549sec


BK_STOP 1679420538294

--------------------
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:1560 (78), effective:340 (17)

initing FirstDep: 0m 0.000sec


iterations count:730 (36), effective:140 (7)

iterations count:245 (12), effective:55 (2)

iterations count:955 (47), effective:235 (11)

iterations count:108 (5), effective:32 (1)

iterations count:143 (7), effective:35 (1)

iterations count:111 (5), effective:26 (1)

iterations count:208 (10), effective:55 (2)

iterations count:933 (46), effective:181 (9)

iterations count:933 (46), effective:181 (9)

iterations count:608 (30), effective:156 (7)

iterations count:933 (46), effective:181 (9)

iterations count:259 (12), effective:87 (4)

iterations count:946 (47), effective:220 (11)

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

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

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

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

iterations count:549 (27), effective:123 (6)

iterations count:209 (10), effective:42 (2)

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

iterations count:549 (27), effective:123 (6)

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

iterations count:549 (27), effective:123 (6)

iterations count:140 (7), effective:40 (2)

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

iterations count:347 (17), effective:105 (5)

iterations count:166 (8), effective:36 (1)

iterations count:140 (7), effective:40 (2)

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

iterations count:347 (17), effective:105 (5)

iterations count:787 (39), effective:173 (8)

iterations count:140 (7), effective:40 (2)

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

iterations count:347 (17), effective:105 (5)

iterations count:370 (18), effective:70 (3)

iterations count:496 (24), effective:149 (7)

iterations count:370 (18), effective:70 (3)

iterations count:370 (18), effective:70 (3)

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

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

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

iterations count:638 (31), effective:156 (7)

iterations count:848 (42), effective:162 (8)

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

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

iterations count:58 (2), effective:11 (0)

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

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

iterations count:330 (16), effective:70 (3)

iterations count:462 (23), effective:150 (7)

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

iterations count:1052 (52), effective:233 (11)

iterations count:437 (21), effective:139 (6)

iterations count:1052 (52), effective:233 (11)

iterations count:1052 (52), effective:233 (11)

iterations count:1028 (51), effective:196 (9)

iterations count:1028 (51), effective:196 (9)

iterations count:39 (1), effective:18 (0)

iterations count:1028 (51), effective:196 (9)

iterations count:305 (15), effective:110 (5)

iterations count:1173 (58), effective:237 (11)

iterations count:89 (4), effective:23 (1)

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

iterations count:142 (7), effective:35 (1)

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

iterations count:20 (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="FMS-PT-00020"
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 FMS-PT-00020, 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-167838844800209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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