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-r0010w0020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r092kn-qhx2-143267650200028
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432977887251

Model: RwMutex-PT-r0010w0020
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: 70 NrTr: 60 NrArc: 540)

net check time: 0m0sec

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

init dd package: 0m13sec


RS generation: 0m0sec


-> reachability set: #nodes 12069 (1.2e+04) #states 1,044 (3)



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

checking: E [AF [p26<=p17] U [2<=p43 & [1<=p46 | p32<=p12]]]
normalized: E [~ [EG [~ [p26<=p17]]] U [2<=p43 & [1<=p46 | p32<=p12]]]

abstracting: (p32<=p12) states: 1,044 (3)
abstracting: (1<=p46) states: 512
abstracting: (2<=p43) states: 0
abstracting: (p26<=p17) states: 1,043 (3)
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m0sec

checking: [EF [[[p18<=p13 & 1<=p39] & 2<=p23]] | AG [~ [[p62<=p70 & 2<=p4]]]]
normalized: [E [true U [2<=p23 & [p18<=p13 & 1<=p39]]] | ~ [E [true U [p62<=p70 & 2<=p4]]]]

abstracting: (2<=p4) states: 0
abstracting: (p62<=p70) states: 1,043 (3)
abstracting: (1<=p39) states: 512
abstracting: (p18<=p13) states: 1,043 (3)
abstracting: (2<=p23) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[EX [2<=p39] & [[1<=p31 & 1<=p51] | [2<=p21 & p5<=p70]]]]
normalized: E [true U [EX [2<=p39] & [[1<=p31 & 1<=p51] | [2<=p21 & p5<=p70]]]]

abstracting: (p5<=p70) states: 513
abstracting: (2<=p21) states: 0
abstracting: (1<=p51) states: 512
abstracting: (1<=p31) states: 1,043 (3)
abstracting: (2<=p39) states: 0
.-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [EF [AG [p11<=p58]]]
normalized: ~ [E [true U ~ [E [true U ~ [p11<=p58]]]]]

abstracting: (p11<=p58) states: 513
-> the formula is TRUE

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

MC time: 0m0sec

checking: A [[[p11<=p21 | 3<=p51] & [1<=p40 & 2<=p35]] U EF [3<=p54]]
normalized: [~ [EG [~ [E [true U 3<=p54]]]] & ~ [E [~ [[[p11<=p21 | 3<=p51] & [1<=p40 & 2<=p35]]] U [~ [E [true U 3<=p54]] & ~ [[[p11<=p21 | 3<=p51] & [1<=p40 & 2<=p35]]]]]]]

abstracting: (2<=p35) states: 0
abstracting: (1<=p40) states: 512
abstracting: (3<=p51) states: 0
abstracting: (p11<=p21) states: 1,043 (3)
abstracting: (3<=p54) states: 0
abstracting: (2<=p35) states: 0
abstracting: (1<=p40) states: 512
abstracting: (3<=p51) states: 0
abstracting: (p11<=p21) states: 1,043 (3)
abstracting: (3<=p54) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: E [~ [~ [p32<=p12]] U [2<=p5 & p3<=p44]]
normalized: E [p32<=p12 U [2<=p5 & p3<=p44]]

abstracting: (p3<=p44) states: 768
abstracting: (2<=p5) states: 0
abstracting: (p32<=p12) states: 1,044 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [E [[p5<=p43 | p32<=p70] U [2<=p41 & 3<=p55]]]
normalized: ~ [E [[p5<=p43 | p32<=p70] U [2<=p41 & 3<=p55]]]

abstracting: (3<=p55) states: 0
abstracting: (2<=p41) states: 0
abstracting: (p32<=p70) states: 532
abstracting: (p5<=p43) states: 768
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [[EF [3<=p4] | ~ [[~ [p1<=p5] | [p18<=p52 | 1<=p45]]]]]
normalized: ~ [[~ [[[p18<=p52 | 1<=p45] | ~ [p1<=p5]]] | E [true U 3<=p4]]]

abstracting: (3<=p4) states: 0
abstracting: (p1<=p5) states: 1,044 (3)
abstracting: (1<=p45) states: 512
abstracting: (p18<=p52) states: 2
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[~ [[p23<=p7 | p8<=p16]] & AG [1<=p1]]]
normalized: E [true U [~ [E [true U ~ [1<=p1]]] & ~ [[p23<=p7 | p8<=p16]]]]

abstracting: (p8<=p16) states: 1,043 (3)
abstracting: (p23<=p7) states: 532
abstracting: (1<=p1) states: 1
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [AG [~ [2<=p59]]]
normalized: ~ [E [true U E [true U 2<=p59]]]

abstracting: (2<=p59) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [AG [[[p49<=p30 & p52<=p58] | [2<=p46 | p15<=p31]]]]
normalized: E [true U ~ [[[2<=p46 | p15<=p31] | [p49<=p30 & p52<=p58]]]]

abstracting: (p52<=p58) states: 1,043 (3)
abstracting: (p49<=p30) states: 1,044 (3)
abstracting: (p15<=p31) states: 1,043 (3)
abstracting: (2<=p46) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [[~ [p10<=p66] & [2<=p17 | p57<=p44]] U [[p42<=p46 & p15<=p5] & ~ [p32<=p12]]]
normalized: E [[~ [p10<=p66] & [2<=p17 | p57<=p44]] U [~ [p32<=p12] & [p42<=p46 & p15<=p5]]]

abstracting: (p15<=p5) states: 532
abstracting: (p42<=p46) states: 788
abstracting: (p32<=p12) states: 1,044 (3)
abstracting: (p57<=p44) states: 1,043 (3)
abstracting: (2<=p17) states: 0
abstracting: (p10<=p66) states: 513
-> the formula is FALSE

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

MC time: 0m0sec

checking: E [EF [3<=p19] U EG [3<=p57]]
normalized: E [E [true U 3<=p19] U EG [3<=p57]]

abstracting: (3<=p57) states: 0
.
EG iterations: 1
abstracting: (3<=p19) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[EG [p23<=p31] | EF [3<=p67]] & EF [[3<=p40 & 2<=p14]]] & [AF [p9<=p30] | [AG [1<=p68] & 1<=p66]]]
normalized: [[E [true U [3<=p40 & 2<=p14]] & [E [true U 3<=p67] | EG [p23<=p31]]] & [[1<=p66 & ~ [E [true U ~ [1<=p68]]]] | ~ [EG [~ [p9<=p30]]]]]

abstracting: (p9<=p30) states: 1,043 (3)
..
EG iterations: 2
abstracting: (1<=p68) states: 1
abstracting: (1<=p66) states: 1
abstracting: (p23<=p31) states: 1,043 (3)
.
EG iterations: 1
abstracting: (3<=p67) states: 0
abstracting: (2<=p14) states: 0
abstracting: (3<=p40) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [AG [[~ [p23<=p1] | [p64<=p61 | p38<=p22]]] & ~ [2<=p46]]
normalized: [~ [E [true U ~ [[[p64<=p61 | p38<=p22] | ~ [p23<=p1]]]]] & ~ [2<=p46]]

abstracting: (2<=p46) states: 0
abstracting: (p23<=p1) states: 2
abstracting: (p38<=p22) states: 1,044 (3)
abstracting: (p64<=p61) states: 1,043 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [AF [[3<=p13 | p1<=p65]]]
normalized: ~ [E [true U EG [~ [[3<=p13 | p1<=p65]]]]]

abstracting: (p1<=p65) states: 1,043 (3)
abstracting: (3<=p13) states: 0
..
EG iterations: 2
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0020-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m18sec


BK_STOP 1432977905412

--------------------
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:98 (1), effective:2 (0)

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

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

iterations count:116 (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="RwMutex-PT-r0010w0020"
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-r0010w0020.tgz
mv RwMutex-PT-r0010w0020 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-r0010w0020, 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-143267650200028"
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 ;