fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r225-tall-167856407100121
Last Updated
May 14, 2023

About the Execution of Marcie for IOTPpurchase-PT-C05M04P03D02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6773.483 25675.00 25030.00 30.00 FFFFFFTFTTTFTFFT 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.r225-tall-167856407100121.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 IOTPpurchase-PT-C05M04P03D02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407100121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 15:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 15:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 60K Mar 5 18:22 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 IOTPpurchase-PT-C05M04P03D02-CTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678606778238

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=IOTPpurchase-PT-C05M04P03D02
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: IOTPpurchase_PT_C05M04P03D02
(NrP: 111 NrTr: 45 NrArc: 224)

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

net check time: 0m 0.000sec

init dd package: 0m 2.824sec


RS generation: 0m 0.478sec


-> reachability set: #nodes 15027 (1.5e+04) #states 17,406,024 (7)



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

checking: AX [EX [EG [~ [EG [p12_3<=4]]]]]
normalized: ~ [EX [~ [EX [EG [~ [EG [p12_3<=4]]]]]]]

abstracting: (p12_3<=4)
states: 17,406,024 (7)

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

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.175sec

checking: E [~ [[~ [[EF [AX [p10_2<=OfferRequest_p10]] & ~ [EF [4<=DeliveryHandlerDelivery_p8_0]]]] & AX [~ [EF [HowDeliver_p12_2<=1]]]]] U 2<=DeliveryRequest_p12_5]
normalized: E [~ [[~ [EX [E [true U HowDeliver_p12_2<=1]]] & ~ [[~ [E [true U 4<=DeliveryHandlerDelivery_p8_0]] & E [true U ~ [EX [~ [p10_2<=OfferRequest_p10]]]]]]]] U 2<=DeliveryRequest_p12_5]

abstracting: (2<=DeliveryRequest_p12_5)
states: 0
abstracting: (p10_2<=OfferRequest_p10)
states: 16,092,612 (7)
.abstracting: (4<=DeliveryHandlerDelivery_p8_0)
states: 0
abstracting: (HowDeliver_p12_2<=1)
states: 17,406,024 (7)
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.136sec

checking: E [AX [AF [[A [2<=OfferRequest_p10 U 3<=OfferResponce_p10] & p6_5<=p5_2]]] U EX [[4<=p3_1 & 5<=MerchantDelivery_p4_6]]]
normalized: E [~ [EX [EG [~ [[p6_5<=p5_2 & [~ [EG [~ [3<=OfferResponce_p10]]] & ~ [E [~ [3<=OfferResponce_p10] U [~ [2<=OfferRequest_p10] & ~ [3<=OfferResponce_p10]]]]]]]]]] U EX [[4<=p3_1 & 5<=MerchantDelivery_p4_6]]]

abstracting: (5<=MerchantDelivery_p4_6)
states: 0
abstracting: (4<=p3_1)
states: 136
.abstracting: (3<=OfferResponce_p10)
states: 0
abstracting: (2<=OfferRequest_p10)
states: 0
abstracting: (3<=OfferResponce_p10)
states: 0
abstracting: (3<=OfferResponce_p10)
states: 0

EG iterations: 0
abstracting: (p6_5<=p5_2)
states: 9,650,442 (6)

EG iterations: 0
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [A [E [AX [~ [p3_6<=1]] U ~ [[AG [p8_1<=PaySchemeData_p11_10] & [2<=Organization_p20_7 | 1<=p10_0]]]] U AG [~ [EG [Payment_p21_7<=p8_1]]]]]
normalized: E [true U [~ [EG [E [true U EG [Payment_p21_7<=p8_1]]]] & ~ [E [E [true U EG [Payment_p21_7<=p8_1]] U [~ [E [~ [EX [p3_6<=1]] U ~ [[[2<=Organization_p20_7 | 1<=p10_0] & ~ [E [true U ~ [p8_1<=PaySchemeData_p11_10]]]]]]] & E [true U EG [Payment_p21_7<=p8_1]]]]]]]

abstracting: (Payment_p21_7<=p8_1)
states: 16,319,430 (7)
.............................................................................................................
EG iterations: 109
abstracting: (p8_1<=PaySchemeData_p11_10)
states: 15,643,698 (7)
abstracting: (1<=p10_0)
states: 14,627,748 (7)
abstracting: (2<=Organization_p20_7)
states: 117,800 (5)
abstracting: (p3_6<=1)
states: 17,288,224 (7)
.abstracting: (Payment_p21_7<=p8_1)
states: 16,319,430 (7)
.............................................................................................................
EG iterations: 109
abstracting: (Payment_p21_7<=p8_1)
states: 16,319,430 (7)
.............................................................................................................
EG iterations: 109

EG iterations: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.335sec

checking: EG [EF [~ [A [[Status_p22_7<=0 | AG [Organization_p22_2<=3]] U [[MerchantPayment_p4_0<=p6_6 & p12_7<=p12_4] | 2<=Organization_p22_9]]]]]
normalized: EG [E [true U ~ [[~ [EG [~ [[2<=Organization_p22_9 | [MerchantPayment_p4_0<=p6_6 & p12_7<=p12_4]]]]] & ~ [E [~ [[2<=Organization_p22_9 | [MerchantPayment_p4_0<=p6_6 & p12_7<=p12_4]]] U [~ [[2<=Organization_p22_9 | [MerchantPayment_p4_0<=p6_6 & p12_7<=p12_4]]] & ~ [[Status_p22_7<=0 | ~ [E [true U ~ [Organization_p22_2<=3]]]]]]]]]]]]

abstracting: (Organization_p22_2<=3)
states: 17,405,888 (7)
abstracting: (Status_p22_7<=0)
states: 14,258,424 (7)
abstracting: (p12_7<=p12_4)
states: 14,964,620 (7)
abstracting: (MerchantPayment_p4_0<=p6_6)
states: 11,427,876 (7)
abstracting: (2<=Organization_p22_9)
states: 118,920 (5)
abstracting: (p12_7<=p12_4)
states: 14,964,620 (7)
abstracting: (MerchantPayment_p4_0<=p6_6)
states: 11,427,876 (7)
abstracting: (2<=Organization_p22_9)
states: 118,920 (5)
abstracting: (p12_7<=p12_4)
states: 14,964,620 (7)
abstracting: (MerchantPayment_p4_0<=p6_6)
states: 11,427,876 (7)
abstracting: (2<=Organization_p22_9)
states: 118,920 (5)
...................................................................................................................
EG iterations: 115

EG iterations: 0
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.808sec

checking: E [EX [[OfferResponce_p10<=3 | [[p12_0<=1 & 5<=Organization_p22_5] | EX [p11_0<=OfferRequest_p10]]]] U AG [Delivery_p22_4<=HowDeliver_p12_2]]
normalized: E [EX [[OfferResponce_p10<=3 | [EX [p11_0<=OfferRequest_p10] | [p12_0<=1 & 5<=Organization_p22_5]]]] U ~ [E [true U ~ [Delivery_p22_4<=HowDeliver_p12_2]]]]

abstracting: (Delivery_p22_4<=HowDeliver_p12_2)
states: 12,119,560 (7)
abstracting: (5<=Organization_p22_5)
states: 360
abstracting: (p12_0<=1)
states: 17,406,024 (7)
abstracting: (p11_0<=OfferRequest_p10)
states: 4,091,688 (6)
.abstracting: (OfferResponce_p10<=3)
states: 17,406,024 (7)
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.276sec

checking: EG [[[[E [~ [[1<=Delivery_p22_1 & p4_4<=4]] U AF [PaySchemeData_p21_10<=4]] & [EF [EG [DeliveryResponse_p12_6<=PaySchemeData_p21_6]] | p3_3<=2]] | EG [ConsumerDelivery_p6_0<=2]] & Organization_p21_2<=PaidFor_p11_1]]
normalized: EG [[Organization_p21_2<=PaidFor_p11_1 & [EG [ConsumerDelivery_p6_0<=2] | [[p3_3<=2 | E [true U EG [DeliveryResponse_p12_6<=PaySchemeData_p21_6]]] & E [~ [[1<=Delivery_p22_1 & p4_4<=4]] U ~ [EG [~ [PaySchemeData_p21_10<=4]]]]]]]]

abstracting: (PaySchemeData_p21_10<=4)
states: 17,406,024 (7)
.
EG iterations: 1
abstracting: (p4_4<=4)
states: 17,406,024 (7)
abstracting: (1<=Delivery_p22_1)
states: 1,647,592 (6)
abstracting: (DeliveryResponse_p12_6<=PaySchemeData_p21_6)
states: 14,863,888 (7)
..........................................................................
EG iterations: 74
abstracting: (p3_3<=2)
states: 17,400,376 (7)
abstracting: (ConsumerDelivery_p6_0<=2)
states: 17,400,376 (7)
.
EG iterations: 1
abstracting: (Organization_p21_2<=PaidFor_p11_1)
states: 15,865,208 (7)
...........................................
EG iterations: 43
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.157sec

checking: [EG [~ [[[Organization_p22_9<=5 | [~ [Status_p21_11<=0] & [3<=Status_p22_13 & [p3_5<=p12_7 & p2_1<=4]]]] | ~ [EX [AG [3<=PaySchemeData_p11_10]]]]]] | ~ [EF [[~ [Order_p20<=4] | AX [[AG [p5_2<=3] & p6_5<=3]]]]]]
normalized: [~ [E [true U [~ [EX [~ [[p6_5<=3 & ~ [E [true U ~ [p5_2<=3]]]]]]] | ~ [Order_p20<=4]]]] | EG [~ [[~ [EX [~ [E [true U ~ [3<=PaySchemeData_p11_10]]]]] | [Organization_p22_9<=5 | [[3<=Status_p22_13 & [p3_5<=p12_7 & p2_1<=4]] & ~ [Status_p21_11<=0]]]]]]]

abstracting: (Status_p21_11<=0)
states: 15,248,736 (7)
abstracting: (p2_1<=4)
states: 17,406,024 (7)
abstracting: (p3_5<=p12_7)
states: 15,846,296 (7)
abstracting: (3<=Status_p22_13)
states: 36,512 (4)
abstracting: (Organization_p22_9<=5)
states: 17,406,024 (7)
abstracting: (3<=PaySchemeData_p11_10)
states: 0
..
EG iterations: 1
abstracting: (Order_p20<=4)
states: 17,406,024 (7)
abstracting: (p5_2<=3)
states: 17,406,024 (7)
abstracting: (p6_5<=3)
states: 17,404,104 (7)
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.097sec

checking: AG [[[AX [AX [EX [OfferRequest_p10<=1]]] & ~ [[~ [[[3<=p7_1 | p4_3<=5] | p11_11<=p5_1]] | ~ [EG [p2_2<=4]]]]] & E [AX [AF [p3_5<=Delivery_p20_10]] U ~ [AG [~ [Delivery_p22_4<=DeliveryNote_p22_14]]]]]]
normalized: ~ [E [true U ~ [[E [~ [EX [EG [~ [p3_5<=Delivery_p20_10]]]] U E [true U Delivery_p22_4<=DeliveryNote_p22_14]] & [~ [[~ [EG [p2_2<=4]] | ~ [[p11_11<=p5_1 | [3<=p7_1 | p4_3<=5]]]]] & ~ [EX [EX [~ [EX [OfferRequest_p10<=1]]]]]]]]]]

abstracting: (OfferRequest_p10<=1)
states: 17,406,024 (7)
...abstracting: (p4_3<=5)
states: 17,406,024 (7)
abstracting: (3<=p7_1)
states: 5,648 (3)
abstracting: (p11_11<=p5_1)
states: 3,445,320 (6)
abstracting: (p2_2<=4)
states: 17,406,024 (7)

EG iterations: 0
abstracting: (Delivery_p22_4<=DeliveryNote_p22_14)
states: 12,186,344 (7)
abstracting: (p3_5<=Delivery_p20_10)
states: 12,078,728 (7)
.................................................................................................................
EG iterations: 113
.-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.039sec

checking: [~ [EG [AX [[AX [4<=Status_p22_11] | E [DeliveryNote_p22_14<=3 U p2_2<=0]]]]] | [A [Payment_p20_9<=1 U [AG [[[ConsumerPayment_p3<=p6_1 | OfferResponce_p10<=PaymentAmount_p11_6] | 3<=p5_4]] | PaySchemeData_p21_6<=1]] & EF [~ [EX [AX [p3_7<=5]]]]]]
normalized: [[E [true U ~ [EX [~ [EX [~ [p3_7<=5]]]]]] & [~ [EG [~ [[PaySchemeData_p21_6<=1 | ~ [E [true U ~ [[3<=p5_4 | [ConsumerPayment_p3<=p6_1 | OfferResponce_p10<=PaymentAmount_p11_6]]]]]]]]] & ~ [E [~ [[PaySchemeData_p21_6<=1 | ~ [E [true U ~ [[3<=p5_4 | [ConsumerPayment_p3<=p6_1 | OfferResponce_p10<=PaymentAmount_p11_6]]]]]]] U [~ [Payment_p20_9<=1] & ~ [[PaySchemeData_p21_6<=1 | ~ [E [true U ~ [[3<=p5_4 | [ConsumerPayment_p3<=p6_1 | OfferResponce_p10<=PaymentAmount_p11_6]]]]]]]]]]]] | ~ [EG [~ [EX [~ [[E [DeliveryNote_p22_14<=3 U p2_2<=0] | ~ [EX [~ [4<=Status_p22_11]]]]]]]]]]

abstracting: (4<=Status_p22_11)
states: 0
.abstracting: (p2_2<=0)
states: 15,758,432 (7)
abstracting: (DeliveryNote_p22_14<=3)
states: 17,403,904 (7)
..
EG iterations: 1
abstracting: (OfferResponce_p10<=PaymentAmount_p11_6)
states: 2,963,696 (6)
abstracting: (ConsumerPayment_p3<=p6_1)
states: 15,870,720 (7)
abstracting: (3<=p5_4)
states: 3,275,380 (6)
abstracting: (PaySchemeData_p21_6<=1)
states: 17,288,224 (7)
abstracting: (Payment_p20_9<=1)
states: 17,288,224 (7)
abstracting: (OfferResponce_p10<=PaymentAmount_p11_6)
states: 2,963,696 (6)
abstracting: (ConsumerPayment_p3<=p6_1)
states: 15,870,720 (7)
abstracting: (3<=p5_4)
states: 3,275,380 (6)
abstracting: (PaySchemeData_p21_6<=1)
states: 17,288,224 (7)
abstracting: (OfferResponce_p10<=PaymentAmount_p11_6)
states: 2,963,696 (6)
abstracting: (ConsumerPayment_p3<=p6_1)
states: 15,870,720 (7)
abstracting: (3<=p5_4)
states: 3,275,380 (6)
abstracting: (PaySchemeData_p21_6<=1)
states: 17,288,224 (7)
.
EG iterations: 1
abstracting: (p3_7<=5)
states: 17,406,024 (7)
..-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.257sec

checking: A [AX [AG [~ [[AX [1<=PaymentRequest_p11_9] & EG [1<=p5_4]]]]] U [~ [EF [[3<=p11_11 & 2<=Organization_p20_7]]] | [[~ [[[DeliveryResponse_p12_6<=4 & p3_4<=2] & p10_2<=DeliveryNote_p22_14]] & [AF [AG [Order_p22_6<=p6_7]] & Status_p21_9<=Delivery_p20_10]] | 4<=Delivery_p22_8]]]
normalized: [~ [EG [~ [[[4<=Delivery_p22_8 | [[Status_p21_9<=Delivery_p20_10 & ~ [EG [E [true U ~ [Order_p22_6<=p6_7]]]]] & ~ [[p10_2<=DeliveryNote_p22_14 & [DeliveryResponse_p12_6<=4 & p3_4<=2]]]]] | ~ [E [true U [3<=p11_11 & 2<=Organization_p20_7]]]]]]] & ~ [E [~ [[[4<=Delivery_p22_8 | [[Status_p21_9<=Delivery_p20_10 & ~ [EG [E [true U ~ [Order_p22_6<=p6_7]]]]] & ~ [[p10_2<=DeliveryNote_p22_14 & [DeliveryResponse_p12_6<=4 & p3_4<=2]]]]] | ~ [E [true U [3<=p11_11 & 2<=Organization_p20_7]]]]] U [EX [E [true U [EG [1<=p5_4] & ~ [EX [~ [1<=PaymentRequest_p11_9]]]]]] & ~ [[[4<=Delivery_p22_8 | [[Status_p21_9<=Delivery_p20_10 & ~ [EG [E [true U ~ [Order_p22_6<=p6_7]]]]] & ~ [[p10_2<=DeliveryNote_p22_14 & [DeliveryResponse_p12_6<=4 & p3_4<=2]]]]] | ~ [E [true U [3<=p11_11 & 2<=Organization_p20_7]]]]]]]]]

abstracting: (2<=Organization_p20_7)
states: 117,800 (5)
abstracting: (3<=p11_11)
states: 0
abstracting: (p3_4<=2)
states: 17,400,376 (7)
abstracting: (DeliveryResponse_p12_6<=4)
states: 17,406,024 (7)
abstracting: (p10_2<=DeliveryNote_p22_14)
states: 16,116,192 (7)
abstracting: (Order_p22_6<=p6_7)
states: 12,186,344 (7)

EG iterations: 0
abstracting: (Status_p21_9<=Delivery_p20_10)
states: 16,285,544 (7)
abstracting: (4<=Delivery_p22_8)
states: 0
abstracting: (1<=PaymentRequest_p11_9)
states: 1,535,304 (6)
.abstracting: (1<=p5_4)
states: 12,608,338 (7)
.
EG iterations: 1
.abstracting: (2<=Organization_p20_7)
states: 117,800 (5)
abstracting: (3<=p11_11)
states: 0
abstracting: (p3_4<=2)
states: 17,400,376 (7)
abstracting: (DeliveryResponse_p12_6<=4)
states: 17,406,024 (7)
abstracting: (p10_2<=DeliveryNote_p22_14)
states: 16,116,192 (7)
abstracting: (Order_p22_6<=p6_7)
states: 12,186,344 (7)

EG iterations: 0
abstracting: (Status_p21_9<=Delivery_p20_10)
states: 16,285,544 (7)
abstracting: (4<=Delivery_p22_8)
states: 0
abstracting: (2<=Organization_p20_7)
states: 117,800 (5)
abstracting: (3<=p11_11)
states: 0
abstracting: (p3_4<=2)
states: 17,400,376 (7)
abstracting: (DeliveryResponse_p12_6<=4)
states: 17,406,024 (7)
abstracting: (p10_2<=DeliveryNote_p22_14)
states: 16,116,192 (7)
abstracting: (Order_p22_6<=p6_7)
states: 12,186,344 (7)

EG iterations: 0
abstracting: (Status_p21_9<=Delivery_p20_10)
states: 16,285,544 (7)
abstracting: (4<=Delivery_p22_8)
states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.478sec

checking: E [[A [[Order_p22_3<=DeliveryNote_p22_12 & 3<=Status_p20_6] U EF [[~ [Order_p22_10<=PaymentRequest_p11_9] | [PaymentNote_p21_13<=0 | 2<=p3_9]]]] | EG [EG [[EX [DeliveryRequest_p12_5<=1] | ~ [ConsumerOffer_p1<=2]]]]] U AG [[AF [AF [Order_p22_3<=Order_p22_10]] & [[~ [[p11_8<=Organization_p21_4 | DeliveryRequest_p12_5<=0]] & EX [1<=Organization_p22_2]] & ~ [EG [p7_1<=4]]]]]]
normalized: E [[EG [EG [[~ [ConsumerOffer_p1<=2] | EX [DeliveryRequest_p12_5<=1]]]] | [~ [EG [~ [E [true U [[PaymentNote_p21_13<=0 | 2<=p3_9] | ~ [Order_p22_10<=PaymentRequest_p11_9]]]]]] & ~ [E [~ [E [true U [[PaymentNote_p21_13<=0 | 2<=p3_9] | ~ [Order_p22_10<=PaymentRequest_p11_9]]]] U [~ [[Order_p22_3<=DeliveryNote_p22_12 & 3<=Status_p20_6]] & ~ [E [true U [[PaymentNote_p21_13<=0 | 2<=p3_9] | ~ [Order_p22_10<=PaymentRequest_p11_9]]]]]]]]] U ~ [E [true U ~ [[[~ [EG [p7_1<=4]] & [EX [1<=Organization_p22_2] & ~ [[p11_8<=Organization_p21_4 | DeliveryRequest_p12_5<=0]]]] & ~ [EG [EG [~ [Order_p22_3<=Order_p22_10]]]]]]]]]

abstracting: (Order_p22_3<=Order_p22_10)
states: 15,915,888 (7)
................
EG iterations: 16
.
EG iterations: 1
abstracting: (DeliveryRequest_p12_5<=0)
states: 14,627,748 (7)
abstracting: (p11_8<=Organization_p21_4)
states: 4,493,624 (6)
abstracting: (1<=Organization_p22_2)
states: 1,647,592 (6)
.abstracting: (p7_1<=4)
states: 17,406,024 (7)

EG iterations: 0
abstracting: (Order_p22_10<=PaymentRequest_p11_9)
states: 15,559,224 (7)
abstracting: (2<=p3_9)
states: 129,880 (5)
abstracting: (PaymentNote_p21_13<=0)
states: 15,248,736 (7)
abstracting: (3<=Status_p20_6)
states: 5,648 (3)
abstracting: (Order_p22_3<=DeliveryNote_p22_12)
states: 15,915,888 (7)
abstracting: (Order_p22_10<=PaymentRequest_p11_9)
states: 15,559,224 (7)
abstracting: (2<=p3_9)
states: 129,880 (5)
abstracting: (PaymentNote_p21_13<=0)
states: 15,248,736 (7)
abstracting: (Order_p22_10<=PaymentRequest_p11_9)
states: 15,559,224 (7)
abstracting: (2<=p3_9)
states: 129,880 (5)
abstracting: (PaymentNote_p21_13<=0)
states: 15,248,736 (7)
.
EG iterations: 1
abstracting: (DeliveryRequest_p12_5<=1)
states: 17,406,024 (7)
.abstracting: (ConsumerOffer_p1<=2)
states: 17,369,512 (7)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.529sec

checking: E [[AX [[~ [Order_p20<=2] | [EF [5<=WhatDeliver_p12_1] | p7_3<=2]]] | [[MerchantOffer_p2<=Status_p21_11 | [5<=p6_2 & [[EF [BrandList_p11_2<=Status_p22_11] | ~ [5<=MerchantOffer_p2]] & E [Organization_p21_4<=3 U DeliveryNote_p22_14<=Organization_p20_7]]]] & A [~ [[~ [1<=Status_p21_5] & [3<=p2_2 & Payment_p21_1<=PaySchemeData_p21_10]]] U E [p11_7<=2 U 1<=p7_1]]]] U 5<=p12_7]
normalized: E [[[[~ [EG [~ [E [p11_7<=2 U 1<=p7_1]]]] & ~ [E [~ [E [p11_7<=2 U 1<=p7_1]] U [[[3<=p2_2 & Payment_p21_1<=PaySchemeData_p21_10] & ~ [1<=Status_p21_5]] & ~ [E [p11_7<=2 U 1<=p7_1]]]]]] & [MerchantOffer_p2<=Status_p21_11 | [5<=p6_2 & [E [Organization_p21_4<=3 U DeliveryNote_p22_14<=Organization_p20_7] & [~ [5<=MerchantOffer_p2] | E [true U BrandList_p11_2<=Status_p22_11]]]]]] | ~ [EX [~ [[[p7_3<=2 | E [true U 5<=WhatDeliver_p12_1]] | ~ [Order_p20<=2]]]]]] U 5<=p12_7]

abstracting: (5<=p12_7)
states: 0
abstracting: (Order_p20<=2)
states: 17,400,376 (7)
abstracting: (5<=WhatDeliver_p12_1)
states: 0
abstracting: (p7_3<=2)
states: 17,072,184 (7)
.abstracting: (BrandList_p11_2<=Status_p22_11)
states: 16,178,064 (7)
abstracting: (5<=MerchantOffer_p2)
states: 0
abstracting: (DeliveryNote_p22_14<=Organization_p20_7)
states: 14,494,080 (7)
abstracting: (Organization_p21_4<=3)
states: 17,405,344 (7)
abstracting: (5<=p6_2)
states: 108
abstracting: (MerchantOffer_p2<=Status_p21_11)
states: 10,681,896 (7)
abstracting: (1<=p7_1)
states: 1,647,592 (6)
abstracting: (p11_7<=2)
states: 17,406,024 (7)
abstracting: (1<=Status_p21_5)
states: 1,647,592 (6)
abstracting: (Payment_p21_1<=PaySchemeData_p21_10)
states: 15,921,352 (7)
abstracting: (3<=p2_2)
states: 5,648 (3)
abstracting: (1<=p7_1)
states: 1,647,592 (6)
abstracting: (p11_7<=2)
states: 17,406,024 (7)
abstracting: (1<=p7_1)
states: 1,647,592 (6)
abstracting: (p11_7<=2)
states: 17,406,024 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.529sec

checking: E [[~ [EX [[EX [p6_7<=0] & ~ [[4<=p6_2 | p12_7<=5]]]]] | E [EF [3<=ConsumerDelivery_p6_0] U [[AG [Status_p21_11<=p5_1] | ~ [[Delivery_p20_10<=4 | Order_p20<=4]]] | EG [EG [ConsumerOffer_p1<=5]]]]] U [4<=p6_3 | [[AG [Order_p20<=3] & [[BrandSelection_p11_5<=OfferRequest_p10 & ~ [EX [Delivery_p22_8<=DeliveryHandlerDelivery_p8_0]]] | [EX [p7_2<=5] | [AG [p8_2<=2] & EF [1<=p3_10]]]]] | ~ [A [p3_10<=PaymentNote_p21_13 U ConsumerDelivery_p6_0<=2]]]]]
normalized: E [[~ [EX [[~ [[4<=p6_2 | p12_7<=5]] & EX [p6_7<=0]]]] | E [E [true U 3<=ConsumerDelivery_p6_0] U [EG [EG [ConsumerOffer_p1<=5]] | [~ [[Delivery_p20_10<=4 | Order_p20<=4]] | ~ [E [true U ~ [Status_p21_11<=p5_1]]]]]]] U [4<=p6_3 | [~ [[~ [E [~ [ConsumerDelivery_p6_0<=2] U [~ [ConsumerDelivery_p6_0<=2] & ~ [p3_10<=PaymentNote_p21_13]]]] & ~ [EG [~ [ConsumerDelivery_p6_0<=2]]]]] | [~ [E [true U ~ [Order_p20<=3]]] & [[EX [p7_2<=5] | [~ [E [true U ~ [p8_2<=2]]] & E [true U 1<=p3_10]]] | [BrandSelection_p11_5<=OfferRequest_p10 & ~ [EX [Delivery_p22_8<=DeliveryHandlerDelivery_p8_0]]]]]]]]

abstracting: (Delivery_p22_8<=DeliveryHandlerDelivery_p8_0)
states: 16,288,788 (7)
.abstracting: (BrandSelection_p11_5<=OfferRequest_p10)
states: 16,092,612 (7)
abstracting: (1<=p3_10)
states: 1,647,592 (6)
abstracting: (p8_2<=2)
states: 17,406,024 (7)
abstracting: (p7_2<=5)
states: 17,406,024 (7)
.abstracting: (Order_p20<=3)
states: 17,405,888 (7)
abstracting: (ConsumerDelivery_p6_0<=2)
states: 17,400,376 (7)
.
EG iterations: 1
abstracting: (p3_10<=PaymentNote_p21_13)
states: 15,911,280 (7)
abstracting: (ConsumerDelivery_p6_0<=2)
states: 17,400,376 (7)
abstracting: (ConsumerDelivery_p6_0<=2)
states: 17,400,376 (7)
abstracting: (4<=p6_3)
states: 2,120 (3)
abstracting: (Status_p21_11<=p5_1)
states: 15,350,544 (7)
abstracting: (Order_p20<=4)
states: 17,406,024 (7)
abstracting: (Delivery_p20_10<=4)
states: 17,406,024 (7)
abstracting: (ConsumerOffer_p1<=5)
states: 17,406,024 (7)

EG iterations: 0

EG iterations: 0
abstracting: (3<=ConsumerDelivery_p6_0)
states: 5,648 (3)
abstracting: (p6_7<=0)
states: 14,258,424 (7)
.abstracting: (p12_7<=5)
states: 17,406,024 (7)
abstracting: (4<=p6_2)
states: 5,228 (3)
.-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.209sec

checking: [EX [p5_4<=p10_0] & [AG [[p7_1<=p10_0 & ~ [A [E [1<=PaymentAmount_p11_6 U DeliveryRequest_p12_5<=p3_7] U ~ [p1_3<=2]]]]] | A [[~ [[E [Delivery_p20_10<=2 U HowDeliver_p12_2<=DeliveryNote_p22_14] | AX [p3_2<=4]]] | [p3_4<=Status_p22_11 | [AX [p12_3<=4] | [[Organization_p21_2<=p3_3 & HowDeliver_p12_2<=5] | [ConsumerPayment_p3<=5 & 1<=p3_9]]]]] U EG [AF [[PaymentAmount_p11_6<=3 & PayReceipt_p21_15<=2]]]]]]
normalized: [[[~ [EG [~ [EG [~ [EG [~ [[PaymentAmount_p11_6<=3 & PayReceipt_p21_15<=2]]]]]]]] & ~ [E [~ [EG [~ [EG [~ [[PaymentAmount_p11_6<=3 & PayReceipt_p21_15<=2]]]]]] U [~ [EG [~ [EG [~ [[PaymentAmount_p11_6<=3 & PayReceipt_p21_15<=2]]]]]] & ~ [[~ [[~ [EX [~ [p3_2<=4]]] | E [Delivery_p20_10<=2 U HowDeliver_p12_2<=DeliveryNote_p22_14]]] | [p3_4<=Status_p22_11 | [[[Organization_p21_2<=p3_3 & HowDeliver_p12_2<=5] | [ConsumerPayment_p3<=5 & 1<=p3_9]] | ~ [EX [~ [p12_3<=4]]]]]]]]]]] | ~ [E [true U ~ [[p7_1<=p10_0 & ~ [[~ [EG [p1_3<=2]] & ~ [E [p1_3<=2 U [p1_3<=2 & ~ [E [1<=PaymentAmount_p11_6 U DeliveryRequest_p12_5<=p3_7]]]]]]]]]]]] & EX [p5_4<=p10_0]]

abstracting: (p5_4<=p10_0)
states: 8,819,221 (6)
.abstracting: (DeliveryRequest_p12_5<=p3_7)
states: 14,863,888 (7)
abstracting: (1<=PaymentAmount_p11_6)
states: 1,535,304 (6)
abstracting: (p1_3<=2)
states: 17,400,376 (7)
abstracting: (p1_3<=2)
states: 17,400,376 (7)
abstracting: (p1_3<=2)
states: 17,400,376 (7)
.
EG iterations: 1
abstracting: (p7_1<=p10_0)
states: 17,066,928 (7)
abstracting: (p12_3<=4)
states: 17,406,024 (7)
.abstracting: (1<=p3_9)
states: 2,492,728 (6)
abstracting: (ConsumerPayment_p3<=5)
states: 17,406,024 (7)
abstracting: (HowDeliver_p12_2<=5)
states: 17,406,024 (7)
abstracting: (Organization_p21_2<=p3_3)
states: 15,870,720 (7)
abstracting: (p3_4<=Status_p22_11)
states: 16,066,024 (7)
abstracting: (HowDeliver_p12_2<=DeliveryNote_p22_14)
states: 14,997,072 (7)
abstracting: (Delivery_p20_10<=2)
states: 17,400,376 (7)
abstracting: (p3_2<=4)
states: 17,406,024 (7)
.abstracting: (PayReceipt_p21_15<=2)
states: 17,400,376 (7)
abstracting: (PaymentAmount_p11_6<=3)
states: 17,406,024 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (PayReceipt_p21_15<=2)
states: 17,400,376 (7)
abstracting: (PaymentAmount_p11_6<=3)
states: 17,406,024 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (PayReceipt_p21_15<=2)
states: 17,400,376 (7)
abstracting: (PaymentAmount_p11_6<=3)
states: 17,406,024 (7)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.854sec

checking: [E [~ [[EX [[[5<=p6_4 & Delivery_p20<=p5_2] | E [Payment_p20_9<=3 U p12_7<=3]]] & AG [[~ [PaidFor_p11_1<=p5_1] & A [p3_5<=1 U 1<=Organization_p20_7]]]]] U [[EX [[AX [4<=ConsumerOffer_p1] & p12_0<=p12_7]] & EX [~ [AF [Order_p22_10<=2]]]] & [5<=p3_3 | [[[E [p7_3<=2 U 1<=DeliveryHandlerDelivery_p8_0] | E [OfferResponce_p10<=1 U p6_4<=p6_7]] & [EG [p8_2<=p5_4] | A [DeliveryResponse_p12_6<=5 U 4<=Payment_p20]]] & DeliveryNote_p22_14<=1]]]] | EG [EX [AG [EX [p12_4<=p6_3]]]]]
normalized: [EG [EX [~ [E [true U ~ [EX [p12_4<=p6_3]]]]]] | E [~ [[~ [E [true U ~ [[[~ [EG [~ [1<=Organization_p20_7]]] & ~ [E [~ [1<=Organization_p20_7] U [~ [p3_5<=1] & ~ [1<=Organization_p20_7]]]]] & ~ [PaidFor_p11_1<=p5_1]]]]] & EX [[E [Payment_p20_9<=3 U p12_7<=3] | [5<=p6_4 & Delivery_p20<=p5_2]]]]] U [[5<=p3_3 | [DeliveryNote_p22_14<=1 & [[[~ [EG [~ [4<=Payment_p20]]] & ~ [E [~ [4<=Payment_p20] U [~ [DeliveryResponse_p12_6<=5] & ~ [4<=Payment_p20]]]]] | EG [p8_2<=p5_4]] & [E [OfferResponce_p10<=1 U p6_4<=p6_7] | E [p7_3<=2 U 1<=DeliveryHandlerDelivery_p8_0]]]]] & [EX [EG [~ [Order_p22_10<=2]]] & EX [[p12_0<=p12_7 & ~ [EX [~ [4<=ConsumerOffer_p1]]]]]]]]]

abstracting: (4<=ConsumerOffer_p1)
states: 2,120 (3)
.abstracting: (p12_0<=p12_7)
states: 14,849,640 (7)
.abstracting: (Order_p22_10<=2)
states: 17,406,024 (7)
.
EG iterations: 1
.abstracting: (1<=DeliveryHandlerDelivery_p8_0)
states: 10,779,912 (7)
abstracting: (p7_3<=2)
states: 17,072,184 (7)
abstracting: (p6_4<=p6_7)
states: 14,627,748 (7)
abstracting: (OfferResponce_p10<=1)
states: 17,406,024 (7)
abstracting: (p8_2<=p5_4)
states: 16,830,238 (7)
.................................................
EG iterations: 49
abstracting: (4<=Payment_p20)
states: 136
abstracting: (DeliveryResponse_p12_6<=5)
states: 17,406,024 (7)
abstracting: (4<=Payment_p20)
states: 136
abstracting: (4<=Payment_p20)
states: 136
.
EG iterations: 1
abstracting: (DeliveryNote_p22_14<=1)
states: 17,002,248 (7)
abstracting: (5<=p3_3)
states: 0
abstracting: (Delivery_p20<=p5_2)
states: 15,841,202 (7)
abstracting: (5<=p6_4)
states: 60
abstracting: (p12_7<=3)
states: 17,406,024 (7)
abstracting: (Payment_p20_9<=3)
states: 17,405,888 (7)
.abstracting: (PaidFor_p11_1<=p5_1)
states: 15,953,524 (7)
abstracting: (1<=Organization_p20_7)
states: 1,647,592 (6)
abstracting: (p3_5<=1)
states: 16,572,232 (7)
abstracting: (1<=Organization_p20_7)
states: 1,647,592 (6)
abstracting: (1<=Organization_p20_7)
states: 1,647,592 (6)
............................................................................................................................................................................................
EG iterations: 188
abstracting: (p12_4<=p6_3)
states: 5,556,552 (6)
...
EG iterations: 1
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.297sec

totally nodes used: 17781879 (1.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 12850816 37731090 50581906
used/not used/entry size/cache size: 37497921 29610943 16 1024MB
basic ops cache: hits/miss/sum: 1511352 5755201 7266553
used/not used/entry size/cache size: 6822793 9954423 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: 108141 383408 491549
used/not used/entry size/cache size: 375176 8013432 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 52672413
1 11705061
2 2237444
3 408298
4 69695
5 10510
6 2129
7 1622
8 433
9 366
>= 10 893

Total processing time: 0m25.621sec


BK_STOP 1678606803913

--------------------
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:1581 (35), effective:301 (6)

initing FirstDep: 0m 0.000sec


iterations count:282 (6), effective:42 (0)

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

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

iterations count:299 (6), effective:58 (1)

iterations count:298 (6), effective:58 (1)

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

iterations count:299 (6), effective:58 (1)

iterations count:299 (6), effective:58 (1)

iterations count:881 (19), effective:172 (3)

iterations count:243 (5), effective:41 (0)

iterations count:244 (5), effective:41 (0)

iterations count:238 (5), effective:38 (0)

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

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

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

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

iterations count:102 (2), effective:18 (0)

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

iterations count:71 (1), effective:7 (0)

iterations count:285 (6), effective:51 (1)

iterations count:285 (6), effective:51 (1)

iterations count:467 (10), effective:88 (1)

iterations count:285 (6), effective:51 (1)

iterations count:242 (5), effective:42 (0)

iterations count:841 (18), effective:160 (3)

iterations count:242 (5), effective:42 (0)

iterations count:242 (5), effective:42 (0)

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

iterations count:127 (2), effective:28 (0)

iterations count:127 (2), effective:28 (0)

iterations count:127 (2), effective:28 (0)

iterations count:141 (3), effective:27 (0)

iterations count:55 (1), effective:5 (0)

iterations count:257 (5), effective:44 (0)

iterations count:257 (5), effective:44 (0)

iterations count:257 (5), effective:44 (0)

iterations count:256 (5), effective:44 (0)

iterations count:875 (19), effective:173 (3)

iterations count:256 (5), effective:44 (0)

iterations count:263 (5), effective:46 (1)

iterations count:681 (15), effective:132 (2)

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

iterations count:697 (15), effective:136 (3)

iterations count:58 (1), effective:5 (0)

iterations count:294 (6), effective:49 (1)

iterations count:429 (9), effective:85 (1)

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

iterations count:54 (1), effective:4 (0)

iterations count:103 (2), effective:17 (0)

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

iterations count:97 (2), effective:17 (0)

iterations count:103 (2), effective:14 (0)

iterations count:149 (3), effective:35 (0)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IOTPpurchase-PT-C05M04P03D02"
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 IOTPpurchase-PT-C05M04P03D02, 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 r225-tall-167856407100121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;