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-4, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204500054
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433630807874

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


RS generation: 0m10sec


-> reachability set: #nodes 91520 (9.2e+04) #states 2,409,739 (6)



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

checking: [EG [EF [2<=A2U_in]] & AX [AX [arm2_having_swivel_1<=ch_A1P_free]]]
normalized: [EG [E [true U 2<=A2U_in]] & ~ [EX [EX [~ [arm2_having_swivel_1<=ch_A1P_free]]]]]

abstracting: (arm2_having_swivel_1<=ch_A1P_free) states: 2,335,088 (6)
..abstracting: (2<=A2U_in) states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17sec

checking: EG [press_at_upper_pos<=ch_FT_free]
normalized: EG [press_at_upper_pos<=ch_FT_free]

abstracting: (press_at_upper_pos<=ch_FT_free) states: 2,027,871 (6)
.......................................................................................
EG iterations: 87
-> the formula is TRUE

FORMULA ParamProductionCell-PT-4-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11sec

checking: E [[~ [3<=A1U_rot3_in] | ~ [table_top_pos<=ch_TA1_full]] U EG [2<=A2U_ext_run]]
normalized: E [[~ [table_top_pos<=ch_TA1_full] | ~ [3<=A1U_rot3_in]] U EG [2<=A2U_ext_run]]

abstracting: (2<=A2U_ext_run) states: 0
.
EG iterations: 1
abstracting: (3<=A1U_rot3_in) states: 0
abstracting: (table_top_pos<=ch_TA1_full) states: 1,263,259 (6)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15sec

checking: AF [[AF [1<=CU_in] & [1<=TU_out & A2U_rot1_run<=table_unload_angle]]]
normalized: ~ [EG [~ [[[1<=TU_out & A2U_rot1_run<=table_unload_angle] & ~ [EG [~ [1<=CU_in]]]]]]]

abstracting: (1<=CU_in) states: 64,071 (4)
.....................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 389
abstracting: (A2U_rot1_run<=table_unload_angle) states: 2,390,209 (6)
abstracting: (1<=TU_out) states: 89,458 (4)
.....................................................................................
before gc: list nodes free: 1989821

after gc: idd nodes used:268702, unused:63731298; list nodes free:284058830
..............................................................................................................................................................................................................................................................................................................
EG iterations: 387
-> the formula is TRUE

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

MC time: 5m55sec

checking: EG [crane_lift<=A2L_rotated]
normalized: EG [crane_lift<=A2L_rotated]

abstracting: (crane_lift<=A2L_rotated) states: 1,993,759 (6)
......................................................................................................................
EG iterations: 118
-> the formula is TRUE

FORMULA ParamProductionCell-PT-4-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18sec

checking: AF [[~ [~ [3<=arm2_release_ext]] & AF [3<=A1U_extendet]]]
normalized: ~ [EG [~ [[3<=arm2_release_ext & ~ [EG [~ [3<=A1U_extendet]]]]]]]

abstracting: (3<=A1U_extendet) states: 0

EG iterations: 0
abstracting: (3<=arm2_release_ext) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [AX [A2L_ext_run<=forge_rs] U 3<=DB_trans_rs]
normalized: E [~ [EX [~ [A2L_ext_run<=forge_rs]]] U 3<=DB_trans_rs]

abstracting: (3<=DB_trans_rs) states: 0
abstracting: (A2L_ext_run<=forge_rs) states: 2,386,715 (6)
.-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

checking: A [AG [A2L_rot1_rs<=FB_out] U EX [2<=A2L_rot2_run]]
normalized: [~ [EG [~ [EX [2<=A2L_rot2_run]]]] & ~ [E [E [true U ~ [A2L_rot1_rs<=FB_out]] U [E [true U ~ [A2L_rot1_rs<=FB_out]] & ~ [EX [2<=A2L_rot2_run]]]]]]

abstracting: (2<=A2L_rot2_run) states: 0
.abstracting: (A2L_rot1_rs<=FB_out) states: 2,404,203 (6)
abstracting: (A2L_rot1_rs<=FB_out) states: 2,404,203 (6)
abstracting: (2<=A2L_rot2_run) states: 0
.
EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m36sec

checking: AG [[EF [1<=table_at_unload_angle] | CL_ready_to_transport<=arm1_release_ext]]
normalized: ~ [E [true U ~ [[CL_ready_to_transport<=arm1_release_ext | E [true U 1<=table_at_unload_angle]]]]]

abstracting: (1<=table_at_unload_angle) states: 89,458 (4)
abstracting: (CL_ready_to_transport<=arm1_release_ext) states: 2,336,264 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-4-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m7sec

checking: A [EX [PU_in<=CU_lift_rs] U AX [3<=arm1_waiting_for_swivel_1]]
normalized: [~ [EG [EX [~ [3<=arm1_waiting_for_swivel_1]]]] & ~ [E [~ [EX [PU_in<=CU_lift_rs]] U [~ [EX [PU_in<=CU_lift_rs]] & EX [~ [3<=arm1_waiting_for_swivel_1]]]]]]

abstracting: (3<=arm1_waiting_for_swivel_1) states: 0
.abstracting: (PU_in<=CU_lift_rs) states: 2,312,425 (6)
.abstracting: (PU_in<=CU_lift_rs) states: 2,312,425 (6)
.abstracting: (3<=arm1_waiting_for_swivel_1) states: 0
.
EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31sec

checking: AF [EG [~ [1<=table_top_pos]]]
normalized: ~ [EG [~ [EG [~ [1<=table_top_pos]]]]]

abstracting: (1<=table_top_pos) states: 1,235,938 (6)
.............................................................................................
before gc: list nodes free: 2844635

after gc: idd nodes used:258980, unused:63741020; list nodes free:284097566
....................................................................................................................................................................................................
EG iterations: 289

EG iterations: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m11sec

checking: [[AF [robot_right<=PU_in] & [AF [arm1_stop<=arm2_waiting_for_swivel_1] & 1<=arm1_retract_ext]] & [[[A2L_ext_run<=ch_FT_free | ~ [1<=A2L_ext_rs]] & forge_run<=press_up] | A2L_rot3_run<=DB_out]]
normalized: [[A2L_rot3_run<=DB_out | [forge_run<=press_up & [A2L_ext_run<=ch_FT_free | ~ [1<=A2L_ext_rs]]]] & [[1<=arm1_retract_ext & ~ [EG [~ [arm1_stop<=arm2_waiting_for_swivel_1]]]] & ~ [EG [~ [robot_right<=PU_in]]]]]

abstracting: (robot_right<=PU_in) states: 2,265,211 (6)
...............................................................................................................
EG iterations: 111
abstracting: (arm1_stop<=arm2_waiting_for_swivel_1) states: 171,570 (5)
................................................................................................................................
before gc: list nodes free: 4113144

after gc: idd nodes used:264715, unused:63735285; list nodes free:284079528
......................................................
EG iterations: 182
abstracting: (1<=arm1_retract_ext) states: 2,299,379 (6)
abstracting: (1<=A2L_ext_rs) states: 11,512 (4)
abstracting: (A2L_ext_run<=ch_FT_free) states: 2,387,659 (6)
abstracting: (forge_run<=press_up) states: 2,209,877 (6)
abstracting: (A2L_rot3_run<=DB_out) states: 2,387,667 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-4-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m18sec

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

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

FORMULA ParamProductionCell-PT-4-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[EF [TL_in<=TL_in] & EX [1<=PL_lower_run]]]
normalized: E [true U [E [true U TL_in<=TL_in] & EX [1<=PL_lower_run]]]

abstracting: (1<=PL_lower_run) states: 209,132 (5)
.abstracting: (TL_in<=TL_in) states: 2,409,739 (6)
-> the formula is TRUE

FORMULA ParamProductionCell-PT-4-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m32sec

checking: AG [[[[3<=ch_PA2_free | CU_ready_to_transport<=TU_in] | 2<=table_ready_for_loading] | [[1<=CL_trans_rs & 2<=A2U_out] | [FB_deliver_rs<=CL_in & 2<=belt1_stop]]]]
normalized: ~ [E [true U ~ [[[[1<=CL_trans_rs & 2<=A2U_out] | [FB_deliver_rs<=CL_in & 2<=belt1_stop]] | [2<=table_ready_for_loading | [3<=ch_PA2_free | CU_ready_to_transport<=TU_in]]]]]]

abstracting: (CU_ready_to_transport<=TU_in) states: 2,348,194 (6)
abstracting: (3<=ch_PA2_free) states: 0
abstracting: (2<=table_ready_for_loading) states: 0
abstracting: (2<=belt1_stop) states: 0
abstracting: (FB_deliver_rs<=CL_in) states: 2,392,366 (6)
abstracting: (2<=A2U_out) states: 0
abstracting: (1<=CL_trans_rs) states: 75,240 (4)
-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18sec

checking: AG [[3<=arm1_release_angle | [[A2L_rot3_run<=ch_PA2_full | crane_store_free<=arm1_release_angle] & [TU_out<=arm2_backward | A2U_rot3_run<=A1U_rot1_in]]]]
normalized: ~ [E [true U ~ [[3<=arm1_release_angle | [[TU_out<=arm2_backward | A2U_rot3_run<=A1U_rot1_in] & [A2L_rot3_run<=ch_PA2_full | crane_store_free<=arm1_release_angle]]]]]]

abstracting: (crane_store_free<=arm1_release_angle) states: 2,226,639 (6)
abstracting: (A2L_rot3_run<=ch_PA2_full) states: 2,386,715 (6)
abstracting: (A2U_rot3_run<=A1U_rot1_in) states: 2,382,041 (6)
abstracting: (TU_out<=arm2_backward) states: 2,325,507 (6)
abstracting: (3<=arm1_release_angle) states: 0
-> the formula is FALSE

FORMULA ParamProductionCell-PT-4-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m3sec


Total processing time: 18m7sec


BK_STOP 1433631895622

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

2655 4846 9433 13656 19726 21971 23207 24740 36850 66946 66346 66108 94911 103492 91520
iterations count:15075 (74), effective:641 (3)

initing FirstDep: 0m0sec

16152 29072 52196 69608 74428 80230 86586 94733 91520
iterations count:9004 (44), effective:383 (1)
16152 29072 52196 69608 74428 80230 86586 94733 91520
iterations count:9004 (44), effective:383 (1)

iterations count:202 (1), effective:0 (0)
78378 86256 86495 88602 88092 93661
iterations count:6774 (33), effective:285 (1)

iterations count:202 (1), effective:0 (0)

iterations count:202 (1), effective:0 (0)
52504 72843 83391 92822 93396 93689
iterations count:6792 (33), effective:293 (1)
63532 65677 65949 66885 94622 93027 92270
iterations count:7315 (36), effective:300 (1)
20822 35167 45930 62876 75060 89896 89829 92302 93413 96352
iterations count:10718 (53), effective:469 (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-4"
export BK_EXAMINATION="CTLCardinality"
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-4.tgz
mv S_ParamProductionCell-PT-4 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-4, 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 r204st-blw3-143341204500054"
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 ;