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 S_CircadianClock-PT-001000, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r120st-ebro-143297419600307
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433162993840

Model: S_CircadianClock-PT-001000
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 14 NrTr: 16 NrArc: 58)

net check time: 0m0sec

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

init dd package: 0m5sec


RS generation: 0m20sec


-> reachability set: #nodes 5016 (5.0e+03) #states 4,020,040,040,020,004 (15)



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

checking: maxVal(da_a)<=3
normalized: maxVal(da_a)<=3

abstracting: (1<=3) states: 4,020,040,040,020,004 (15)
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(mr_cap)<=1
normalized: maxVal(mr_cap)<=1

abstracting: (1000<=1) states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(da_a)<=1 & maxVal(c)<=1] & maxVal(a_cap)<=3]
normalized: [maxVal(a_cap)<=3 & [maxVal(da_a)<=1 & maxVal(c)<=1]]

abstracting: (1000<=1) states: 0
abstracting: (1<=1) states: 4,020,040,040,020,004 (15)
abstracting: (1000<=3) states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(r_cap)<=3 & [maxVal(r)<=1 & [[[maxVal(dr_a)<=3 & maxVal(a_cap)<=3] & [maxVal(c_cap)<=1 & maxVal(r)<=1]] & maxVal(ma)<=3]]] & [maxVal(c)<=2 & [maxVal(ma)<=3 & [[[maxVal(ma)<=1 & maxVal(ma)<=1] & [maxVal(mr_cap)<=1 & maxVal(dr)<=3]] & maxVal(c_cap)<=2]]]]
normalized: [[maxVal(c)<=2 & [maxVal(ma)<=3 & [maxVal(c_cap)<=2 & [[maxVal(mr_cap)<=1 & maxVal(dr)<=3] & [maxVal(ma)<=1 & maxVal(ma)<=1]]]]] & [maxVal(r_cap)<=3 & [maxVal(r)<=1 & [maxVal(ma)<=3 & [[maxVal(c_cap)<=1 & maxVal(r)<=1] & [maxVal(dr_a)<=3 & maxVal(a_cap)<=3]]]]]]

abstracting: (1000<=3) states: 0
abstracting: (1<=3) states: 4,020,040,040,020,004 (15)
abstracting: (1000<=1) states: 0
abstracting: (1000<=1) states: 0
abstracting: (1000<=3) states: 0
abstracting: (1000<=1) states: 0
abstracting: (1000<=3) states: 0
abstracting: (1000<=1) states: 0
abstracting: (1000<=1) states: 0
abstracting: (1<=3) states: 4,020,040,040,020,004 (15)
abstracting: (1000<=1) states: 0
abstracting: (1000<=2) states: 0
abstracting: (1000<=3) states: 0
abstracting: (1000<=2) states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(dr_a)<=1
normalized: maxVal(dr_a)<=1

abstracting: (1<=1) states: 4,020,040,040,020,004 (15)
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(r_cap)<=1
normalized: maxVal(r_cap)<=1

abstracting: (1000<=1) states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[maxVal(a_cap)<=1 & [[maxVal(dr)<=3 & maxVal(dr)<=2] & [maxVal(r_cap)<=3 & maxVal(r_cap)<=3]]] & [[maxVal(mr_cap)<=3 & maxVal(mr_cap)<=3] & [[maxVal(da_a)<=2 & maxVal(mr_cap)<=1] & maxVal(c)<=2]]] & maxVal(c)<=2] & maxVal(dr_a)<=2]
normalized: [maxVal(dr_a)<=2 & [maxVal(c)<=2 & [[[maxVal(c)<=2 & [maxVal(da_a)<=2 & maxVal(mr_cap)<=1]] & [maxVal(mr_cap)<=3 & maxVal(mr_cap)<=3]] & [maxVal(a_cap)<=1 & [[maxVal(dr)<=3 & maxVal(dr)<=2] & [maxVal(r_cap)<=3 & maxVal(r_cap)<=3]]]]]]

abstracting: (1000<=3) states: 0
abstracting: (1000<=3) states: 0
abstracting: (1<=2) states: 4,020,040,040,020,004 (15)
abstracting: (1<=3) states: 4,020,040,040,020,004 (15)
abstracting: (1000<=1) states: 0
abstracting: (1000<=3) states: 0
abstracting: (1000<=3) states: 0
abstracting: (1000<=1) states: 0
abstracting: (1<=2) states: 4,020,040,040,020,004 (15)
abstracting: (1000<=2) states: 0
abstracting: (1000<=2) states: 0
abstracting: (1<=2) states: 4,020,040,040,020,004 (15)
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(da)<=2 & maxVal(dr_a)<=2]
normalized: [maxVal(da)<=2 & maxVal(dr_a)<=2]

abstracting: (1<=2) states: 4,020,040,040,020,004 (15)
abstracting: (1<=2) states: 4,020,040,040,020,004 (15)
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(a)<=1
normalized: maxVal(a)<=1

abstracting: (1000<=1) states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(mr)<=1
normalized: maxVal(mr)<=1

abstracting: (1000<=1) states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(mr_cap)<=3
normalized: maxVal(mr_cap)<=3

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

FORMULA CircadianClock-PT-001000-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(r_cap)<=3
normalized: maxVal(r_cap)<=3

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

FORMULA CircadianClock-PT-001000-ReachabilityBounds-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(a_cap)<=3
normalized: maxVal(a_cap)<=3

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

FORMULA CircadianClock-PT-001000-ReachabilityBounds-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(ma)<=1 & maxVal(c_cap)<=1] & [[[[maxVal(ma)<=1 & maxVal(dr_a)<=2] & maxVal(da)<=3] & [maxVal(c_cap)<=2 & maxVal(c_cap)<=2]] & maxVal(da)<=1]] & maxVal(a_cap)<=1]
normalized: [maxVal(a_cap)<=1 & [[maxVal(da)<=1 & [[maxVal(da)<=3 & [maxVal(ma)<=1 & maxVal(dr_a)<=2]] & [maxVal(c_cap)<=2 & maxVal(c_cap)<=2]]] & [maxVal(ma)<=1 & maxVal(c_cap)<=1]]]

abstracting: (1000<=1) states: 0
abstracting: (1000<=1) states: 0
abstracting: (1000<=2) states: 0
abstracting: (1000<=2) states: 0
abstracting: (1<=2) states: 4,020,040,040,020,004 (15)
abstracting: (1000<=1) states: 0
abstracting: (1<=3) states: 4,020,040,040,020,004 (15)
abstracting: (1<=1) states: 4,020,040,040,020,004 (15)
abstracting: (1000<=1) states: 0
-> the formula is FALSE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(da)<=2
normalized: maxVal(da)<=2

abstracting: (1<=2) states: 4,020,040,040,020,004 (15)
-> the formula is TRUE

FORMULA CircadianClock-PT-001000-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(a_cap)<=3
normalized: maxVal(a_cap)<=3

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

FORMULA CircadianClock-PT-001000-ReachabilityBounds-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m28sec


BK_STOP 1433163022310

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

514 1014 1214 1414 1614 1814 2014 3230 3447 3650 3855 4072 4275 4480 4697 4900 5105 5322 5525 5730 5947 6150 6355 6572 6775 6980 7197 7400 7605 7822 8025 7622 7193 6764 6335 5909 5480 5051 5067 6116 5154 6203 5241 6290 5328 6377 5415 6464 5502 6551 6594 5636 6681 5723 6768 5808 6855 5893 6942 5980 7029
iterations count:61043 (3815), effective:13006 (812)

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