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

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

=== Now, execution of the tool begins

BK_START 1432978183360

Model: RwMutex-PT-r0010w0500
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: 1030 NrTr: 1020 NrArc: 12060)

net check time: 0m0sec

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

init dd package: 0m12sec


RS generation: 0m14sec


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



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

checking: EF [[EG [1<=p553] & AX [p626<=p835]]]
normalized: E [true U [EG [1<=p553] & ~ [EX [~ [p626<=p835]]]]]

abstracting: (p626<=p835) states: 1,523 (3)
.abstracting: (1<=p553) states: 1
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[EG [2<=p233] & [[1<=p994 | p918<=p660] | ~ [2<=p40]]]]
normalized: E [true U [[~ [2<=p40] | [1<=p994 | p918<=p660]] & EG [2<=p233]]]

abstracting: (2<=p233) states: 0
.
EG iterations: 1
abstracting: (p918<=p660) states: 1,523 (3)
abstracting: (1<=p994) states: 1
abstracting: (2<=p40) states: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[1<=p937 | 1<=p13] & [p169<=p997 | p130<=p385]] & EG [p93<=p808]] | EG [[p199<=p219 & p234<=p656]]] | E [[p576<=p943 & p665<=p917] U [3<=p291 & p460<=p541]]]
normalized: [E [[p576<=p943 & p665<=p917] U [3<=p291 & p460<=p541]] | [EG [[p199<=p219 & p234<=p656]] | [EG [p93<=p808] & [[p169<=p997 | p130<=p385] & [1<=p937 | 1<=p13]]]]]

abstracting: (1<=p13) states: 1,523 (3)
abstracting: (1<=p937) states: 1
abstracting: (p130<=p385) states: 1,523 (3)
abstracting: (p169<=p997) states: 2
abstracting: (p93<=p808) states: 2
..
EG iterations: 2
abstracting: (p234<=p656) states: 2
abstracting: (p199<=p219) states: 1,523 (3)
..
EG iterations: 2
abstracting: (p460<=p541) states: 2
abstracting: (3<=p291) states: 0
abstracting: (p665<=p917) states: 1,523 (3)
abstracting: (p576<=p943) states: 1,523 (3)
-> the formula is FALSE

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

MC time: 0m1sec

checking: E [~ [p335<=p762] U AX [3<=p929]]
normalized: E [~ [p335<=p762] U ~ [EX [~ [3<=p929]]]]

abstracting: (3<=p929) states: 0
.abstracting: (p335<=p762) states: 2
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [~ [1<=p558]] | p727<=p192]]
normalized: ~ [E [true U ~ [[1<=p558 | p727<=p192]]]]

abstracting: (p727<=p192) states: 1,524 (3)
abstracting: (1<=p558) states: 1
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[AF [2<=p815] & AX [p263<=p249]]]
normalized: E [true U [~ [EX [~ [p263<=p249]]] & ~ [EG [~ [2<=p815]]]]]

abstracting: (2<=p815) states: 0

EG iterations: 0
abstracting: (p263<=p249) states: 1,523 (3)
.-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[~ [[3<=p206 & p356<=p225]] | [[1<=p643 & 2<=p229] | [2<=p237 & 1<=p45]]]]
normalized: ~ [E [true U ~ [[[[2<=p237 & 1<=p45] | [1<=p643 & 2<=p229]] | ~ [[3<=p206 & p356<=p225]]]]]]

abstracting: (p356<=p225) states: 1,523 (3)
abstracting: (3<=p206) states: 0
abstracting: (2<=p229) states: 0
abstracting: (1<=p643) states: 1
abstracting: (1<=p45) states: 1,523 (3)
abstracting: (2<=p237) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: AF [EF [[3<=p191 | 2<=p844]]]
normalized: ~ [EG [~ [E [true U [3<=p191 | 2<=p844]]]]]

abstracting: (2<=p844) states: 0
abstracting: (3<=p191) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [EG [~ [p163<=p335]]]
normalized: E [true U EG [~ [p163<=p335]]]

abstracting: (p163<=p335) states: 1,523 (3)
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[EF [1<=p3] | [[2<=p100 | 1<=p298] & [2<=p1005 | p345<=p250]]]]
normalized: ~ [E [true U ~ [[E [true U 1<=p3] | [[2<=p100 | 1<=p298] & [2<=p1005 | p345<=p250]]]]]]

abstracting: (p345<=p250) states: 1,523 (3)
abstracting: (2<=p1005) states: 0
abstracting: (1<=p298) states: 1,523 (3)
abstracting: (2<=p100) states: 0
abstracting: (1<=p3) states: 1,012 (3)
-> the formula is TRUE

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

MC time: 0m1sec

checking: [AF [EF [3<=p586]] & p132<=p21]
normalized: [p132<=p21 & ~ [EG [~ [E [true U 3<=p586]]]]]

abstracting: (3<=p586) states: 0

EG iterations: 0
abstracting: (p132<=p21) states: 1,523 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[EX [3<=p932] | p521<=p250]]
normalized: ~ [E [true U ~ [[p521<=p250 | EX [3<=p932]]]]]

abstracting: (3<=p932) states: 0
.abstracting: (p521<=p250) states: 1,524 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w0500-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [E [~ [p323<=p976] U [p395<=p586 & 3<=p407]]]
normalized: ~ [E [~ [p323<=p976] U [p395<=p586 & 3<=p407]]]

abstracting: (3<=p407) states: 0
abstracting: (p395<=p586) states: 2
abstracting: (p323<=p976) states: 2
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: ~ [AG [~ [[3<=p20 & p404<=p262]]]]
normalized: E [true U [3<=p20 & p404<=p262]]

abstracting: (p404<=p262) states: 1,523 (3)
abstracting: (3<=p20) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [EF [EG [p669<=p812]] & [[p275<=p502 | [~ [p483<=p310] | ~ [2<=p299]]] & [p437<=p199 & AG [p871<=p298]]]]
normalized: [[[p437<=p199 & ~ [E [true U ~ [p871<=p298]]]] & [p275<=p502 | [~ [2<=p299] | ~ [p483<=p310]]]] & E [true U EG [p669<=p812]]]

abstracting: (p669<=p812) states: 1,523 (3)
.
EG iterations: 1
abstracting: (p483<=p310) states: 1,523 (3)
abstracting: (2<=p299) states: 0
abstracting: (p275<=p502) states: 1,523 (3)
abstracting: (p871<=p298) states: 1,524 (3)
abstracting: (p437<=p199) states: 1,523 (3)
-> the formula is TRUE

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

MC time: 0m1sec


Total processing time: 1m4sec


BK_STOP 1432978247835

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

214541
iterations count:1022 (1), effective:1 (0)
214541
iterations count:1369 (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-r0010w0500"
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-r0010w0500.tgz
mv RwMutex-PT-r0010w0500 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-r0010w0500, 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-143267650200067"
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 ;