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 RwMutex-PT-r0010w0500, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r113kn-smll-146373293000052
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463758971355


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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: RwMutex_PT_r0010w0500
(NrP: 1030 NrTr: 1020 NrArc: 12060)

net check time: 0m 0.002sec

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

init dd package: 0m 3.756sec


RS generation: 0m 4.845sec


-> reachability set: #nodes 156359 (1.6e+05) #states 1,524 (3)



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

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

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

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [p724<=p443]
normalized: ~ [E [true U ~ [p724<=p443]]]

abstracting: (p724<=p443) states: 1,524 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [p946<=p284]
normalized: ~ [E [true U ~ [p946<=p284]]]

abstracting: (p946<=p284) states: 1,524 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [p929<=p110]
normalized: ~ [E [true U ~ [p929<=p110]]]

abstracting: (p929<=p110) states: 1,524 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [~ [~ [[2<=p285 & 3<=p558]]]]
normalized: E [true U [2<=p285 & 3<=p558]]

abstracting: (3<=p558) states: 0
abstracting: (2<=p285) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [~ [[[1<=p991 | 2<=p562] | ~ [3<=p570]]]]
normalized: E [true U ~ [[~ [3<=p570] | [1<=p991 | 2<=p562]]]]

abstracting: (2<=p562) states: 0
abstracting: (1<=p991) states: 1
abstracting: (3<=p570) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [~ [[~ [p30<=p952] | [1<=p382 & p964<=p695]]]]
normalized: E [true U ~ [[[1<=p382 & p964<=p695] | ~ [p30<=p952]]]]

abstracting: (p30<=p952) states: 2
abstracting: (p964<=p695) states: 1,523 (3)
abstracting: (1<=p382) states: 1,523 (3)
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: AG [[~ [[p949<=p98 & 3<=p376]] & ~ [[3<=p265 | 3<=p590]]]]
normalized: ~ [E [true U ~ [[~ [[3<=p265 | 3<=p590]] & ~ [[p949<=p98 & 3<=p376]]]]]]

abstracting: (3<=p376) states: 0
abstracting: (p949<=p98) states: 1,524 (3)
abstracting: (3<=p590) states: 0
abstracting: (3<=p265) states: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[[[2<=p753 & p94<=p133] | 3<=p193] & p976<=p416]]
normalized: E [true U [[[2<=p753 & p94<=p133] | 3<=p193] & p976<=p416]]

abstracting: (p976<=p416) states: 1,524 (3)
abstracting: (3<=p193) states: 0
abstracting: (p94<=p133) states: 1,523 (3)
abstracting: (2<=p753) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[~ [[p724<=p336 | 1<=p545]] & ~ [[p327<=p141 & 2<=p810]]]]
normalized: E [true U [~ [[p327<=p141 & 2<=p810]] & ~ [[p724<=p336 | 1<=p545]]]]

abstracting: (1<=p545) states: 1
abstracting: (p724<=p336) states: 1,524 (3)
abstracting: (2<=p810) states: 0
abstracting: (p327<=p141) states: 1,523 (3)
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: EF [[[[2<=p170 & p377<=p513] & [p730<=p675 & 2<=p699]] & 2<=p68]]
normalized: E [true U [2<=p68 & [[p730<=p675 & 2<=p699] & [2<=p170 & p377<=p513]]]]

abstracting: (p377<=p513) states: 513
abstracting: (2<=p170) states: 0
abstracting: (2<=p699) states: 0
abstracting: (p730<=p675) states: 1,523 (3)
abstracting: (2<=p68) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.111sec

checking: AG [[[[p62<=p215 & p664<=p223] | [1<=p241 & p610<=p296]] | ~ [~ [p911<=p27]]]]
normalized: ~ [E [true U ~ [[p911<=p27 | [[1<=p241 & p610<=p296] | [p62<=p215 & p664<=p223]]]]]]

abstracting: (p664<=p223) states: 1,524 (3)
abstracting: (p62<=p215) states: 1,523 (3)
abstracting: (p610<=p296) states: 1,524 (3)
abstracting: (1<=p241) states: 1,523 (3)
abstracting: (p911<=p27) states: 1,524 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: AG [[[p679<=p81 | [p880<=p263 | p534<=p119]] | [[2<=p301 | 2<=p729] & 3<=p72]]]
normalized: ~ [E [true U ~ [[[p679<=p81 | [p880<=p263 | p534<=p119]] | [3<=p72 & [2<=p301 | 2<=p729]]]]]]

abstracting: (2<=p729) states: 0
abstracting: (2<=p301) states: 0
abstracting: (3<=p72) states: 0
abstracting: (p534<=p119) states: 1,524 (3)
abstracting: (p880<=p263) states: 1,524 (3)
abstracting: (p679<=p81) states: 1,524 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: AG [[3<=p467 | [[p515<=p679 | p172<=p934] | [p291<=p998 | p143<=p30]]]]
normalized: ~ [E [true U ~ [[3<=p467 | [[p291<=p998 | p143<=p30] | [p515<=p679 | p172<=p934]]]]]]

abstracting: (p172<=p934) states: 2
abstracting: (p515<=p679) states: 1,012 (3)
abstracting: (p143<=p30) states: 1,523 (3)
abstracting: (p291<=p998) states: 2
abstracting: (3<=p467) states: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.132sec

checking: EF [[[~ [p248<=p683] & [2<=p45 & p232<=p371]] & [[3<=p680 | p543<=p59] & [3<=p469 & p32<=p231]]]]
normalized: E [true U [[[3<=p469 & p32<=p231] & [3<=p680 | p543<=p59]] & [[2<=p45 & p232<=p371] & ~ [p248<=p683]]]]

abstracting: (p248<=p683) states: 2
abstracting: (p232<=p371) states: 1,523 (3)
abstracting: (2<=p45) states: 0
abstracting: (p543<=p59) states: 1,524 (3)
abstracting: (3<=p680) states: 0
abstracting: (p32<=p231) states: 1,523 (3)
abstracting: (3<=p469) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.106sec

checking: EF [[[[p812<=p768 | p334<=p362] & [1<=p718 & p718<=p556]] | [[1<=p897 | 1<=p272] & ~ [p547<=p419]]]]
normalized: E [true U [[[1<=p718 & p718<=p556] & [p812<=p768 | p334<=p362]] | [~ [p547<=p419] & [1<=p897 | 1<=p272]]]]

abstracting: (1<=p272) states: 1,523 (3)
abstracting: (1<=p897) states: 1
abstracting: (p547<=p419) states: 1,524 (3)
abstracting: (p334<=p362) states: 1,523 (3)
abstracting: (p812<=p768) states: 1,523 (3)
abstracting: (p718<=p556) states: 1,523 (3)
abstracting: (1<=p718) states: 1
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec


Total processing time: 0m16.692sec


BK_STOP 1463758988086

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

..................

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-r0010w0500"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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-r0010w0500.tgz
mv RwMutex-PT-r0010w0500 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 RwMutex-PT-r0010w0500, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r113kn-smll-146373293000052"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;