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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 17:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 17:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 17:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.6K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679868193722

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-nC00010vD
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_nC00010vD
(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.775sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 252 (2.5e+02) #states 503



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

checking: EG [~ [AG [6<=haveB]]]
normalized: EG [E [true U ~ [6<=haveB]]]

abstracting: (6<=haveB)
states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EX [6<=Clients]
normalized: EX [6<=Clients]

abstracting: (6<=Clients)
states: 126
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [EG [EF [AX [[haveAandB<=0 | haveB<=0]]]]]
normalized: ~ [E [true U ~ [EG [E [true U ~ [EX [~ [[haveAandB<=0 | haveB<=0]]]]]]]]]

abstracting: (haveB<=0)
states: 126
abstracting: (haveAandB<=0)
states: 265
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EG [~ [haveAandB<=haveA2andB]]
normalized: EG [~ [haveAandB<=haveA2andB]]

abstracting: (haveAandB<=haveA2andB)
states: 337
..........
EG iterations: 10
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: ~ [[EG [~ [resB<=4]] & AF [Clients<=haveA]]]
normalized: ~ [[~ [EG [~ [Clients<=haveA]]] & EG [~ [resB<=4]]]]

abstracting: (resB<=4)
states: 482
............
EG iterations: 12
abstracting: (Clients<=haveA)
states: 68
.
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00010vD-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (haveA2andB<=resB)
states: 396
abstracting: (Clients<=haveA2andB)
states: 20
abstracting: (9<=Clients)
states: 6
...........
EG iterations: 11
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EX [~ [[EG [[AX [8<=haveA2andB] | Clients<=3]] & [resB<=3 & AF [[AX [4<=resA] & EG [haveA<=haveA]]]]]]]
normalized: EX [~ [[[~ [EG [~ [[EG [haveA<=haveA] & ~ [EX [~ [4<=resA]]]]]]] & resB<=3] & EG [[~ [EX [~ [8<=haveA2andB]]] | Clients<=3]]]]]

abstracting: (Clients<=3)
states: 146
abstracting: (8<=haveA2andB)
states: 0
......
EG iterations: 5
abstracting: (resB<=3)
states: 431
abstracting: (4<=resA)
states: 28
.abstracting: (haveA<=haveA)
states: 503

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

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

MC time: 0m 0.001sec

checking: ~ [AX [[~ [haveA<=resA] & [[7<=resA | [5<=haveB | haveA2<=Clients]] | 8<=resA]]]]
normalized: EX [~ [[[[[5<=haveB | haveA2<=Clients] | 7<=resA] | 8<=resA] & ~ [haveA<=resA]]]]

abstracting: (haveA<=resA)
states: 307
abstracting: (8<=resA)
states: 0
abstracting: (7<=resA)
states: 0
abstracting: (haveA2<=Clients)
states: 465
abstracting: (5<=haveB)
states: 20
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00010vD-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [AX [[[~ [[~ [resB<=0] & [6<=haveA | 6<=resB]]] | [EX [resB<=haveAandB] | AF [haveAandB<=8]]] & EG [[~ [5<=resA] | ~ [haveA2andB<=0]]]]]]
normalized: EG [~ [EX [~ [[EG [[~ [haveA2andB<=0] | ~ [5<=resA]]] & [[~ [EG [~ [haveAandB<=8]]] | EX [resB<=haveAandB]] | ~ [[[6<=haveA | 6<=resB] & ~ [resB<=0]]]]]]]]]

abstracting: (resB<=0)
states: 125
abstracting: (6<=resB)
states: 0
abstracting: (6<=haveA)
states: 0
abstracting: (resB<=haveAandB)
states: 212
.abstracting: (haveAandB<=8)
states: 503
.
EG iterations: 1
abstracting: (5<=resA)
states: 6
abstracting: (haveA2andB<=0)
states: 265
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: E [~ [[AF [[~ [[Clients<=0 & resB<=7]] | E [Clients<=haveAandB U 1<=Clients]]] & [~ [8<=resA] & ~ [EX [resB<=5]]]]] U EF [AF [AX [resA<=haveA2andB]]]]
normalized: E [~ [[[~ [EX [resB<=5]] & ~ [8<=resA]] & ~ [EG [~ [[E [Clients<=haveAandB U 1<=Clients] | ~ [[Clients<=0 & resB<=7]]]]]]]] U E [true U ~ [EG [EX [~ [resA<=haveA2andB]]]]]]

abstracting: (resA<=haveA2andB)
states: 279
...
EG iterations: 2
abstracting: (resB<=7)
states: 503
abstracting: (Clients<=0)
states: 5
abstracting: (1<=Clients)
states: 498
abstracting: (Clients<=haveAandB)
states: 20
.
EG iterations: 1
abstracting: (8<=resA)
states: 0
abstracting: (resB<=5)
states: 503
.-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: EG [[EF [[haveB<=Clients | [[AG [7<=haveB] | EF [resB<=haveA2]] | ~ [EF [1<=resA]]]]] | AX [E [A [haveB<=haveAandB U 10<=haveAandB] U AG [haveA2andB<=resA]]]]]
normalized: EG [[~ [EX [~ [E [[~ [EG [~ [10<=haveAandB]]] & ~ [E [~ [10<=haveAandB] U [~ [haveB<=haveAandB] & ~ [10<=haveAandB]]]]] U ~ [E [true U ~ [haveA2andB<=resA]]]]]]] | E [true U [[~ [E [true U 1<=resA]] | [E [true U resB<=haveA2] | ~ [E [true U ~ [7<=haveB]]]]] | haveB<=Clients]]]]

abstracting: (haveB<=Clients)
states: 417
abstracting: (7<=haveB)
states: 0
abstracting: (resB<=haveA2)
states: 251
abstracting: (1<=resA)
states: 308
abstracting: (haveA2andB<=resA)
states: 365
abstracting: (10<=haveAandB)
states: 0
abstracting: (haveB<=haveAandB)
states: 213
abstracting: (10<=haveAandB)
states: 0
abstracting: (10<=haveAandB)
states: 0

EG iterations: 0
.
EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.003sec

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

abstracting: (haveA2andB<=resB)
states: 396
abstracting: (haveA2andB<=2)
states: 470
abstracting: (haveA2andB<=6)
states: 503
abstracting: (haveA2andB<=2)
states: 470
abstracting: (haveA2andB<=2)
states: 470
..
EG iterations: 2
abstracting: (10<=Clients)
states: 1
abstracting: (haveA2andB<=2)
states: 470
abstracting: (haveA2andB<=6)
states: 503
abstracting: (haveA2andB<=2)
states: 470
abstracting: (haveA2andB<=2)
states: 470
..
EG iterations: 2
abstracting: (haveA2andB<=2)
states: 470
abstracting: (haveA2andB<=6)
states: 503
abstracting: (haveA2andB<=2)
states: 470
abstracting: (haveA2andB<=2)
states: 470
..
EG iterations: 2
.
EG iterations: 1
abstracting: (resA<=haveA)
states: 307
abstracting: (Clients<=haveA2)
states: 68
abstracting: (10<=haveAandB)
states: 0
.abstracting: (resA<=1)
states: 335
..
EG iterations: 2
.
EG iterations: 1
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00010vD-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [~ [[E [~ [haveA2andB<=3] U [[haveAandB<=2 & [6<=haveA2 | haveAandB<=3]] & [EF [resB<=8] & [Clients<=haveA | haveB<=4]]]] | [[E [~ [haveB<=8] U ~ [haveA<=haveA2]] | ~ [resA<=0]] & ~ [resB<=haveA2]]]] U AX [EF [haveAandB<=haveAandB]]]
normalized: E [~ [[[~ [resB<=haveA2] & [~ [resA<=0] | E [~ [haveB<=8] U ~ [haveA<=haveA2]]]] | E [~ [haveA2andB<=3] U [[[Clients<=haveA | haveB<=4] & E [true U resB<=8]] & [[6<=haveA2 | haveAandB<=3] & haveAandB<=2]]]]] U ~ [EX [~ [E [true U haveAandB<=haveAandB]]]]]

abstracting: (haveAandB<=haveAandB)
states: 503
.abstracting: (haveAandB<=2)
states: 470
abstracting: (haveAandB<=3)
states: 495
abstracting: (6<=haveA2)
states: 0
abstracting: (resB<=8)
states: 503
abstracting: (haveB<=4)
states: 483
abstracting: (Clients<=haveA)
states: 68
abstracting: (haveA2andB<=3)
states: 495
abstracting: (haveA<=haveA2)
states: 307
abstracting: (haveB<=8)
states: 503
abstracting: (resA<=0)
states: 195
abstracting: (resB<=haveA2)
states: 251
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: E [EX [haveA<=9] U [EF [Clients<=haveA] | [[[E [[7<=haveAandB & haveAandB<=haveAandB] U AF [haveA2<=haveA]] | [resB<=haveAandB | haveA2<=resA]] & AF [~ [Clients<=8]]] | [3<=haveA2 & EG [[[resB<=7 & haveAandB<=8] & [haveA2<=haveAandB & haveA2andB<=haveB]]]]]]]
normalized: E [EX [haveA<=9] U [[[EG [[[haveA2<=haveAandB & haveA2andB<=haveB] & [resB<=7 & haveAandB<=8]]] & 3<=haveA2] | [~ [EG [Clients<=8]] & [[resB<=haveAandB | haveA2<=resA] | E [[7<=haveAandB & haveAandB<=haveAandB] U ~ [EG [~ [haveA2<=haveA]]]]]]] | E [true U Clients<=haveA]]]

abstracting: (Clients<=haveA)
states: 68
abstracting: (haveA2<=haveA)
states: 308
..
EG iterations: 2
abstracting: (haveAandB<=haveAandB)
states: 503
abstracting: (7<=haveAandB)
states: 0
abstracting: (haveA2<=resA)
states: 308
abstracting: (resB<=haveAandB)
states: 212
abstracting: (Clients<=8)
states: 497
.
EG iterations: 1
abstracting: (3<=haveA2)
states: 77
abstracting: (haveAandB<=8)
states: 503
abstracting: (resB<=7)
states: 503
abstracting: (haveA2andB<=haveB)
states: 396
abstracting: (haveA2<=haveAandB)
states: 280
......
EG iterations: 6
abstracting: (haveA<=9)
states: 503
.-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: AX [[[[EX [[AF [8<=haveAandB] & EX [resA<=10]]] | ~ [[8<=haveAandB & A [haveB<=haveA U haveAandB<=haveA2andB]]]] & [[AF [EX [4<=Clients]] | [[[4<=haveA | haveA2<=haveB] | [resB<=10 & resB<=1]] & [AG [haveA<=haveB] & AX [haveA2<=4]]]] & EG [[AF [3<=haveB] & Clients<=7]]]] & EF [[[[AX [haveAandB<=10] | A [Clients<=7 U resA<=haveAandB]] | A [10<=haveA U resB<=resA]] | AG [[haveA2<=9 & 6<=haveA]]]]]]
normalized: ~ [EX [~ [[[[~ [[[~ [EG [~ [haveAandB<=haveA2andB]]] & ~ [E [~ [haveAandB<=haveA2andB] U [~ [haveB<=haveA] & ~ [haveAandB<=haveA2andB]]]]] & 8<=haveAandB]] | EX [[EX [resA<=10] & ~ [EG [~ [8<=haveAandB]]]]]] & [EG [[~ [EG [~ [3<=haveB]]] & Clients<=7]] & [[[~ [EX [~ [haveA2<=4]]] & ~ [E [true U ~ [haveA<=haveB]]]] & [[resB<=10 & resB<=1] | [4<=haveA | haveA2<=haveB]]] | ~ [EG [~ [EX [4<=Clients]]]]]]] & E [true U [~ [E [true U ~ [[haveA2<=9 & 6<=haveA]]]] | [[~ [EG [~ [resB<=resA]]] & ~ [E [~ [resB<=resA] U [~ [10<=haveA] & ~ [resB<=resA]]]]] | [[~ [EG [~ [resA<=haveAandB]]] & ~ [E [~ [resA<=haveAandB] U [~ [Clients<=7] & ~ [resA<=haveAandB]]]]] | ~ [EX [~ [haveAandB<=10]]]]]]]]]]]

abstracting: (haveAandB<=10)
states: 503
.abstracting: (resA<=haveAandB)
states: 279
abstracting: (Clients<=7)
states: 482
abstracting: (resA<=haveAandB)
states: 279
abstracting: (resA<=haveAandB)
states: 279
..
EG iterations: 2
abstracting: (resB<=resA)
states: 251
abstracting: (10<=haveA)
states: 0
abstracting: (resB<=resA)
states: 251
abstracting: (resB<=resA)
states: 251
...
EG iterations: 3
abstracting: (6<=haveA)
states: 0
abstracting: (haveA2<=9)
states: 503
abstracting: (4<=Clients)
states: 357
.....
EG iterations: 4
abstracting: (haveA2<=haveB)
states: 377
abstracting: (4<=haveA)
states: 28
abstracting: (resB<=1)
states: 245
abstracting: (resB<=10)
states: 503
abstracting: (haveA<=haveB)
states: 377
abstracting: (haveA2<=4)
states: 498
.abstracting: (Clients<=7)
states: 482
abstracting: (3<=haveB)
states: 152
.....
EG iterations: 5
.
EG iterations: 1
abstracting: (8<=haveAandB)
states: 0

EG iterations: 0
abstracting: (resA<=10)
states: 503
..abstracting: (8<=haveAandB)
states: 0
abstracting: (haveAandB<=haveA2andB)
states: 337
abstracting: (haveB<=haveA)
states: 252
abstracting: (haveAandB<=haveA2andB)
states: 337
abstracting: (haveAandB<=haveA2andB)
states: 337
..........
EG iterations: 10
.-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: A [[[[A [[E [4<=haveB U 1<=Clients] & [haveB<=2 & haveAandB<=2]] U [EG [2<=haveA] | AX [haveA2<=2]]] | [AF [~ [haveB<=haveB]] & E [AX [Clients<=5] U AX [haveB<=haveB]]]] | [E [[~ [resA<=6] | EF [Clients<=5]] U resB<=7] & [haveB<=Clients & ~ [10<=Clients]]]] | EF [AX [AX [haveA2andB<=3]]]] U ~ [[[E [AX [haveB<=haveA2andB] U E [haveA<=9 U haveAandB<=5]] & resB<=haveA2] | ~ [[EG [[resB<=resB | Clients<=haveA]] | ~ [[4<=resA | EF [9<=haveAandB]]]]]]]]
normalized: [~ [EG [[~ [[~ [[E [true U 9<=haveAandB] | 4<=resA]] | EG [[resB<=resB | Clients<=haveA]]]] | [E [~ [EX [~ [haveB<=haveA2andB]]] U E [haveA<=9 U haveAandB<=5]] & resB<=haveA2]]]] & ~ [E [[~ [[~ [[E [true U 9<=haveAandB] | 4<=resA]] | EG [[resB<=resB | Clients<=haveA]]]] | [E [~ [EX [~ [haveB<=haveA2andB]]] U E [haveA<=9 U haveAandB<=5]] & resB<=haveA2]] U [~ [[E [true U ~ [EX [EX [~ [haveA2andB<=3]]]]] | [[[~ [10<=Clients] & haveB<=Clients] & E [[E [true U Clients<=5] | ~ [resA<=6]] U resB<=7]] | [[E [~ [EX [~ [Clients<=5]]] U ~ [EX [~ [haveB<=haveB]]]] & ~ [EG [haveB<=haveB]]] | [~ [EG [~ [[~ [EX [~ [haveA2<=2]]] | EG [2<=haveA]]]]] & ~ [E [~ [[~ [EX [~ [haveA2<=2]]] | EG [2<=haveA]]] U [~ [[[haveB<=2 & haveAandB<=2] & E [4<=haveB U 1<=Clients]]] & ~ [[~ [EX [~ [haveA2<=2]]] | EG [2<=haveA]]]]]]]]]]] & [~ [[~ [[E [true U 9<=haveAandB] | 4<=resA]] | EG [[resB<=resB | Clients<=haveA]]]] | [E [~ [EX [~ [haveB<=haveA2andB]]] U E [haveA<=9 U haveAandB<=5]] & resB<=haveA2]]]]]]

abstracting: (resB<=haveA2)
states: 251
abstracting: (haveAandB<=5)
states: 503
abstracting: (haveA<=9)
states: 503
abstracting: (haveB<=haveA2andB)
states: 213
.abstracting: (Clients<=haveA)
states: 68
abstracting: (resB<=resB)
states: 503

EG iterations: 0
abstracting: (4<=resA)
states: 28
abstracting: (9<=haveAandB)
states: 0
abstracting: (2<=haveA)
states: 168
.
EG iterations: 1
abstracting: (haveA2<=2)
states: 426
.abstracting: (1<=Clients)
states: 498
abstracting: (4<=haveB)
states: 71
abstracting: (haveAandB<=2)
states: 470
abstracting: (haveB<=2)
states: 351
abstracting: (2<=haveA)
states: 168
.
EG iterations: 1
abstracting: (haveA2<=2)
states: 426
.abstracting: (2<=haveA)
states: 168
.
EG iterations: 1
abstracting: (haveA2<=2)
states: 426
..
EG iterations: 1
abstracting: (haveB<=haveB)
states: 503

EG iterations: 0
abstracting: (haveB<=haveB)
states: 503
.abstracting: (Clients<=5)
states: 377
.abstracting: (resB<=7)
states: 503
abstracting: (resA<=6)
states: 503
abstracting: (Clients<=5)
states: 377
abstracting: (haveB<=Clients)
states: 417
abstracting: (10<=Clients)
states: 1
abstracting: (haveA2andB<=3)
states: 495
..abstracting: (resB<=haveA2)
states: 251
abstracting: (haveAandB<=5)
states: 503
abstracting: (haveA<=9)
states: 503
abstracting: (haveB<=haveA2andB)
states: 213
.abstracting: (Clients<=haveA)
states: 68
abstracting: (resB<=resB)
states: 503

EG iterations: 0
abstracting: (4<=resA)
states: 28
abstracting: (9<=haveAandB)
states: 0
abstracting: (resB<=haveA2)
states: 251
abstracting: (haveAandB<=5)
states: 503
abstracting: (haveA<=9)
states: 503
abstracting: (haveB<=haveA2andB)
states: 213
.abstracting: (Clients<=haveA)
states: 68
abstracting: (resB<=resB)
states: 503

EG iterations: 0
abstracting: (4<=resA)
states: 28
abstracting: (9<=haveAandB)
states: 0
.......
EG iterations: 7
-> the formula is TRUE

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

MC time: 0m 0.005sec

totally nodes used: 8616 (8.6e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 33042 21691 54733
used/not used/entry size/cache size: 28103 67080761 16 1024MB
basic ops cache: hits/miss/sum: 18310 22694 41004
used/not used/entry size/cache size: 33067 16744149 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: 2972 1735 4707
used/not used/entry size/cache size: 1735 8386873 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 67101470
1 6808
2 391
3 86
4 40
5 11
6 14
7 7
8 6
9 9
>= 10 22

Total processing time: 0m 4.562sec


BK_STOP 1679868198341

--------------------
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:133 (22), effective:42 (7)

initing FirstDep: 0m 0.000sec


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

iterations count:46 (7), effective:16 (2)

iterations count:27 (4), effective:13 (2)

iterations count:46 (7), effective:14 (2)

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

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

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

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

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

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

iterations count:31 (5), effective:10 (1)

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

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

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

iterations count:68 (11), effective:22 (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:61 (10), effective:18 (3)

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

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

iterations count:120 (20), effective:32 (5)

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

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

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

iterations count:42 (7), effective:14 (2)

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

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

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

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

iterations count:48 (8), effective:15 (2)

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

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

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

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

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)

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

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