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-2265
Executing tool marcie
Input is RwMutex-PT-r0010w0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r092kn-qhx2-143267650200015
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432977770845

Model: RwMutex-PT-r0010w0010
reachability algorithm:
Transition chaining algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=2 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=2 --place-order=5

parse successfull
net created successfully

(NrP: 50 NrTr: 40 NrArc: 300)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m12sec


RS generation: 0m0sec


-> reachability set: #nodes 7795 (7.8e+03) #states 1,034 (3)



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

checking: AX [EF [2<=p11]]
normalized: ~ [EX [~ [E [true U 2<=p11]]]]

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

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [EX [3<=p34]]]
normalized: ~ [E [true U EX [3<=p34]]]

abstracting: (3<=p34) states: 0
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [p44<=p33 U [~ [3<=p36] & ~ [p24<=p20]]]
normalized: E [p44<=p33 U [~ [p24<=p20] & ~ [3<=p36]]]

abstracting: (3<=p36) states: 0
abstracting: (p24<=p20) states: 1,034 (3)
abstracting: (p44<=p33) states: 1,033 (3)
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [AF [[p20<=p14 | 1<=p8]]]
normalized: ~ [E [true U EG [~ [[p20<=p14 | 1<=p8]]]]]

abstracting: (1<=p8) states: 522
abstracting: (p20<=p14) states: 1,033 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [AG [[p7<=p37 | 1<=p4]]]
normalized: E [true U ~ [[p7<=p37 | 1<=p4]]]

abstracting: (1<=p4) states: 522
abstracting: (p7<=p37) states: 1,024 (3)
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [EF [[3<=p28 & 1<=p13]]]
normalized: EG [E [true U [3<=p28 & 1<=p13]]]

abstracting: (1<=p13) states: 1,033 (3)
abstracting: (3<=p28) states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [~ [[3<=p44 & p42<=p46]] U 2<=p45]
normalized: E [~ [[3<=p44 & p42<=p46]] U 2<=p45]

abstracting: (2<=p45) states: 0
abstracting: (p42<=p46) states: 1,033 (3)
abstracting: (3<=p44) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[p44<=p8 | 2<=p30]]
normalized: ~ [E [true U ~ [[p44<=p8 | 2<=p30]]]]

abstracting: (2<=p30) states: 0
abstracting: (p44<=p8) states: 1,034 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [EF [[3<=p26 & 1<=p49]]]
normalized: E [true U E [true U [3<=p26 & 1<=p49]]]

abstracting: (1<=p49) states: 1
abstracting: (3<=p26) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[~ [1<=p43] & [p49<=p16 & p16<=p8]] | AX [p32<=p13]]]
normalized: ~ [E [true U ~ [[~ [EX [~ [p32<=p13]]] | [[p49<=p16 & p16<=p8] & ~ [1<=p43]]]]]]

abstracting: (1<=p43) states: 1
abstracting: (p16<=p8) states: 522
abstracting: (p49<=p16) states: 1,034 (3)
abstracting: (p32<=p13) states: 1,034 (3)
.-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [AG [[p9<=p12 | p24<=p41]]]
normalized: ~ [E [true U E [true U ~ [[p9<=p12 | p24<=p41]]]]]

abstracting: (p24<=p41) states: 778
abstracting: (p9<=p12) states: 1,033 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EG [EF [3<=p43]] & p25<=p23]
normalized: [p25<=p23 & EG [E [true U 3<=p43]]]

abstracting: (3<=p43) states: 0
.
EG iterations: 1
abstracting: (p25<=p23) states: 778
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [AF [[p42<=p31 | p26<=p6]]]
normalized: ~ [E [true U EG [~ [[p42<=p31 | p26<=p6]]]]]

abstracting: (p26<=p6) states: 522
abstracting: (p42<=p31) states: 1,033 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[EF [1<=p46] & 3<=p33]]
normalized: E [true U [3<=p33 & E [true U 1<=p46]]]

abstracting: (1<=p46) states: 1
abstracting: (3<=p33) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[EG [2<=p14] & EF [1<=p28]]]
normalized: E [true U [E [true U 1<=p28] & EG [2<=p14]]]

abstracting: (2<=p14) states: 0
.
EG iterations: 1
abstracting: (1<=p28) states: 512
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [E [p10<=p18 U 2<=p1]]
normalized: EG [E [p10<=p18 U 2<=p1]]

abstracting: (2<=p1) states: 0
abstracting: (p10<=p18) states: 1,033 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m16sec


BK_STOP 1432977787114

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

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: 0m0sec


iterations count:365 (9), effective:20 (0)

iterations count:355 (8), effective:11 (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="RwMutex-PT-r0010w0010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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/RwMutex-PT-r0010w0010.tgz
mv RwMutex-PT-r0010w0010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is RwMutex-PT-r0010w0010, 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 r092kn-qhx2-143267650200015"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;