About the Execution of Marcie for TwoPhaseLocking-PT-nC00020vN
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5448.712 | 4698.00 | 4060.00 | 0.00 | TFFFFTFTTFTTTFFT | 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-167912692500814.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-nC00020vN, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692500814
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.2K Feb 25 17:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 17:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 17:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 17:31 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-nC00020vN-ReachabilityCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679868375699
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-nC00020vN
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_nC00020vN
(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.846sec
RS generation: 0m 0.007sec
-> reachability set: #nodes 1210 (1.2e+03) #states 7,997 (3)
starting MCC model checker
--------------------------
checking: AG [haveA2<=20]
normalized: ~ [E [true U ~ [haveA2<=20]]]
abstracting: (haveA2<=20)
states: 7,997 (3)
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [16<=haveB]
normalized: E [true U 16<=haveB]
abstracting: (16<=haveB)
states: 0
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [15<=haveA2]
normalized: E [true U 15<=haveA2]
abstracting: (15<=haveA2)
states: 0
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [resA<=19]
normalized: ~ [E [true U ~ [resA<=19]]]
abstracting: (resA<=19)
states: 7,997 (3)
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [19<=haveA]
normalized: E [true U 19<=haveA]
abstracting: (19<=haveA)
states: 0
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [resB<=resB]]
normalized: E [true U ~ [resB<=resB]]
abstracting: (resB<=resB)
states: 7,997 (3)
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[18<=haveAandB | 9<=haveA2andB]]
normalized: E [true U [18<=haveAandB | 9<=haveA2andB]]
abstracting: (9<=haveA2andB)
states: 13
abstracting: (18<=haveAandB)
states: 0
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EF [[~ [[7<=haveA2andB | haveA<=18]] & ~ [Clients<=resA]]]
normalized: E [true U [~ [Clients<=resA] & ~ [[7<=haveA2andB | haveA<=18]]]]
abstracting: (haveA<=18)
states: 7,997 (3)
abstracting: (7<=haveA2andB)
states: 133
abstracting: (Clients<=resA)
states: 231
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [~ [[[~ [[13<=haveA2 & 8<=haveA2]] | 20<=haveA2] & haveA<=10]]]
normalized: E [true U ~ [[[~ [[13<=haveA2 & 8<=haveA2]] | 20<=haveA2] & haveA<=10]]]
abstracting: (haveA<=10)
states: 7,997 (3)
abstracting: (20<=haveA2)
states: 0
abstracting: (8<=haveA2)
states: 165
abstracting: (13<=haveA2)
states: 0
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[~ [[~ [[[~ [haveA<=17] & resB<=6] & [~ [resB<=1] | [resA<=haveA & 20<=haveA]]]] & [~ [[haveB<=7 & resB<=Clients]] | resB<=haveA2]]] | resB<=15]]
normalized: ~ [E [true U ~ [[~ [[[~ [[haveB<=7 & resB<=Clients]] | resB<=haveA2] & ~ [[[[resA<=haveA & 20<=haveA] | ~ [resB<=1]] & [~ [haveA<=17] & resB<=6]]]]] | resB<=15]]]]
abstracting: (resB<=15)
states: 7,997 (3)
abstracting: (resB<=6)
states: 6,394 (3)
abstracting: (haveA<=17)
states: 7,997 (3)
abstracting: (resB<=1)
states: 1,991 (3)
abstracting: (20<=haveA)
states: 0
abstracting: (resA<=haveA)
states: 4,539 (3)
abstracting: (resB<=haveA2)
states: 2,992 (3)
abstracting: (resB<=Clients)
states: 7,876 (3)
abstracting: (haveB<=7)
states: 7,000 (3)
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: AG [[[[Clients<=Clients | ~ [[[~ [[[12<=haveA & 5<=haveA2] & ~ [haveA<=3]]] & [[~ [resA<=0] | 16<=haveA] & [[haveA2<=1 | haveA2andB<=7] & [Clients<=15 | haveA2andB<=6]]]] | [[6<=haveB & ~ [[13<=resB & resA<=resA]]] | [[[haveAandB<=9 & Clients<=8] | [18<=haveA & 15<=resA]] & ~ [haveA2<=resB]]]]]] & resA<=10] | [4<=haveA2andB | ~ [haveA<=haveA]]]]
normalized: ~ [E [true U ~ [[[~ [haveA<=haveA] | 4<=haveA2andB] | [[~ [[[[~ [haveA2<=resB] & [[18<=haveA & 15<=resA] | [haveAandB<=9 & Clients<=8]]] | [~ [[13<=resB & resA<=resA]] & 6<=haveB]] | [[[[Clients<=15 | haveA2andB<=6] & [haveA2<=1 | haveA2andB<=7]] & [~ [resA<=0] | 16<=haveA]] & ~ [[~ [haveA<=3] & [12<=haveA & 5<=haveA2]]]]]] | Clients<=Clients] & resA<=10]]]]]
abstracting: (resA<=10)
states: 7,997 (3)
abstracting: (Clients<=Clients)
states: 7,997 (3)
abstracting: (5<=haveA2)
states: 1,254 (3)
abstracting: (12<=haveA)
states: 0
abstracting: (haveA<=3)
states: 5,988 (3)
abstracting: (16<=haveA)
states: 0
abstracting: (resA<=0)
states: 1,991 (3)
abstracting: (haveA2andB<=7)
states: 7,949 (3)
abstracting: (haveA2<=1)
states: 3,650 (3)
abstracting: (haveA2andB<=6)
states: 7,864 (3)
abstracting: (Clients<=15)
states: 7,871 (3)
abstracting: (6<=haveB)
states: 2,313 (3)
abstracting: (resA<=resA)
states: 7,997 (3)
abstracting: (13<=resB)
states: 0
abstracting: (Clients<=8)
states: 3,993 (3)
abstracting: (haveAandB<=9)
states: 7,995 (3)
abstracting: (15<=resA)
states: 0
abstracting: (18<=haveA)
states: 0
abstracting: (haveA2<=resB)
states: 6,005 (3)
abstracting: (4<=haveA2andB)
states: 1,176 (3)
abstracting: (haveA<=haveA)
states: 7,997 (3)
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AG [[~ [[[[Clients<=haveB | ~ [Clients<=resA]] | [~ [haveA2andB<=9] & [[[haveAandB<=17 | ~ [resA<=14]] | resB<=haveAandB] & [[~ [resB<=8] & [haveB<=resB & resA<=16]] | ~ [[haveB<=haveA & Clients<=haveAandB]]]]]] & ~ [[[[15<=haveA2 | [haveA2<=haveAandB | Clients<=5]] & ~ [haveA2andB<=haveB]] | [1<=resA | Clients<=11]]]]] | ~ [[haveB<=resA & haveA2andB<=haveA2]]]]
normalized: ~ [E [true U ~ [[~ [[haveB<=resA & haveA2andB<=haveA2]] | ~ [[~ [[[1<=resA | Clients<=11] | [~ [haveA2andB<=haveB] & [[haveA2<=haveAandB | Clients<=5] | 15<=haveA2]]]] & [[[[~ [[haveB<=haveA & Clients<=haveAandB]] | [[haveB<=resB & resA<=16] & ~ [resB<=8]]] & [[~ [resA<=14] | haveAandB<=17] | resB<=haveAandB]] & ~ [haveA2andB<=9]] | [~ [Clients<=resA] | Clients<=haveB]]]]]]]]
abstracting: (Clients<=haveB)
states: 2,048 (3)
abstracting: (Clients<=resA)
states: 231
abstracting: (haveA2andB<=9)
states: 7,995 (3)
abstracting: (resB<=haveAandB)
states: 2,698 (3)
abstracting: (haveAandB<=17)
states: 7,997 (3)
abstracting: (resA<=14)
states: 7,997 (3)
abstracting: (resB<=8)
states: 7,444 (3)
abstracting: (resA<=16)
states: 7,997 (3)
abstracting: (haveB<=resB)
states: 4,249 (3)
abstracting: (Clients<=haveAandB)
states: 231
abstracting: (haveB<=haveA)
states: 3,003 (3)
abstracting: (15<=haveA2)
states: 0
abstracting: (Clients<=5)
states: 1,543 (3)
abstracting: (haveA2<=haveAandB)
states: 4,066 (3)
abstracting: (haveA2andB<=haveB)
states: 6,184 (3)
abstracting: (Clients<=11)
states: 6,710 (3)
abstracting: (1<=resA)
states: 6,006 (3)
abstracting: (haveA2andB<=haveA2)
states: 5,267 (3)
abstracting: (haveB<=resA)
states: 3,003 (3)
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: AG [[[~ [[[[[haveA<=12 & [~ [15<=haveA] | [haveB<=haveA2 | 9<=resA]]] & [Clients<=Clients & [~ [haveA2andB<=haveB] | ~ [15<=haveA]]]] & [~ [[[haveA2<=12 | haveA<=resB] | 8<=resB]] & [[[resA<=9 & haveA2<=haveA2] | haveA<=haveA2andB] | [[haveB<=12 | Clients<=16] & [haveA2<=14 & 9<=haveA2]]]]] & [resA<=haveA & [haveB<=2 & 1<=haveA2andB]]]] | 13<=haveAandB] | ~ [Clients<=haveA]]]
normalized: ~ [E [true U ~ [[~ [Clients<=haveA] | [13<=haveAandB | ~ [[[resA<=haveA & [haveB<=2 & 1<=haveA2andB]] & [[[[[haveA2<=14 & 9<=haveA2] & [haveB<=12 | Clients<=16]] | [haveA<=haveA2andB | [resA<=9 & haveA2<=haveA2]]] & ~ [[8<=resB | [haveA2<=12 | haveA<=resB]]]] & [[Clients<=Clients & [~ [15<=haveA] | ~ [haveA2andB<=haveB]]] & [haveA<=12 & [[haveB<=haveA2 | 9<=resA] | ~ [15<=haveA]]]]]]]]]]]]
abstracting: (15<=haveA)
states: 0
abstracting: (9<=resA)
states: 58
abstracting: (haveB<=haveA2)
states: 3,003 (3)
abstracting: (haveA<=12)
states: 7,997 (3)
abstracting: (haveA2andB<=haveB)
states: 6,184 (3)
abstracting: (15<=haveA)
states: 0
abstracting: (Clients<=Clients)
states: 7,997 (3)
abstracting: (haveA<=resB)
states: 6,005 (3)
abstracting: (haveA2<=12)
states: 7,997 (3)
abstracting: (8<=resB)
states: 1,008 (3)
abstracting: (haveA2<=haveA2)
states: 7,997 (3)
abstracting: (resA<=9)
states: 7,985 (3)
abstracting: (haveA<=haveA2andB)
states: 4,066 (3)
abstracting: (Clients<=16)
states: 7,941 (3)
abstracting: (haveB<=12)
states: 7,997 (3)
abstracting: (9<=haveA2)
states: 56
abstracting: (haveA2<=14)
states: 7,997 (3)
abstracting: (1<=haveA2andB)
states: 5,291 (3)
abstracting: (haveB<=2)
states: 2,992 (3)
abstracting: (resA<=haveA)
states: 4,539 (3)
abstracting: (13<=haveAandB)
states: 0
abstracting: (Clients<=haveA)
states: 870
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EF [[[~ [[~ [[[[[haveA2andB<=7 & 18<=resA] & [haveAandB<=7 | haveAandB<=resB]] | haveB<=0] & 3<=haveB]] & [[14<=haveAandB | [[[haveAandB<=haveA | haveB<=7] & [resB<=13 | 19<=resA]] | ~ [[16<=haveB | 11<=haveAandB]]]] & ~ [[~ [haveA2andB<=1] | [resA<=17 | 10<=resB]]]]]] | [[~ [10<=resA] | ~ [haveA2<=resA]] & [~ [Clients<=15] | [~ [Clients<=11] & [[~ [[haveB<=11 & 12<=haveB]] | [resB<=6 | haveA2<=haveA]] & [[[resB<=8 | 6<=haveA] & ~ [haveA2andB<=haveA2]] & haveA2<=haveA2andB]]]]]] & [[[[haveAandB<=19 & ~ [[3<=resA & [[resA<=haveA | haveB<=16] & Clients<=3]]]] & resA<=haveA2andB] | [haveA<=haveA & 7<=resA]] & [Clients<=haveA2 & ~ [[[~ [[4<=haveB | resA<=haveA2]] | haveA<=7] | 16<=haveA2]]]]]]
normalized: E [true U [[[Clients<=haveA2 & ~ [[16<=haveA2 | [haveA<=7 | ~ [[4<=haveB | resA<=haveA2]]]]]] & [[haveA<=haveA & 7<=resA] | [resA<=haveA2andB & [haveAandB<=19 & ~ [[3<=resA & [Clients<=3 & [resA<=haveA | haveB<=16]]]]]]]] & [[[[[[haveA2<=haveA2andB & [~ [haveA2andB<=haveA2] & [resB<=8 | 6<=haveA]]] & [[resB<=6 | haveA2<=haveA] | ~ [[haveB<=11 & 12<=haveB]]]] & ~ [Clients<=11]] | ~ [Clients<=15]] & [~ [haveA2<=resA] | ~ [10<=resA]]] | ~ [[[~ [[[resA<=17 | 10<=resB] | ~ [haveA2andB<=1]]] & [14<=haveAandB | [~ [[16<=haveB | 11<=haveAandB]] | [[resB<=13 | 19<=resA] & [haveAandB<=haveA | haveB<=7]]]]] & ~ [[3<=haveB & [haveB<=0 | [[haveAandB<=7 | haveAandB<=resB] & [haveA2andB<=7 & 18<=resA]]]]]]]]]]
abstracting: (18<=resA)
states: 0
abstracting: (haveA2andB<=7)
states: 7,949 (3)
abstracting: (haveAandB<=resB)
states: 6,184 (3)
abstracting: (haveAandB<=7)
states: 7,949 (3)
abstracting: (haveB<=0)
states: 1,001 (3)
abstracting: (3<=haveB)
states: 5,005 (3)
abstracting: (haveB<=7)
states: 7,000 (3)
abstracting: (haveAandB<=haveA)
states: 5,267 (3)
abstracting: (19<=resA)
states: 0
abstracting: (resB<=13)
states: 7,997 (3)
abstracting: (11<=haveAandB)
states: 0
abstracting: (16<=haveB)
states: 0
abstracting: (14<=haveAandB)
states: 0
abstracting: (haveA2andB<=1)
states: 4,631 (3)
abstracting: (10<=resB)
states: 242
abstracting: (resA<=17)
states: 7,997 (3)
abstracting: (10<=resA)
states: 12
abstracting: (haveA2<=resA)
states: 4,549 (3)
abstracting: (Clients<=15)
states: 7,871 (3)
abstracting: (Clients<=11)
states: 6,710 (3)
abstracting: (12<=haveB)
states: 0
abstracting: (haveB<=11)
states: 7,997 (3)
abstracting: (haveA2<=haveA)
states: 4,544 (3)
abstracting: (resB<=6)
states: 6,394 (3)
abstracting: (6<=haveA)
states: 723
abstracting: (resB<=8)
states: 7,444 (3)
abstracting: (haveA2andB<=haveA2)
states: 5,267 (3)
abstracting: (haveA2<=haveA2andB)
states: 4,066 (3)
abstracting: (haveB<=16)
states: 7,997 (3)
abstracting: (resA<=haveA)
states: 4,539 (3)
abstracting: (Clients<=3)
states: 591
abstracting: (3<=resA)
states: 3,036 (3)
abstracting: (haveAandB<=19)
states: 7,997 (3)
abstracting: (resA<=haveA2andB)
states: 4,056 (3)
abstracting: (7<=resA)
states: 378
abstracting: (haveA<=haveA)
states: 7,997 (3)
abstracting: (resA<=haveA2)
states: 4,539 (3)
abstracting: (4<=haveB)
states: 4,045 (3)
abstracting: (haveA<=7)
states: 7,832 (3)
abstracting: (16<=haveA2)
states: 0
abstracting: (Clients<=haveA2)
states: 870
-> the formula is TRUE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: EF [[[[[[[~ [resB<=3] | [resA<=haveAandB | haveB<=resB]] | 18<=haveA] | haveB<=Clients] & ~ [[[haveB<=11 | ~ [[haveB<=2 & 15<=resB]]] | Clients<=4]]] & [[[haveAandB<=haveB & ~ [3<=haveAandB]] | [haveAandB<=Clients | [[~ [haveAandB<=haveB] & [[4<=Clients & 4<=resB] & ~ [haveA2andB<=10]]] & [[[16<=haveA | haveA2<=9] | ~ [haveAandB<=resB]] | ~ [[18<=resA | haveA2<=10]]]]]] | haveA2andB<=haveB]] & [[[~ [haveB<=9] | ~ [[16<=haveA & resA<=haveB]]] & haveA2andB<=2] | [[[resA<=0 | Clients<=haveB] & 17<=haveB] | [[[haveA2andB<=19 | [[[resB<=0 | haveA2andB<=haveA2andB] | ~ [resB<=haveA2andB]] | ~ [[haveAandB<=Clients | Clients<=4]]]] | [[~ [9<=Clients] | [[haveA2<=Clients | 8<=haveA] & ~ [haveA2<=haveB]]] | haveB<=haveAandB]] & haveA2andB<=haveA]]]]]
normalized: E [true U [[[[haveA2andB<=haveA & [[haveB<=haveAandB | [[~ [haveA2<=haveB] & [haveA2<=Clients | 8<=haveA]] | ~ [9<=Clients]]] | [haveA2andB<=19 | [~ [[haveAandB<=Clients | Clients<=4]] | [~ [resB<=haveA2andB] | [resB<=0 | haveA2andB<=haveA2andB]]]]]] | [17<=haveB & [resA<=0 | Clients<=haveB]]] | [haveA2andB<=2 & [~ [[16<=haveA & resA<=haveB]] | ~ [haveB<=9]]]] & [[haveA2andB<=haveB | [[haveAandB<=Clients | [[~ [[18<=resA | haveA2<=10]] | [~ [haveAandB<=resB] | [16<=haveA | haveA2<=9]]] & [[~ [haveA2andB<=10] & [4<=Clients & 4<=resB]] & ~ [haveAandB<=haveB]]]] | [haveAandB<=haveB & ~ [3<=haveAandB]]]] & [~ [[Clients<=4 | [haveB<=11 | ~ [[haveB<=2 & 15<=resB]]]]] & [haveB<=Clients | [18<=haveA | [[resA<=haveAandB | haveB<=resB] | ~ [resB<=3]]]]]]]]
abstracting: (resB<=3)
states: 3,941 (3)
abstracting: (haveB<=resB)
states: 4,249 (3)
abstracting: (resA<=haveAandB)
states: 4,056 (3)
abstracting: (18<=haveA)
states: 0
abstracting: (haveB<=Clients)
states: 6,370 (3)
abstracting: (15<=resB)
states: 0
abstracting: (haveB<=2)
states: 2,992 (3)
abstracting: (haveB<=11)
states: 7,997 (3)
abstracting: (Clients<=4)
states: 997
abstracting: (3<=haveAandB)
states: 2,046 (3)
abstracting: (haveAandB<=haveB)
states: 6,184 (3)
abstracting: (haveAandB<=haveB)
states: 6,184 (3)
abstracting: (4<=resB)
states: 4,056 (3)
abstracting: (4<=Clients)
states: 7,406 (3)
abstracting: (haveA2andB<=10)
states: 7,997 (3)
abstracting: (haveA2<=9)
states: 7,986 (3)
abstracting: (16<=haveA)
states: 0
abstracting: (haveAandB<=resB)
states: 6,184 (3)
abstracting: (haveA2<=10)
states: 7,997 (3)
abstracting: (18<=resA)
states: 0
abstracting: (haveAandB<=Clients)
states: 7,942 (3)
abstracting: (haveA2andB<=haveB)
states: 6,184 (3)
abstracting: (haveB<=9)
states: 7,766 (3)
abstracting: (resA<=haveB)
states: 5,995 (3)
abstracting: (16<=haveA)
states: 0
abstracting: (haveA2andB<=2)
states: 5,951 (3)
abstracting: (Clients<=haveB)
states: 2,048 (3)
abstracting: (resA<=0)
states: 1,991 (3)
abstracting: (17<=haveB)
states: 0
abstracting: (haveA2andB<=haveA2andB)
states: 7,997 (3)
abstracting: (resB<=0)
states: 990
abstracting: (resB<=haveA2andB)
states: 2,698 (3)
abstracting: (Clients<=4)
states: 997
abstracting: (haveAandB<=Clients)
states: 7,942 (3)
abstracting: (haveA2andB<=19)
states: 7,997 (3)
abstracting: (9<=Clients)
states: 4,004 (3)
abstracting: (8<=haveA)
states: 165
abstracting: (haveA2<=Clients)
states: 7,378 (3)
abstracting: (haveA2<=haveB)
states: 5,995 (3)
abstracting: (haveB<=haveAandB)
states: 2,709 (3)
abstracting: (haveA2andB<=haveA)
states: 5,267 (3)
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: EF [[[[[~ [[[haveB<=haveB & [haveAandB<=haveA2andB | resA<=haveA2andB]] & [[haveB<=4 & haveAandB<=1] & ~ [resA<=haveA2]]]] & [~ [[13<=haveA2andB & 3<=haveB]] & [haveA2<=5 & [[[2<=haveA2 | haveAandB<=5] | [haveA2andB<=Clients | haveA<=resA]] | [resA<=haveB & [haveAandB<=haveA2andB & Clients<=14]]]]]] & ~ [[~ [haveAandB<=haveA] | [[[[resA<=haveAandB | resB<=resB] | [3<=resB & 5<=haveA2andB]] & [~ [haveAandB<=4] & [haveAandB<=haveAandB | haveAandB<=18]]] & [[3<=haveA2andB & haveA<=Clients] | 5<=haveA2]]]]] & [~ [[haveAandB<=13 | ~ [[[haveA<=haveAandB | Clients<=12] | 5<=haveAandB]]]] | [resA<=20 & [~ [[[9<=resB | 20<=haveA2] & 15<=Clients]] | [[~ [haveA2<=haveB] & [[resB<=2 | haveA2andB<=haveA] | ~ [haveAandB<=4]]] & [[[16<=haveAandB & 12<=resA] | 17<=haveA] & [[haveB<=resB | Clients<=haveB] | 5<=resB]]]]]]] & [[[[10<=haveAandB & resB<=12] & [[10<=resA & [[resB<=6 | haveA<=haveA2andB] & [[haveA<=haveB & resB<=resB] | [19<=resB | 7<=haveA]]]] & haveA2<=haveA2andB]] & ~ [haveA2andB<=3]] & ~ [[[[~ [[16<=haveA | 5<=Clients]] & haveA2andB<=haveB] & haveAandB<=haveA2andB] | 11<=resA]]]]]
normalized: E [true U [[~ [[11<=resA | [haveAandB<=haveA2andB & [haveA2andB<=haveB & ~ [[16<=haveA | 5<=Clients]]]]]] & [~ [haveA2andB<=3] & [[haveA2<=haveA2andB & [10<=resA & [[[19<=resB | 7<=haveA] | [haveA<=haveB & resB<=resB]] & [resB<=6 | haveA<=haveA2andB]]]] & [10<=haveAandB & resB<=12]]]] & [[[resA<=20 & [[[[5<=resB | [haveB<=resB | Clients<=haveB]] & [17<=haveA | [16<=haveAandB & 12<=resA]]] & [[~ [haveAandB<=4] | [resB<=2 | haveA2andB<=haveA]] & ~ [haveA2<=haveB]]] | ~ [[15<=Clients & [9<=resB | 20<=haveA2]]]]] | ~ [[haveAandB<=13 | ~ [[5<=haveAandB | [haveA<=haveAandB | Clients<=12]]]]]] & [~ [[[[5<=haveA2 | [3<=haveA2andB & haveA<=Clients]] & [[[haveAandB<=haveAandB | haveAandB<=18] & ~ [haveAandB<=4]] & [[3<=resB & 5<=haveA2andB] | [resA<=haveAandB | resB<=resB]]]] | ~ [haveAandB<=haveA]]] & [[~ [[13<=haveA2andB & 3<=haveB]] & [haveA2<=5 & [[resA<=haveB & [haveAandB<=haveA2andB & Clients<=14]] | [[haveA2andB<=Clients | haveA<=resA] | [2<=haveA2 | haveAandB<=5]]]]] & ~ [[[[haveB<=4 & haveAandB<=1] & ~ [resA<=haveA2]] & [haveB<=haveB & [haveAandB<=haveA2andB | resA<=haveA2andB]]]]]]]]]
abstracting: (resA<=haveA2andB)
states: 4,056 (3)
abstracting: (haveAandB<=haveA2andB)
states: 4,784 (3)
abstracting: (haveB<=haveB)
states: 7,997 (3)
abstracting: (resA<=haveA2)
states: 4,539 (3)
abstracting: (haveAandB<=1)
states: 4,631 (3)
abstracting: (haveB<=4)
states: 4,858 (3)
abstracting: (haveAandB<=5)
states: 7,689 (3)
abstracting: (2<=haveA2)
states: 4,347 (3)
abstracting: (haveA<=resA)
states: 4,549 (3)
abstracting: (haveA2andB<=Clients)
states: 7,942 (3)
abstracting: (Clients<=14)
states: 7,745 (3)
abstracting: (haveAandB<=haveA2andB)
states: 4,784 (3)
abstracting: (resA<=haveB)
states: 5,995 (3)
abstracting: (haveA2<=5)
states: 7,274 (3)
abstracting: (3<=haveB)
states: 5,005 (3)
abstracting: (13<=haveA2andB)
states: 0
abstracting: (haveAandB<=haveA)
states: 5,267 (3)
abstracting: (resB<=resB)
states: 7,997 (3)
abstracting: (resA<=haveAandB)
states: 4,056 (3)
abstracting: (5<=haveA2andB)
states: 630
abstracting: (3<=resB)
states: 5,016 (3)
abstracting: (haveAandB<=4)
states: 7,367 (3)
abstracting: (haveAandB<=18)
states: 7,997 (3)
abstracting: (haveAandB<=haveAandB)
states: 7,997 (3)
abstracting: (haveA<=Clients)
states: 7,378 (3)
abstracting: (3<=haveA2andB)
states: 2,046 (3)
abstracting: (5<=haveA2)
states: 1,254 (3)
abstracting: (Clients<=12)
states: 7,205 (3)
abstracting: (haveA<=haveAandB)
states: 4,066 (3)
abstracting: (5<=haveAandB)
states: 630
abstracting: (haveAandB<=13)
states: 7,997 (3)
abstracting: (20<=haveA2)
states: 0
abstracting: (9<=resB)
states: 553
abstracting: (15<=Clients)
states: 252
abstracting: (haveA2<=haveB)
states: 5,995 (3)
abstracting: (haveA2andB<=haveA)
states: 5,267 (3)
abstracting: (resB<=2)
states: 2,981 (3)
abstracting: (haveAandB<=4)
states: 7,367 (3)
abstracting: (12<=resA)
states: 0
abstracting: (16<=haveAandB)
states: 0
abstracting: (17<=haveA)
states: 0
abstracting: (Clients<=haveB)
states: 2,048 (3)
abstracting: (haveB<=resB)
states: 4,249 (3)
abstracting: (5<=resB)
states: 3,150 (3)
abstracting: (resA<=20)
states: 7,997 (3)
abstracting: (resB<=12)
states: 7,997 (3)
abstracting: (10<=haveAandB)
states: 2
abstracting: (haveA<=haveA2andB)
states: 4,066 (3)
abstracting: (resB<=6)
states: 6,394 (3)
abstracting: (resB<=resB)
states: 7,997 (3)
abstracting: (haveA<=haveB)
states: 5,995 (3)
abstracting: (7<=haveA)
states: 374
abstracting: (19<=resB)
states: 0
abstracting: (10<=resA)
states: 12
abstracting: (haveA2<=haveA2andB)
states: 4,066 (3)
abstracting: (haveA2andB<=3)
states: 6,821 (3)
abstracting: (5<=Clients)
states: 7,000 (3)
abstracting: (16<=haveA)
states: 0
abstracting: (haveA2andB<=haveB)
states: 6,184 (3)
abstracting: (haveAandB<=haveA2andB)
states: 4,784 (3)
abstracting: (11<=resA)
states: 0
-> the formula is FALSE
FORMULA TwoPhaseLocking-PT-nC00020vN-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
totally nodes used: 22510 (2.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 84928 33411 118339
used/not used/entry size/cache size: 38823 67070041 16 1024MB
basic ops cache: hits/miss/sum: 172927 170008 342935
used/not used/entry size/cache size: 222923 16554293 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: 35402 12891 48293
used/not used/entry size/cache size: 12890 8375718 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 67088603
1 19295
2 720
3 121
4 42
5 17
6 8
7 2
8 4
9 2
>= 10 50
Total processing time: 0m 4.652sec
BK_STOP 1679868380397
--------------------
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:256 (42), effective:80 (13)
initing FirstDep: 0m 0.000sec
iterations count:321 (53), effective:100 (16)
iterations count:187 (31), effective:68 (11)
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-nC00020vN"
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-nC00020vN, 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-167912692500814"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00020vN.tgz
mv TwoPhaseLocking-PT-nC00020vN 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 ;