About the Execution of Marcie for TwoPhaseLocking-PT-nC00010vD
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5447.716 | 4778.00 | 4820.00 | 160.80 | FTFTFFFTTTTFTTFT | 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-167912692500790.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692500790
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679868226604
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC00010vD
Not applying reductions.
Model is PT
ReachabilityCardinality 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=ReachabilityCardinality.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.917sec
RS generation: 0m 0.001sec
-> reachability set: #nodes 252 (2.5e+02) #states 503
starting MCC model checker
--------------------------
checking: AG [3<=haveA2andB]
normalized: ~ [E [true U ~ [3<=haveA2andB]]]
abstracting: (3<=haveA2andB)
states: 33
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [5<=Clients]
normalized: ~ [E [true U ~ [5<=Clients]]]
abstracting: (5<=Clients)
states: 252
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [haveA<=haveA2]
normalized: ~ [E [true U ~ [haveA<=haveA2]]]
abstracting: (haveA<=haveA2)
states: 307
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [haveA2andB<=haveB]
normalized: E [true U haveA2andB<=haveB]
abstracting: (haveA2andB<=haveB)
states: 396
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [haveAandB<=haveA2andB]]
normalized: E [true U ~ [haveAandB<=haveA2andB]]
abstracting: (haveAandB<=haveA2andB)
states: 337
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [[[haveB<=4 & 7<=haveA2andB] & haveA2<=2]]]
normalized: E [true U ~ [[[haveB<=4 & 7<=haveA2andB] & haveA2<=2]]]
abstracting: (haveA2<=2)
states: 426
abstracting: (7<=haveA2andB)
states: 0
abstracting: (haveB<=4)
states: 483
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[~ [[haveAandB<=haveA2 | haveB<=2]] | resA<=1]]
normalized: E [true U [~ [[haveAandB<=haveA2 | haveB<=2]] | resA<=1]]
abstracting: (resA<=1)
states: 335
abstracting: (haveB<=2)
states: 351
abstracting: (haveAandB<=haveA2)
states: 365
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[~ [[4<=Clients & [[[8<=haveA2 | 7<=haveAandB] & ~ [[9<=Clients | 3<=haveA2andB]]] & [haveAandB<=10 | 2<=haveA2andB]]]] | ~ [resB<=0]]]]
normalized: ~ [E [true U [~ [resB<=0] | ~ [[[[haveAandB<=10 | 2<=haveA2andB] & [~ [[9<=Clients | 3<=haveA2andB]] & [8<=haveA2 | 7<=haveAandB]]] & 4<=Clients]]]]]
abstracting: (4<=Clients)
states: 357
abstracting: (7<=haveAandB)
states: 0
abstracting: (8<=haveA2)
states: 0
abstracting: (3<=haveA2andB)
states: 33
abstracting: (9<=Clients)
states: 6
abstracting: (2<=haveA2andB)
states: 98
abstracting: (haveAandB<=10)
states: 503
abstracting: (resB<=0)
states: 125
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [~ [[[[[7<=haveAandB & 4<=resA] & haveA<=resB] & [~ [haveA2<=haveAandB] & resA<=Clients]] & [haveA2<=9 & [[[haveB<=8 & haveAandB<=haveA2andB] | ~ [[haveA2andB<=5 | haveA2andB<=resB]]] & ~ [haveA2andB<=haveA2andB]]]]]]
normalized: ~ [E [true U [[[[~ [[haveA2andB<=5 | haveA2andB<=resB]] | [haveB<=8 & haveAandB<=haveA2andB]] & ~ [haveA2andB<=haveA2andB]] & haveA2<=9] & [[~ [haveA2<=haveAandB] & resA<=Clients] & [[7<=haveAandB & 4<=resA] & haveA<=resB]]]]]
abstracting: (haveA<=resB)
states: 377
abstracting: (4<=resA)
states: 28
abstracting: (7<=haveAandB)
states: 0
abstracting: (resA<=Clients)
states: 503
abstracting: (haveA2<=haveAandB)
states: 280
abstracting: (haveA2<=9)
states: 503
abstracting: (haveA2andB<=haveA2andB)
states: 503
abstracting: (haveAandB<=haveA2andB)
states: 337
abstracting: (haveB<=8)
states: 503
abstracting: (haveA2andB<=resB)
states: 396
abstracting: (haveA2andB<=5)
states: 503
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[haveA2<=2 & [[haveAandB<=haveA2 | ~ [resB<=haveA2]] | ~ [[~ [[~ [resB<=haveA] | ~ [haveB<=haveAandB]]] & [~ [[haveA<=haveAandB | [~ [haveA2<=10] | ~ [haveB<=8]]]] & [[[resA<=1 | ~ [resB<=haveAandB]] | haveA2<=1] & resA<=0]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[[[~ [resB<=haveAandB] | resA<=1] | haveA2<=1] & resA<=0] & ~ [[[~ [haveB<=8] | ~ [haveA2<=10]] | haveA<=haveAandB]]] & ~ [[~ [haveB<=haveAandB] | ~ [resB<=haveA]]]]] | [~ [resB<=haveA2] | haveAandB<=haveA2]] & haveA2<=2]]]]
abstracting: (haveA2<=2)
states: 426
abstracting: (haveAandB<=haveA2)
states: 365
abstracting: (resB<=haveA2)
states: 251
abstracting: (resB<=haveA)
states: 251
abstracting: (haveB<=haveAandB)
states: 213
abstracting: (haveA<=haveAandB)
states: 279
abstracting: (haveA2<=10)
states: 503
abstracting: (haveB<=8)
states: 503
abstracting: (resA<=0)
states: 195
abstracting: (haveA2<=1)
states: 336
abstracting: (resA<=1)
states: 335
abstracting: (resB<=haveAandB)
states: 212
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [~ [[~ [haveB<=1] | [6<=haveA | [~ [[[[[haveA2andB<=10 | 6<=Clients] | [haveA2andB<=resB | haveA2andB<=resB]] | ~ [[haveAandB<=haveA & resB<=2]]] & resA<=haveA2andB]] & [~ [[~ [resA<=haveA2] | haveA2<=haveA]] & ~ [[7<=Clients & [[resA<=0 | haveB<=7] & haveB<=3]]]]]]]]]
normalized: ~ [E [true U [[[[~ [[[[resA<=0 | haveB<=7] & haveB<=3] & 7<=Clients]] & ~ [[~ [resA<=haveA2] | haveA2<=haveA]]] & ~ [[[~ [[haveAandB<=haveA & resB<=2]] | [[haveA2andB<=resB | haveA2andB<=resB] | [haveA2andB<=10 | 6<=Clients]]] & resA<=haveA2andB]]] | 6<=haveA] | ~ [haveB<=1]]]]
abstracting: (haveB<=1)
states: 246
abstracting: (6<=haveA)
states: 0
abstracting: (resA<=haveA2andB)
states: 279
abstracting: (6<=Clients)
states: 126
abstracting: (haveA2andB<=10)
states: 503
abstracting: (haveA2andB<=resB)
states: 396
abstracting: (haveA2andB<=resB)
states: 396
abstracting: (resB<=2)
states: 350
abstracting: (haveAandB<=haveA)
states: 365
abstracting: (haveA2<=haveA)
states: 308
abstracting: (resA<=haveA2)
states: 307
abstracting: (7<=Clients)
states: 56
abstracting: (haveB<=3)
states: 432
abstracting: (haveB<=7)
states: 503
abstracting: (resA<=0)
states: 195
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [~ [[[[[~ [[[haveA2<=haveAandB | haveA<=8] | ~ [2<=resB]]] & haveA2<=4] & [Clients<=resA & [[2<=haveAandB | [[3<=haveB & 3<=resB] & [haveA<=Clients | Clients<=5]]] & ~ [[haveB<=haveAandB | [haveA<=haveA2andB & haveA2andB<=resB]]]]]] & [~ [6<=resB] & [5<=haveAandB | ~ [[resB<=Clients | resB<=resA]]]]] & haveAandB<=10]]]
normalized: ~ [E [true U [[[[~ [[resB<=Clients | resB<=resA]] | 5<=haveAandB] & ~ [6<=resB]] & [[[~ [[[haveA<=haveA2andB & haveA2andB<=resB] | haveB<=haveAandB]] & [[[haveA<=Clients | Clients<=5] & [3<=haveB & 3<=resB]] | 2<=haveAandB]] & Clients<=resA] & [~ [[~ [2<=resB] | [haveA2<=haveAandB | haveA<=8]]] & haveA2<=4]]] & haveAandB<=10]]]
abstracting: (haveAandB<=10)
states: 503
abstracting: (haveA2<=4)
states: 498
abstracting: (haveA<=8)
states: 503
abstracting: (haveA2<=haveAandB)
states: 280
abstracting: (2<=resB)
states: 258
abstracting: (Clients<=resA)
states: 20
abstracting: (2<=haveAandB)
states: 98
abstracting: (3<=resB)
states: 153
abstracting: (3<=haveB)
states: 152
abstracting: (Clients<=5)
states: 377
abstracting: (haveA<=Clients)
states: 464
abstracting: (haveB<=haveAandB)
states: 213
abstracting: (haveA2andB<=resB)
states: 396
abstracting: (haveA<=haveA2andB)
states: 279
abstracting: (6<=resB)
states: 0
abstracting: (5<=haveAandB)
states: 1
abstracting: (resB<=resA)
states: 251
abstracting: (resB<=Clients)
states: 503
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[[~ [[[[[[[haveB<=0 | haveA<=8] | ~ [resB<=6]] & ~ [resB<=7]] | [~ [[haveAandB<=haveA2 | haveA2<=haveA2]] & ~ [[6<=resA | 8<=haveB]]]] | [[[6<=haveA2 & Clients<=10] | 3<=haveAandB] | ~ [[Clients<=Clients & haveB<=resB]]]] | [[haveA2<=haveA2 | [resA<=5 | [[resA<=6 | 3<=Clients] | [haveA2<=8 | resA<=10]]]] & [~ [haveA<=haveAandB] & Clients<=haveB]]]] | ~ [haveA2andB<=0]] | 4<=resA]]
normalized: E [true U [[~ [haveA2andB<=0] | ~ [[[[~ [haveA<=haveAandB] & Clients<=haveB] & [[[[haveA2<=8 | resA<=10] | [resA<=6 | 3<=Clients]] | resA<=5] | haveA2<=haveA2]] | [[~ [[Clients<=Clients & haveB<=resB]] | [[6<=haveA2 & Clients<=10] | 3<=haveAandB]] | [[~ [[6<=resA | 8<=haveB]] & ~ [[haveAandB<=haveA2 | haveA2<=haveA2]]] | [~ [resB<=7] & [~ [resB<=6] | [haveB<=0 | haveA<=8]]]]]]]] | 4<=resA]]
abstracting: (4<=resA)
states: 28
abstracting: (haveA<=8)
states: 503
abstracting: (haveB<=0)
states: 126
abstracting: (resB<=6)
states: 503
abstracting: (resB<=7)
states: 503
abstracting: (haveA2<=haveA2)
states: 503
abstracting: (haveAandB<=haveA2)
states: 365
abstracting: (8<=haveB)
states: 0
abstracting: (6<=resA)
states: 0
abstracting: (3<=haveAandB)
states: 33
abstracting: (Clients<=10)
states: 503
abstracting: (6<=haveA2)
states: 0
abstracting: (haveB<=resB)
states: 282
abstracting: (Clients<=Clients)
states: 503
abstracting: (haveA2<=haveA2)
states: 503
abstracting: (resA<=5)
states: 503
abstracting: (3<=Clients)
states: 432
abstracting: (resA<=6)
states: 503
abstracting: (resA<=10)
states: 503
abstracting: (haveA2<=8)
states: 503
abstracting: (Clients<=haveB)
states: 116
abstracting: (haveA<=haveAandB)
states: 279
abstracting: (haveA2andB<=0)
states: 265
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[haveA2andB<=haveA2andB & [[~ [[[[6<=haveAandB | [[haveA2andB<=haveB | resB<=1] | [Clients<=resA & 5<=haveA]]] | ~ [[~ [7<=haveA2] & haveAandB<=haveAandB]]] | [[haveA2andB<=haveA & [7<=haveA | ~ [resB<=haveA2]]] | ~ [8<=haveAandB]]]] | [[haveA2andB<=3 & [7<=resA | [[~ [resA<=6] | [haveB<=6 | haveA2andB<=4]] | resA<=6]]] & ~ [[[resB<=4 | haveAandB<=haveA2andB] & ~ [Clients<=haveA2]]]]] | haveAandB<=3]]]
normalized: E [true U [[[[~ [[~ [Clients<=haveA2] & [resB<=4 | haveAandB<=haveA2andB]]] & [[[[[haveB<=6 | haveA2andB<=4] | ~ [resA<=6]] | resA<=6] | 7<=resA] & haveA2andB<=3]] | ~ [[[~ [8<=haveAandB] | [[~ [resB<=haveA2] | 7<=haveA] & haveA2andB<=haveA]] | [~ [[~ [7<=haveA2] & haveAandB<=haveAandB]] | [[[Clients<=resA & 5<=haveA] | [haveA2andB<=haveB | resB<=1]] | 6<=haveAandB]]]]] | haveAandB<=3] & haveA2andB<=haveA2andB]]
abstracting: (haveA2andB<=haveA2andB)
states: 503
abstracting: (haveAandB<=3)
states: 495
abstracting: (6<=haveAandB)
states: 0
abstracting: (resB<=1)
states: 245
abstracting: (haveA2andB<=haveB)
states: 396
abstracting: (5<=haveA)
states: 6
abstracting: (Clients<=resA)
states: 20
abstracting: (haveAandB<=haveAandB)
states: 503
abstracting: (7<=haveA2)
states: 0
abstracting: (haveA2andB<=haveA)
states: 365
abstracting: (7<=haveA)
states: 0
abstracting: (resB<=haveA2)
states: 251
abstracting: (8<=haveAandB)
states: 0
abstracting: (haveA2andB<=3)
states: 495
abstracting: (7<=resA)
states: 0
abstracting: (resA<=6)
states: 503
abstracting: (resA<=6)
states: 503
abstracting: (haveA2andB<=4)
states: 502
abstracting: (haveB<=6)
states: 503
abstracting: (haveAandB<=haveA2andB)
states: 337
abstracting: (resB<=4)
states: 482
abstracting: (Clients<=haveA2)
states: 68
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[~ [[[[[~ [[5<=haveB & 5<=haveB]] & ~ [Clients<=8]] | [4<=haveA | [~ [resA<=haveB] & ~ [[7<=haveB & 7<=resA]]]]] & ~ [[8<=resB | haveA<=resB]]] | [[[~ [[~ [6<=resA] | haveB<=haveA2andB]] | ~ [[[haveAandB<=haveA | haveA2andB<=4] & Clients<=haveB]]] | 9<=haveA] & 5<=haveA]]] & [[~ [[~ [7<=haveA] & [haveA<=9 | haveA2<=2]]] | 4<=haveB] | [~ [[[[[4<=resB | resB<=7] & ~ [5<=Clients]] & ~ [2<=Clients]] | haveAandB<=0]] & ~ [haveB<=2]]]]]
normalized: E [true U [[[~ [haveB<=2] & ~ [[[~ [2<=Clients] & [~ [5<=Clients] & [4<=resB | resB<=7]]] | haveAandB<=0]]] | [~ [[[haveA<=9 | haveA2<=2] & ~ [7<=haveA]]] | 4<=haveB]] & ~ [[[[[~ [[[haveAandB<=haveA | haveA2andB<=4] & Clients<=haveB]] | ~ [[~ [6<=resA] | haveB<=haveA2andB]]] | 9<=haveA] & 5<=haveA] | [~ [[8<=resB | haveA<=resB]] & [[4<=haveA | [~ [[7<=haveB & 7<=resA]] & ~ [resA<=haveB]]] | [~ [Clients<=8] & ~ [[5<=haveB & 5<=haveB]]]]]]]]]
abstracting: (5<=haveB)
states: 20
abstracting: (5<=haveB)
states: 20
abstracting: (Clients<=8)
states: 497
abstracting: (resA<=haveB)
states: 377
abstracting: (7<=resA)
states: 0
abstracting: (7<=haveB)
states: 0
abstracting: (4<=haveA)
states: 28
abstracting: (haveA<=resB)
states: 377
abstracting: (8<=resB)
states: 0
abstracting: (5<=haveA)
states: 6
abstracting: (9<=haveA)
states: 0
abstracting: (haveB<=haveA2andB)
states: 213
abstracting: (6<=resA)
states: 0
abstracting: (Clients<=haveB)
states: 116
abstracting: (haveA2andB<=4)
states: 502
abstracting: (haveAandB<=haveA)
states: 365
abstracting: (4<=haveB)
states: 71
abstracting: (7<=haveA)
states: 0
abstracting: (haveA2<=2)
states: 426
abstracting: (haveA<=9)
states: 503
abstracting: (haveAandB<=0)
states: 265
abstracting: (resB<=7)
states: 503
abstracting: (4<=resB)
states: 72
abstracting: (5<=Clients)
states: 252
abstracting: (2<=Clients)
states: 477
abstracting: (haveB<=2)
states: 351
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[~ [[[[~ [1<=resB] | [[[~ [2<=resA] & 8<=haveB] | ~ [7<=Clients]] & [~ [haveA2<=haveA2andB] & ~ [[7<=haveA & resA<=5]]]]] & haveAandB<=1] | haveA2andB<=haveB]] & [[[[[haveA<=5 | 8<=Clients] | [haveB<=9 & [[[6<=haveA | haveA<=7] & [3<=haveA | haveA2<=1]] & [3<=resB & ~ [haveB<=haveB]]]]] | [~ [[5<=haveB & ~ [[resA<=10 & 7<=resB]]]] & haveB<=7]] | [[haveB<=haveA2andB & [[5<=Clients & ~ [1<=haveB]] & haveB<=7]] & [~ [resB<=resB] & ~ [[[[8<=resA & resA<=3] | ~ [haveA2<=4]] | [10<=haveB | ~ [6<=Clients]]]]]]] & Clients<=2]]]
normalized: E [true U [[[[[~ [[[~ [6<=Clients] | 10<=haveB] | [~ [haveA2<=4] | [8<=resA & resA<=3]]]] & ~ [resB<=resB]] & [[[~ [1<=haveB] & 5<=Clients] & haveB<=7] & haveB<=haveA2andB]] | [[~ [[~ [[resA<=10 & 7<=resB]] & 5<=haveB]] & haveB<=7] | [[[[~ [haveB<=haveB] & 3<=resB] & [[3<=haveA | haveA2<=1] & [6<=haveA | haveA<=7]]] & haveB<=9] | [haveA<=5 | 8<=Clients]]]] & Clients<=2] & ~ [[[[[[~ [[7<=haveA & resA<=5]] & ~ [haveA2<=haveA2andB]] & [~ [7<=Clients] | [~ [2<=resA] & 8<=haveB]]] | ~ [1<=resB]] & haveAandB<=1] | haveA2andB<=haveB]]]]
abstracting: (haveA2andB<=haveB)
states: 396
abstracting: (haveAandB<=1)
states: 405
abstracting: (1<=resB)
states: 378
abstracting: (8<=haveB)
states: 0
abstracting: (2<=resA)
states: 168
abstracting: (7<=Clients)
states: 56
abstracting: (haveA2<=haveA2andB)
states: 280
abstracting: (resA<=5)
states: 503
abstracting: (7<=haveA)
states: 0
abstracting: (Clients<=2)
states: 71
abstracting: (8<=Clients)
states: 21
abstracting: (haveA<=5)
states: 503
abstracting: (haveB<=9)
states: 503
abstracting: (haveA<=7)
states: 503
abstracting: (6<=haveA)
states: 0
abstracting: (haveA2<=1)
states: 336
abstracting: (3<=haveA)
states: 78
abstracting: (3<=resB)
states: 153
abstracting: (haveB<=haveB)
states: 503
abstracting: (haveB<=7)
states: 503
abstracting: (5<=haveB)
states: 20
abstracting: (7<=resB)
states: 0
abstracting: (resA<=10)
states: 503
abstracting: (haveB<=haveA2andB)
states: 213
abstracting: (haveB<=7)
states: 503
abstracting: (5<=Clients)
states: 252
abstracting: (1<=haveB)
states: 377
abstracting: (resB<=resB)
states: 503
abstracting: (resA<=3)
states: 475
abstracting: (8<=resA)
states: 0
abstracting: (haveA2<=4)
states: 498
abstracting: (10<=haveB)
states: 0
abstracting: (6<=Clients)
states: 126
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00010vD-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
totally nodes used: 4336 (4.3e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 12472 7901 20373
used/not used/entry size/cache size: 9577 67099287 16 1024MB
basic ops cache: hits/miss/sum: 15900 22392 38292
used/not used/entry size/cache size: 30648 16746568 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: 3520 1914 5434
used/not used/entry size/cache size: 1914 8386694 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 67105047
1 3576
2 162
3 32
4 14
5 3
6 5
7 6
8 4
9 4
>= 10 11
Total processing time: 0m 4.730sec
BK_STOP 1679868231382
--------------------
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.000sec
iterations count:133 (22), effective:42 (7)
initing FirstDep: 0m 0.000sec
iterations count:18 (3), effective:3 (0)
iterations count:30 (5), effective:10 (1)
iterations count:27 (4), effective:8 (1)
iterations count:26 (4), effective:5 (0)
iterations count:40 (6), effective:14 (2)
iterations count:6 (1), effective:0 (0)
iterations count:16 (2), effective:6 (1)
iterations count:6 (1), effective:0 (0)
iterations count:69 (11), effective:19 (3)
iterations count:55 (9), effective:19 (3)
iterations count:49 (8), effective:14 (2)
iterations count:16 (2), effective:2 (0)
iterations count:71 (11), effective:24 (4)
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167912692500790"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;