About the Execution of Marcie for TwoPhaseLocking-PT-nC00010vN
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5448.991 | 4679.00 | 3980.00 | 70.00 | TTTFFTTTFFTTTTTT | normal |
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-167912692500793.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-nC00010vN, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692500793
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 17:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 12K Feb 25 17:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 17:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:53 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-nC00010vN-CTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00010vN-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679868254594
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-nC00010vN
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_nC00010vN
(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.845sec
RS generation: 0m 0.001sec
-> reachability set: #nodes 285 (2.8e+02) #states 624
starting MCC model checker
--------------------------
checking: EX [EF [6<=resB]]
normalized: EX [E [true U 6<=resB]]
abstracting: (6<=resB)
states: 21
.-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: EF [AF [EX [Clients<=7]]]
normalized: E [true U ~ [EG [~ [EX [Clients<=7]]]]]
abstracting: (Clients<=7)
states: 603
..
EG iterations: 1
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [haveAandB<=10]
normalized: E [true U haveAandB<=10]
abstracting: (haveAandB<=10)
states: 624
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AX [[~ [4<=haveA2] | AG [10<=resA]]]
normalized: ~ [EX [~ [[~ [E [true U ~ [10<=resA]]] | ~ [4<=haveA2]]]]]
abstracting: (4<=haveA2)
states: 31
abstracting: (10<=resA)
states: 0
.-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [AX [haveAandB<=haveB]]
normalized: ~ [EG [EX [~ [haveAandB<=haveB]]]]
abstracting: (haveAandB<=haveB)
states: 507
....
EG iterations: 3
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [EX [AF [[~ [[haveA2<=5 | resB<=8]] & 8<=haveA2]]]]
normalized: ~ [EX [~ [EG [~ [[~ [[haveA2<=5 | resB<=8]] & 8<=haveA2]]]]]]
abstracting: (8<=haveA2)
states: 0
abstracting: (resB<=8)
states: 624
abstracting: (haveA2<=5)
states: 624
EG iterations: 0
.-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: E [haveB<=haveA U AF [resA<=haveA]]
normalized: E [haveB<=haveA U ~ [EG [~ [resA<=haveA]]]]
abstracting: (resA<=haveA)
states: 382
..
EG iterations: 2
abstracting: (haveB<=haveA)
states: 252
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[EF [~ [9<=resB]] | [[AG [~ [EX [8<=haveAandB]]] & EG [~ [8<=haveAandB]]] & ~ [AG [3<=haveA2andB]]]]]
normalized: ~ [E [true U ~ [[E [true U ~ [9<=resB]] | [E [true U ~ [3<=haveA2andB]] & [EG [~ [8<=haveAandB]] & ~ [E [true U EX [8<=haveAandB]]]]]]]]]
abstracting: (8<=haveAandB)
states: 0
.abstracting: (8<=haveAandB)
states: 0
EG iterations: 0
abstracting: (3<=haveA2andB)
states: 48
abstracting: (9<=resB)
states: 0
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: A [~ [EF [~ [[E [haveB<=resA U 7<=Clients] & ~ [haveAandB<=9]]]]] U [EF [~ [[AG [4<=haveB] | 10<=haveA2andB]]] & resB<=0]]
normalized: [~ [EG [~ [[E [true U ~ [[~ [E [true U ~ [4<=haveB]]] | 10<=haveA2andB]]] & resB<=0]]]] & ~ [E [~ [[E [true U ~ [[~ [E [true U ~ [4<=haveB]]] | 10<=haveA2andB]]] & resB<=0]] U [E [true U ~ [[~ [haveAandB<=9] & E [haveB<=resA U 7<=Clients]]]] & ~ [[E [true U ~ [[~ [E [true U ~ [4<=haveB]]] | 10<=haveA2andB]]] & resB<=0]]]]]]
abstracting: (resB<=0)
states: 120
abstracting: (10<=haveA2andB)
states: 0
abstracting: (4<=haveB)
states: 147
abstracting: (7<=Clients)
states: 56
abstracting: (haveB<=resA)
states: 252
abstracting: (haveAandB<=9)
states: 624
abstracting: (resB<=0)
states: 120
abstracting: (10<=haveA2andB)
states: 0
abstracting: (4<=haveB)
states: 147
abstracting: (resB<=0)
states: 120
abstracting: (10<=haveA2andB)
states: 0
abstracting: (4<=haveB)
states: 147
..
EG iterations: 2
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EX [[A [~ [AG [[haveA2andB<=haveA2andB | Clients<=2]]] U [EG [[2<=haveA & haveB<=8]] | AX [AX [haveB<=9]]]] | EG [A [~ [EF [resA<=4]] U EX [2<=haveA]]]]]
normalized: EX [[EG [[~ [EG [~ [EX [2<=haveA]]]] & ~ [E [~ [EX [2<=haveA]] U [E [true U resA<=4] & ~ [EX [2<=haveA]]]]]]] | [~ [EG [~ [[~ [EX [EX [~ [haveB<=9]]]] | EG [[2<=haveA & haveB<=8]]]]]] & ~ [E [~ [[~ [EX [EX [~ [haveB<=9]]]] | EG [[2<=haveA & haveB<=8]]]] U [~ [E [true U ~ [[haveA2andB<=haveA2andB | Clients<=2]]]] & ~ [[~ [EX [EX [~ [haveB<=9]]]] | EG [[2<=haveA & haveB<=8]]]]]]]]]]
abstracting: (haveB<=8)
states: 624
abstracting: (2<=haveA)
states: 199
.
EG iterations: 1
abstracting: (haveB<=9)
states: 624
..abstracting: (Clients<=2)
states: 141
abstracting: (haveA2andB<=haveA2andB)
states: 624
abstracting: (haveB<=8)
states: 624
abstracting: (2<=haveA)
states: 199
.
EG iterations: 1
abstracting: (haveB<=9)
states: 624
..abstracting: (haveB<=8)
states: 624
abstracting: (2<=haveA)
states: 199
.
EG iterations: 1
abstracting: (haveB<=9)
states: 624
...
EG iterations: 1
abstracting: (2<=haveA)
states: 199
.abstracting: (resA<=4)
states: 617
abstracting: (2<=haveA)
states: 199
.abstracting: (2<=haveA)
states: 199
...............
EG iterations: 14
.
EG iterations: 1
.-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: ~ [A [haveA2andB<=resB U [resA<=3 | [~ [EG [~ [7<=haveA2]]] | [EG [A [resA<=resA U haveA2<=8]] & AX [~ [haveA<=haveA]]]]]]]
normalized: ~ [[~ [EG [~ [[[[~ [EX [haveA<=haveA]] & EG [[~ [EG [~ [haveA2<=8]]] & ~ [E [~ [haveA2<=8] U [~ [resA<=resA] & ~ [haveA2<=8]]]]]]] | ~ [EG [~ [7<=haveA2]]]] | resA<=3]]]] & ~ [E [~ [[[[~ [EX [haveA<=haveA]] & EG [[~ [EG [~ [haveA2<=8]]] & ~ [E [~ [haveA2<=8] U [~ [resA<=resA] & ~ [haveA2<=8]]]]]]] | ~ [EG [~ [7<=haveA2]]]] | resA<=3]] U [~ [haveA2andB<=resB] & ~ [[[[~ [EX [haveA<=haveA]] & EG [[~ [EG [~ [haveA2<=8]]] & ~ [E [~ [haveA2<=8] U [~ [resA<=resA] & ~ [haveA2<=8]]]]]]] | ~ [EG [~ [7<=haveA2]]]] | resA<=3]]]]]]]
abstracting: (resA<=3)
states: 591
abstracting: (7<=haveA2)
states: 0
EG iterations: 0
abstracting: (haveA2<=8)
states: 624
abstracting: (resA<=resA)
states: 624
abstracting: (haveA2<=8)
states: 624
abstracting: (haveA2<=8)
states: 624
.
EG iterations: 1
EG iterations: 0
abstracting: (haveA<=haveA)
states: 624
.abstracting: (haveA2andB<=resB)
states: 507
abstracting: (resA<=3)
states: 591
abstracting: (7<=haveA2)
states: 0
EG iterations: 0
abstracting: (haveA2<=8)
states: 624
abstracting: (resA<=resA)
states: 624
abstracting: (haveA2<=8)
states: 624
abstracting: (haveA2<=8)
states: 624
.
EG iterations: 1
EG iterations: 0
abstracting: (haveA<=haveA)
states: 624
.abstracting: (resA<=3)
states: 591
abstracting: (7<=haveA2)
states: 0
EG iterations: 0
abstracting: (haveA2<=8)
states: 624
abstracting: (resA<=resA)
states: 624
abstracting: (haveA2<=8)
states: 624
abstracting: (haveA2<=8)
states: 624
.
EG iterations: 1
EG iterations: 0
abstracting: (haveA<=haveA)
states: 624
...
EG iterations: 2
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[[~ [[~ [Clients<=haveA2andB] | haveB<=6]] & [haveB<=4 & [~ [EX [haveB<=Clients]] | [AF [1<=resB] & AF [8<=haveAandB]]]]] & E [resB<=8 U ~ [EX [haveA2<=haveAandB]]]]]
normalized: ~ [E [true U ~ [[E [resB<=8 U ~ [EX [haveA2<=haveAandB]]] & [[[[~ [EG [~ [8<=haveAandB]]] & ~ [EG [~ [1<=resB]]]] | ~ [EX [haveB<=Clients]]] & haveB<=4] & ~ [[~ [Clients<=haveA2andB] | haveB<=6]]]]]]]
abstracting: (haveB<=6)
states: 624
abstracting: (Clients<=haveA2andB)
states: 66
abstracting: (haveB<=4)
states: 558
abstracting: (haveB<=Clients)
states: 453
.abstracting: (1<=resB)
states: 504
............
EG iterations: 12
abstracting: (8<=haveAandB)
states: 0
EG iterations: 0
abstracting: (haveA2<=haveAandB)
states: 359
.abstracting: (resB<=8)
states: 624
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: A [AG [[[AX [AG [8<=haveA2]] | ~ [[EF [Clients<=Clients] | AX [Clients<=resA]]]] & [[~ [EX [10<=haveB]] & [[haveA<=9 & 9<=resA] | ~ [8<=resB]]] & EG [[8<=haveAandB | resB<=7]]]]] U [EG [~ [[AX [Clients<=haveA] | 7<=resA]]] | AF [EF [AF [resA<=1]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [E [true U ~ [EG [~ [resA<=1]]]]]]] | EG [~ [[~ [EX [~ [Clients<=haveA]]] | 7<=resA]]]]]]] & ~ [E [~ [[~ [EG [~ [E [true U ~ [EG [~ [resA<=1]]]]]]] | EG [~ [[~ [EX [~ [Clients<=haveA]]] | 7<=resA]]]]] U [E [true U ~ [[[EG [[8<=haveAandB | resB<=7]] & [[~ [8<=resB] | [haveA<=9 & 9<=resA]] & ~ [EX [10<=haveB]]]] & [~ [[~ [EX [~ [Clients<=resA]]] | E [true U Clients<=Clients]]] | ~ [EX [E [true U ~ [8<=haveA2]]]]]]]] & ~ [[~ [EG [~ [E [true U ~ [EG [~ [resA<=1]]]]]]] | EG [~ [[~ [EX [~ [Clients<=haveA]]] | 7<=resA]]]]]]]]]
abstracting: (7<=resA)
states: 0
abstracting: (Clients<=haveA)
states: 112
..
EG iterations: 1
abstracting: (resA<=1)
states: 421
..
EG iterations: 2
.
EG iterations: 1
abstracting: (8<=haveA2)
states: 0
.abstracting: (Clients<=Clients)
states: 624
abstracting: (Clients<=resA)
states: 66
.abstracting: (10<=haveB)
states: 0
.abstracting: (9<=resA)
states: 0
abstracting: (haveA<=9)
states: 624
abstracting: (8<=resB)
states: 0
abstracting: (resB<=7)
states: 624
abstracting: (8<=haveAandB)
states: 0
EG iterations: 0
abstracting: (7<=resA)
states: 0
abstracting: (Clients<=haveA)
states: 112
..
EG iterations: 1
abstracting: (resA<=1)
states: 421
..
EG iterations: 2
.
EG iterations: 1
abstracting: (7<=resA)
states: 0
abstracting: (Clients<=haveA)
states: 112
..
EG iterations: 1
abstracting: (resA<=1)
states: 421
..
EG iterations: 2
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: ~ [E [[[[AG [AF [8<=haveB]] | A [[resA<=Clients & 7<=haveB] U [haveB<=0 | 10<=resA]]] & ~ [[haveAandB<=resA | [haveA2<=2 | 7<=Clients]]]] & ~ [AG [[[3<=haveAandB | haveAandB<=Clients] | 4<=resB]]]] U ~ [resA<=haveAandB]]]
normalized: ~ [E [[E [true U ~ [[[3<=haveAandB | haveAandB<=Clients] | 4<=resB]]] & [~ [[[haveA2<=2 | 7<=Clients] | haveAandB<=resA]] & [[~ [EG [~ [[haveB<=0 | 10<=resA]]]] & ~ [E [~ [[haveB<=0 | 10<=resA]] U [~ [[resA<=Clients & 7<=haveB]] & ~ [[haveB<=0 | 10<=resA]]]]]] | ~ [E [true U EG [~ [8<=haveB]]]]]]] U ~ [resA<=haveAandB]]]
abstracting: (resA<=haveAandB)
states: 354
abstracting: (8<=haveB)
states: 0
EG iterations: 0
abstracting: (10<=resA)
states: 0
abstracting: (haveB<=0)
states: 126
abstracting: (7<=haveB)
states: 0
abstracting: (resA<=Clients)
states: 609
abstracting: (10<=resA)
states: 0
abstracting: (haveB<=0)
states: 126
abstracting: (10<=resA)
states: 0
abstracting: (haveB<=0)
states: 126
.
EG iterations: 1
abstracting: (haveAandB<=resA)
states: 440
abstracting: (7<=Clients)
states: 56
abstracting: (haveA2<=2)
states: 534
abstracting: (4<=resB)
states: 153
abstracting: (haveAandB<=Clients)
states: 609
abstracting: (3<=haveAandB)
states: 48
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [[~ [A [~ [[haveA2andB<=8 | haveB<=resB]] U EG [haveA2<=haveA]]] & [~ [[[[Clients<=haveA2andB & Clients<=4] & haveA2andB<=0] & [[7<=haveB & haveAandB<=resB] | A [haveA<=resB U resB<=5]]]] | AF [[haveA2<=haveA2andB | EG [5<=haveA]]]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [[EG [5<=haveA] | haveA2<=haveA2andB]]]] | ~ [[[[~ [EG [~ [resB<=5]]] & ~ [E [~ [resB<=5] U [~ [haveA<=resB] & ~ [resB<=5]]]]] | [7<=haveB & haveAandB<=resB]] & [[Clients<=haveA2andB & Clients<=4] & haveA2andB<=0]]]] & ~ [[~ [EG [~ [EG [haveA2<=haveA]]]] & ~ [E [~ [EG [haveA2<=haveA]] U [[haveA2andB<=8 | haveB<=resB] & ~ [EG [haveA2<=haveA]]]]]]]]]]]
abstracting: (haveA2<=haveA)
states: 385
..
EG iterations: 2
abstracting: (haveB<=resB)
states: 348
abstracting: (haveA2andB<=8)
states: 624
abstracting: (haveA2<=haveA)
states: 385
..
EG iterations: 2
abstracting: (haveA2<=haveA)
states: 385
..
EG iterations: 2
..
EG iterations: 2
abstracting: (haveA2andB<=0)
states: 316
abstracting: (Clients<=4)
states: 372
abstracting: (Clients<=haveA2andB)
states: 66
abstracting: (haveAandB<=resB)
states: 507
abstracting: (7<=haveB)
states: 0
abstracting: (resB<=5)
states: 603
abstracting: (haveA<=resB)
states: 503
abstracting: (resB<=5)
states: 603
abstracting: (resB<=5)
states: 603
............
EG iterations: 12
abstracting: (haveA2<=haveA2andB)
states: 359
abstracting: (5<=haveA)
states: 6
..
EG iterations: 2
.......................
EG iterations: 23
....
EG iterations: 4
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [EG [resB<=10] & A [~ [[EG [[A [3<=resB U haveA2andB<=haveB] | 4<=haveB]] | [[EG [haveA2<=7] & haveB<=Clients] | [AX [resA<=haveAandB] | EX [1<=haveAandB]]]]] U [9<=haveB | E [~ [[[resA<=resA & haveAandB<=1] & AF [haveA2<=2]]] U [[~ [resB<=haveAandB] & ~ [Clients<=haveA2andB]] | ~ [[haveB<=Clients & haveA2andB<=resB]]]]]]]
normalized: [[~ [EG [~ [[9<=haveB | E [~ [[~ [EG [~ [haveA2<=2]]] & [resA<=resA & haveAandB<=1]]] U [~ [[haveB<=Clients & haveA2andB<=resB]] | [~ [Clients<=haveA2andB] & ~ [resB<=haveAandB]]]]]]]] & ~ [E [~ [[9<=haveB | E [~ [[~ [EG [~ [haveA2<=2]]] & [resA<=resA & haveAandB<=1]]] U [~ [[haveB<=Clients & haveA2andB<=resB]] | [~ [Clients<=haveA2andB] & ~ [resB<=haveAandB]]]]]] U [[[[EX [1<=haveAandB] | ~ [EX [~ [resA<=haveAandB]]]] | [haveB<=Clients & EG [haveA2<=7]]] | EG [[4<=haveB | [~ [EG [~ [haveA2andB<=haveB]]] & ~ [E [~ [haveA2andB<=haveB] U [~ [3<=resB] & ~ [haveA2andB<=haveB]]]]]]]] & ~ [[9<=haveB | E [~ [[~ [EG [~ [haveA2<=2]]] & [resA<=resA & haveAandB<=1]]] U [~ [[haveB<=Clients & haveA2andB<=resB]] | [~ [Clients<=haveA2andB] & ~ [resB<=haveAandB]]]]]]]]]] & EG [resB<=10]]
abstracting: (resB<=10)
states: 624
EG iterations: 0
abstracting: (resB<=haveAandB)
states: 227
abstracting: (Clients<=haveA2andB)
states: 66
abstracting: (haveA2andB<=resB)
states: 507
abstracting: (haveB<=Clients)
states: 453
abstracting: (haveAandB<=1)
states: 491
abstracting: (resA<=resA)
states: 624
abstracting: (haveA2<=2)
states: 534
.
EG iterations: 1
abstracting: (9<=haveB)
states: 0
abstracting: (haveA2andB<=haveB)
states: 507
abstracting: (3<=resB)
states: 258
abstracting: (haveA2andB<=haveB)
states: 507
abstracting: (haveA2andB<=haveB)
states: 507
..............
EG iterations: 14
abstracting: (4<=haveB)
states: 147
.
EG iterations: 1
abstracting: (haveA2<=7)
states: 624
EG iterations: 0
abstracting: (haveB<=Clients)
states: 453
abstracting: (resA<=haveAandB)
states: 354
.abstracting: (1<=haveAandB)
states: 308
.abstracting: (resB<=haveAandB)
states: 227
abstracting: (Clients<=haveA2andB)
states: 66
abstracting: (haveA2andB<=resB)
states: 507
abstracting: (haveB<=Clients)
states: 453
abstracting: (haveAandB<=1)
states: 491
abstracting: (resA<=resA)
states: 624
abstracting: (haveA2<=2)
states: 534
.
EG iterations: 1
abstracting: (9<=haveB)
states: 0
abstracting: (resB<=haveAandB)
states: 227
abstracting: (Clients<=haveA2andB)
states: 66
abstracting: (haveA2andB<=resB)
states: 507
abstracting: (haveB<=Clients)
states: 453
abstracting: (haveAandB<=1)
states: 491
abstracting: (resA<=resA)
states: 624
abstracting: (haveA2<=2)
states: 534
.
EG iterations: 1
abstracting: (9<=haveB)
states: 0
......
EG iterations: 6
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vN-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
totally nodes used: 9396 (9.4e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 37138 24651 61789
used/not used/entry size/cache size: 31098 67077766 16 1024MB
basic ops cache: hits/miss/sum: 19334 23580 42914
used/not used/entry size/cache size: 33809 16743407 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: 2698 1717 4415
used/not used/entry size/cache size: 1717 8386891 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 67100622
1 7639
2 391
3 136
4 22
5 14
6 8
7 2
8 3
9 2
>= 10 25
Total processing time: 0m 4.633sec
BK_STOP 1679868259273
--------------------
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:131 (21), effective:40 (6)
initing FirstDep: 0m 0.000sec
iterations count:123 (20), effective:33 (5)
iterations count:10 (1), effective:2 (0)
iterations count:6 (1), effective:0 (0)
iterations count:6 (1), effective:0 (0)
iterations count:12 (2), effective:3 (0)
iterations count:18 (3), effective:3 (0)
iterations count:6 (1), effective:0 (0)
iterations count:45 (7), effective:11 (1)
iterations count:6 (1), effective:0 (0)
iterations count:40 (6), effective:10 (1)
iterations count:6 (1), effective:0 (0)
iterations count:45 (7), effective:11 (1)
iterations count:6 (1), effective:0 (0)
iterations count:6 (1), effective:0 (0)
iterations count:45 (7), effective:11 (1)
iterations count:6 (1), effective:0 (0)
iterations count:8 (1), effective:1 (0)
iterations count:6 (1), effective:0 (0)
iterations count:93 (15), effective:31 (5)
iterations count:83 (13), effective:28 (4)
iterations count:6 (1), effective:0 (0)
iterations count:14 (2), effective:4 (0)
iterations count:6 (1), effective:0 (0)
iterations count:6 (1), effective:0 (0)
iterations count:6 (1), effective:0 (0)
iterations count:14 (2), effective:4 (0)
iterations count:14 (2), effective:4 (0)
iterations count:6 (1), effective:0 (0)
iterations count:6 (1), effective:0 (0)
iterations count:91 (15), effective:32 (5)
iterations count:11 (1), effective:1 (0)
iterations count:6 (1), effective:0 (0)
iterations count:33 (5), effective:10 (1)
iterations count:21 (3), effective:9 (1)
iterations count:33 (5), effective:10 (1)
iterations count:6 (1), effective:0 (0)
iterations count:33 (5), effective:10 (1)
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-nC00010vN"
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-nC00010vN, 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-167912692500793"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00010vN.tgz
mv TwoPhaseLocking-PT-nC00010vN 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 '
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 ;