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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679868449008

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-nC00050vN
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_nC00050vN
(NrP: 8 NrTr: 6 NrArc: 18)

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

net check time: 0m 0.000sec

init dd package: 0m 2.783sec


RS generation: 0m 0.168sec


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



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

checking: AG [haveA2andB<=46]
normalized: ~ [E [true U ~ [haveA2andB<=46]]]

abstracting: (haveA2andB<=46)
states: 403,741 (5)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vN-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [48<=haveAandB]
normalized: E [true U 48<=haveAandB]

abstracting: (48<=haveAandB)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: AG [resB<=41]
normalized: ~ [E [true U ~ [resB<=41]]]

abstracting: (resB<=41)
states: 403,741 (5)
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: AG [haveAandB<=39]
normalized: ~ [E [true U ~ [haveAandB<=39]]]

abstracting: (haveAandB<=39)
states: 403,741 (5)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vN-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [20<=haveA2]
normalized: E [true U 20<=haveA2]

abstracting: (20<=haveA2)
states: 3,144 (3)
-> the formula is TRUE

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

MC time: 0m 0.299sec

checking: EF [48<=haveAandB]
normalized: E [true U 48<=haveAandB]

abstracting: (48<=haveAandB)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [haveA2<=resA]
normalized: ~ [E [true U ~ [haveA2<=resA]]]

abstracting: (haveA2<=resA)
states: 214,213 (5)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00050vN-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.071sec

checking: AG [[haveAandB<=23 & resB<=resB]]
normalized: ~ [E [true U ~ [[haveAandB<=23 & resB<=resB]]]]

abstracting: (resB<=resB)
states: 403,741 (5)
abstracting: (haveAandB<=23)
states: 403,728 (5)
-> the formula is FALSE

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

MC time: 0m 0.031sec

checking: AG [~ [[~ [[~ [[~ [38<=haveA] | [~ [haveB<=17] | Clients<=haveA2andB]]] & 6<=haveA2andB]] & 14<=haveA2]]]
normalized: ~ [E [true U [14<=haveA2 & ~ [[6<=haveA2andB & ~ [[[Clients<=haveA2andB | ~ [haveB<=17]] | ~ [38<=haveA]]]]]]]]

abstracting: (38<=haveA)
states: 0
abstracting: (haveB<=17)
states: 361,626 (5)
abstracting: (Clients<=haveA2andB)
states: 1,326 (3)
abstracting: (6<=haveA2andB)
states: 118,657 (5)
abstracting: (14<=haveA2)
states: 30,837 (4)
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00050vN-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

checking: AG [[~ [[[11<=haveAandB | ~ [haveA2andB<=haveAandB]] & ~ [[haveAandB<=haveAandB & haveAandB<=15]]]] | haveA<=28]]
normalized: ~ [E [true U ~ [[haveA<=28 | ~ [[~ [[haveAandB<=haveAandB & haveAandB<=15]] & [11<=haveAandB | ~ [haveA2andB<=haveAandB]]]]]]]]

abstracting: (haveA2andB<=haveAandB)
states: 220,103 (5)
abstracting: (11<=haveAandB)
states: 31,824 (4)
abstracting: (haveAandB<=15)
states: 398,450 (5)
abstracting: (haveAandB<=haveAandB)
states: 403,741 (5)
abstracting: (haveA<=28)
states: 403,741 (5)
-> the formula is TRUE

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

MC time: 0m 0.142sec

checking: AG [~ [[[~ [[haveAandB<=Clients | ~ [[[~ [haveAandB<=Clients] | ~ [17<=haveAandB]] & resA<=23]]]] & [28<=resA & resB<=45]] & 32<=Clients]]]
normalized: ~ [E [true U [32<=Clients & [[28<=resA & resB<=45] & ~ [[haveAandB<=Clients | ~ [[resA<=23 & [~ [17<=haveAandB] | ~ [haveAandB<=Clients]]]]]]]]]]

abstracting: (haveAandB<=Clients)
states: 403,416 (5)
abstracting: (17<=haveAandB)
states: 3,366 (3)
abstracting: (resA<=23)
states: 403,608 (5)
abstracting: (haveAandB<=Clients)
states: 403,416 (5)
abstracting: (resB<=45)
states: 403,741 (5)
abstracting: (28<=resA)
states: 0
abstracting: (32<=Clients)
states: 33,649 (4)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vN-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: AG [[~ [[[[~ [[~ [[42<=resA | 19<=haveA2andB]] | 40<=haveA2andB]] & ~ [haveA2andB<=18]] & [~ [[[~ [34<=haveA] | ~ [haveA<=47]] | [[haveA2andB<=50 | haveA<=haveA2] & [haveAandB<=resB | resB<=19]]]] & ~ [[~ [[haveA2<=haveA2 & haveAandB<=resB]] | resB<=41]]]] | 24<=haveA2andB]] | 2<=haveA2andB]]
normalized: ~ [E [true U ~ [[2<=haveA2andB | ~ [[24<=haveA2andB | [[~ [[resB<=41 | ~ [[haveA2<=haveA2 & haveAandB<=resB]]]] & ~ [[[[haveAandB<=resB | resB<=19] & [haveA2andB<=50 | haveA<=haveA2]] | [~ [haveA<=47] | ~ [34<=haveA]]]]] & [~ [haveA2andB<=18] & ~ [[40<=haveA2andB | ~ [[42<=resA | 19<=haveA2andB]]]]]]]]]]]]

abstracting: (19<=haveA2andB)
states: 1,176 (3)
abstracting: (42<=resA)
states: 0
abstracting: (40<=haveA2andB)
states: 0
abstracting: (haveA2andB<=18)
states: 402,565 (5)
abstracting: (34<=haveA)
states: 0
abstracting: (haveA<=47)
states: 403,741 (5)
abstracting: (haveA<=haveA2)
states: 214,201 (5)
abstracting: (haveA2andB<=50)
states: 403,741 (5)
abstracting: (resB<=19)
states: 380,431 (5)
abstracting: (haveAandB<=resB)
states: 298,363 (5)
abstracting: (haveAandB<=resB)
states: 298,363 (5)
abstracting: (haveA2<=haveA2)
states: 403,741 (5)
abstracting: (resB<=41)
states: 403,741 (5)
abstracting: (24<=haveA2andB)
states: 13
abstracting: (2<=haveA2andB)
states: 277,290 (5)
-> the formula is TRUE

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

MC time: 0m 0.093sec

checking: AG [[[[~ [[haveAandB<=32 & ~ [haveA2andB<=haveB]]] | [[[haveA2andB<=39 & ~ [[[27<=resB | resA<=12] & [resB<=22 | haveAandB<=haveA2andB]]]] & ~ [[~ [27<=resB] | ~ [25<=haveB]]]] | [[[haveB<=13 & ~ [19<=haveAandB]] | ~ [[~ [13<=haveA] & haveB<=haveA2andB]]] | ~ [21<=haveB]]]] | 24<=haveA2andB] | 46<=haveA2andB]]
normalized: ~ [E [true U ~ [[46<=haveA2andB | [24<=haveA2andB | [[[~ [21<=haveB] | [~ [[haveB<=haveA2andB & ~ [13<=haveA]]] | [haveB<=13 & ~ [19<=haveAandB]]]] | [~ [[~ [25<=haveB] | ~ [27<=resB]]] & [haveA2andB<=39 & ~ [[[resB<=22 | haveAandB<=haveA2andB] & [27<=resB | resA<=12]]]]]] | ~ [[haveAandB<=32 & ~ [haveA2andB<=haveB]]]]]]]]]

abstracting: (haveA2andB<=haveB)
states: 298,363 (5)
abstracting: (haveAandB<=32)
states: 403,741 (5)
abstracting: (resA<=12)
states: 363,337 (5)
abstracting: (27<=resB)
states: 0
abstracting: (haveAandB<=haveA2andB)
states: 220,103 (5)
abstracting: (resB<=22)
states: 397,483 (5)
abstracting: (haveA2andB<=39)
states: 403,741 (5)
abstracting: (27<=resB)
states: 0
abstracting: (25<=haveB)
states: 1,326 (3)
abstracting: (19<=haveAandB)
states: 1,176 (3)
abstracting: (haveB<=13)
states: 306,033 (5)
abstracting: (13<=haveA)
states: 40,391 (4)
abstracting: (haveB<=haveA2andB)
states: 126,399 (5)
abstracting: (21<=haveB)
states: 16,158 (4)
abstracting: (24<=haveA2andB)
states: 13
abstracting: (46<=haveA2andB)
states: 0
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vN-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.141sec

checking: AG [[~ [[~ [[haveA<=20 & resA<=haveB]] & [[[[[~ [39<=Clients] | [haveAandB<=resA & 30<=resA]] | [[haveA2<=45 | Clients<=3] | 7<=haveAandB]] & [[~ [haveA2<=haveA2] | [29<=haveA & haveAandB<=haveAandB]] | [[Clients<=haveAandB | resB<=haveA2] | 37<=haveB]]] | ~ [[Clients<=46 & ~ [18<=Clients]]]] & [13<=resB & [40<=Clients | ~ [[[Clients<=haveB & 40<=haveA2] & [resB<=26 & haveA<=32]]]]]]]] | haveAandB<=32]]
normalized: ~ [E [true U ~ [[haveAandB<=32 | ~ [[[[13<=resB & [40<=Clients | ~ [[[resB<=26 & haveA<=32] & [Clients<=haveB & 40<=haveA2]]]]] & [~ [[Clients<=46 & ~ [18<=Clients]]] | [[[37<=haveB | [Clients<=haveAandB | resB<=haveA2]] | [[29<=haveA & haveAandB<=haveAandB] | ~ [haveA2<=haveA2]]] & [[7<=haveAandB | [haveA2<=45 | Clients<=3]] | [[haveAandB<=resA & 30<=resA] | ~ [39<=Clients]]]]]] & ~ [[haveA<=20 & resA<=haveB]]]]]]]]

abstracting: (resA<=haveB)
states: 284,986 (5)
abstracting: (haveA<=20)
states: 401,968 (5)
abstracting: (39<=Clients)
states: 4,368 (3)
abstracting: (30<=resA)
states: 0
abstracting: (haveAandB<=resA)
states: 249,587 (5)
abstracting: (Clients<=3)
states: 1,626 (3)
abstracting: (haveA2<=45)
states: 403,741 (5)
abstracting: (7<=haveAandB)
states: 93,632 (4)
abstracting: (haveA2<=haveA2)
states: 403,741 (5)
abstracting: (haveAandB<=haveAandB)
states: 403,741 (5)
abstracting: (29<=haveA)
states: 0
abstracting: (resB<=haveA2)
states: 142,480 (5)
abstracting: (Clients<=haveAandB)
states: 1,326 (3)
abstracting: (37<=haveB)
states: 0
abstracting: (18<=Clients)
states: 292,579 (5)
abstracting: (Clients<=46)
states: 403,685 (5)
abstracting: (40<=haveA2)
states: 0
abstracting: (Clients<=haveB)
states: 71,851 (4)
abstracting: (haveA<=32)
states: 403,741 (5)
abstracting: (resB<=26)
states: 403,741 (5)
abstracting: (40<=Clients)
states: 3,003 (3)
abstracting: (13<=resB)
states: 115,024 (5)
abstracting: (haveAandB<=32)
states: 403,741 (5)
-> the formula is TRUE

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

MC time: 0m 0.217sec

checking: AG [~ [[[[[[[resB<=haveB | [[30<=haveA & resA<=haveA2andB] & resB<=haveA2andB]] & [[~ [haveB<=43] & [resB<=48 | haveA2andB<=haveAandB]] & ~ [28<=haveA]]] | ~ [21<=haveAandB]] | [haveA<=resB & [~ [33<=resB] & haveA2<=5]]] & 31<=haveA2] & [haveB<=haveA2 & [[[resB<=haveA & haveA2<=haveAandB] | ~ [Clients<=40]] | [~ [haveA<=7] | [19<=resA & [[haveAandB<=25 & 43<=resA] & ~ [Clients<=23]]]]]]]]]
normalized: ~ [E [true U [[haveB<=haveA2 & [[[19<=resA & [~ [Clients<=23] & [haveAandB<=25 & 43<=resA]]] | ~ [haveA<=7]] | [~ [Clients<=40] | [resB<=haveA & haveA2<=haveAandB]]]] & [31<=haveA2 & [[haveA<=resB & [haveA2<=5 & ~ [33<=resB]]] | [~ [21<=haveAandB] | [[~ [28<=haveA] & [[resB<=48 | haveA2andB<=haveAandB] & ~ [haveB<=43]]] & [resB<=haveB | [resB<=haveA2andB & [30<=haveA & resA<=haveA2andB]]]]]]]]]]

abstracting: (resA<=haveA2andB)
states: 184,704 (5)
abstracting: (30<=haveA)
states: 0
abstracting: (resB<=haveA2andB)
states: 126,373 (5)
abstracting: (resB<=haveB)
states: 207,818 (5)
abstracting: (haveB<=43)
states: 403,741 (5)
abstracting: (haveA2andB<=haveAandB)
states: 220,103 (5)
abstracting: (resB<=48)
states: 403,741 (5)
abstracting: (28<=haveA)
states: 0
abstracting: (21<=haveAandB)
states: 308
abstracting: (33<=resB)
states: 0
abstracting: (haveA2<=5)
states: 231,974 (5)
abstracting: (haveA<=resB)
states: 285,011 (5)
abstracting: (31<=haveA2)
states: 0
abstracting: (haveA2<=haveAandB)
states: 184,729 (5)
abstracting: (resB<=haveA)
states: 142,480 (5)
abstracting: (Clients<=40)
states: 401,739 (5)
abstracting: (haveA<=7)
states: 282,862 (5)
abstracting: (43<=resA)
states: 0
abstracting: (haveAandB<=25)
states: 403,741 (5)
abstracting: (Clients<=23)
states: 237,484 (5)
abstracting: (19<=resA)
states: 5,166 (3)
abstracting: (haveB<=haveA2)
states: 142,506 (5)
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00050vN-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.222sec

checking: EF [~ [[~ [[Clients<=haveAandB & [~ [haveB<=2] & ~ [[[~ [resA<=haveA2andB] & [25<=haveAandB | resB<=resB]] | [[45<=haveA2 & 41<=haveA2andB] | [43<=Clients & haveA2andB<=40]]]]]]] | [~ [haveA<=22] & ~ [[[[resA<=41 & [~ [17<=haveA] | [35<=haveA | haveA2<=resB]]] & [haveA2<=37 & [haveB<=haveAandB & [50<=resB | Clients<=31]]]] & [[~ [[haveB<=Clients | 17<=haveA]] | [resB<=resB | [15<=haveB & resB<=50]]] | ~ [[30<=haveAandB & ~ [26<=haveB]]]]]]]]]]
normalized: E [true U ~ [[[~ [[[~ [[30<=haveAandB & ~ [26<=haveB]]] | [[resB<=resB | [15<=haveB & resB<=50]] | ~ [[haveB<=Clients | 17<=haveA]]]] & [[haveA2<=37 & [haveB<=haveAandB & [50<=resB | Clients<=31]]] & [resA<=41 & [[35<=haveA | haveA2<=resB] | ~ [17<=haveA]]]]]] & ~ [haveA<=22]] | ~ [[Clients<=haveAandB & [~ [[[[43<=Clients & haveA2andB<=40] | [45<=haveA2 & 41<=haveA2andB]] | [[25<=haveAandB | resB<=resB] & ~ [resA<=haveA2andB]]]] & ~ [haveB<=2]]]]]]]

abstracting: (haveB<=2)
states: 71,227 (4)
abstracting: (resA<=haveA2andB)
states: 184,704 (5)
abstracting: (resB<=resB)
states: 403,741 (5)
abstracting: (25<=haveAandB)
states: 2
abstracting: (41<=haveA2andB)
states: 0
abstracting: (45<=haveA2)
states: 0
abstracting: (haveA2andB<=40)
states: 403,741 (5)
abstracting: (43<=Clients)
states: 792
abstracting: (Clients<=haveAandB)
states: 1,326 (3)
abstracting: (haveA<=22)
states: 403,351 (5)
abstracting: (17<=haveA)
states: 11,772 (4)
abstracting: (haveA2<=resB)
states: 285,011 (5)
abstracting: (35<=haveA)
states: 0
abstracting: (resA<=41)
states: 403,741 (5)
abstracting: (Clients<=31)
states: 370,092 (5)
abstracting: (50<=resB)
states: 0
abstracting: (haveB<=haveAandB)
states: 126,399 (5)
abstracting: (haveA2<=37)
states: 403,741 (5)
abstracting: (17<=haveA)
states: 11,772 (4)
abstracting: (haveB<=Clients)
states: 338,611 (5)
abstracting: (resB<=50)
states: 403,741 (5)
abstracting: (15<=haveB)
states: 81,692 (4)
abstracting: (resB<=resB)
states: 403,741 (5)
abstracting: (26<=haveB)
states: 325
abstracting: (30<=haveAandB)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.288sec

totally nodes used: 225097 (2.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2908703 435313 3344016
used/not used/entry size/cache size: 521308 66587556 16 1024MB
basic ops cache: hits/miss/sum: 2116393 1536733 3653126
used/not used/entry size/cache size: 1858396 14918820 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: 357786 134068 491854
used/not used/entry size/cache size: 133409 8255199 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 66896623
1 205017
2 6342
3 446
4 140
5 71
6 67
7 27
8 16
9 4
>= 10 111

Total processing time: 0m 6.294sec


BK_STOP 1679868455346

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

initing FirstDep: 0m 0.000sec


iterations count:422 (70), effective:119 (19)

iterations count:71 (11), effective:29 (4)

iterations count:618 (103), effective:212 (35)

iterations count:296 (49), effective:83 (13)

iterations count:280 (46), effective:114 (19)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TwoPhaseLocking-PT-nC00050vN"
export BK_EXAMINATION="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-nC00050vN, 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-167912692500830"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00050vN.tgz
mv TwoPhaseLocking-PT-nC00050vN execution
cd execution
if [ "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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;