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-2979
Executing tool marcie
Input is ParamProductionCell-PT-0, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r077kn-smll-146363816000142
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463735642732


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: ParamProductionCell_PT_0
(NrP: 198 NrTr: 176 NrArc: 730)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec

init dd package: 0m 4.130sec


RS generation: 0m 1.862sec


-> reachability set: #nodes 6305 (6.3e+03) #states 2,776,936 (6)



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

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

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

FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (1<=blank_forged) states: 117,136 (5)
-> the formula is TRUE

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

MC time: 0m 1.184sec

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

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

FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.001sec

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

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

FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [[~ [3<=ch_TA1_full] | ~ [2<=A1L_rot2_run]]]]
normalized: E [true U ~ [[~ [3<=ch_TA1_full] | ~ [2<=A1L_rot2_run]]]]

abstracting: (2<=A1L_rot2_run) states: 0
abstracting: (3<=ch_TA1_full) states: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [PU_in<=PL_lower_rs]]
normalized: E [true U ~ [PU_in<=PL_lower_rs]]

abstracting: (PU_in<=PL_lower_rs) states: 2,659,800 (6)
-> the formula is TRUE

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

MC time: 0m 0.827sec

checking: EF [[1<=A1U_rot2_in & A1U_rot3_run<=A2L_ext_rs]]
normalized: E [true U [1<=A1U_rot2_in & A1U_rot3_run<=A2L_ext_rs]]

abstracting: (A1U_rot3_run<=A2L_ext_rs) states: 2,763,744 (6)
abstracting: (1<=A1U_rot2_in) states: 7,372 (3)
-> the formula is TRUE

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

MC time: 0m 0.611sec

checking: AG [~ [[3<=A1U_ext_run & ~ [arm1_waiting_for_swivel_2<=table_ready_for_unloading]]]]
normalized: ~ [E [true U [3<=A1U_ext_run & ~ [arm1_waiting_for_swivel_2<=table_ready_for_unloading]]]]

abstracting: (arm1_waiting_for_swivel_2<=table_ready_for_unloading) states: 2,724,960 (6)
abstracting: (3<=A1U_ext_run) states: 0
-> the formula is TRUE

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

MC time: 0m 0.009sec

checking: AG [[1<=belt2_light_barrier_false & A2L_out<=belt1_stop]]
normalized: ~ [E [true U ~ [[1<=belt2_light_barrier_false & A2L_out<=belt1_stop]]]]

abstracting: (A2L_out<=belt1_stop) states: 2,776,120 (6)
abstracting: (1<=belt2_light_barrier_false) states: 2,253,544 (6)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.420sec

checking: AG [[press_up<=A1U_rot2_in | 3<=A2U_rot2_rs]]
normalized: ~ [E [true U ~ [[press_up<=A1U_rot2_in | 3<=A2U_rot2_rs]]]]

abstracting: (3<=A2U_rot2_rs) states: 0
abstracting: (press_up<=A1U_rot2_in) states: 2,417,968 (6)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.193sec

checking: EF [~ [[~ [A1U_ext_rs<=ch_TA1_full] | A2L_rot3_in<=PL_out]]]
normalized: E [true U ~ [[A2L_rot3_in<=PL_out | ~ [A1U_ext_rs<=ch_TA1_full]]]]

abstracting: (A1U_ext_rs<=ch_TA1_full) states: 2,763,544 (6)
abstracting: (A2L_rot3_in<=PL_out) states: 2,763,472 (6)
-> the formula is TRUE

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

MC time: 0m 0.787sec

checking: AG [[~ [~ [3<=A1L_rot3_rs]] | [A1U_rot3_rs<=A2U_rot3_rs | ~ [A1U_ext_rs<=A2L_ext_run]]]]
normalized: ~ [E [true U ~ [[3<=A1L_rot3_rs | [A1U_rot3_rs<=A2U_rot3_rs | ~ [A1U_ext_rs<=A2L_ext_run]]]]]]

abstracting: (A1U_ext_rs<=A2L_ext_run) states: 2,762,968 (6)
abstracting: (A1U_rot3_rs<=A2U_rot3_rs) states: 2,770,340 (6)
abstracting: (3<=A1L_rot3_rs) states: 0
-> the formula is FALSE

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

MC time: 0m 0.649sec

checking: AG [[~ [[arm1_storing<=TU_lift_run & 1<=DB_at_end]] & A2U_rot2_rs<=belt2_stop]]
normalized: ~ [E [true U ~ [[A2U_rot2_rs<=belt2_stop & ~ [[arm1_storing<=TU_lift_run & 1<=DB_at_end]]]]]]

abstracting: (1<=DB_at_end) states: 130,848 (5)
abstracting: (arm1_storing<=TU_lift_run) states: 1,888,360 (6)
abstracting: (A2U_rot2_rs<=belt2_stop) states: 2,776,936 (6)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-0-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.512sec

checking: EF [[[[1<=TL_out | 2<=table_at_unload_angle] & [2<=A1U_in & A1U_rot2_rs<=A1U_rot3_rs]] & 1<=ch_CF_free]]
normalized: E [true U [1<=ch_CF_free & [[2<=A1U_in & A1U_rot2_rs<=A1U_rot3_rs] & [1<=TL_out | 2<=table_at_unload_angle]]]]

abstracting: (2<=table_at_unload_angle) states: 0
abstracting: (1<=TL_out) states: 105,824 (5)
abstracting: (A1U_rot2_rs<=A1U_rot3_rs) states: 2,769,564 (6)
abstracting: (2<=A1U_in) states: 0
abstracting: (1<=ch_CF_free) states: 634,708 (5)
-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: EF [[[~ [3<=arm2_release_ext] | [1<=FB_at_end | arm2_pick_up_angle<=TL_lower_rs]] & [3<=TL_lower_rs & ~ [3<=A2L_out]]]]
normalized: E [true U [[3<=TL_lower_rs & ~ [3<=A2L_out]] & [[1<=FB_at_end | arm2_pick_up_angle<=TL_lower_rs] | ~ [3<=arm2_release_ext]]]]

abstracting: (3<=arm2_release_ext) states: 0
abstracting: (arm2_pick_up_angle<=TL_lower_rs) states: 2,329,404 (6)
abstracting: (1<=FB_at_end) states: 26,456 (4)
abstracting: (3<=A2L_out) states: 0
abstracting: (3<=TL_lower_rs) states: 0
-> the formula is FALSE

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

MC time: 0m 0.007sec


Total processing time: 0m16.084sec


BK_STOP 1463735658857

--------------------
content from stderr:

check for maximal unmarked siphon
ok
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: 0m 0.000sec

1080 3179 5141 6112 6857 7261 10641 11570 12845 13242 13364 15407 16413 17268 17664 19373 17301 17964 14016
iterations count:19315 (109), effective:1275 (7)

initing FirstDep: 0m 0.000sec

4566 5220 5420 5793
iterations count:4504 (25), effective:273 (1)
4470 5146 5389 5762
iterations count:4518 (25), effective:277 (1)
1964 2985 4306 6240 7613
iterations count:5240 (29), effective:329 (1)
6756 7468 7361 6866 6632
iterations count:5269 (29), effective:335 (1)
4557 5213 5783 6535
iterations count:4986 (28), effective:336 (1)
2714 4153 4704 5971 7722
iterations count:5608 (31), effective:367 (2)
2059 2948 3864 5402 7159
iterations count:5486 (31), effective:364 (2)
6436 7187 7292 6988 6669
iterations count:5189 (29), effective:345 (1)

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-0"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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-0.tgz
mv ParamProductionCell-PT-0 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is ParamProductionCell-PT-0, 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 r077kn-smll-146363816000142"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 ;