fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r065kn-blw3-146358913200066
Last Updated
June 30, 2016

About the Execution of Marcie for IOTPpurchase-PT-C01M01P01D01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5417.140 5461.00 5059.00 10.10 FTTFFTTTFTFFFFTT normal

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-2979
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 r065kn-blw3-146358913200066
=====================================================================


--------------------
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 1463723618990


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: IOTPpurchase_PT_C01M01P01D01
(NrP: 111 NrTr: 45 NrArc: 224)

net check time: 0m 0.000sec

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

init dd package: 0m 3.990sec


RS generation: 0m 0.022sec


-> reachability set: #nodes 651 (6.5e+02) #states 204



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

checking: 1<=p12_3
normalized: 1<=p12_3

abstracting: (1<=p12_3) states: 196
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AX [~ [~ [1<=Organization_p20_7]]]
normalized: ~ [EX [~ [1<=Organization_p20_7]]]

abstracting: (1<=Organization_p20_7) states: 4
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: 2<=Delivery_p22_8
normalized: 2<=Delivery_p22_8

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

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

MC time: 0m 0.000sec

checking: ~ [EX [DeliveryNote_p22_14<=p4_4]]
normalized: ~ [EX [DeliveryNote_p22_14<=p4_4]]

abstracting: (DeliveryNote_p22_14<=p4_4) states: 196
.-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: ~ [Status_p22_13<=BrandList_p11_2]
normalized: ~ [Status_p22_13<=BrandList_p11_2]

abstracting: (Status_p22_13<=BrandList_p11_2) states: 196
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: Order_p22_10<=p4_3
normalized: Order_p22_10<=p4_3

abstracting: (Order_p22_10<=p4_3) states: 200
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: HowDeliver_p12_2<=Status_p21_9
normalized: HowDeliver_p12_2<=Status_p21_9

abstracting: (HowDeliver_p12_2<=Status_p21_9) states: 196
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: ~ [MerchantPayment_p4_0<=p6_4]
normalized: ~ [MerchantPayment_p4_0<=p6_4]

abstracting: (MerchantPayment_p4_0<=p6_4) states: 184
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [EX [p11_13<=p11_7]]
normalized: ~ [E [true U ~ [EX [p11_13<=p11_7]]]]

abstracting: (p11_13<=p11_7) states: 200
.-> the formula is FALSE

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

MC time: 0m 0.017sec

checking: BrandSelection_p11_5<=p7_2
normalized: BrandSelection_p11_5<=p7_2

abstracting: (BrandSelection_p11_5<=p7_2) 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.001sec

checking: AG [~ [~ [[DeliveryHandlerDelivery_p8_0<=p6_1 | 2<=p5_3]]]]
normalized: ~ [E [true U ~ [[DeliveryHandlerDelivery_p8_0<=p6_1 | 2<=p5_3]]]]

abstracting: (2<=p5_3) states: 0
abstracting: (DeliveryHandlerDelivery_p8_0<=p6_1) states: 108
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: [2<=PayReceipt_p21_15 | [~ [~ [[1<=p4_1 | p7_3<=p1_1]]] | 3<=PaySchemeData_p21_6]]
normalized: [2<=PayReceipt_p21_15 | [3<=PaySchemeData_p21_6 | [1<=p4_1 | p7_3<=p1_1]]]

abstracting: (p7_3<=p1_1) states: 164
abstracting: (1<=p4_1) states: 4
abstracting: (3<=PaySchemeData_p21_6) states: 0
abstracting: (2<=PayReceipt_p21_15) states: 0
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: E [EF [p11_0<=Status_p21_5] U ~ [[1<=p6_4 | p11_3<=Payment_p21_7]]]
normalized: E [E [true U p11_0<=Status_p21_5] U ~ [[1<=p6_4 | p11_3<=Payment_p21_7]]]

abstracting: (p11_3<=Payment_p21_7) states: 6
abstracting: (1<=p6_4) states: 8
abstracting: (p11_0<=Status_p21_5) states: 8
-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: AG [[[[p11_0<=p5_1 | 3<=p4_4] | ~ [3<=p5_3]] & [[Order_p20<=p8_1 | p6_5<=DeliveryNote_p22_14] | [2<=PaymentRequest_p11_9 & Organization_p21_4<=PaymentHandlerPayment_p5_0]]]]
normalized: ~ [E [true U ~ [[[[2<=PaymentRequest_p11_9 & Organization_p21_4<=PaymentHandlerPayment_p5_0] | [Order_p20<=p8_1 | p6_5<=DeliveryNote_p22_14]] & [~ [3<=p5_3] | [p11_0<=p5_1 | 3<=p4_4]]]]]]

abstracting: (3<=p4_4) states: 0
abstracting: (p11_0<=p5_1) states: 6
abstracting: (3<=p5_3) states: 0
abstracting: (p6_5<=DeliveryNote_p22_14) states: 180
abstracting: (Order_p20<=p8_1) states: 200
abstracting: (Organization_p21_4<=PaymentHandlerPayment_p5_0) states: 200
abstracting: (2<=PaymentRequest_p11_9) states: 0
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: [[[EF [p5_2<=p6_7] & EX [p6_7<=Organization_p21_2]] | ~ [3<=p8_3]] | [[AX [p2_2<=p4_2] | ~ [~ [2<=p6_4]]] | [EF [Order_p20<=WhatDeliver_p12_1] | EX [1<=WhatDeliver_p12_1]]]]
normalized: [[[EX [p6_7<=Organization_p21_2] & E [true U p5_2<=p6_7]] | ~ [3<=p8_3]] | [[2<=p6_4 | ~ [EX [~ [p2_2<=p4_2]]]] | [E [true U Order_p20<=WhatDeliver_p12_1] | EX [1<=WhatDeliver_p12_1]]]]

abstracting: (1<=WhatDeliver_p12_1) states: 4
.abstracting: (Order_p20<=WhatDeliver_p12_1) states: 200
abstracting: (p2_2<=p4_2) states: 200
.abstracting: (2<=p6_4) states: 0
abstracting: (3<=p8_3) states: 0
abstracting: (p5_2<=p6_7) states: 202
abstracting: (p6_7<=Organization_p21_2) states: 196
.-> the formula is TRUE

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

MC time: 0m 0.014sec

checking: [1<=ConsumerPayment_p3 | [2<=p11_3 & [~ [[Status_p21_11<=p3_4 & 3<=DeliveryNote_p22_14]] | [[3<=PaymentAmount_p11_6 | Payment_p21_1<=p11_4] | [DeliveryRequest_p12_5<=p7_1 & PaySchemeData_p11_10<=OfferRequest_p10]]]]]
normalized: [1<=ConsumerPayment_p3 | [2<=p11_3 & [[[DeliveryRequest_p12_5<=p7_1 & PaySchemeData_p11_10<=OfferRequest_p10] | [3<=PaymentAmount_p11_6 | Payment_p21_1<=p11_4]] | ~ [[Status_p21_11<=p3_4 & 3<=DeliveryNote_p22_14]]]]]

abstracting: (3<=DeliveryNote_p22_14) states: 0
abstracting: (Status_p21_11<=p3_4) states: 200
abstracting: (Payment_p21_1<=p11_4) states: 204
abstracting: (3<=PaymentAmount_p11_6) states: 0
abstracting: (PaySchemeData_p11_10<=OfferRequest_p10) states: 198
abstracting: (DeliveryRequest_p12_5<=p7_1) states: 196
abstracting: (2<=p11_3) states: 0
abstracting: (1<=ConsumerPayment_p3) states: 4
-> the formula is FALSE

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

MC time: 0m 0.003sec


Total processing time: 0m 5.425sec


BK_STOP 1463723624451

--------------------
content from stderr:

check for maximal unmarked siphon
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:254 (5), effective:46 (1)

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

iterations count:248 (5), effective:43 (0)

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

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

iterations count:48 (1), effective:1 (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="/home/hulinhub/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-2979"
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 r065kn-blw3-146358913200066"
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 ;