fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Execution of r204st-blw3-143341204400009
Last Updated
August 19, 2015

About the Execution of Marcie for S_ParamProductionCell-PT-0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4250.320 103961.00 103999.00 20.20 TFFFTFFFFTTFFTFF normal

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


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

Model: S_ParamProductionCell-PT-0
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: 198 NrTr: 176 NrArc: 730)

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 14351 (1.4e+04) #states 2,776,936 (6)



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

checking: AG [~ [[TL_lower_run<=deposit_belt_empty & [3<=belt2_start & 3<=arm2_waiting_for_swivel_2]]]]
normalized: ~ [E [true U [TL_lower_run<=deposit_belt_empty & [3<=belt2_start & 3<=arm2_waiting_for_swivel_2]]]]

abstracting: (3<=arm2_waiting_for_swivel_2) states: 0
abstracting: (3<=belt2_start) states: 0
abstracting: (TL_lower_run<=deposit_belt_empty) states: 2,585,000 (6)
-> the formula is TRUE

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

MC time: 0m5sec

checking: AG [~ [[[arm1_release_angle<=TL_lower_rs & 3<=A2U_in] | [1<=PU_lower_run & FB_deliver_rs<=A1L_rot2_in]]]]
normalized: ~ [E [true U [[arm1_release_angle<=TL_lower_rs & 3<=A2U_in] | [1<=PU_lower_run & FB_deliver_rs<=A1L_rot2_in]]]]

abstracting: (FB_deliver_rs<=A1L_rot2_in) states: 2,750,480 (6)
abstracting: (1<=PU_lower_run) states: 234,272 (5)
abstracting: (3<=A2U_in) states: 0
abstracting: (arm1_release_angle<=TL_lower_rs) states: 2,210,348 (6)
-> the formula is FALSE

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

MC time: 0m2sec

checking: AG [[[~ [1<=deposit_belt_occupied] | 1<=belt1_light_barrier_false] & [~ [2<=A2U_rot1_rs] & [swivel<=FB_out | A2U_extended<=FB_deliver_rs]]]]
normalized: ~ [E [true U ~ [[[~ [2<=A2U_rot1_rs] & [swivel<=FB_out | A2U_extended<=FB_deliver_rs]] & [1<=belt1_light_barrier_false | ~ [1<=deposit_belt_occupied]]]]]]

abstracting: (1<=deposit_belt_occupied) states: 261,696 (5)
abstracting: (1<=belt1_light_barrier_false) states: 2,671,112 (6)
abstracting: (A2U_extended<=FB_deliver_rs) states: 2,747,944 (6)
abstracting: (swivel<=FB_out) states: 1,971,224 (6)
abstracting: (2<=A2U_rot1_rs) states: 0
-> the formula is FALSE

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

MC time: 0m5sec

checking: EF [~ [[~ [1<=arm2_having_swivel_1] | [DB_deliver_run<=c_p1 & A2L_ext_run<=belt1_start]]]]
normalized: E [true U ~ [[~ [1<=arm2_having_swivel_1] | [DB_deliver_run<=c_p1 & A2L_ext_run<=belt1_start]]]]

abstracting: (A2L_ext_run<=belt1_start) states: 2,751,640 (6)
abstracting: (DB_deliver_run<=c_p1) states: 2,646,088 (6)
abstracting: (1<=arm2_having_swivel_1) states: 100,844 (5)
-> the formula is TRUE

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

MC time: 0m10sec

checking: AG [~ [[2<=deposit_belt_occupied | [2<=TU_lift_rs & ch_FT_full<=ch_A1P_free]]]]
normalized: ~ [E [true U [2<=deposit_belt_occupied | [2<=TU_lift_rs & ch_FT_full<=ch_A1P_free]]]]

abstracting: (ch_FT_full<=ch_A1P_free) states: 2,675,624 (6)
abstracting: (2<=TU_lift_rs) states: 0
abstracting: (2<=deposit_belt_occupied) states: 0
-> the formula is TRUE

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

MC time: 0m2sec

checking: AG [~ [[[PL_in<=A1L_rot1_in | 3<=TL_rot_rs] & [arm2_retract_ext<=A1L_loaded & press_ready_for_loading<=arm1_waiting_for_swivel_1]]]]
normalized: ~ [E [true U [[PL_in<=A1L_rot1_in | 3<=TL_rot_rs] & [arm2_retract_ext<=A1L_loaded & press_ready_for_loading<=arm1_waiting_for_swivel_1]]]]

abstracting: (press_ready_for_loading<=arm1_waiting_for_swivel_1) states: 2,207,336 (6)
abstracting: (arm2_retract_ext<=A1L_loaded) states: 224,400 (5)
abstracting: (3<=TL_rot_rs) states: 0
abstracting: (PL_in<=A1L_rot1_in) states: 2,657,280 (6)
-> the formula is FALSE

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

MC time: 0m8sec

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

abstracting: (A2U_rot3_run<=A1L_in) states: 2,753,208 (6)
-> the formula is FALSE

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

MC time: 0m2sec

checking: EF [[[press_at_middle_pos<=A1U_rot1_in | [A1U_unloadet<=A2L_extended & 2<=belt1_stop]] & [1<=FB_deliver_rs | [1<=arm2_release_ext & 2<=press_down]]]]
normalized: E [true U [[1<=FB_deliver_rs | [1<=arm2_release_ext & 2<=press_down]] & [press_at_middle_pos<=A1U_rot1_in | [A1U_unloadet<=A2L_extended & 2<=belt1_stop]]]]

abstracting: (2<=belt1_stop) states: 0
abstracting: (A1U_unloadet<=A2L_extended) states: 2,762,968 (6)
abstracting: (press_at_middle_pos<=A1U_rot1_in) states: 1,624,864 (6)
abstracting: (2<=press_down) states: 0
abstracting: (1<=arm2_release_ext) states: 146,440 (5)
abstracting: (1<=FB_deliver_rs) states: 26,456 (4)
-> the formula is TRUE

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

MC time: 0m2sec

checking: AG [A2L_rot1_run<=arm2_waiting_for_swivel_1]
normalized: ~ [E [true U ~ [A2L_rot1_run<=arm2_waiting_for_swivel_1]]]

abstracting: (A2L_rot1_run<=arm2_waiting_for_swivel_1) states: 2,763,744 (6)
-> the formula is FALSE

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

MC time: 0m6sec

checking: EF [[[1<=A2U_rotated | [2<=feed_belt_empty & A1U_ret_rs<=A1L_out]] & ~ [[PL_in<=arm1_stop & DB_deliver_rs<=ch_A2D_free]]]]
normalized: E [true U [~ [[PL_in<=arm1_stop & DB_deliver_rs<=ch_A2D_free]] & [1<=A2U_rotated | [2<=feed_belt_empty & A1U_ret_rs<=A1L_out]]]]

abstracting: (A1U_ret_rs<=A1L_out) states: 2,762,968 (6)
abstracting: (2<=feed_belt_empty) states: 0
abstracting: (1<=A2U_rotated) states: 29,288 (4)
abstracting: (DB_deliver_rs<=ch_A2D_free) states: 2,646,088 (6)
abstracting: (PL_in<=arm1_stop) states: 2,773,480 (6)
-> the formula is FALSE

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

MC time: 0m16sec

checking: AG [[[~ [arm1_forward<=A2U_rot1_run] | robot_right<=PL_out] | [[belt2_stop<=arm1_pick_up_angle & 3<=DB_trans_run] | [deposit_belt_empty<=press_ready_for_unloading | table_at_unload_angle<=A1L_rot2_rs]]]]
normalized: ~ [E [true U ~ [[[[belt2_stop<=arm1_pick_up_angle & 3<=DB_trans_run] | [deposit_belt_empty<=press_ready_for_unloading | table_at_unload_angle<=A1L_rot2_rs]] | [robot_right<=PL_out | ~ [arm1_forward<=A2U_rot1_run]]]]]]

abstracting: (arm1_forward<=A2U_rot1_run) states: 2,703,112 (6)
abstracting: (robot_right<=PL_out) states: 2,640,172 (6)
abstracting: (table_at_unload_angle<=A1L_rot2_rs) states: 2,671,112 (6)
abstracting: (deposit_belt_empty<=press_ready_for_unloading) states: 2,573,240 (6)
abstracting: (3<=DB_trans_run) states: 0
abstracting: (belt2_stop<=arm1_pick_up_angle) states: 1,312,420 (6)
-> the formula is FALSE

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

MC time: 0m14sec

checking: AG [belt2_light_barrier_true<=A2L_out]
normalized: ~ [E [true U ~ [belt2_light_barrier_true<=A2L_out]]]

abstracting: (belt2_light_barrier_true<=A2L_out) states: 2,256,712 (6)
-> the formula is FALSE

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

MC time: 0m6sec

checking: AG [[3<=ch_A1P_full | [[A2L_ext_run<=table_upward & 2<=TL_rot_run] | A1U_rotated<=press_at_middle_pos]]]
normalized: ~ [E [true U ~ [[3<=ch_A1P_full | [A1U_rotated<=press_at_middle_pos | [A2L_ext_run<=table_upward & 2<=TL_rot_run]]]]]]

abstracting: (2<=TL_rot_run) states: 0
abstracting: (A2L_ext_run<=table_upward) states: 2,756,536 (6)
abstracting: (A1U_rotated<=press_at_middle_pos) states: 2,776,936 (6)
abstracting: (3<=ch_A1P_full) states: 0
-> the formula is TRUE

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

MC time: 0m2sec

checking: AG [[[[A2L_rot1_in<=belt2_light_barrier_false & FB_trans_rs<=press_stop] | [2<=A1U_ext_run | table_stop_v<=press_upward]] | [[1<=c_p2 | 2<=A2U_in] & [A1L_ret_rs<=A2L_rot2_rs | TU_lift_rs<=A1U_rot3_in]]]]
normalized: ~ [E [true U ~ [[[[1<=c_p2 | 2<=A2U_in] & [A1L_ret_rs<=A2L_rot2_rs | TU_lift_rs<=A1U_rot3_in]] | [[A2L_rot1_in<=belt2_light_barrier_false & FB_trans_rs<=press_stop] | [2<=A1U_ext_run | table_stop_v<=press_upward]]]]]]

abstracting: (table_stop_v<=press_upward) states: 908,016 (5)
abstracting: (2<=A1U_ext_run) states: 0
abstracting: (FB_trans_rs<=press_stop) states: 2,767,024 (6)
abstracting: (A2L_rot1_in<=belt2_light_barrier_false) states: 2,775,384 (6)
abstracting: (TU_lift_rs<=A1U_rot3_in) states: 2,671,384 (6)
abstracting: (A1L_ret_rs<=A2L_rot2_rs) states: 2,766,296 (6)
abstracting: (2<=A2U_in) states: 0
abstracting: (1<=c_p2) states: 1,388,468 (6)
-> the formula is FALSE

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

MC time: 0m8sec

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

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

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

MC time: 0m0sec

checking: EF [[3<=DB_trans_rs | [[2<=arm1_backward | 2<=belt1_stop] | [1<=A1L_rot1_run & 3<=A1U_rot1_in]]]]
normalized: E [true U [3<=DB_trans_rs | [[2<=arm1_backward | 2<=belt1_stop] | [1<=A1L_rot1_run & 3<=A1U_rot1_in]]]]

abstracting: (3<=A1U_rot1_in) states: 0
abstracting: (1<=A1L_rot1_run) states: 13,216 (4)
abstracting: (2<=belt1_stop) states: 0
abstracting: (2<=arm1_backward) states: 0
abstracting: (3<=DB_trans_rs) states: 0
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 1m43sec


BK_STOP 1433630862857

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

1110 2462 4320 5974 7898 9368 11426 12423 12737 14206 14576 16278 15618 15366 16389 15347 15728 15417 16046 14555 14613
iterations count:21333 (121), effective:1085 (6)

initing FirstDep: 0m0sec

10008 11077 11326 14174 14311
iterations count:5207 (29), effective:253 (1)
8044 10201 13313 14540 14627 15687 14874 14764
iterations count:8227 (46), effective:427 (2)
6000 10421 13024 14480 15162 16066 16789 15865 15646 15544 15445 14944 14562
iterations count:13305 (75), effective:700 (3)
6163 10175 14184 14907 14896 14697
iterations count:6162 (35), effective:335 (1)
5741 9512 12832 13803 14724
iterations count:5404 (30), effective:274 (1)
12026 13936 13205 15706 14953
iterations count:5708 (32), effective:295 (1)
3661 7020 10733 11575 12278 14114
iterations count:6701 (38), effective:344 (1)
3864 5407 8673 12196 12648 15663 15297 14934 14351
iterations count:9040 (51), effective:500 (2)
15010 16086 16680 14800
iterations count:4491 (25), effective:235 (1)
9455 10099 12716 14182 14486 15934 14813 14259
iterations count:8911 (50), effective:455 (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-0"
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-0.tgz
mv S_ParamProductionCell-PT-0 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-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 r204st-blw3-143341204400009"
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 ;