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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.3K Feb 25 20:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 20:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 20:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 20:18 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.4K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 20:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 20:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 20:20 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 17K 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-00010-CTLCardinality-00
FORMULA_NAME FMS-PT-00010-CTLCardinality-01
FORMULA_NAME FMS-PT-00010-CTLCardinality-02
FORMULA_NAME FMS-PT-00010-CTLCardinality-03
FORMULA_NAME FMS-PT-00010-CTLCardinality-04
FORMULA_NAME FMS-PT-00010-CTLCardinality-05
FORMULA_NAME FMS-PT-00010-CTLCardinality-06
FORMULA_NAME FMS-PT-00010-CTLCardinality-07
FORMULA_NAME FMS-PT-00010-CTLCardinality-08
FORMULA_NAME FMS-PT-00010-CTLCardinality-09
FORMULA_NAME FMS-PT-00010-CTLCardinality-10
FORMULA_NAME FMS-PT-00010-CTLCardinality-11
FORMULA_NAME FMS-PT-00010-CTLCardinality-12
FORMULA_NAME FMS-PT-00010-CTLCardinality-13
FORMULA_NAME FMS-PT-00010-CTLCardinality-14
FORMULA_NAME FMS-PT-00010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679420403670

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-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: FMS_PT_00010
(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.824sec


RS generation: 0m 0.092sec


-> reachability set: #nodes 4565 (4.6e+03) #states 2,501,413,200 (9)



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

checking: AG [EF [AF [~ [AG [P1d<=0]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EG [~ [E [true U ~ [P1d<=0]]]]]]]]]

abstracting: (P1d<=0)
states: 957,824,868 (8)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.103sec

checking: EF [P1wP2<=8]
normalized: E [true U P1wP2<=8]

abstracting: (P1wP2<=8)
states: 2,500,414,224 (9)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: ~ [EF [~ [EF [~ [[P3<=0 & P12s<=2]]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [[P3<=0 & P12s<=2]]]]]]

abstracting: (P12s<=2)
states: 2,380,620,792 (9)
abstracting: (P3<=0)
states: 416,902,200 (8)
-> the formula is TRUE

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

MC time: 0m 0.022sec

checking: EG [[P12<=M2 & AX [AX [EF [4<=P1wP2]]]]]
normalized: EG [[P12<=M2 & ~ [EX [EX [~ [E [true U 4<=P1wP2]]]]]]]

abstracting: (4<=P1wP2)
states: 252,962,028 (8)
..abstracting: (P12<=M2)
states: 1,891,309,134 (9)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.034sec

checking: AF [AG [EF [E [[P3M2<=P12 & 4<=P1wM1] U EF [3<=P2s]]]]]
normalized: ~ [EG [E [true U ~ [E [true U E [[P3M2<=P12 & 4<=P1wM1] U E [true U 3<=P2s]]]]]]]

abstracting: (3<=P2s)
states: 556,422,900 (8)
abstracting: (4<=P1wM1)
states: 252,962,028 (8)
abstracting: (P3M2<=P12)
states: 636,479,958 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.104sec

checking: E [[P3<=8 | P1wP2<=0] U AF [~ [EF [AX [P3<=P12]]]]]
normalized: E [[P3<=8 | P1wP2<=0] U ~ [EG [E [true U ~ [EX [~ [P3<=P12]]]]]]]

abstracting: (P3<=P12)
states: 636,479,958 (8)
.
EG iterations: 0
abstracting: (P1wP2<=0)
states: 957,824,868 (8)
abstracting: (P3<=8)
states: 2,387,712,600 (9)
-> the formula is FALSE

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

MC time: 0m 0.108sec

checking: EF [[E [AG [AX [P1wM1<=4]] U [P3M2<=P3M2 & AG [4<=P12]]] | AG [AF [AG [P3M2<=8]]]]]
normalized: E [true U [~ [E [true U EG [E [true U ~ [P3M2<=8]]]]] | E [~ [E [true U EX [~ [P1wM1<=4]]]] U [P3M2<=P3M2 & ~ [E [true U ~ [4<=P12]]]]]]]

abstracting: (4<=P12)
states: 35,655,180 (7)
abstracting: (P3M2<=P3M2)
states: 2,501,413,200 (9)
abstracting: (P1wM1<=4)
states: 2,384,190,072 (9)
.abstracting: (P3M2<=8)
states: 2,387,712,600 (9)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.116sec

checking: EG [EG [[EX [AF [P2wP1<=P2M2]] | [E [~ [M1<=P2d] U [P3M2<=3 | 2<=P2M2]] & AF [~ [P3M2<=6]]]]]]
normalized: EG [EG [[[~ [EG [P3M2<=6]] & E [~ [M1<=P2d] U [P3M2<=3 | 2<=P2M2]]] | EX [~ [EG [~ [P2wP1<=P2M2]]]]]]]

abstracting: (P2wP1<=P2M2)
states: 1,156,904,958 (9)
.
EG iterations: 1
.abstracting: (2<=P2M2)
states: 0
abstracting: (P3M2<=3)
states: 1,440,207,600 (9)
abstracting: (M1<=P2d)
states: 1,051,462,698 (9)
abstracting: (P3M2<=6)
states: 2,122,411,200 (9)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA FMS-PT-00010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.238sec

checking: [A [AF [E [EG [P1wP2<=10] U EG [P1<=P3s]]] U E [EG [E [P12<=6 U 4<=P12wM3]] U ~ [M2<=5]]] & EF [P2d<=P2d]]
normalized: [E [true U P2d<=P2d] & [~ [EG [~ [E [EG [E [P12<=6 U 4<=P12wM3]] U ~ [M2<=5]]]]] & ~ [E [~ [E [EG [E [P12<=6 U 4<=P12wM3]] U ~ [M2<=5]]] U [EG [~ [E [EG [P1wP2<=10] U EG [P1<=P3s]]]] & ~ [E [EG [E [P12<=6 U 4<=P12wM3]] U ~ [M2<=5]]]]]]]]

abstracting: (M2<=5)
states: 2,501,413,200 (9)
abstracting: (4<=P12wM3)
states: 35,655,180 (7)
abstracting: (P12<=6)
states: 2,501,092,506 (9)
.
EG iterations: 1
abstracting: (P1<=P3s)
states: 1,990,375,656 (9)
.
EG iterations: 1
abstracting: (P1wP2<=10)
states: 2,501,413,200 (9)

EG iterations: 0
.
EG iterations: 1
abstracting: (M2<=5)
states: 2,501,413,200 (9)
abstracting: (4<=P12wM3)
states: 35,655,180 (7)
abstracting: (P12<=6)
states: 2,501,092,506 (9)
.
EG iterations: 1
abstracting: (M2<=5)
states: 2,501,413,200 (9)
abstracting: (4<=P12wM3)
states: 35,655,180 (7)
abstracting: (P12<=6)
states: 2,501,092,506 (9)
.
EG iterations: 1

EG iterations: 0
abstracting: (P2d<=P2d)
states: 2,501,413,200 (9)
-> the formula is FALSE

FORMULA FMS-PT-00010-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.183sec

checking: AG [[EG [[[[EG [P2d<=7] & ~ [P12M3<=8]] & EF [M1<=P12]] | ~ [[~ [P2d<=P3s] & A [P12s<=P2 U 8<=P2wM2]]]]] & M2<=5]]
normalized: ~ [E [true U ~ [[M2<=5 & EG [[~ [[[~ [EG [~ [8<=P2wM2]]] & ~ [E [~ [8<=P2wM2] U [~ [P12s<=P2] & ~ [8<=P2wM2]]]]] & ~ [P2d<=P3s]]] | [E [true U M1<=P12] & [~ [P12M3<=8] & EG [P2d<=7]]]]]]]]]

abstracting: (P2d<=7)
states: 2,494,520,820 (9)
.
EG iterations: 1
abstracting: (P12M3<=8)
states: 2,501,413,200 (9)
abstracting: (M1<=P12)
states: 586,261,500 (8)
abstracting: (P2d<=P3s)
states: 1,953,113,808 (9)
abstracting: (8<=P2wM2)
states: 6,892,380 (6)
abstracting: (P12s<=P2)
states: 1,999,708,128 (9)
abstracting: (8<=P2wM2)
states: 6,892,380 (6)
abstracting: (8<=P2wM2)
states: 6,892,380 (6)
.
EG iterations: 1
..............
EG iterations: 14
abstracting: (M2<=5)
states: 2,501,413,200 (9)
-> the formula is FALSE

FORMULA FMS-PT-00010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.368sec

checking: EX [[EG [E [~ [P1d<=P2s] U P2<=P12]] | [AF [[E [P1wP2<=M2 U M3<=P1s] & ~ [5<=P12M3]]] & AF [[AG [5<=P2wM2] & EX [1<=P12s]]]]]]
normalized: EX [[[~ [EG [~ [[~ [E [true U ~ [5<=P2wM2]]] & EX [1<=P12s]]]]] & ~ [EG [~ [[~ [5<=P12M3] & E [P1wP2<=M2 U M3<=P1s]]]]]] | EG [E [~ [P1d<=P2s] U P2<=P12]]]]

abstracting: (P2<=P12)
states: 1,229,682,234 (9)
abstracting: (P1d<=P2s)
states: 1,606,245,498 (9)
.
EG iterations: 1
abstracting: (M3<=P1s)
states: 1,247,806,494 (9)
abstracting: (P1wP2<=M2)
states: 1,346,294,466 (9)
abstracting: (5<=P12M3)
states: 0
.
EG iterations: 1
abstracting: (1<=P12s)
states: 993,692,700 (8)
.abstracting: (5<=P2wM2)
states: 144,312,828 (8)

EG iterations: 0
.-> the formula is FALSE

FORMULA FMS-PT-00010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.727sec

checking: EF [[6<=P1wM1 & [1<=P12s & [[[EG [P2d<=1] & ~ [[7<=M1 & P3s<=4]]] & [~ [AG [P2<=3]] & [[P12s<=7 & P1s<=1] | [P1s<=4 | 1<=P1wM1]]]] & [1<=P1M1 | ~ [EX [6<=P1d]]]]]]]
normalized: E [true U [6<=P1wM1 & [1<=P12s & [[1<=P1M1 | ~ [EX [6<=P1d]]] & [[[[P1s<=4 | 1<=P1wM1] | [P12s<=7 & P1s<=1]] & E [true U ~ [P2<=3]]] & [~ [[7<=M1 & P3s<=4]] & EG [P2d<=1]]]]]]]

abstracting: (P2d<=1)
states: 1,530,536,502 (9)
.
EG iterations: 1
abstracting: (P3s<=4)
states: 1,705,509,000 (9)
abstracting: (7<=M1)
states: 0
abstracting: (P2<=3)
states: 2,204,852,628 (9)
abstracting: (P1s<=1)
states: 1,597,713,348 (9)
abstracting: (P12s<=7)
states: 2,501,375,316 (9)
abstracting: (1<=P1wM1)
states: 1,543,588,332 (9)
abstracting: (P1s<=4)
states: 2,384,190,072 (9)
abstracting: (6<=P1d)
states: 48,230,556 (7)
.abstracting: (1<=P1M1)
states: 1,404,008,892 (9)
abstracting: (1<=P12s)
states: 993,692,700 (8)
abstracting: (6<=P1wM1)
states: 48,230,556 (7)
-> the formula is TRUE

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

MC time: 0m 0.263sec

checking: [AG [EF [EF [[[P1s<=P12 | P2s<=P3M2] & EG [P3M2<=4]]]]] | [AG [~ [4<=P12M3]] | EX [[[[~ [10<=P2wM2] & [[10<=M2 & P2d<=P2wM2] | AX [P1d<=3]]] & P2s<=3] & ~ [AG [~ [M1<=P12wM3]]]]]]]
normalized: [[EX [[E [true U M1<=P12wM3] & [P2s<=3 & [[~ [EX [~ [P1d<=3]]] | [10<=M2 & P2d<=P2wM2]] & ~ [10<=P2wM2]]]]] | ~ [E [true U 4<=P12M3]]] | ~ [E [true U ~ [E [true U E [true U [EG [P3M2<=4] & [P1s<=P12 | P2s<=P3M2]]]]]]]]

abstracting: (P2s<=P3M2)
states: 1,953,113,808 (9)
abstracting: (P1s<=P12)
states: 1,283,872,326 (9)
abstracting: (P3M2<=4)
states: 1,705,509,000 (9)
.
EG iterations: 1
abstracting: (4<=P12M3)
states: 0
abstracting: (10<=P2wM2)
states: 167,706 (5)
abstracting: (P2d<=P2wM2)
states: 1,516,159,788 (9)
abstracting: (10<=M2)
states: 0
abstracting: (P1d<=3)
states: 2,248,451,172 (9)
.abstracting: (P2s<=3)
states: 2,204,852,628 (9)
abstracting: (M1<=P12wM3)
states: 586,261,500 (8)
.-> the formula is TRUE

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

MC time: 0m 0.354sec

checking: AG [[[[P12M3<=P2s & AX [AG [2<=P12s]]] & [~ [AF [~ [P3M2<=5]]] | EG [~ [AX [6<=P2d]]]]] | [AF [[EX [P3s<=8] | [8<=P12s & [4<=P2wM2 | P2s<=P1M1]]]] & [[P2M2<=M3 | ~ [[~ [M1<=10] | [P2wM2<=M1 | 1<=P2s]]]] & EF [P2s<=1]]]]]
normalized: ~ [E [true U ~ [[[[E [true U P2s<=1] & [P2M2<=M3 | ~ [[[P2wM2<=M1 | 1<=P2s] | ~ [M1<=10]]]]] & ~ [EG [~ [[[8<=P12s & [4<=P2wM2 | P2s<=P1M1]] | EX [P3s<=8]]]]]] | [[EG [EX [~ [6<=P2d]]] | EG [P3M2<=5]] & [P12M3<=P2s & ~ [EX [E [true U ~ [2<=P12s]]]]]]]]]]

abstracting: (2<=P12s)
states: 363,737,418 (8)
.abstracting: (P12M3<=P2s)
states: 2,089,232,508 (9)
abstracting: (P3M2<=5)
states: 1,932,910,200 (9)
.
EG iterations: 1
abstracting: (6<=P2d)
states: 62,474,280 (7)
..
EG iterations: 1
abstracting: (P3s<=8)
states: 2,387,712,600 (9)
.abstracting: (P2s<=P1M1)
states: 1,397,618,970 (9)
abstracting: (4<=P2wM2)
states: 296,560,572 (8)
abstracting: (8<=P12s)
states: 37,884 (4)
.
EG iterations: 1
abstracting: (M1<=10)
states: 2,501,413,200 (9)
abstracting: (1<=P2s)
states: 1,596,875,280 (9)
abstracting: (P2wM2<=M1)
states: 1,878,390,030 (9)
abstracting: (P2M2<=M3)
states: 2,406,450,618 (9)
abstracting: (P2s<=1)
states: 1,530,536,502 (9)
-> the formula is FALSE

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

MC time: 0m 0.307sec

checking: E [[A [~ [AG [[P2s<=5 & 3<=P1M1]]] U M2<=4] | [[E [AF [P3M2<=10] U 8<=P3s] | ~ [A [E [10<=P12wM3 U P12<=P1wM1] U P12wM3<=P2s]]] | [AG [[M2<=P2wM2 & [P1<=P12wM3 & P2d<=9]]] & ~ [P12s<=P1]]]] U [P2<=P12M3 & ~ [EF [4<=P2wP1]]]]
normalized: E [[[[~ [P12s<=P1] & ~ [E [true U ~ [[M2<=P2wM2 & [P1<=P12wM3 & P2d<=9]]]]]] | [~ [[~ [EG [~ [P12wM3<=P2s]]] & ~ [E [~ [P12wM3<=P2s] U [~ [E [10<=P12wM3 U P12<=P1wM1]] & ~ [P12wM3<=P2s]]]]]] | E [~ [EG [~ [P3M2<=10]]] U 8<=P3s]]] | [~ [EG [~ [M2<=4]]] & ~ [E [~ [M2<=4] U [~ [E [true U ~ [[P2s<=5 & 3<=P1M1]]]] & ~ [M2<=4]]]]]] U [P2<=P12M3 & ~ [E [true U 4<=P2wP1]]]]

abstracting: (4<=P2wP1)
states: 296,560,572 (8)
abstracting: (P2<=P12M3)
states: 1,178,435,940 (9)
abstracting: (M2<=4)
states: 2,501,413,200 (9)
abstracting: (3<=P1M1)
states: 255,949,980 (8)
abstracting: (P2s<=5)
states: 2,438,938,920 (9)
abstracting: (M2<=4)
states: 2,501,413,200 (9)
abstracting: (M2<=4)
states: 2,501,413,200 (9)
.
EG iterations: 1
abstracting: (8<=P3s)
states: 227,401,200 (8)
abstracting: (P3M2<=10)
states: 2,501,413,200 (9)
.
EG iterations: 1
abstracting: (P12wM3<=P2s)
states: 1,999,708,128 (9)
abstracting: (P12<=P1wM1)
states: 1,977,224,106 (9)
abstracting: (10<=P12wM3)
states: 66
abstracting: (P12wM3<=P2s)
states: 1,999,708,128 (9)
abstracting: (P12wM3<=P2s)
states: 1,999,708,128 (9)
.
EG iterations: 1
abstracting: (P2d<=9)
states: 2,501,245,494 (9)
abstracting: (P1<=P12wM3)
states: 1,283,872,326 (9)
abstracting: (M2<=P2wM2)
states: 1,970,506,824 (9)
abstracting: (P12s<=P1)
states: 1,977,224,106 (9)
-> the formula is FALSE

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

MC time: 0m 0.597sec

checking: A [[[~ [7<=P2wP1] | [AG [[AF [P3s<=10] & 1<=P1M1]] & EF [~ [5<=M3]]]] & [P12s<=3 | [EF [E [P1<=P2wM2 U 4<=P1wM1]] | 5<=P12wM3]]] U AG [[P1wM1<=M3 | [~ [[~ [P12s<=P12s] | ~ [P1<=7]]] | [[[10<=P3s & P1<=P1s] | [P1<=P2M2 | P1wM1<=6]] & AG [7<=P1d]]]]]]
normalized: [~ [EG [E [true U ~ [[P1wM1<=M3 | [[~ [E [true U ~ [7<=P1d]]] & [[P1<=P2M2 | P1wM1<=6] | [10<=P3s & P1<=P1s]]] | ~ [[~ [P1<=7] | ~ [P12s<=P12s]]]]]]]]] & ~ [E [E [true U ~ [[P1wM1<=M3 | [[~ [E [true U ~ [7<=P1d]]] & [[P1<=P2M2 | P1wM1<=6] | [10<=P3s & P1<=P1s]]] | ~ [[~ [P1<=7] | ~ [P12s<=P12s]]]]]]] U [~ [[[P12s<=3 | [5<=P12wM3 | E [true U E [P1<=P2wM2 U 4<=P1wM1]]]] & [[E [true U ~ [5<=M3]] & ~ [E [true U ~ [[1<=P1M1 & ~ [EG [~ [P3s<=10]]]]]]]] | ~ [7<=P2wP1]]]] & E [true U ~ [[P1wM1<=M3 | [[~ [E [true U ~ [7<=P1d]]] & [[P1<=P2M2 | P1wM1<=6] | [10<=P3s & P1<=P1s]]] | ~ [[~ [P1<=7] | ~ [P12s<=P12s]]]]]]]]]]]

abstracting: (P12s<=P12s)
states: 2,501,413,200 (9)
abstracting: (P1<=7)
states: 2,496,573,684 (9)
abstracting: (P1<=P1s)
states: 1,535,696,448 (9)
abstracting: (10<=P3s)
states: 37,900,200 (7)
abstracting: (P1wM1<=6)
states: 2,484,418,464 (9)
abstracting: (P1<=P2M2)
states: 1,209,243,750 (9)
abstracting: (7<=P1d)
states: 16,994,736 (7)
abstracting: (P1wM1<=M3)
states: 1,792,563,696 (9)
abstracting: (7<=P2wP1)
states: 23,145,804 (7)
abstracting: (P3s<=10)
states: 2,501,413,200 (9)
.
EG iterations: 1
abstracting: (1<=P1M1)
states: 1,404,008,892 (9)
abstracting: (5<=M3)
states: 0
abstracting: (4<=P1wM1)
states: 252,962,028 (8)
abstracting: (P1<=P2wM2)
states: 1,606,245,498 (9)
abstracting: (5<=P12wM3)
states: 9,098,628 (6)
abstracting: (P12s<=3)
states: 2,465,758,020 (9)
abstracting: (P12s<=P12s)
states: 2,501,413,200 (9)
abstracting: (P1<=7)
states: 2,496,573,684 (9)
abstracting: (P1<=P1s)
states: 1,535,696,448 (9)
abstracting: (10<=P3s)
states: 37,900,200 (7)
abstracting: (P1wM1<=6)
states: 2,484,418,464 (9)
abstracting: (P1<=P2M2)
states: 1,209,243,750 (9)
abstracting: (7<=P1d)
states: 16,994,736 (7)
abstracting: (P1wM1<=M3)
states: 1,792,563,696 (9)
abstracting: (P12s<=P12s)
states: 2,501,413,200 (9)
abstracting: (P1<=7)
states: 2,496,573,684 (9)
abstracting: (P1<=P1s)
states: 1,535,696,448 (9)
abstracting: (10<=P3s)
states: 37,900,200 (7)
abstracting: (P1wM1<=6)
states: 2,484,418,464 (9)
abstracting: (P1<=P2M2)
states: 1,209,243,750 (9)
abstracting: (7<=P1d)
states: 16,994,736 (7)
abstracting: (P1wM1<=M3)
states: 1,792,563,696 (9)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.345sec

totally nodes used: 1631672 (1.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 11865333 4853212 16718545
used/not used/entry size/cache size: 5871427 61237437 16 1024MB
basic ops cache: hits/miss/sum: 4641224 1976491 6617715
used/not used/entry size/cache size: 2988848 13788368 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: 579294 218014 797308
used/not used/entry size/cache size: 215352 8173256 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 65572010
1 1491504
2 35827
3 3092
4 838
5 755
6 703
7 1116
8 1453
9 110
>= 10 1456

Total processing time: 0m 8.647sec


BK_STOP 1679420412378

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


iterations count:790 (39), effective:170 (8)

initing FirstDep: 0m 0.001sec


iterations count:76 (3), effective:14 (0)

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

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

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

iterations count:204 (10), effective:36 (1)

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

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

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

iterations count:70 (3), effective:20 (1)

iterations count:34 (1), effective:7 (0)

iterations count:300 (15), effective:71 (3)

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

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

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

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

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

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

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

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

iterations count:185 (9), effective:41 (2)

iterations count:136 (6), effective:26 (1)

iterations count:581 (29), effective:133 (6)

iterations count:60 (3), effective:10 (0)

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

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

iterations count:260 (13), effective:56 (2)

iterations count:449 (22), effective:109 (5)

iterations count:96 (4), effective:22 (1)

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

iterations count:175 (8), effective:40 (2)

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

iterations count:38 (1), effective:9 (0)

iterations count:147 (7), effective:44 (2)

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

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

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

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

iterations count:118 (5), effective:27 (1)

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

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

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

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

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

iterations count:79 (3), effective:20 (1)

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

iterations count:24 (1), effective:4 (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-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 FMS-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 r161-tall-167838844800201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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