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

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

=== Now, execution of the tool begins

BK_START 1432978616485

Model: RwMutex-PT-r0010w1000
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=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=2 --place-order=5

parse successfull
net created successfully

(NrP: 2030 NrTr: 2020 NrArc: 24060)

net check time: 0m0sec

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

init dd package: 0m11sec


RS generation: 0m50sec


-> reachability set: #nodes 425661 (4.3e+05) #states 2,024 (3)



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

checking: AG [p1309<=p942]
normalized: ~ [E [true U ~ [p1309<=p942]]]

abstracting: (p1309<=p942) states: 2,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w1000-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [[~ [p1485<=p401] | p1630<=p215]]]
normalized: E [true U ~ [[p1630<=p215 | ~ [p1485<=p401]]]]

abstracting: (p1485<=p401) states: 2,024 (3)
abstracting: (p1630<=p215) states: 2,024 (3)
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w1000-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[2<=p2 & 2<=p1107] & 1<=p1853] & [[p1227<=p699 | 1<=p1864] & [p618<=p2027 & 2<=p1058]]]]
normalized: E [true U [[[p618<=p2027 & 2<=p1058] & [p1227<=p699 | 1<=p1864]] & [1<=p1853 & [2<=p2 & 2<=p1107]]]]

abstracting: (2<=p1107) states: 0
abstracting: (2<=p2) states: 0
abstracting: (1<=p1853) states: 1
abstracting: (1<=p1864) states: 1
abstracting: (p1227<=p699) states: 2,024 (3)
abstracting: (2<=p1058) states: 0
abstracting: (p618<=p2027) states: 2
-> the formula is FALSE

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

MC time: 0m1sec

checking: EF [2<=p496]
normalized: E [true U 2<=p496]

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

FORMULA RwMutex-PT-r0010w1000-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[~ [p435<=p486] | ~ [2<=p1510]] | ~ [[p1594<=p295 | 2<=p2004]]]]
normalized: ~ [E [true U ~ [[~ [[p1594<=p295 | 2<=p2004]] | [~ [2<=p1510] | ~ [p435<=p486]]]]]]

abstracting: (p435<=p486) states: 2,023 (3)
abstracting: (2<=p1510) states: 0
abstracting: (2<=p2004) states: 0
abstracting: (p1594<=p295) states: 2,024 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[[2<=p1847 & [3<=p1120 | 3<=p517]] & [~ [p892<=p1814] | ~ [p695<=p523]]]]
normalized: E [true U [[~ [p892<=p1814] | ~ [p695<=p523]] & [2<=p1847 & [3<=p1120 | 3<=p517]]]]

abstracting: (3<=p517) states: 0
abstracting: (3<=p1120) states: 0
abstracting: (2<=p1847) states: 0
abstracting: (p695<=p523) states: 2,023 (3)
abstracting: (p892<=p1814) states: 2
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [2<=p1020]
normalized: E [true U 2<=p1020]

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

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

MC time: 0m0sec

checking: EF [[[[p93<=p324 | 2<=p559] & ~ [p1850<=p140]] & [2<=p224 & [2<=p683 & p738<=p202]]]]
normalized: E [true U [[2<=p224 & [2<=p683 & p738<=p202]] & [[p93<=p324 | 2<=p559] & ~ [p1850<=p140]]]]

abstracting: (p1850<=p140) states: 2,024 (3)
abstracting: (2<=p559) states: 0
abstracting: (p93<=p324) states: 2,023 (3)
abstracting: (p738<=p202) states: 2,023 (3)
abstracting: (2<=p683) states: 0
abstracting: (2<=p224) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w1000-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: EF [3<=p479]
normalized: E [true U 3<=p479]

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

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

MC time: 0m0sec

checking: AG [[~ [2<=p1146] | [p1523<=p925 | [3<=p1365 | 3<=p117]]]]
normalized: ~ [E [true U ~ [[~ [2<=p1146] | [p1523<=p925 | [3<=p1365 | 3<=p117]]]]]]

abstracting: (3<=p117) states: 0
abstracting: (3<=p1365) states: 0
abstracting: (p1523<=p925) states: 2,024 (3)
abstracting: (2<=p1146) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [p1656<=p115]
normalized: ~ [E [true U ~ [p1656<=p115]]]

abstracting: (p1656<=p115) states: 2,024 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [~ [[[1<=p1195 | 3<=p1241] & 2<=p317]]]
normalized: ~ [E [true U [2<=p317 & [1<=p1195 | 3<=p1241]]]]

abstracting: (3<=p1241) states: 0
abstracting: (1<=p1195) states: 1
abstracting: (2<=p317) states: 0
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w1000-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [~ [1<=p548]] & [[3<=p1043 & 2<=p1236] & [p641<=p2013 & p1230<=p1450]]]]
normalized: E [true U [1<=p548 & [[p641<=p2013 & p1230<=p1450] & [3<=p1043 & 2<=p1236]]]]

abstracting: (2<=p1236) states: 0
abstracting: (3<=p1043) states: 0
abstracting: (p1230<=p1450) states: 2,023 (3)
abstracting: (p641<=p2013) states: 2
abstracting: (1<=p548) states: 2,023 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[[p437<=p1076 & 1<=p1403] | [p63<=p602 & p1459<=p741]] & 2<=p246]]
normalized: E [true U [2<=p246 & [[p63<=p602 & p1459<=p741] | [p437<=p1076 & 1<=p1403]]]]

abstracting: (1<=p1403) states: 1
abstracting: (p437<=p1076) states: 2
abstracting: (p1459<=p741) states: 2,024 (3)
abstracting: (p63<=p602) states: 2,023 (3)
abstracting: (2<=p246) states: 0
-> the formula is FALSE

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

MC time: 0m1sec

checking: AG [[[[1<=p786 & 3<=p1555] & [p774<=p1177 | 3<=p2011]] | [[2<=p1984 | 1<=p1875] | [p998<=p2 | p1285<=p1918]]]]
normalized: ~ [E [true U ~ [[[[p774<=p1177 | 3<=p2011] & [1<=p786 & 3<=p1555]] | [[p998<=p2 | p1285<=p1918] | [2<=p1984 | 1<=p1875]]]]]]

abstracting: (1<=p1875) states: 1
abstracting: (2<=p1984) states: 0
abstracting: (p1285<=p1918) states: 2,023 (3)
abstracting: (p998<=p2) states: 1,512 (3)
abstracting: (3<=p1555) states: 0
abstracting: (1<=p786) states: 2,023 (3)
abstracting: (3<=p2011) states: 0
abstracting: (p774<=p1177) states: 2
-> the formula is TRUE

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

MC time: 0m1sec

checking: EF [2<=p1508]
normalized: E [true U 2<=p1508]

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

FORMULA RwMutex-PT-r0010w1000-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 3m2sec


BK_STOP 1432978798896

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

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-r0010w1000"
export BK_EXAMINATION="ReachabilityCardinality"
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-r0010w1000.tgz
mv RwMutex-PT-r0010w1000 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-r0010w1000, 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 r092kn-qhx2-143267650200087"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;