Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r481-tall-167912692500825.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is TwoPhaseLocking-PT-nC00050vN, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692500825
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 17:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 17:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.6K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679868428008

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC00050vN
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: TwoPhaseLocking_PT_nC00050vN
(NrP: 8 NrTr: 6 NrArc: 18)

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

net check time: 0m 0.000sec

init dd package: 0m 2.783sec


RS generation: 0m 0.162sec


-> reachability set: #nodes 11635 (1.2e+04) #states 403,741 (5)



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

checking: EF [32<=resA]
normalized: E [true U 32<=resA]

abstracting: (32<=resA)
states: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00050vN-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [resA<=50]]
normalized: E [true U ~ [resA<=50]]

abstracting: (resA<=50)
states: 403,741 (5)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00050vN-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [AX [AX [E [EX [haveA<=22] U Clients<=haveAandB]]]]
normalized: E [true U ~ [EX [EX [~ [E [EX [haveA<=22] U Clients<=haveAandB]]]]]]

abstracting: (Clients<=haveAandB)
states: 1,326 (3)
abstracting: (haveA<=22)
states: 403,351 (5)
...-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vN-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.236sec

checking: [AF [haveA<=Clients] & EF [AX [EG [27<=resA]]]]
normalized: [E [true U ~ [EX [~ [EG [27<=resA]]]]] & ~ [EG [~ [haveA<=Clients]]]]

abstracting: (haveA<=Clients)
states: 380,835 (5)
..............
EG iterations: 14
abstracting: (27<=resA)
states: 0
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.086sec

checking: EF [E [Clients<=33 U AG [EF [[4<=haveA | resB<=Clients]]]]]
normalized: E [true U E [Clients<=33 U ~ [E [true U ~ [E [true U [4<=haveA | resB<=Clients]]]]]]]

abstracting: (resB<=Clients)
states: 403,065 (5)
abstracting: (4<=haveA)
states: 235,268 (5)
abstracting: (Clients<=33)
states: 383,392 (5)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vN-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.074sec

checking: EF [AF [[~ [[[EG [Clients<=haveA2] & resA<=29] & AF [haveAandB<=47]]] & EX [[21<=haveA2andB & 33<=haveA2]]]]]
normalized: E [true U ~ [EG [~ [[EX [[21<=haveA2andB & 33<=haveA2]] & ~ [[~ [EG [~ [haveAandB<=47]]] & [resA<=29 & EG [Clients<=haveA2]]]]]]]]]

abstracting: (Clients<=haveA2)
states: 27,105 (4)
...
EG iterations: 3
abstracting: (resA<=29)
states: 403,741 (5)
abstracting: (haveAandB<=47)
states: 403,741 (5)
.
EG iterations: 1
abstracting: (33<=haveA2)
states: 0
abstracting: (21<=haveA2andB)
states: 308
.
EG iterations: 0
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00050vN-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: ~ [AG [E [[~ [resB<=resA] | haveA<=haveB] U EF [[AF [resB<=25] | ~ [15<=haveA2andB]]]]]]
normalized: E [true U ~ [E [[haveA<=haveB | ~ [resB<=resA]] U E [true U [~ [EG [~ [resB<=25]]] | ~ [15<=haveA2andB]]]]]]

abstracting: (15<=haveA2andB)
states: 8,008 (3)
abstracting: (resB<=25)
states: 403,390 (5)
....................................................
EG iterations: 52
abstracting: (resB<=resA)
states: 142,480 (5)
abstracting: (haveA<=haveB)
states: 284,986 (5)
-> the formula is FALSE

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

MC time: 0m 0.189sec

checking: [AG [EX [~ [E [[resB<=19 | 32<=haveA] U AX [28<=resB]]]]] | AG [[[~ [EG [~ [Clients<=49]]] & resB<=5] & haveB<=haveA]]]
normalized: [~ [E [true U ~ [[haveB<=haveA & [resB<=5 & ~ [EG [~ [Clients<=49]]]]]]]] | ~ [E [true U ~ [EX [~ [E [[resB<=19 | 32<=haveA] U ~ [EX [~ [28<=resB]]]]]]]]]]

abstracting: (28<=resB)
states: 0
.abstracting: (32<=haveA)
states: 0
abstracting: (resB<=19)
states: 380,431 (5)
.abstracting: (Clients<=49)
states: 403,740 (5)
..
EG iterations: 2
abstracting: (resB<=5)
states: 141,633 (5)
abstracting: (haveB<=haveA)
states: 142,506 (5)
-> the formula is TRUE

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

MC time: 0m 0.141sec

checking: AG [[AX [[~ [[[41<=resB | haveA2<=haveAandB] | [Clients<=9 & 14<=resB]]] & ~ [AG [47<=Clients]]]] | resB<=34]]
normalized: ~ [E [true U ~ [[resB<=34 | ~ [EX [~ [[E [true U ~ [47<=Clients]] & ~ [[[Clients<=9 & 14<=resB] | [41<=resB | haveA2<=haveAandB]]]]]]]]]]]

abstracting: (haveA2<=haveAandB)
states: 184,729 (5)
abstracting: (41<=resB)
states: 0
abstracting: (14<=resB)
states: 97,734 (4)
abstracting: (Clients<=9)
states: 19,994 (4)
abstracting: (47<=Clients)
states: 56
.abstracting: (resB<=34)
states: 403,741 (5)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vN-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.184sec

checking: E [EF [haveAandB<=haveAandB] U AX [[[A [[22<=haveA2andB | haveB<=haveA] U EG [resA<=haveA]] | 36<=resB] & haveA<=8]]]
normalized: E [E [true U haveAandB<=haveAandB] U ~ [EX [~ [[haveA<=8 & [36<=resB | [~ [EG [~ [EG [resA<=haveA]]]] & ~ [E [~ [EG [resA<=haveA]] U [~ [[22<=haveA2andB | haveB<=haveA]] & ~ [EG [resA<=haveA]]]]]]]]]]]]

abstracting: (resA<=haveA)
states: 214,188 (5)
...........................
EG iterations: 27
abstracting: (haveB<=haveA)
states: 142,506 (5)
abstracting: (22<=haveA2andB)
states: 133
abstracting: (resA<=haveA)
states: 214,188 (5)
...........................
EG iterations: 27
abstracting: (resA<=haveA)
states: 214,188 (5)
...........................
EG iterations: 27
..
EG iterations: 2
abstracting: (36<=resB)
states: 0
abstracting: (haveA<=8)
states: 303,951 (5)
.abstracting: (haveAandB<=haveAandB)
states: 403,741 (5)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vN-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.327sec

checking: ~ [AG [[haveAandB<=Clients | [[A [[haveA<=2 | haveA2andB<=48] U EF [resA<=38]] | [AX [haveA2<=haveA2andB] | 23<=haveB]] & 25<=haveA2andB]]]]
normalized: E [true U ~ [[haveAandB<=Clients | [25<=haveA2andB & [[23<=haveB | ~ [EX [~ [haveA2<=haveA2andB]]]] | [~ [EG [~ [E [true U resA<=38]]]] & ~ [E [~ [E [true U resA<=38]] U [~ [[haveA<=2 | haveA2andB<=48]] & ~ [E [true U resA<=38]]]]]]]]]]]

abstracting: (resA<=38)
states: 403,741 (5)
abstracting: (haveA2andB<=48)
states: 403,741 (5)
abstracting: (haveA<=2)
states: 131,674 (5)
abstracting: (resA<=38)
states: 403,741 (5)
abstracting: (resA<=38)
states: 403,741 (5)
.
EG iterations: 1
abstracting: (haveA2<=haveA2andB)
states: 184,729 (5)
.abstracting: (23<=haveB)
states: 6,232 (3)
abstracting: (25<=haveA2andB)
states: 2
abstracting: (haveAandB<=Clients)
states: 403,416 (5)
-> the formula is TRUE

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

MC time: 0m 0.180sec

checking: EF [[~ [EX [[EF [haveA2andB<=haveA2andB] & haveB<=haveB]]] & [~ [[EG [AG [31<=resB]] & [[AF [haveAandB<=haveB] & ~ [haveA2andB<=haveAandB]] & ~ [resA<=haveA]]]] | ~ [30<=Clients]]]]
normalized: E [true U [[~ [30<=Clients] | ~ [[[~ [resA<=haveA] & [~ [haveA2andB<=haveAandB] & ~ [EG [~ [haveAandB<=haveB]]]]] & EG [~ [E [true U ~ [31<=resB]]]]]]] & ~ [EX [[haveB<=haveB & E [true U haveA2andB<=haveA2andB]]]]]]

abstracting: (haveA2andB<=haveA2andB)
states: 403,741 (5)
abstracting: (haveB<=haveB)
states: 403,741 (5)
.abstracting: (31<=resB)
states: 0
.
EG iterations: 1
abstracting: (haveAandB<=haveB)
states: 298,363 (5)
...
EG iterations: 3
abstracting: (haveA2andB<=haveAandB)
states: 220,103 (5)
abstracting: (resA<=haveA)
states: 214,188 (5)
abstracting: (30<=Clients)
states: 53,130 (4)
-> the formula is FALSE

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

MC time: 0m 0.335sec

checking: EF [[EX [[~ [haveAandB<=resA] & [[~ [haveA2<=17] | AX [haveAandB<=1]] | EF [resB<=27]]]] | ~ [[E [AX [resB<=resB] U ~ [10<=haveA2andB]] | [EX [resA<=haveA2andB] & A [haveA2andB<=5 U 31<=haveB]]]]]]
normalized: E [true U [~ [[[[~ [EG [~ [31<=haveB]]] & ~ [E [~ [31<=haveB] U [~ [haveA2andB<=5] & ~ [31<=haveB]]]]] & EX [resA<=haveA2andB]] | E [~ [EX [~ [resB<=resB]]] U ~ [10<=haveA2andB]]]] | EX [[[E [true U resB<=27] | [~ [EX [~ [haveAandB<=1]]] | ~ [haveA2<=17]]] & ~ [haveAandB<=resA]]]]]

abstracting: (haveAandB<=resA)
states: 249,587 (5)
abstracting: (haveA2<=17)
states: 395,763 (5)
abstracting: (haveAandB<=1)
states: 126,451 (5)
.abstracting: (resB<=27)
states: 403,741 (5)
.abstracting: (10<=haveA2andB)
states: 42,636 (4)
abstracting: (resB<=resB)
states: 403,741 (5)
.abstracting: (resA<=haveA2andB)
states: 184,704 (5)
.abstracting: (31<=haveB)
states: 0
abstracting: (haveA2andB<=5)
states: 285,084 (5)
abstracting: (31<=haveB)
states: 0
abstracting: (31<=haveB)
states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.427sec

checking: A [[[[EF [[AG [8<=haveA] | 31<=haveA2]] & 20<=resA] & 7<=haveB] & E [haveB<=haveA2andB U A [AG [6<=haveB] U E [haveA2<=23 U resA<=5]]]] U [~ [A [~ [[[resA<=31 | 5<=resA] | AX [haveAandB<=haveA2]]] U AF [haveA2andB<=17]]] & [A [AG [[30<=haveA | 35<=haveA2andB]] U EF [AG [39<=haveA2]]] | ~ [AF [17<=Clients]]]]]
normalized: [~ [EG [~ [[[EG [~ [17<=Clients]] | [~ [EG [~ [E [true U ~ [E [true U ~ [39<=haveA2]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [39<=haveA2]]]]] U [E [true U ~ [[30<=haveA | 35<=haveA2andB]]] & ~ [E [true U ~ [E [true U ~ [39<=haveA2]]]]]]]]]] & ~ [[~ [EG [EG [~ [haveA2andB<=17]]]] & ~ [E [EG [~ [haveA2andB<=17]] U [[~ [EX [~ [haveAandB<=haveA2]]] | [resA<=31 | 5<=resA]] & EG [~ [haveA2andB<=17]]]]]]]]]]] & ~ [E [~ [[[EG [~ [17<=Clients]] | [~ [EG [~ [E [true U ~ [E [true U ~ [39<=haveA2]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [39<=haveA2]]]]] U [E [true U ~ [[30<=haveA | 35<=haveA2andB]]] & ~ [E [true U ~ [E [true U ~ [39<=haveA2]]]]]]]]]] & ~ [[~ [EG [EG [~ [haveA2andB<=17]]]] & ~ [E [EG [~ [haveA2andB<=17]] U [[~ [EX [~ [haveAandB<=haveA2]]] | [resA<=31 | 5<=resA]] & EG [~ [haveA2andB<=17]]]]]]]]] U [~ [[E [haveB<=haveA2andB U [~ [EG [~ [E [haveA2<=23 U resA<=5]]]] & ~ [E [~ [E [haveA2<=23 U resA<=5]] U [E [true U ~ [6<=haveB]] & ~ [E [haveA2<=23 U resA<=5]]]]]]] & [7<=haveB & [20<=resA & E [true U [31<=haveA2 | ~ [E [true U ~ [8<=haveA]]]]]]]]] & ~ [[[EG [~ [17<=Clients]] | [~ [EG [~ [E [true U ~ [E [true U ~ [39<=haveA2]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [39<=haveA2]]]]] U [E [true U ~ [[30<=haveA | 35<=haveA2andB]]] & ~ [E [true U ~ [E [true U ~ [39<=haveA2]]]]]]]]]] & ~ [[~ [EG [EG [~ [haveA2andB<=17]]]] & ~ [E [EG [~ [haveA2andB<=17]] U [[~ [EX [~ [haveAandB<=haveA2]]] | [resA<=31 | 5<=resA]] & EG [~ [haveA2andB<=17]]]]]]]]]]]]]

abstracting: (haveA2andB<=17)
states: 401,695 (5)
..
EG iterations: 2
abstracting: (5<=resA)
states: 201,894 (5)
abstracting: (resA<=31)
states: 403,741 (5)
abstracting: (haveAandB<=haveA2)
states: 249,587 (5)
.abstracting: (haveA2andB<=17)
states: 401,695 (5)
..
EG iterations: 2
abstracting: (haveA2andB<=17)
states: 401,695 (5)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (39<=haveA2)
states: 0
abstracting: (35<=haveA2andB)
states: 0
abstracting: (30<=haveA)
states: 0
abstracting: (39<=haveA2)
states: 0
abstracting: (39<=haveA2)
states: 0

EG iterations: 0
abstracting: (17<=Clients)
states: 309,204 (5)
...................
EG iterations: 19
abstracting: (8<=haveA)
states: 120,879 (5)
abstracting: (31<=haveA2)
states: 0
abstracting: (20<=resA)
states: 3,150 (3)
abstracting: (7<=haveB)
states: 239,136 (5)
abstracting: (resA<=5)
states: 231,954 (5)
abstracting: (haveA2<=23)
states: 403,610 (5)
abstracting: (6<=haveB)
states: 262,082 (5)
abstracting: (resA<=5)
states: 231,954 (5)
abstracting: (haveA2<=23)
states: 403,610 (5)
abstracting: (resA<=5)
states: 231,954 (5)
abstracting: (haveA2<=23)
states: 403,610 (5)
.
EG iterations: 1
abstracting: (haveB<=haveA2andB)
states: 126,399 (5)
abstracting: (haveA2andB<=17)
states: 401,695 (5)
..
EG iterations: 2
abstracting: (5<=resA)
states: 201,894 (5)
abstracting: (resA<=31)
states: 403,741 (5)
abstracting: (haveAandB<=haveA2)
states: 249,587 (5)
.abstracting: (haveA2andB<=17)
states: 401,695 (5)
..
EG iterations: 2
abstracting: (haveA2andB<=17)
states: 401,695 (5)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (39<=haveA2)
states: 0
abstracting: (35<=haveA2andB)
states: 0
abstracting: (30<=haveA)
states: 0
abstracting: (39<=haveA2)
states: 0
abstracting: (39<=haveA2)
states: 0

EG iterations: 0
abstracting: (17<=Clients)
states: 309,204 (5)
...................
EG iterations: 19
abstracting: (haveA2andB<=17)
states: 401,695 (5)
..
EG iterations: 2
abstracting: (5<=resA)
states: 201,894 (5)
abstracting: (resA<=31)
states: 403,741 (5)
abstracting: (haveAandB<=haveA2)
states: 249,587 (5)
.abstracting: (haveA2andB<=17)
states: 401,695 (5)
..
EG iterations: 2
abstracting: (haveA2andB<=17)
states: 401,695 (5)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (39<=haveA2)
states: 0
abstracting: (35<=haveA2andB)
states: 0
abstracting: (30<=haveA)
states: 0
abstracting: (39<=haveA2)
states: 0
abstracting: (39<=haveA2)
states: 0

EG iterations: 0
abstracting: (17<=Clients)
states: 309,204 (5)
...................
EG iterations: 19

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.174sec

checking: [E [~ [EF [22<=resA]] U EG [~ [[[~ [haveB<=haveB] | ~ [haveAandB<=42]] | E [resB<=14 U haveA<=36]]]]] | [EX [[~ [EF [[haveAandB<=19 | haveA2<=resB]]] | E [haveB<=26 U ~ [haveA2<=41]]]] & [E [Clients<=haveB U ~ [[~ [resA<=haveAandB] | ~ [[haveA<=haveA2 | haveB<=33]]]]] | AX [haveB<=haveA2]]]]
normalized: [[[~ [EX [~ [haveB<=haveA2]]] | E [Clients<=haveB U ~ [[~ [[haveA<=haveA2 | haveB<=33]] | ~ [resA<=haveAandB]]]]] & EX [[E [haveB<=26 U ~ [haveA2<=41]] | ~ [E [true U [haveAandB<=19 | haveA2<=resB]]]]]] | E [~ [E [true U 22<=resA]] U EG [~ [[E [resB<=14 U haveA<=36] | [~ [haveAandB<=42] | ~ [haveB<=haveB]]]]]]]

abstracting: (haveB<=haveB)
states: 403,741 (5)
abstracting: (haveAandB<=42)
states: 403,741 (5)
abstracting: (haveA<=36)
states: 403,741 (5)
abstracting: (resB<=14)
states: 322,023 (5)
.
EG iterations: 1
abstracting: (22<=resA)
states: 903
abstracting: (haveA2<=resB)
states: 285,011 (5)
abstracting: (haveAandB<=19)
states: 403,111 (5)
abstracting: (haveA2<=41)
states: 403,741 (5)
abstracting: (haveB<=26)
states: 403,741 (5)
.abstracting: (resA<=haveAandB)
states: 184,704 (5)
abstracting: (haveB<=33)
states: 403,741 (5)
abstracting: (haveA<=haveA2)
states: 214,201 (5)
abstracting: (Clients<=haveB)
states: 71,851 (4)
abstracting: (haveB<=haveA2)
states: 142,506 (5)
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00050vN-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.487sec

checking: E [A [[~ [haveAandB<=haveAandB] & AG [AG [23<=haveAandB]]] U [[resA<=haveAandB | haveA2andB<=haveAandB] & [AX [[37<=haveB & 12<=resA]] | [[A [haveA2<=9 U haveA2andB<=1] | AX [haveA<=resB]] | EF [resB<=haveA2andB]]]]] U ~ [[[E [resA<=3 U [EX [19<=resA] & haveA2<=resA]] & [[AG [32<=resA] | [AG [haveA2andB<=6] & haveAandB<=35]] & [E [haveB<=30 U haveA<=42] | Clients<=Clients]]] | [A [[EF [haveA2<=haveB] | ~ [resA<=haveA]] U haveAandB<=resA] | Clients<=haveA2]]]]
normalized: E [[~ [EG [~ [[[[E [true U resB<=haveA2andB] | [~ [EX [~ [haveA<=resB]]] | [~ [EG [~ [haveA2andB<=1]]] & ~ [E [~ [haveA2andB<=1] U [~ [haveA2<=9] & ~ [haveA2andB<=1]]]]]]] | ~ [EX [~ [[37<=haveB & 12<=resA]]]]] & [resA<=haveAandB | haveA2andB<=haveAandB]]]]] & ~ [E [~ [[[[E [true U resB<=haveA2andB] | [~ [EX [~ [haveA<=resB]]] | [~ [EG [~ [haveA2andB<=1]]] & ~ [E [~ [haveA2andB<=1] U [~ [haveA2<=9] & ~ [haveA2andB<=1]]]]]]] | ~ [EX [~ [[37<=haveB & 12<=resA]]]]] & [resA<=haveAandB | haveA2andB<=haveAandB]]] U [~ [[~ [E [true U E [true U ~ [23<=haveAandB]]]] & ~ [haveAandB<=haveAandB]]] & ~ [[[[E [true U resB<=haveA2andB] | [~ [EX [~ [haveA<=resB]]] | [~ [EG [~ [haveA2andB<=1]]] & ~ [E [~ [haveA2andB<=1] U [~ [haveA2<=9] & ~ [haveA2andB<=1]]]]]]] | ~ [EX [~ [[37<=haveB & 12<=resA]]]]] & [resA<=haveAandB | haveA2andB<=haveAandB]]]]]]] U ~ [[[Clients<=haveA2 | [~ [EG [~ [haveAandB<=resA]]] & ~ [E [~ [haveAandB<=resA] U [~ [[~ [resA<=haveA] | E [true U haveA2<=haveB]]] & ~ [haveAandB<=resA]]]]]] | [[[Clients<=Clients | E [haveB<=30 U haveA<=42]] & [[haveAandB<=35 & ~ [E [true U ~ [haveA2andB<=6]]]] | ~ [E [true U ~ [32<=resA]]]]] & E [resA<=3 U [haveA2<=resA & EX [19<=resA]]]]]]]

abstracting: (19<=resA)
states: 5,166 (3)
.abstracting: (haveA2<=resA)
states: 214,213 (5)
abstracting: (resA<=3)
states: 168,451 (5)
abstracting: (32<=resA)
states: 0
abstracting: (haveA2andB<=6)
states: 310,109 (5)
abstracting: (haveAandB<=35)
states: 403,741 (5)
abstracting: (haveA<=42)
states: 403,741 (5)
abstracting: (haveB<=30)
states: 403,741 (5)
abstracting: (Clients<=Clients)
states: 403,741 (5)
abstracting: (haveAandB<=resA)
states: 249,587 (5)
abstracting: (haveA2<=haveB)
states: 284,986 (5)
abstracting: (resA<=haveA)
states: 214,188 (5)
abstracting: (haveAandB<=resA)
states: 249,587 (5)
abstracting: (haveAandB<=resA)
states: 249,587 (5)
..........................
EG iterations: 26
abstracting: (Clients<=haveA2)
states: 27,105 (4)
abstracting: (haveA2andB<=haveAandB)
states: 220,103 (5)
abstracting: (resA<=haveAandB)
states: 184,704 (5)
abstracting: (12<=resA)
states: 51,884 (4)
abstracting: (37<=haveB)
states: 0
.abstracting: (haveA2andB<=1)
states: 126,451 (5)
abstracting: (haveA2<=9)
states: 322,361 (5)
abstracting: (haveA2andB<=1)
states: 126,451 (5)
abstracting: (haveA2andB<=1)
states: 126,451 (5)
..
EG iterations: 2
abstracting: (haveA<=resB)
states: 285,011 (5)
.abstracting: (resB<=haveA2andB)
states: 126,373 (5)
abstracting: (haveAandB<=haveAandB)
states: 403,741 (5)
abstracting: (23<=haveAandB)
states: 48
abstracting: (haveA2andB<=haveAandB)
states: 220,103 (5)
abstracting: (resA<=haveAandB)
states: 184,704 (5)
abstracting: (12<=resA)
states: 51,884 (4)
abstracting: (37<=haveB)
states: 0
.abstracting: (haveA2andB<=1)
states: 126,451 (5)
abstracting: (haveA2<=9)
states: 322,361 (5)
abstracting: (haveA2andB<=1)
states: 126,451 (5)
abstracting: (haveA2andB<=1)
states: 126,451 (5)
..
EG iterations: 2
abstracting: (haveA<=resB)
states: 285,011 (5)
.abstracting: (resB<=haveA2andB)
states: 126,373 (5)
abstracting: (haveA2andB<=haveAandB)
states: 220,103 (5)
abstracting: (resA<=haveAandB)
states: 184,704 (5)
abstracting: (12<=resA)
states: 51,884 (4)
abstracting: (37<=haveB)
states: 0
.abstracting: (haveA2andB<=1)
states: 126,451 (5)
abstracting: (haveA2<=9)
states: 322,361 (5)
abstracting: (haveA2andB<=1)
states: 126,451 (5)
abstracting: (haveA2andB<=1)
states: 126,451 (5)
..
EG iterations: 2
abstracting: (haveA<=resB)
states: 285,011 (5)
.abstracting: (resB<=haveA2andB)
states: 126,373 (5)
...............................................................................
EG iterations: 79
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vN-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.826sec

totally nodes used: 565904 (5.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7372288 1870747 9243035
used/not used/entry size/cache size: 2401204 64707660 16 1024MB
basic ops cache: hits/miss/sum: 3754677 2142642 5897319
used/not used/entry size/cache size: 2669033 14108183 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: 489149 157177 646326
used/not used/entry size/cache size: 155742 8232866 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 66598213
1 481735
2 20870
3 3859
4 1522
5 766
6 448
7 315
8 218
9 180
>= 10 738

Total processing time: 0m 9.397sec


BK_STOP 1679868437452

--------------------
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:631 (105), effective:200 (33)

initing FirstDep: 0m 0.001sec


iterations count:236 (39), effective:101 (16)

iterations count:27 (4), effective:10 (1)

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

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

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

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

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

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

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

iterations count:60 (10), effective:25 (4)

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

iterations count:373 (62), effective:126 (21)

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

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

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

iterations count:250 (41), effective:106 (17)

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

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

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

iterations count:70 (11), effective:16 (2)

iterations count:207 (34), effective:64 (10)

iterations count:87 (14), effective:41 (6)

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

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

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

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

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

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

iterations count:343 (57), effective:110 (18)

iterations count:46 (7), effective:20 (3)

iterations count:351 (58), effective:101 (16)

iterations count:46 (7), effective:20 (3)

iterations count:46 (7), effective:20 (3)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:665 (110), effective:202 (33)

iterations count:16 (2), effective:5 (0)

iterations count:68 (11), effective:34 (5)

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

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

iterations count:245 (40), effective:76 (12)

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

iterations count:56 (9), effective:25 (4)

iterations count:230 (38), effective:68 (11)

iterations count:141 (23), effective:79 (13)

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

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

iterations count:230 (38), effective:68 (11)

iterations count:141 (23), effective:79 (13)

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

iterations count:230 (38), effective:68 (11)

iterations count:141 (23), effective:79 (13)

iterations count:357 (59), effective:162 (27)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TwoPhaseLocking-PT-nC00050vN"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is TwoPhaseLocking-PT-nC00050vN, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r481-tall-167912692500825"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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