About the Execution of Marcie for LamportFastMutEx-COL-5
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8809.670 | 1867990.00 | 1867989.00 | 20.20 | 5 5 4 5 4 20 4 20 5 20 1 5 5 20 4 4 | 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-2979
Executing tool marcie
Input is LamportFastMutEx-COL-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913400200
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-0
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-1
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-15
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-2
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-3
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-4
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-5
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-6
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-7
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-8
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1463727261977
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=UpperBounds.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Unfolding complete |P|=174|T|=318|A|=1380
Time for unfolding: 0m 1.590sec
Net: LamportFastMutEx_COL_5
(NrP: 174 NrTr: 318 NrArc: 1380)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.008sec
init dd package: 0m 3.975sec
RS generation: 28m20.298sec
-> reachability set: #nodes 668391 (6.7e+05) #states 530,682,432 (8)
starting MCC model checker
--------------------------
checking: place_bound(P_ify0_4_C_pid_0,P_ify0_4_C_pid_1,P_ify0_4_C_pid_2,P_ify0_4_C_pid_3,P_ify0_4_C_pid_4,P_ify0_4_C_pid_5)
normalized: place_bound(P_ify0_4_C_pid_0,P_ify0_4_C_pid_1,P_ify0_4_C_pid_2,P_ify0_4_C_pid_3,P_ify0_4_C_pid_4,P_ify0_4_C_pid_5)
-> the formula is 5
FORMULA LamportFastMutEx-COL-5-UpperBounds-0 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(P_sety_9_C_pid_0,P_sety_9_C_pid_1,P_sety_9_C_pid_2,P_sety_9_C_pid_3,P_sety_9_C_pid_4,P_sety_9_C_pid_5)
normalized: place_bound(P_sety_9_C_pid_0,P_sety_9_C_pid_1,P_sety_9_C_pid_2,P_sety_9_C_pid_3,P_sety_9_C_pid_4,P_sety_9_C_pid_5)
-> the formula is 5
FORMULA LamportFastMutEx-COL-5-UpperBounds-1 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(P_sety_9_C_pid_0,P_sety_9_C_pid_1,P_sety_9_C_pid_2,P_sety_9_C_pid_3,P_sety_9_C_pid_4,P_sety_9_C_pid_5)
normalized: place_bound(P_sety_9_C_pid_0,P_sety_9_C_pid_1,P_sety_9_C_pid_2,P_sety_9_C_pid_3,P_sety_9_C_pid_4,P_sety_9_C_pid_5)
-> the formula is 5
FORMULA LamportFastMutEx-COL-5-UpperBounds-2 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(y_C_pid_0,y_C_pid_1,y_C_pid_2,y_C_pid_3,y_C_pid_4,y_C_pid_5)
normalized: place_bound(y_C_pid_0,y_C_pid_1,y_C_pid_2,y_C_pid_3,y_C_pid_4,y_C_pid_5)
-> the formula is 1
FORMULA LamportFastMutEx-COL-5-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(P_fordo_12_C_pid_0,P_fordo_12_C_pid_1,P_fordo_12_C_pid_2,P_fordo_12_C_pid_3,P_fordo_12_C_pid_4,P_fordo_12_C_pid_5)
normalized: place_bound(P_fordo_12_C_pid_0,P_fordo_12_C_pid_1,P_fordo_12_C_pid_2,P_fordo_12_C_pid_3,P_fordo_12_C_pid_4,P_fordo_12_C_pid_5)
-> the formula is 4
FORMULA LamportFastMutEx-COL-5-UpperBounds-8 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(P_await_13_C_pid_0,P_await_13_C_pid_1,P_await_13_C_pid_2,P_await_13_C_pid_3,P_await_13_C_pid_4,P_await_13_C_pid_5)
normalized: place_bound(P_await_13_C_pid_0,P_await_13_C_pid_1,P_await_13_C_pid_2,P_await_13_C_pid_3,P_await_13_C_pid_4,P_await_13_C_pid_5)
-> the formula is 4
FORMULA LamportFastMutEx-COL-5-UpperBounds-9 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(P_setbi_5_C_pid_0,P_setbi_5_C_pid_1,P_setbi_5_C_pid_2,P_setbi_5_C_pid_3,P_setbi_5_C_pid_4,P_setbi_5_C_pid_5)
normalized: place_bound(P_setbi_5_C_pid_0,P_setbi_5_C_pid_1,P_setbi_5_C_pid_2,P_setbi_5_C_pid_3,P_setbi_5_C_pid_4,P_setbi_5_C_pid_5)
-> the formula is 4
FORMULA LamportFastMutEx-COL-5-UpperBounds-10 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(P_start_1_C_pid_0,P_start_1_C_pid_1,P_start_1_C_pid_2,P_start_1_C_pid_3,P_start_1_C_pid_4,P_start_1_C_pid_5)
normalized: place_bound(P_start_1_C_pid_0,P_start_1_C_pid_1,P_start_1_C_pid_2,P_start_1_C_pid_3,P_start_1_C_pid_4,P_start_1_C_pid_5)
-> the formula is 5
FORMULA LamportFastMutEx-COL-5-UpperBounds-11 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(P_setbi_5_C_pid_0,P_setbi_5_C_pid_1,P_setbi_5_C_pid_2,P_setbi_5_C_pid_3,P_setbi_5_C_pid_4,P_setbi_5_C_pid_5)
normalized: place_bound(P_setbi_5_C_pid_0,P_setbi_5_C_pid_1,P_setbi_5_C_pid_2,P_setbi_5_C_pid_3,P_setbi_5_C_pid_4,P_setbi_5_C_pid_5)
-> the formula is 4
FORMULA LamportFastMutEx-COL-5-UpperBounds-12 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(P_await_13_C_pid_0,P_await_13_C_pid_1,P_await_13_C_pid_2,P_await_13_C_pid_3,P_await_13_C_pid_4,P_await_13_C_pid_5)
normalized: place_bound(P_await_13_C_pid_0,P_await_13_C_pid_1,P_await_13_C_pid_2,P_await_13_C_pid_3,P_await_13_C_pid_4,P_await_13_C_pid_5)
-> the formula is 4
FORMULA LamportFastMutEx-COL-5-UpperBounds-14 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(b_C_pid_0_C_bool_false,b_C_pid_0_C_bool_true,b_C_pid_1_C_bool_false,b_C_pid_1_C_bool_true,b_C_pid_2_C_bool_false,b_C_pid_2_C_bool_true,b_C_pid_3_C_bool_false,b_C_pid_3_C_bool_true,b_C_pid_4_C_bool_false,b_C_pid_4_C_bool_true,b_C_pid_5_C_bool_false,b_C_pid_5_C_bool_true)
normalized: place_bound(b_C_pid_0_C_bool_false,b_C_pid_0_C_bool_true,b_C_pid_1_C_bool_false,b_C_pid_1_C_bool_true,b_C_pid_2_C_bool_false,b_C_pid_2_C_bool_true,b_C_pid_3_C_bool_false,b_C_pid_3_C_bool_true,b_C_pid_4_C_bool_false,b_C_pid_4_C_bool_true,b_C_pid_5_C_bool_false,b_C_pid_5_C_bool_true)
-> the formula is 5
FORMULA LamportFastMutEx-COL-5-UpperBounds-5 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(b_C_pid_0_C_bool_false,b_C_pid_0_C_bool_true,b_C_pid_1_C_bool_false,b_C_pid_1_C_bool_true,b_C_pid_2_C_bool_false,b_C_pid_2_C_bool_true,b_C_pid_3_C_bool_false,b_C_pid_3_C_bool_true,b_C_pid_4_C_bool_false,b_C_pid_4_C_bool_true,b_C_pid_5_C_bool_false,b_C_pid_5_C_bool_true)
normalized: place_bound(b_C_pid_0_C_bool_false,b_C_pid_0_C_bool_true,b_C_pid_1_C_bool_false,b_C_pid_1_C_bool_true,b_C_pid_2_C_bool_false,b_C_pid_2_C_bool_true,b_C_pid_3_C_bool_false,b_C_pid_3_C_bool_true,b_C_pid_4_C_bool_false,b_C_pid_4_C_bool_true,b_C_pid_5_C_bool_false,b_C_pid_5_C_bool_true)
-> the formula is 5
FORMULA LamportFastMutEx-COL-5-UpperBounds-6 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(wait_C_pid_0_C_pid_0,wait_C_pid_0_C_pid_1,wait_C_pid_0_C_pid_2,wait_C_pid_0_C_pid_3,wait_C_pid_0_C_pid_4,wait_C_pid_0_C_pid_5,wait_C_pid_1_C_pid_0,wait_C_pid_1_C_pid_1,wait_C_pid_1_C_pid_2,wait_C_pid_1_C_pid_3,wait_C_pid_1_C_pid_4,wait_C_pid_1_C_pid_5,wait_C_pid_2_C_pid_0,wait_C_pid_2_C_pid_1,wait_C_pid_2_C_pid_2,wait_C_pid_2_C_pid_3,wait_C_pid_2_C_pid_4,wait_C_pid_2_C_pid_5,wait_C_pid_3_C_pid_0,wait_C_pid_3_C_pid_1,wait_C_pid_3_C_pid_2,wait_C_pid_3_C_pid_3,wait_C_pid_3_C_pid_4,wait_C_pid_3_C_pid_5,wait_C_pid_4_C_pid_0,wait_C_pid_4_C_pid_1,wait_C_pid_4_C_pid_2,wait_C_pid_4_C_pid_3,wait_C_pid_4_C_pid_4,wait_C_pid_4_C_pid_5,wait_C_pid_5_C_pid_0,wait_C_pid_5_C_pid_1,wait_C_pid_5_C_pid_2,wait_C_pid_5_C_pid_3,wait_C_pid_5_C_pid_4,wait_C_pid_5_C_pid_5)
normalized: place_bound(wait_C_pid_0_C_pid_0,wait_C_pid_0_C_pid_1,wait_C_pid_0_C_pid_2,wait_C_pid_0_C_pid_3,wait_C_pid_0_C_pid_4,wait_C_pid_0_C_pid_5,wait_C_pid_1_C_pid_0,wait_C_pid_1_C_pid_1,wait_C_pid_1_C_pid_2,wait_C_pid_1_C_pid_3,wait_C_pid_1_C_pid_4,wait_C_pid_1_C_pid_5,wait_C_pid_2_C_pid_0,wait_C_pid_2_C_pid_1,wait_C_pid_2_C_pid_2,wait_C_pid_2_C_pid_3,wait_C_pid_2_C_pid_4,wait_C_pid_2_C_pid_5,wait_C_pid_3_C_pid_0,wait_C_pid_3_C_pid_1,wait_C_pid_3_C_pid_2,wait_C_pid_3_C_pid_3,wait_C_pid_3_C_pid_4,wait_C_pid_3_C_pid_5,wait_C_pid_4_C_pid_0,wait_C_pid_4_C_pid_1,wait_C_pid_4_C_pid_2,wait_C_pid_4_C_pid_3,wait_C_pid_4_C_pid_4,wait_C_pid_4_C_pid_5,wait_C_pid_5_C_pid_0,wait_C_pid_5_C_pid_1,wait_C_pid_5_C_pid_2,wait_C_pid_5_C_pid_3,wait_C_pid_5_C_pid_4,wait_C_pid_5_C_pid_5)
-> the formula is 20
FORMULA LamportFastMutEx-COL-5-UpperBounds-3 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(done_C_pid_0_C_pid_0,done_C_pid_0_C_pid_1,done_C_pid_0_C_pid_2,done_C_pid_0_C_pid_3,done_C_pid_0_C_pid_4,done_C_pid_0_C_pid_5,done_C_pid_1_C_pid_0,done_C_pid_1_C_pid_1,done_C_pid_1_C_pid_2,done_C_pid_1_C_pid_3,done_C_pid_1_C_pid_4,done_C_pid_1_C_pid_5,done_C_pid_2_C_pid_0,done_C_pid_2_C_pid_1,done_C_pid_2_C_pid_2,done_C_pid_2_C_pid_3,done_C_pid_2_C_pid_4,done_C_pid_2_C_pid_5,done_C_pid_3_C_pid_0,done_C_pid_3_C_pid_1,done_C_pid_3_C_pid_2,done_C_pid_3_C_pid_3,done_C_pid_3_C_pid_4,done_C_pid_3_C_pid_5,done_C_pid_4_C_pid_0,done_C_pid_4_C_pid_1,done_C_pid_4_C_pid_2,done_C_pid_4_C_pid_3,done_C_pid_4_C_pid_4,done_C_pid_4_C_pid_5,done_C_pid_5_C_pid_0,done_C_pid_5_C_pid_1,done_C_pid_5_C_pid_2,done_C_pid_5_C_pid_3,done_C_pid_5_C_pid_4,done_C_pid_5_C_pid_5)
normalized: place_bound(done_C_pid_0_C_pid_0,done_C_pid_0_C_pid_1,done_C_pid_0_C_pid_2,done_C_pid_0_C_pid_3,done_C_pid_0_C_pid_4,done_C_pid_0_C_pid_5,done_C_pid_1_C_pid_0,done_C_pid_1_C_pid_1,done_C_pid_1_C_pid_2,done_C_pid_1_C_pid_3,done_C_pid_1_C_pid_4,done_C_pid_1_C_pid_5,done_C_pid_2_C_pid_0,done_C_pid_2_C_pid_1,done_C_pid_2_C_pid_2,done_C_pid_2_C_pid_3,done_C_pid_2_C_pid_4,done_C_pid_2_C_pid_5,done_C_pid_3_C_pid_0,done_C_pid_3_C_pid_1,done_C_pid_3_C_pid_2,done_C_pid_3_C_pid_3,done_C_pid_3_C_pid_4,done_C_pid_3_C_pid_5,done_C_pid_4_C_pid_0,done_C_pid_4_C_pid_1,done_C_pid_4_C_pid_2,done_C_pid_4_C_pid_3,done_C_pid_4_C_pid_4,done_C_pid_4_C_pid_5,done_C_pid_5_C_pid_0,done_C_pid_5_C_pid_1,done_C_pid_5_C_pid_2,done_C_pid_5_C_pid_3,done_C_pid_5_C_pid_4,done_C_pid_5_C_pid_5)
-> the formula is 20
FORMULA LamportFastMutEx-COL-5-UpperBounds-7 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(wait_C_pid_0_C_pid_0,wait_C_pid_0_C_pid_1,wait_C_pid_0_C_pid_2,wait_C_pid_0_C_pid_3,wait_C_pid_0_C_pid_4,wait_C_pid_0_C_pid_5,wait_C_pid_1_C_pid_0,wait_C_pid_1_C_pid_1,wait_C_pid_1_C_pid_2,wait_C_pid_1_C_pid_3,wait_C_pid_1_C_pid_4,wait_C_pid_1_C_pid_5,wait_C_pid_2_C_pid_0,wait_C_pid_2_C_pid_1,wait_C_pid_2_C_pid_2,wait_C_pid_2_C_pid_3,wait_C_pid_2_C_pid_4,wait_C_pid_2_C_pid_5,wait_C_pid_3_C_pid_0,wait_C_pid_3_C_pid_1,wait_C_pid_3_C_pid_2,wait_C_pid_3_C_pid_3,wait_C_pid_3_C_pid_4,wait_C_pid_3_C_pid_5,wait_C_pid_4_C_pid_0,wait_C_pid_4_C_pid_1,wait_C_pid_4_C_pid_2,wait_C_pid_4_C_pid_3,wait_C_pid_4_C_pid_4,wait_C_pid_4_C_pid_5,wait_C_pid_5_C_pid_0,wait_C_pid_5_C_pid_1,wait_C_pid_5_C_pid_2,wait_C_pid_5_C_pid_3,wait_C_pid_5_C_pid_4,wait_C_pid_5_C_pid_5)
normalized: place_bound(wait_C_pid_0_C_pid_0,wait_C_pid_0_C_pid_1,wait_C_pid_0_C_pid_2,wait_C_pid_0_C_pid_3,wait_C_pid_0_C_pid_4,wait_C_pid_0_C_pid_5,wait_C_pid_1_C_pid_0,wait_C_pid_1_C_pid_1,wait_C_pid_1_C_pid_2,wait_C_pid_1_C_pid_3,wait_C_pid_1_C_pid_4,wait_C_pid_1_C_pid_5,wait_C_pid_2_C_pid_0,wait_C_pid_2_C_pid_1,wait_C_pid_2_C_pid_2,wait_C_pid_2_C_pid_3,wait_C_pid_2_C_pid_4,wait_C_pid_2_C_pid_5,wait_C_pid_3_C_pid_0,wait_C_pid_3_C_pid_1,wait_C_pid_3_C_pid_2,wait_C_pid_3_C_pid_3,wait_C_pid_3_C_pid_4,wait_C_pid_3_C_pid_5,wait_C_pid_4_C_pid_0,wait_C_pid_4_C_pid_1,wait_C_pid_4_C_pid_2,wait_C_pid_4_C_pid_3,wait_C_pid_4_C_pid_4,wait_C_pid_4_C_pid_5,wait_C_pid_5_C_pid_0,wait_C_pid_5_C_pid_1,wait_C_pid_5_C_pid_2,wait_C_pid_5_C_pid_3,wait_C_pid_5_C_pid_4,wait_C_pid_5_C_pid_5)
-> the formula is 20
FORMULA LamportFastMutEx-COL-5-UpperBounds-13 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(done_C_pid_0_C_pid_0,done_C_pid_0_C_pid_1,done_C_pid_0_C_pid_2,done_C_pid_0_C_pid_3,done_C_pid_0_C_pid_4,done_C_pid_0_C_pid_5,done_C_pid_1_C_pid_0,done_C_pid_1_C_pid_1,done_C_pid_1_C_pid_2,done_C_pid_1_C_pid_3,done_C_pid_1_C_pid_4,done_C_pid_1_C_pid_5,done_C_pid_2_C_pid_0,done_C_pid_2_C_pid_1,done_C_pid_2_C_pid_2,done_C_pid_2_C_pid_3,done_C_pid_2_C_pid_4,done_C_pid_2_C_pid_5,done_C_pid_3_C_pid_0,done_C_pid_3_C_pid_1,done_C_pid_3_C_pid_2,done_C_pid_3_C_pid_3,done_C_pid_3_C_pid_4,done_C_pid_3_C_pid_5,done_C_pid_4_C_pid_0,done_C_pid_4_C_pid_1,done_C_pid_4_C_pid_2,done_C_pid_4_C_pid_3,done_C_pid_4_C_pid_4,done_C_pid_4_C_pid_5,done_C_pid_5_C_pid_0,done_C_pid_5_C_pid_1,done_C_pid_5_C_pid_2,done_C_pid_5_C_pid_3,done_C_pid_5_C_pid_4,done_C_pid_5_C_pid_5)
normalized: place_bound(done_C_pid_0_C_pid_0,done_C_pid_0_C_pid_1,done_C_pid_0_C_pid_2,done_C_pid_0_C_pid_3,done_C_pid_0_C_pid_4,done_C_pid_0_C_pid_5,done_C_pid_1_C_pid_0,done_C_pid_1_C_pid_1,done_C_pid_1_C_pid_2,done_C_pid_1_C_pid_3,done_C_pid_1_C_pid_4,done_C_pid_1_C_pid_5,done_C_pid_2_C_pid_0,done_C_pid_2_C_pid_1,done_C_pid_2_C_pid_2,done_C_pid_2_C_pid_3,done_C_pid_2_C_pid_4,done_C_pid_2_C_pid_5,done_C_pid_3_C_pid_0,done_C_pid_3_C_pid_1,done_C_pid_3_C_pid_2,done_C_pid_3_C_pid_3,done_C_pid_3_C_pid_4,done_C_pid_3_C_pid_5,done_C_pid_4_C_pid_0,done_C_pid_4_C_pid_1,done_C_pid_4_C_pid_2,done_C_pid_4_C_pid_3,done_C_pid_4_C_pid_4,done_C_pid_4_C_pid_5,done_C_pid_5_C_pid_0,done_C_pid_5_C_pid_1,done_C_pid_5_C_pid_2,done_C_pid_5_C_pid_3,done_C_pid_5_C_pid_4,done_C_pid_5_C_pid_5)
-> the formula is 20
FORMULA LamportFastMutEx-COL-5-UpperBounds-15 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
Total processing time: 31m 7.844sec
BK_STOP 1463729129967
--------------------
content from stderr:
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
P_ify0_4_C_pid_0
P_ifxi_10_C_pid_0
P_fordo_12_C_pid_0
P_awaity_C_pid_0
P_await_13_C_pid_0
P_setbi_5_C_pid_0
P_setbi_11_C_pid_0
P_setbi_24_C_pid_0
wait_C_pid_0_C_pid_5
wait_C_pid_1_C_pid_0
P_sety_9_C_pid_0
wait_C_pid_2_C_pid_0
wait_C_pid_3_C_pid_0
wait_C_pid_4_C_pid_0
wait_C_pid_5_C_pid_0
done_C_pid_0_C_pid_0
done_C_pid_0_C_pid_1
done_C_pid_0_C_pid_2
done_C_pid_0_C_pid_3
done_C_pid_0_C_pid_4
done_C_pid_0_C_pid_5
done_C_pid_1_C_pid_0
P_start_1_C_pid_0
done_C_pid_2_C_pid_0
done_C_pid_3_C_pid_0
done_C_pid_4_C_pid_0
wait_C_pid_0_C_pid_3
P_ifyi_15_C_pid_0
wait_C_pid_0_C_pid_4
done_C_pid_5_C_pid_0
wait_C_pid_0_C_pid_0
wait_C_pid_0_C_pid_1
wait_C_pid_0_C_pid_2
P_CS_21_C_pid_0
b_C_pid_0_C_bool_false
b_C_pid_0_C_bool_true
P_setx_3_C_pid_0
The net has transition(s) that can never fire:
T_setbi_2_0_0
T_setbi_2_1_0
T_setx_3_0_0
T_setx_3_0_1
T_setx_3_0_2
T_setx_3_0_5
T_setx_3_0_3
T_setx_3_0_4
T_yne0_4_0_2
T_yne0_4_0_1
T_yne0_4_0_3
T_yne0_4_0_4
T_yne0_4_0_5
T_setbi_5_0_0
T_yeqi_15_0_0
T_ynei_15_1_0
T_ynei_15_5_0
T_setbi_5_1_0
T_awaity_0
T_yeq0_4_0
T_setbi_24_1_0
T_sety_9_0_0
T_sety_9_0_1
T_sety_9_0_2
T_sety_9_0_5
T_sety_9_0_3
T_sety_9_0_4
T_ynei_15_2_0
T_ynei_15_3_0
T_ynei_15_4_0
T_xeqi_10_0_0
T_sety0_23_0_0
T_xnei_10_1_0
T_xnei_10_2_0
T_setbi_11_0_0
T_xnei_10_5_0
T_xnei_10_3_0
T_xnei_10_4_0
T_setbi_11_1_0
T_fordo_12_0
T_await_13_0_0
T_await_13_0_1
T_await_13_0_2
T_await_13_0_3
T_await_13_0_4
T_await_13_0_5
T_await_13_1_0
T_await_13_2_0
T_await_13_3_0
T_await_13_4_0
T_await_13_5_0
T_forod_13_0
T_sety0_23_0_1
T_sety0_23_0_2
T_sety0_23_0_5
T_sety0_23_0_3
T_sety0_23_0_4
T_setbi_24_0_0
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
.........10 1421685.........20 698191.........30 668391
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="LamportFastMutEx-COL-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/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/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 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 LamportFastMutEx-COL-5, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r065kn-blw3-146358913400200"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
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 ;