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-2270
Executing tool marcie
Input is S_ParamProductionCell-PT-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204400035
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433630788257

Model: S_ParamProductionCell-PT-2
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=ReachabilityCardinality.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: 0m3sec


-> reachability set: #nodes 33876 (3.4e+04) #states 349,874 (5)



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

checking: AG [[~ [[2<=ch_A1P_free | 2<=PL_in]] | [A2U_rot2_in<=CL_trans_run | [TL_out<=TL_rot_rs | A2L_rotated<=A1L_out]]]]
normalized: ~ [E [true U ~ [[~ [[2<=ch_A1P_free | 2<=PL_in]] | [A2U_rot2_in<=CL_trans_run | [TL_out<=TL_rot_rs | A2L_rotated<=A1L_out]]]]]]

abstracting: (A2L_rotated<=A1L_out) states: 348,466 (5)
abstracting: (TL_out<=TL_rot_rs) states: 322,738 (5)
abstracting: (A2U_rot2_in<=CL_trans_run) states: 349,632 (5)
abstracting: (2<=PL_in) states: 0
abstracting: (2<=ch_A1P_free) states: 0
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

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

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

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [1<=press_at_upper_pos]
normalized: E [true U 1<=press_at_upper_pos]

abstracting: (1<=press_at_upper_pos) states: 24,328 (4)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m3sec

checking: AG [~ [[~ [2<=A1U_ret_rs] & [3<=CU_lower_rs & feed_belt_empty<=A1U_rot2_in]]]]
normalized: ~ [E [true U [[3<=CU_lower_rs & feed_belt_empty<=A1U_rot2_in] & ~ [2<=A1U_ret_rs]]]]

abstracting: (2<=A1U_ret_rs) states: 0
abstracting: (feed_belt_empty<=A1U_rot2_in) states: 237,463 (5)
abstracting: (3<=CU_lower_rs) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [~ [[[ch_DC_full<=crane_stop_h & 1<=arm1_pick_up_ext] & ~ [A2U_rotated<=FB_in]]]]
normalized: ~ [E [true U [~ [A2U_rotated<=FB_in] & [ch_DC_full<=crane_stop_h & 1<=arm1_pick_up_ext]]]]

abstracting: (1<=arm1_pick_up_ext) states: 4,580 (3)
abstracting: (ch_DC_full<=crane_stop_h) states: 348,950 (5)
abstracting: (A2U_rotated<=FB_in) states: 345,536 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

checking: AG [[A2U_unloaded<=A2U_unloaded | ~ [[3<=A2L_rot3_in | 2<=FB_deliver_rs]]]]
normalized: ~ [E [true U ~ [[A2U_unloaded<=A2U_unloaded | ~ [[3<=A2L_rot3_in | 2<=FB_deliver_rs]]]]]]

abstracting: (2<=FB_deliver_rs) states: 0
abstracting: (3<=A2L_rot3_in) states: 0
abstracting: (A2U_unloaded<=A2U_unloaded) states: 349,874 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[ch_A2D_full<=table_bottom_pos | ~ [2<=CU_out]]]
normalized: ~ [E [true U ~ [[ch_A2D_full<=table_bottom_pos | ~ [2<=CU_out]]]]]

abstracting: (2<=CU_out) states: 0
abstracting: (ch_A2D_full<=table_bottom_pos) states: 342,972 (5)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

checking: EF [~ [~ [[3<=TL_out & ch_PA2_free<=belt1_stop]]]]
normalized: E [true U [3<=TL_out & ch_PA2_free<=belt1_stop]]

abstracting: (ch_PA2_free<=belt1_stop) states: 349,190 (5)
abstracting: (3<=TL_out) states: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: AG [[[~ [1<=FB_deliver_rs] | arm2_forward<=A2U_extended] & ~ [[3<=A1L_ret_rs | 2<=PL_in]]]]
normalized: ~ [E [true U ~ [[~ [[3<=A1L_ret_rs | 2<=PL_in]] & [arm2_forward<=A2U_extended | ~ [1<=FB_deliver_rs]]]]]]

abstracting: (1<=FB_deliver_rs) states: 978
abstracting: (arm2_forward<=A2U_extended) states: 332,615 (5)
abstracting: (2<=PL_in) states: 0
abstracting: (3<=A1L_ret_rs) states: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

checking: EF [[[[1<=A2U_unloaded | 2<=A2L_extended] | [2<=forge_rs & 3<=arm2_backward]] & [[2<=arm2_magnet_off | 3<=arm2_release_angle] & 3<=A2L_rot1_in]]]
normalized: E [true U [[3<=A2L_rot1_in & [2<=arm2_magnet_off | 3<=arm2_release_angle]] & [[2<=forge_rs & 3<=arm2_backward] | [1<=A2U_unloaded | 2<=A2L_extended]]]]

abstracting: (2<=A2L_extended) states: 0
abstracting: (1<=A2U_unloaded) states: 4,345 (3)
abstracting: (3<=arm2_backward) states: 0
abstracting: (2<=forge_rs) states: 0
abstracting: (3<=arm2_release_angle) states: 0
abstracting: (2<=arm2_magnet_off) states: 0
abstracting: (3<=A2L_rot1_in) states: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [1<=A1U_in]
normalized: E [true U 1<=A1U_in]

abstracting: (1<=A1U_in) states: 2,852 (3)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: AG [[[CL_ready_to_grasp<=A2U_out | ~ [press_ready_for_unloading<=ch_A2D_full]] | [2<=A1U_ret_run | [DB_deliver_rs<=arm1_waiting_for_swivel_1 | 3<=CL_loaded]]]]
normalized: ~ [E [true U ~ [[[2<=A1U_ret_run | [DB_deliver_rs<=arm1_waiting_for_swivel_1 | 3<=CL_loaded]] | [CL_ready_to_grasp<=A2U_out | ~ [press_ready_for_unloading<=ch_A2D_full]]]]]]

abstracting: (press_ready_for_unloading<=ch_A2D_full) states: 282,394 (5)
abstracting: (CL_ready_to_grasp<=A2U_out) states: 339,180 (5)
abstracting: (3<=CL_loaded) states: 0
abstracting: (DB_deliver_rs<=arm1_waiting_for_swivel_1) states: 343,554 (5)
abstracting: (2<=A1U_ret_run) states: 0
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m6sec

checking: AG [[[[CL_lower_rs<=CL_trans_rs & 3<=A1L_rot2_rs] | [1<=A2L_rot1_run | crane_lift<=A2L_in]] | press_up<=A1L_ext_run]]
normalized: ~ [E [true U ~ [[press_up<=A1L_ext_run | [[1<=A2L_rot1_run | crane_lift<=A2L_in] | [CL_lower_rs<=CL_trans_rs & 3<=A1L_rot2_rs]]]]]]

abstracting: (3<=A1L_rot2_rs) states: 0
abstracting: (CL_lower_rs<=CL_trans_rs) states: 339,026 (5)
abstracting: (crane_lift<=A2L_in) states: 297,674 (5)
abstracting: (1<=A2L_rot1_run) states: 88
abstracting: (press_up<=A1L_ext_run) states: 257,378 (5)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m4sec

checking: AG [~ [[[belt1_stop<=arm2_pick_up_angle | arm2_magnet_on<=DB_out] & [3<=A2U_ret_rs & FB_deliver_run<=A2L_rot1_rs]]]]
normalized: ~ [E [true U [[belt1_stop<=arm2_pick_up_angle | arm2_magnet_on<=DB_out] & [3<=A2U_ret_rs & FB_deliver_run<=A2L_rot1_rs]]]]

abstracting: (FB_deliver_run<=A2L_rot1_rs) states: 347,918 (5)
abstracting: (3<=A2U_ret_rs) states: 0
abstracting: (arm2_magnet_on<=DB_out) states: 270,627 (5)
abstracting: (belt1_stop<=arm2_pick_up_angle) states: 61,524 (4)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

checking: EF [[[[2<=CU_in | arm1_having_swivel_1<=A1L_ret_run] & [1<=A2U_ret_rs & 1<=crane_storing]] & 2<=crane_mag_off]]
normalized: E [true U [2<=crane_mag_off & [[2<=CU_in | arm1_having_swivel_1<=A1L_ret_run] & [1<=A2U_ret_rs & 1<=crane_storing]]]]

abstracting: (1<=crane_storing) states: 14,236 (4)
abstracting: (1<=A2U_ret_rs) states: 4,345 (3)
abstracting: (arm1_having_swivel_1<=A1L_ret_run) states: 339,364 (5)
abstracting: (2<=CU_in) states: 0
abstracting: (2<=crane_mag_off) states: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: AG [~ [~ [~ [2<=A1L_in]]]]
normalized: ~ [E [true U 2<=A1L_in]]

abstracting: (2<=A1L_in) states: 0
-> the formula is TRUE

FORMULA ParamProductionCell-PT-2-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m42sec


BK_STOP 1433630830663

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

1263 3249 8936 18616 22767 26159 28074 31114 32438 35213 34106 34092
iterations count:12683 (62), effective:526 (2)

initing FirstDep: 0m0sec

17347 18622 21108 27216 28244 33917
iterations count:6339 (31), effective:260 (1)
3279 7563 10082 19593 30625 32528 33816 34083 33876
iterations count:9009 (44), effective:403 (1)
8161 12047 19701 21459 29745 33752
iterations count:6443 (31), effective:259 (1)
8669 10257 15153 25744 32089 32593 34005 34801 34743
iterations count:9542 (47), effective:420 (2)

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_ParamProductionCell-PT-2"
export BK_EXAMINATION="ReachabilityCardinality"
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/S_ParamProductionCell-PT-2.tgz
mv S_ParamProductionCell-PT-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is S_ParamProductionCell-PT-2, 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 r204st-blw3-143341204400035"
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 ;