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 ParamProductionCell-PT-3, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r064kn-blw3-143254880200047
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432724956036

Model: ParamProductionCell-PT-3
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: 231 NrTr: 202 NrArc: 846)

net check time: 0m0sec

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

init dd package: 0m2sec


RS generation: 0m8sec


-> reachability set: #nodes 71919 (7.2e+04) #states 1,465,206 (6)



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

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

abstracting: (1<=2) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(ch_DC_free)<=1 & [[maxVal(A1L_rotated)<=2 & [[maxVal(A2L_rot1_rs)<=2 & [maxVal(A2L_rot1_run)<=2 & maxVal(robot_left)<=3]] & maxVal(A1_extended)<=1]] & [maxVal(A1U_extendet)<=2 & [[[maxVal(arm1_pick_up_angle)<=1 & maxVal(arm1_backward)<=1] & [maxVal(CL_trans_run)<=1 & maxVal(arm2_having_swivel_1)<=1]] & [[maxVal(A2L_rot3_in)<=2 & maxVal(A2U_extended)<=3] & maxVal(crane_mag_on)<=1]]]]]
normalized: [maxVal(ch_DC_free)<=1 & [[maxVal(A1U_extendet)<=2 & [[maxVal(crane_mag_on)<=1 & [maxVal(A2L_rot3_in)<=2 & maxVal(A2U_extended)<=3]] & [[maxVal(arm1_pick_up_angle)<=1 & maxVal(arm1_backward)<=1] & [maxVal(CL_trans_run)<=1 & maxVal(arm2_having_swivel_1)<=1]]]] & [maxVal(A1L_rotated)<=2 & [maxVal(A1_extended)<=1 & [maxVal(A2L_rot1_rs)<=2 & [maxVal(A2L_rot1_run)<=2 & maxVal(robot_left)<=3]]]]]]

abstracting: (1<=3) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=3) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(A1U_ret_rs)<=2 & [maxVal(A2U_ret_run)<=1 & maxVal(A1U_extendet)<=2]]
normalized: [maxVal(A1U_ret_rs)<=2 & [maxVal(A2U_ret_run)<=1 & maxVal(A1U_extendet)<=2]]

abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(press_ready_for_unloading)<=1 & [maxVal(PL_out)<=1 & maxVal(robot_left)<=3]]
normalized: [maxVal(press_ready_for_unloading)<=1 & [maxVal(PL_out)<=1 & maxVal(robot_left)<=3]]

abstracting: (1<=3) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(arm1_having_swivel_2)<=3 & maxVal(PL_lower_rs)<=3] & [maxVal(crane_above_feed_belt)<=3 & maxVal(PL_lower_run)<=3]]
normalized: [[maxVal(crane_above_feed_belt)<=3 & maxVal(PL_lower_run)<=3] & [maxVal(arm1_having_swivel_2)<=3 & maxVal(PL_lower_rs)<=3]]

abstracting: (1<=3) states: 1,465,206 (6)
abstracting: (1<=3) states: 1,465,206 (6)
abstracting: (1<=3) states: 1,465,206 (6)
abstracting: (1<=3) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(belt1_stop)<=2 & maxVal(PU_in)<=3] & maxVal(arm2_magnet_off)<=2]
normalized: [maxVal(arm2_magnet_off)<=2 & [maxVal(belt1_stop)<=2 & maxVal(PU_in)<=3]]

abstracting: (1<=3) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(A2U_rot1_in)<=2 & [[[maxVal(blank_forged)<=1 & maxVal(A2U_rot1_in)<=3] & maxVal(arm1_store_free)<=1] & [[[maxVal(A2L_rot2_run)<=1 & maxVal(CU_lower_run)<=2] & maxVal(CL_ready_to_grasp)<=2] & [maxVal(A1U_rot1_rs)<=3 & maxVal(arm1_pick_up_ext)<=3]]]] & maxVal(FB_in)<=2]
normalized: [maxVal(FB_in)<=2 & [maxVal(A2U_rot1_in)<=2 & [[maxVal(arm1_store_free)<=1 & [maxVal(blank_forged)<=1 & maxVal(A2U_rot1_in)<=3]] & [[maxVal(A1U_rot1_rs)<=3 & maxVal(arm1_pick_up_ext)<=3] & [maxVal(CL_ready_to_grasp)<=2 & [maxVal(A2L_rot2_run)<=1 & maxVal(CU_lower_run)<=2]]]]]]

abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=3) states: 1,465,206 (6)
abstracting: (1<=3) states: 1,465,206 (6)
abstracting: (1<=3) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(TU_lift_rs)<=2 & [maxVal(ch_PA2_free)<=1 & maxVal(A2U_rot1_in)<=1]] & maxVal(robot_left)<=3]
normalized: [maxVal(robot_left)<=3 & [maxVal(TU_lift_rs)<=2 & [maxVal(ch_PA2_free)<=1 & maxVal(A2U_rot1_in)<=1]]]

abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=3) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(crane_mag_off)<=1 & maxVal(arm1_retract_ext)<=2] & maxVal(ch_CF_full)<=3]
normalized: [maxVal(ch_CF_full)<=3 & [maxVal(crane_mag_off)<=1 & maxVal(arm1_retract_ext)<=2]]

abstracting: (1<=2) states: 1,465,206 (6)
abstracting: (1<=1) states: 1,465,206 (6)
abstracting: (1<=3) states: 1,465,206 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-3-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m21sec


BK_STOP 1432724977246

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

1521 3737 8466 11420 14263 16467 17708 44468 67777 70751 72990 74094 72724 72211
iterations count:14281 (70), effective:597 (2)

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="ParamProductionCell-PT-3"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/hulinhub/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/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 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 ParamProductionCell-PT-3, 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 r064kn-blw3-143254880200047"
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 ;