Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is IOTPpurchase-PT-C01M01P01D01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440473800102
=====================================================================

--------------------
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-C01M01P01D01-CTLCardinality-0
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-1
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-15
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-2
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-3
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-4
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-5
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-6
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-7
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-8
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494452243709

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: IOTPpurchase_PT_C01M01P01D01
(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 1.082sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 188 (1.9e+02) #states 204



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

checking: 3<=PayReceipt_p21_15
normalized: 3<=PayReceipt_p21_15

abstracting: (3<=PayReceipt_p21_15)
states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: 2<=p12_4
normalized: 2<=p12_4

abstracting: (2<=p12_4)
states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: p4_2<=Order_p20
normalized: p4_2<=Order_p20

abstracting: (p4_2<=Order_p20)
states: 200
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: Status_p21_11<=p8_3
normalized: Status_p21_11<=p8_3

abstracting: (Status_p21_11<=p8_3)
states: 202
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [WhatDeliver_p12_1<=p3_3]
normalized: ~ [WhatDeliver_p12_1<=p3_3]

abstracting: (WhatDeliver_p12_1<=p3_3)
states: 200
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [EF [[Order_p22_10<=PaymentRequest_p11_9 & 1<=p11_8]]]
normalized: ~ [EG [~ [E [true U [Order_p22_10<=PaymentRequest_p11_9 & 1<=p11_8]]]]]

abstracting: (1<=p11_8)
states: 200
abstracting: (Order_p22_10<=PaymentRequest_p11_9)
states: 200
.
EG iterations: 1
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [[AX [p3_3<=Organization_p21_2] & ~ [~ [PaymentNote_p21_13<=Order_p22_10]]] & 2<=p4_4]
normalized: [2<=p4_4 & [~ [EX [~ [p3_3<=Organization_p21_2]]] & PaymentNote_p21_13<=Order_p22_10]]

abstracting: (PaymentNote_p21_13<=Order_p22_10)
states: 200
abstracting: (p3_3<=Organization_p21_2)
states: 200
.abstracting: (2<=p4_4)
states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [AX [Delivery_p22_8<=MerchantDelivery_p4_6] U ~ [[2<=PaymentAmount_p11_6 & DeliveryRequest_p12_5<=p11_0]]]
normalized: E [~ [EX [~ [Delivery_p22_8<=MerchantDelivery_p4_6]]] U ~ [[2<=PaymentAmount_p11_6 & DeliveryRequest_p12_5<=p11_0]]]

abstracting: (DeliveryRequest_p12_5<=p11_0)
states: 204
abstracting: (2<=PaymentAmount_p11_6)
states: 0
abstracting: (Delivery_p22_8<=MerchantDelivery_p4_6)
states: 200
.-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [[[~ [2<=p3_3] & AX [3<=p4_2]] | [p4_2<=Payment_p20_9 & EX [PaymentAmount_p11_6<=Status_p20]]] | p6_3<=p11_3]
normalized: [p6_3<=p11_3 | [[p4_2<=Payment_p20_9 & EX [PaymentAmount_p11_6<=Status_p20]] | [~ [EX [~ [3<=p4_2]]] & ~ [2<=p3_3]]]]

abstracting: (2<=p3_3)
states: 0
abstracting: (3<=p4_2)
states: 0
.abstracting: (PaymentAmount_p11_6<=Status_p20)
states: 200
.abstracting: (p4_2<=Payment_p20_9)
states: 200
abstracting: (p6_3<=p11_3)
states: 204
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [[AG [2<=Delivery_p20] & [[1<=p10_0 & p5_4<=p10_2] & [Delivery_p22_4<=p4_4 & DeliveryNote_p22_12<=MerchantPayment_p4_0]]]]
normalized: EG [[[[Delivery_p22_4<=p4_4 & DeliveryNote_p22_12<=MerchantPayment_p4_0] & [1<=p10_0 & p5_4<=p10_2]] & ~ [E [true U ~ [2<=Delivery_p20]]]]]

abstracting: (2<=Delivery_p20)
states: 0
abstracting: (p5_4<=p10_2)
states: 108
abstracting: (1<=p10_0)
states: 196
abstracting: (DeliveryNote_p22_12<=MerchantPayment_p4_0)
states: 200
abstracting: (Delivery_p22_4<=p4_4)
states: 188
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: [[[1<=Order_p22_10 & [[Status_p20<=Status_p22_13 & 2<=Payment_p21_3] & 2<=PaymentAmount_p11_6]] | [3<=p6_5 | AF [3<=MerchantOffer_p2]]] & p1_1<=p7_3]
normalized: [p1_1<=p7_3 & [[3<=p6_5 | ~ [EG [~ [3<=MerchantOffer_p2]]]] | [1<=Order_p22_10 & [2<=PaymentAmount_p11_6 & [Status_p20<=Status_p22_13 & 2<=Payment_p21_3]]]]]

abstracting: (2<=Payment_p21_3)
states: 0
abstracting: (Status_p20<=Status_p22_13)
states: 200
abstracting: (2<=PaymentAmount_p11_6)
states: 0
abstracting: (1<=Order_p22_10)
states: 4
abstracting: (3<=MerchantOffer_p2)
states: 0

EG iterations: 0
abstracting: (3<=p6_5)
states: 0
abstracting: (p1_1<=p7_3)
states: 200
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [3<=BrandList_p11_2 | [[EG [3<=p11_13] | [[3<=Status_p22_13 | 2<=p4_1] | [1<=p8_2 | p3_3<=p3_7]]] & EG [[2<=p11_0 & 1<=PayReceipt_p21_12]]]]
normalized: [3<=BrandList_p11_2 | [EG [[2<=p11_0 & 1<=PayReceipt_p21_12]] & [[[1<=p8_2 | p3_3<=p3_7] | [3<=Status_p22_13 | 2<=p4_1]] | EG [3<=p11_13]]]]

abstracting: (3<=p11_13)
states: 0
.
EG iterations: 1
abstracting: (2<=p4_1)
states: 0
abstracting: (3<=Status_p22_13)
states: 0
abstracting: (p3_3<=p3_7)
states: 200
abstracting: (1<=p8_2)
states: 4
abstracting: (1<=PayReceipt_p21_12)
states: 4
abstracting: (2<=p11_0)
states: 0
.
EG iterations: 1
abstracting: (3<=BrandList_p11_2)
states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [[[[OfferRequest_p10<=Delivery_p22_1 | [3<=DeliveryNote_p22_14 & 3<=ConsumerPayment_p3]] | p6_4<=PaymentRequest_p11_9] | [~ [[1<=p11_4 & Organization_p20_2<=Organization_p21_2]] & p7_3<=Status_p21_11]]]
normalized: ~ [[[p7_3<=Status_p21_11 & ~ [[1<=p11_4 & Organization_p20_2<=Organization_p21_2]]] | [p6_4<=PaymentRequest_p11_9 | [OfferRequest_p10<=Delivery_p22_1 | [3<=DeliveryNote_p22_14 & 3<=ConsumerPayment_p3]]]]]

abstracting: (3<=ConsumerPayment_p3)
states: 0
abstracting: (3<=DeliveryNote_p22_14)
states: 0
abstracting: (OfferRequest_p10<=Delivery_p22_1)
states: 196
abstracting: (p6_4<=PaymentRequest_p11_9)
states: 196
abstracting: (Organization_p20_2<=Organization_p21_2)
states: 200
abstracting: (1<=p11_4)
states: 200
abstracting: (p7_3<=Status_p21_11)
states: 160
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [[~ [[~ [Delivery_p22_4<=PayReceipt_p21_15] | ~ [PaymentRequest_p11_9<=p6_3]]] & ~ [3<=p11_8]] | EG [[[2<=p4_1 | p12_4<=p11_8] | [1<=Delivery_p20 | p3_4<=p11_3]]]]
normalized: [[~ [3<=p11_8] & ~ [[~ [PaymentRequest_p11_9<=p6_3] | ~ [Delivery_p22_4<=PayReceipt_p21_15]]]] | EG [[[1<=Delivery_p20 | p3_4<=p11_3] | [2<=p4_1 | p12_4<=p11_8]]]]

abstracting: (p12_4<=p11_8)
states: 200
abstracting: (2<=p4_1)
states: 0
abstracting: (p3_4<=p11_3)
states: 204
abstracting: (1<=Delivery_p20)
states: 4

EG iterations: 0
abstracting: (Delivery_p22_4<=PayReceipt_p21_15)
states: 188
abstracting: (PaymentRequest_p11_9<=p6_3)
states: 200
abstracting: (3<=p11_8)
states: 0
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [~ [~ [EG [2<=Payment_p20_9]]] | [[2<=Organization_p20_7 | [[1<=p11_4 & p5_2<=p11_8] & [Organization_p20_7<=p1_1 & 1<=DeliveryResponse_p12_6]]] | EF [[p3_5<=p3_3 | Payment_p21_7<=p8_2]]]]
normalized: [[[2<=Organization_p20_7 | [[1<=p11_4 & p5_2<=p11_8] & [Organization_p20_7<=p1_1 & 1<=DeliveryResponse_p12_6]]] | E [true U [p3_5<=p3_3 | Payment_p21_7<=p8_2]]] | EG [2<=Payment_p20_9]]

abstracting: (2<=Payment_p20_9)
states: 0
.
EG iterations: 1
abstracting: (Payment_p21_7<=p8_2)
states: 202
abstracting: (p3_5<=p3_3)
states: 188
abstracting: (1<=DeliveryResponse_p12_6)
states: 8
abstracting: (Organization_p20_7<=p1_1)
states: 200
abstracting: (p5_2<=p11_8)
states: 204
abstracting: (1<=p11_4)
states: 200
abstracting: (2<=Organization_p20_7)
states: 0
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [p4_1<=Organization_p21_8 & [[[[2<=p3_8 & Status_p21_11<=PaymentNote_p21_16] | ~ [3<=Delivery_p22_1]] & Status_p21_5<=Order_p20_8] & [3<=Organization_p21_8 | [[p4_5<=p4_5 | 1<=p7_2] & [p11_13<=p11_13 & PaymentNote_p21_16<=p6_4]]]]]
normalized: [p4_1<=Organization_p21_8 & [[3<=Organization_p21_8 | [[p4_5<=p4_5 | 1<=p7_2] & [p11_13<=p11_13 & PaymentNote_p21_16<=p6_4]]] & [Status_p21_5<=Order_p20_8 & [~ [3<=Delivery_p22_1] | [2<=p3_8 & Status_p21_11<=PaymentNote_p21_16]]]]]

abstracting: (Status_p21_11<=PaymentNote_p21_16)
states: 200
abstracting: (2<=p3_8)
states: 0
abstracting: (3<=Delivery_p22_1)
states: 0
abstracting: (Status_p21_5<=Order_p20_8)
states: 200
abstracting: (PaymentNote_p21_16<=p6_4)
states: 200
abstracting: (p11_13<=p11_13)
states: 204
abstracting: (1<=p7_2)
states: 4
abstracting: (p4_5<=p4_5)
states: 204
abstracting: (3<=Organization_p21_8)
states: 0
abstracting: (p4_1<=Organization_p21_8)
states: 200
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 16563(1.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7523 20980 28503
used/not used/entry size/cache size: 19931 67088933 16 1024MB
basic ops cache: hits/miss/sum: 6549 33078 39627
used/not used/entry size/cache size: 58518 16718698 12 192MB
unary ops cache: hits/miss/sum: 0 136 136
used/not used/entry size/cache size: 136 8388472 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 506 970 1476
used/not used/entry size/cache size: 970 2096182 32 64MB
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 67092303
1 16559
2 2
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.695sec


BK_STOP 1494452245431

--------------------
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:457 (10), effective:83 (1)

initing FirstDep: 0m 0.000sec


iterations count:56 (1), effective:3 (0)

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

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

iterations count:45 (1), effective:0 (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-C01M01P01D01"
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"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C01M01P01D01.tgz
mv IOTPpurchase-PT-C01M01P01D01 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is IOTPpurchase-PT-C01M01P01D01, 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 r031-blw7-149440473800102"
echo "====================================================================="
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
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 ;