About the Execution of Marcie for S_NeoElection-COL-2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5439.050 | 7563.00 | 6999.00 | 30.30 | T | 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 S_NeoElection-COL-2, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444130500989
=====================================================================
--------------------
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 NeoElection-COL-2-ReachabilityDeadlock-0
=== Now, execution of the tool begins
BK_START 1464861007912
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=ReachabilityDeadlock.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Unfolding complete |P|=195|T|=375|A|=2088
Time for unfolding: 0m 1.930sec
Net: NeoElection_COL_2
(NrP: 195 NrTr: 375 NrArc: 2088)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.012sec
init dd package: 0m 3.812sec
RS generation: 0m 0.086sec
-> reachability set: #nodes 1767 (1.8e+03) #states 241
starting MCC model checker
--------------------------
checking: EF [DEADLOCK]
normalized: E [true U DEADLOCK]
-> the formula is TRUE
FORMULA NeoElection-COL-2-ReachabilityDeadlock-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.180sec
Total processing time: 0m 7.527sec
BK_STOP 1464861015475
--------------------
content from stderr:
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
P_network_C_M_0_C_M_0_C_MT_AskP_C_M_0
P_network_C_M_0_C_M_0_C_MT_RI_C_M_0
P_masterList_C_M_0_C_POS_1_C_M_2
P_masterList_C_M_0_C_POS_2_C_M_0
P_masterList_C_M_0_C_POS_2_C_M_1
P_electionInit_C_M_0
P_electedPrimary_C_M_2
P_electedSecondary_C_M_0
P_electedSecondary_C_M_2
P_masterState_C_M_2_C_BOOL_F_C_M_0
P_masterList_C_M_0_C_POS_1_C_M_0
P_electedSecondary_C_M_1
P_masterState_C_M_0_C_BOOL_F_C_M_0
P_masterList_C_M_0_C_POS_1_C_M_1
P_electedPrimary_C_M_1
P_masterList_C_M_2_C_POS_2_C_M_2
P_masterList_C_M_2_C_POS_2_C_M_1
P_masterList_C_M_2_C_POS_2_C_M_0
P_masterList_C_M_2_C_POS_1_C_M_2
P_masterList_C_M_2_C_POS_1_C_M_0
P_masterList_C_M_1_C_POS_2_C_M_2
P_masterList_C_M_1_C_POS_2_C_M_1
P_masterList_C_M_1_C_POS_2_C_M_0
P_masterList_C_M_1_C_POS_1_C_M_1
P_negotiation_C_M_0_C_M_0_C_NEGSTEP_DONE
P_masterList_C_M_1_C_POS_1_C_M_0
P_masterList_C_M_0_C_POS_2_C_M_2
P_masterState_C_M_2_C_BOOL_T_C_M_2
P_negotiation_C_M_0_C_M_0_C_NEGSTEP_CO
P_masterState_C_M_2_C_BOOL_T_C_M_1
P_masterState_C_M_2_C_BOOL_F_C_M_2
P_masterState_C_M_2_C_BOOL_F_C_M_1
P_masterState_C_M_1_C_BOOL_T_C_M_2
P_masterState_C_M_1_C_BOOL_T_C_M_1
P_masterState_C_M_1_C_BOOL_F_C_M_1
P_masterState_C_M_1_C_BOOL_F_C_M_2
P_masterState_C_M_0_C_BOOL_T_C_M_2
P_masterState_C_M_0_C_BOOL_T_C_M_1
P_masterState_C_M_0_C_BOOL_F_C_M_2
P_negotiation_C_M_1_C_M_0_C_NEGSTEP_CO
P_masterState_C_M_0_C_BOOL_T_C_M_0
P_negotiation_C_M_0_C_M_2_C_NEGSTEP_DONE
P_masterState_C_M_0_C_BOOL_F_C_M_1
P_negotiation_C_M_2_C_M_2_C_NEGSTEP_NONE
P_network_C_M_1_C_M_0_C_MT_AnsP_C_M_0
P_network_C_M_1_C_M_0_C_MT_AnsP_C_M_1
P_network_C_M_0_C_M_0_C_MT_AnsP_C_M_0
P_network_C_M_0_C_M_0_C_MT_AnsP_C_M_1
P_network_C_M_0_C_M_0_C_MT_AnsP_C_M_2
P_negotiation_C_M_0_C_M_2_C_NEGSTEP_NONE
P_negotiation_C_M_2_C_M_2_C_NEGSTEP_CO
P_negotiation_C_M_2_C_M_0_C_NEGSTEP_NONE
P_network_C_M_0_C_M_1_C_MT_AnnP_C_M_0
P_network_C_M_0_C_M_1_C_MT_AnsP_C_M_0
P_negotiation_C_M_0_C_M_2_C_NEGSTEP_CO
P_negotiation_C_M_2_C_M_0_C_NEGSTEP_DONE
P_negotiation_C_M_2_C_M_0_C_NEGSTEP_CO
P_negotiation_C_M_0_C_M_1_C_NEGSTEP_NONE
P_negotiation_C_M_0_C_M_1_C_NEGSTEP_DONE
P_network_C_M_0_C_M_0_C_MT_AI_C_M_0
P_negotiation_C_M_0_C_M_1_C_NEGSTEP_CO
P_negotiation_C_M_0_C_M_0_C_NEGSTEP_NONE
P_network_C_M_2_C_M_2_C_MT_AskP_C_M_0
P_network_C_M_2_C_M_2_C_MT_RI_C_M_0
P_network_C_M_2_C_M_2_C_MT_RP_C_M_0
P_poll__handlingMessage_C_M_0
P_poll__networl_C_M_0_C_M_0_C_MT_AnsP_C_M_1
P_poll__networl_C_M_0_C_M_0_C_MT_AnsP_C_M_2
P_poll__networl_C_M_0_C_M_1_C_MT_AnsP_C_M_1
P_poll__networl_C_M_0_C_M_1_C_MT_AnsP_C_M_2
P_poll__networl_C_M_0_C_M_2_C_MT_AnsP_C_M_1
P_poll__networl_C_M_0_C_M_2_C_MT_AnsP_C_M_2
P_poll__networl_C_M_1_C_M_0_C_MT_AnsP_C_M_1
P_poll__networl_C_M_1_C_M_0_C_MT_AnsP_C_M_2
P_poll__networl_C_M_1_C_M_1_C_MT_AnsP_C_M_1
P_poll__networl_C_M_1_C_M_1_C_MT_AnsP_C_M_2
P_poll__networl_C_M_1_C_M_2_C_MT_AnsP_C_M_1
P_poll__networl_C_M_1_C_M_2_C_MT_AnsP_C_M_2
P_poll__networl_C_M_2_C_M_0_C_MT_AnsP_C_M_1
P_network_C_M_2_C_M_2_C_MT_AnnP_C_M_0
P_network_C_M_2_C_M_2_C_MT_AnsP_C_M_0
P_network_C_M_2_C_M_2_C_MT_AnsP_C_M_1
P_network_C_M_2_C_M_2_C_MT_AnsP_C_M_2
P_network_C_M_1_C_M_1_C_MT_AI_C_M_0
P_network_C_M_1_C_M_1_C_MT_AnnP_C_M_0
P_network_C_M_1_C_M_1_C_MT_AnsP_C_M_0
P_network_C_M_1_C_M_1_C_MT_AnsP_C_M_1
P_network_C_M_1_C_M_1_C_MT_AnsP_C_M_2
P_network_C_M_1_C_M_1_C_MT_AskP_C_M_0
P_network_C_M_1_C_M_1_C_MT_RI_C_M_0
P_network_C_M_1_C_M_1_C_MT_RP_C_M_0
P_network_C_M_0_C_M_2_C_MT_AnnP_C_M_0
P_network_C_M_0_C_M_2_C_MT_AnsP_C_M_0
P_network_C_M_0_C_M_2_C_MT_AnsP_C_M_1
P_network_C_M_0_C_M_1_C_MT_AnsP_C_M_2
P_network_C_M_0_C_M_2_C_MT_RP_C_M_0
P_network_C_M_1_C_M_0_C_MT_AI_C_M_0
P_network_C_M_1_C_M_0_C_MT_AnnP_C_M_0
P_network_C_M_0_C_M_1_C_MT_AnsP_C_M_1
P_network_C_M_0_C_M_2_C_MT_AnsP_C_M_2
P_network_C_M_0_C_M_2_C_MT_AskP_C_M_0
P_network_C_M_0_C_M_2_C_MT_RI_C_M_0
P_negotiation_C_M_1_C_M_1_C_NEGSTEP_CO
P_network_C_M_1_C_M_0_C_MT_AnsP_C_M_2
P_network_C_M_1_C_M_0_C_MT_AskP_C_M_0
P_network_C_M_1_C_M_0_C_MT_RI_C_M_0
P_network_C_M_1_C_M_0_C_MT_RP_C_M_0
P_negotiation_C_M_1_C_M_1_C_NEGSTEP_NONE
P_network_C_M_0_C_M_2_C_MT_AI_C_M_0
P_network_C_M_0_C_M_0_C_MT_AnnP_C_M_0
P_network_C_M_0_C_M_1_C_MT_AskP_C_M_0
P_network_C_M_0_C_M_1_C_MT_RI_C_M_0
P_network_C_M_0_C_M_1_C_MT_RP_C_M_0
P_negotiation_C_M_1_C_M_0_C_NEGSTEP_DONE
P_negotiation_C_M_1_C_M_0_C_NEGSTEP_NONE
P_network_C_M_0_C_M_0_C_MT_RP_C_M_0
P_network_C_M_0_C_M_1_C_MT_AI_C_M_0
P_network_C_M_2_C_M_1_C_MT_AnsP_C_M_1
P_network_C_M_2_C_M_1_C_MT_AnsP_C_M_2
P_network_C_M_2_C_M_1_C_MT_AnnP_C_M_0
P_poll__networl_C_M_2_C_M_0_C_MT_AnsP_C_M_2
P_poll__networl_C_M_2_C_M_1_C_MT_AnsP_C_M_1
P_poll__networl_C_M_2_C_M_1_C_MT_AnsP_C_M_2
P_poll__networl_C_M_2_C_M_2_C_MT_AnsP_C_M_1
P_poll__networl_C_M_2_C_M_2_C_MT_AnsP_C_M_2
P_poll__pollEnd_C_M_0
P_poll__waitingMessage_C_M_0
P_poll__waitingMessage_C_M_1
P_poll__waitingMessage_C_M_2
P_polling_C_M_0
P_sendAnnPs__broadcasting_C_M_0_C_POS_1
P_sendAnnPs__broadcasting_C_M_0_C_POS_2
P_network_C_M_2_C_M_0_C_MT_AI_C_M_0
P_network_C_M_2_C_M_0_C_MT_AnnP_C_M_0
P_network_C_M_2_C_M_0_C_MT_AnsP_C_M_0
P_network_C_M_2_C_M_0_C_MT_AnsP_C_M_1
P_network_C_M_2_C_M_0_C_MT_AnsP_C_M_2
P_network_C_M_2_C_M_0_C_MT_AskP_C_M_0
P_network_C_M_2_C_M_0_C_MT_RI_C_M_0
P_network_C_M_2_C_M_0_C_MT_RP_C_M_0
P_network_C_M_2_C_M_1_C_MT_RP_C_M_0
P_network_C_M_2_C_M_2_C_MT_AI_C_M_0
P_sendAnnPs__broadcasting_C_M_1_C_POS_1
P_sendAnnPs__broadcasting_C_M_1_C_POS_2
P_sendAnnPs__broadcasting_C_M_2_C_POS_1
P_sendAnnPs__broadcasting_C_M_2_C_POS_2
P_stage_C_M_0_C_STAGE_NEG
P_stage_C_M_0_C_STAGE_PRIM
P_stage_C_M_0_C_STAGE_SEC
P_stage_C_M_1_C_STAGE_PRIM
P_stage_C_M_1_C_STAGE_SEC
P_stage_C_M_2_C_STAGE_PRIM
P_stage_C_M_2_C_STAGE_SEC
P_startNeg__broadcasting_C_M_0_C_POS_1
P_startNeg__broadcasting_C_M_0_C_POS_2
P_electedPrimary_C_M_0
P_network_C_M_1_C_M_2_C_MT_AnnP_C_M_0
P_network_C_M_1_C_M_2_C_MT_AnsP_C_M_1
P_network_C_M_1_C_M_2_C_MT_AnsP_C_M_2
P_network_C_M_1_C_M_2_C_MT_RP_C_M_0
The net has transition(s) that can never fire:
T_poll__end_0
T_poll__handleAI1_0_0_0
T_poll__handleAI1_0_0_1
T_poll__handleAI1_0_0_2
T_poll__handleAI1_0_1_0
T_poll__handleAI2_1_0_0_0_2
T_poll__handleAI1_0_2_1
T_poll__handleAI1_0_1_1
T_poll__handleAI1_0_1_2
T_poll__handleAI1_0_2_0
T_poll__handleAI1_1_1_2
T_poll__handleAI1_2_2_0
T_poll__handleAI1_0_2_2
T_poll__handleAI1_1_1_0
T_poll__handleAI1_1_2_2
T_poll__handleAI1_1_1_1
T_poll__handleAI1_1_2_0
T_poll__handleAI2_1_0_1_1_0
T_poll__handleAI1_2_2_1
T_poll__iAmSecondary_2_1
T_poll__handleAI1_2_2_2
T_poll__iAmSecondary_2_2
T_poll__handleAI2_1_0_0_0_0
T_poll__handleAnnP1_1_2_0_2
T_poll__handleAI2_1_0_0_0_1
T_poll__handleAI2_1_0_0_1_0
T_poll__handleAI2_2_0_0_0_1
T_poll__handleAI2_1_0_1_0_2
T_poll__handleAI2_1_0_0_1_1
T_poll__handleAI2_1_0_0_1_2
T_poll__handleAI2_1_0_0_2_0
T_poll__handleAI2_1_0_1_1_2
T_poll__handleAI2_1_0_0_2_1
T_poll__handleAI2_1_0_0_2_2
T_poll__handleAI2_1_0_1_0_0
T_poll__handleAI2_1_0_1_0_1
T_poll__handleAnsP2_0_0_1_0
T_poll__handleAI2_2_1_1_0_0
T_poll__handleAI2_1_0_1_1_1
T_poll__handleAI2_2_0_1_1_0
T_poll__handleAI2_2_1_0_2_2
T_poll__handleAI2_1_0_1_2_0
T_poll__handleAI2_1_0_1_2_1
T_poll__handleAI2_1_0_1_2_2
T_poll__handleAI2_2_0_0_0_0
T_poll__handleAI2_2_1_1_2_0
T_poll__handleAnnP2_1_2
T_poll__handleAI2_2_0_0_0_2
T_poll__handleAI2_2_0_0_1_0
T_poll__handleAI2_2_0_0_1_1
T_poll__handleAI2_2_0_0_1_2
T_poll__iAmSecondary_1_0
T_poll__handleAI2_2_0_0_2_0
T_poll__handleAI2_2_0_0_2_1
T_poll__handleAI2_2_0_0_2_2
T_poll__handleAI2_2_0_1_0_0
T_poll__handleAI2_2_0_1_0_1
T_poll__handleAI2_2_0_1_0_2
T_poll__handleAI2_2_0_1_1_1
T_poll__handleAnnP1_2_0_1_1
T_poll__handleAnnP1_2_0_1_2
T_poll__handleAnnP1_2_1_0_0
T_poll__handleAI2_2_0_1_1_2
T_poll__handleAI2_2_0_1_2_0
T_poll__handleAI2_2_0_1_2_1
T_poll__handleAI2_2_0_1_2_2
T_poll__handleAI2_2_1_0_0_0
T_poll__handleAI2_2_1_0_0_1
T_poll__handleAI2_2_1_0_1_0
T_poll__handleAI2_2_1_0_1_1
T_poll__handleAI2_2_1_0_1_2
T_poll__handleAI2_2_1_0_2_0
T_poll__handleAI2_2_1_0_2_1
T_poll__handleAskP_0_2_0_2
T_poll__handleAnsP2_0_0_1_1
T_poll__handleAnsP2_0_0_1_2
T_poll__handleAnsP2_0_0_2_0
T_poll__handleAnsP2_0_0_2_1
T_poll__handleAI2_2_1_1_0_1
T_poll__handleAnnP1_2_1_1_0
T_poll__handleAI2_2_1_1_1_0
T_poll__handleAI2_2_1_1_1_1
T_poll__handleAI2_2_1_1_1_2
T_poll__handleAnsP2_1_2_1_0
T_poll__handleAnsP2_1_2_1_2
T_poll__handleAnsP2_1_2_1_1
T_poll__handleAI2_2_1_1_2_1
T_poll__handleAI2_2_1_1_2_2
T_poll__handleAnnP1_0_1_0_0
T_poll__handleAnnP1_0_1_0_1
T_poll__handleAnnP1_0_1_0_2
T_poll__handleAnnP1_0_1_1_0
T_poll__handleAnnP1_0_1_1_1
T_poll__handleAnnP1_0_1_1_2
T_poll__handleAnnP1_0_2_0_0
T_poll__handleAnnP1_0_2_0_1
T_poll__handleAnnP1_0_2_0_2
T_poll__handleAnnP1_0_2_1_0
T_poll__handleAnnP1_0_2_1_1
T_poll__handleAnnP1_0_2_1_2
T_poll__handleAnnP1_1_0_0_0
T_poll__handleAnnP1_1_0_0_1
T_poll__handleAnnP1_1_0_0_2
T_poll__handleAnnP1_1_0_1_0
T_poll__handleAnnP1_1_0_1_1
T_poll__handleAnnP1_1_0_1_2
T_poll__handleAnnP1_1_2_0_0
T_poll__handleAnnP1_1_2_0_1
T_poll__handleAnsP2_1_0_1_0
T_poll__handleAnnP1_1_2_1_0
T_poll__handleAnnP1_1_2_1_1
T_poll__handleAnnP1_1_2_1_2
T_poll__handleAnnP1_2_0_0_0
T_poll__handleAnnP1_2_0_0_1
T_poll__handleAnnP1_2_0_0_2
T_poll__handleAnnP1_2_0_1_0
T_poll__handleAnsP2_1_0_1_2
T_poll__handleAnsP4_0_1_2_0
T_poll__handleAnsP4_0_1_2_1
T_poll__handleAnsP4_0_1_2_2
T_poll__handleAnnP1_2_1_0_1
T_poll__handleAnnP1_2_1_0_2
T_poll__handleAnsP3_2_1_1_2_0
T_poll__handleAnnP1_2_1_1_1
T_poll__handleAnnP1_2_1_1_2
T_poll__handleAnnP2_0_0
T_poll__handleAnnP2_0_1
T_poll__handleAnnP2_0_2
T_poll__handleAnnP2_1_0
T_poll__handleAnnP2_1_1
T_poll__handleAnnP2_2_0
T_poll__handleAnnP2_2_1
T_poll__handleAnnP2_2_2
T_poll__handleAnsP1_0_0
T_poll__handleAnsP1_0_1
T_poll__handleAnsP1_0_2
T_poll__handleAnsP1_1_0
T_poll__handleAnsP1_1_1
T_poll__handleAnsP1_2_0
T_poll__handleAnsP1_2_2
T_poll__handleAskP_0_2_1_1
T_poll__handleAskP_0_2_1_2
T_poll__handleAskP_0_2_2_0
T_poll__handleAskP_0_2_2_1
T_poll__handleAskP_0_2_2_2
T_poll__handleAskP_1_0_0_1
T_poll__handleAskP_1_0_0_0
T_poll__handleAnsP2_0_0_2_2
T_poll__handleAnsP2_0_1_1_0
T_poll__handleAnsP2_0_1_1_1
T_poll__handleAnsP2_0_1_1_2
T_poll__handleAnsP2_0_1_2_0
T_poll__handleAnsP2_0_1_2_1
T_poll__handleAnsP2_0_1_2_2
T_poll__handleAnsP2_0_2_1_0
T_poll__handleAnsP2_0_2_1_1
T_poll__handleAnsP2_0_2_1_2
T_poll__handleAnsP2_0_2_2_0
T_poll__handleAnsP2_0_2_2_1
T_poll__handleAnsP2_0_2_2_2
T_poll__handleAskP_0_2_1_0
T_poll__handleAnsP2_1_0_1_1
T_poll__handleAnsP2_1_0_2_0
T_poll__handleAnsP2_1_0_2_1
T_poll__handleAnsP2_1_0_2_2
T_poll__handleAnsP2_1_1_1_0
T_poll__handleAnsP2_1_1_1_1
T_poll__handleAnsP2_1_1_1_2
T_poll__handleAnsP2_1_1_2_0
T_poll__handleAnsP2_1_1_2_1
T_poll__handleAnsP2_1_1_2_2
T_poll__handleAnsP3_1_2_0_0_1
T_sendAnnPs__start_1
T_sendAnnPs__start_2
T_sendAnnPs__send_0_2_1
T_sendAnnPs__send_0_2_2
T_sendAnnPs__send_1_0_0
T_sendAnnPs__send_1_0_1
T_sendAnnPs__send_1_0_2
T_sendAnnPs__send_1_1_0
T_sendAnnPs__send_1_1_1
T_poll__handleAnsP2_1_2_2_0
T_poll__handleAnsP2_1_2_2_1
T_poll__handleAnsP2_1_2_2_2
T_poll__handleAnsP3_1_2_0_0_0
T_poll__handleAnsP3_1_2_0_0_2
T_poll__handleAnsP3_1_2_0_1_0
T_poll__handleAnsP3_1_2_0_1_1
T_poll__handleAnsP3_1_2_0_1_2
T_poll__handleAnsP3_1_2_0_2_0
T_poll__handleAnsP3_1_2_0_2_1
T_poll__handleAnsP3_2_1_1_1_2
T_poll__handleAnsP3_1_2_0_2_2
T_poll__handleAnsP3_1_2_1_0_0
T_poll__handleAnsP3_1_2_1_0_1
T_poll__handleAnsP3_1_2_1_0_2
T_poll__handleAnsP3_1_2_1_1_0
T_poll__handleAnsP3_1_2_1_1_1
T_poll__handleAnsP3_1_2_1_1_2
T_poll__handleAnsP3_1_2_1_2_0
T_poll__handleAnsP3_1_2_1_2_1
T_poll__handleAnsP3_1_2_1_2_2
T_poll__handleAnsP3_2_1_0_0_0
T_poll__handleAnsP3_2_1_0_0_1
T_poll__handleAnsP3_2_1_0_0_2
T_poll__handleAnsP3_2_1_0_1_0
T_poll__handleAnsP3_2_1_0_1_1
T_poll__handleAnsP3_2_1_0_1_2
T_poll__handleAnsP3_2_1_0_2_0
T_poll__handleAnsP3_2_1_0_2_1
T_poll__handleAnsP3_2_1_0_2_2
T_poll__handleAnsP3_2_1_1_0_0
T_poll__handleAnsP3_2_1_1_0_1
T_poll__handleAnsP3_2_1_1_0_2
T_poll__handleAnsP3_2_1_1_1_0
T_poll__handleAnsP3_2_1_1_1_1
T_poll__handleAnsP4_0_1_1_2
T_poll__handleAnsP3_2_1_1_2_1
T_poll__handleAnsP3_2_1_1_2_2
T_poll__handleAnsP4_0_0_1_0
T_poll__handleAnsP4_0_0_1_1
T_poll__handleAnsP4_0_0_1_2
T_poll__handleAnsP4_0_0_2_0
T_poll__handleAnsP4_0_0_2_1
T_poll__handleAnsP4_0_0_2_2
T_poll__handleAnsP4_0_1_1_0
T_poll__handleAnsP4_0_1_1_1
T_poll__handleAnsP4_0_2_1_0
T_poll__handleAnsP4_0_2_1_1
T_poll__handleAnsP4_0_2_1_2
T_poll__handleAnsP4_0_2_2_0
T_poll__handleAnsP4_0_2_2_1
T_poll__handleAnsP4_0_2_2_2
T_poll__handleAnsP4_1_0_1_0
T_poll__handleAnsP4_1_0_1_1
T_poll__handleAnsP4_1_0_1_2
T_poll__handleAnsP4_1_0_2_0
T_poll__handleAnsP4_1_0_2_1
T_poll__handleAnsP4_1_0_2_2
T_poll__handleAnsP4_1_1_1_0
T_poll__handleAnsP4_1_1_1_1
T_poll__handleAnsP4_1_1_1_2
T_poll__handleAnsP4_1_1_2_0
T_poll__handleAnsP4_1_1_2_1
T_poll__handleAnsP4_1_1_2_2
T_poll__handleAnsP4_1_2_1_0
T_poll__handleAnsP4_1_2_1_1
T_poll__handleAnsP4_1_2_1_2
T_poll__handleAnsP4_1_2_2_0
T_poll__handleAnsP4_1_2_2_1
T_poll__handleAnsP4_1_2_2_2
T_poll__handleAskP_0_0_0_0
T_poll__handleAskP_0_0_0_1
T_poll__handleAskP_0_0_0_2
T_poll__handleAskP_0_0_1_0
T_poll__handleAskP_0_0_1_1
T_poll__handleAskP_0_0_1_2
T_poll__handleAskP_0_0_2_0
T_poll__handleAskP_0_0_2_1
T_poll__handleAskP_0_0_2_2
T_poll__handleAskP_0_1_0_0
T_poll__handleAskP_0_1_0_1
T_poll__handleAskP_0_1_1_0
T_poll__handleAskP_0_1_1_1
T_poll__handleAskP_0_1_1_2
T_poll__handleAskP_0_1_2_0
T_poll__handleAskP_0_1_2_1
T_poll__handleAskP_0_1_2_2
T_poll__handleAskP_0_2_0_0
T_poll__handleAskP_0_2_0_1
T_poll__handleAskP_1_0_0_2
T_poll__handleAskP_1_0_1_0
T_poll__handleAskP_1_0_1_1
T_poll__handleAskP_1_0_1_2
T_poll__handleAskP_1_0_2_0
T_poll__handleAskP_1_0_2_1
T_poll__handleAskP_1_0_2_2
T_poll__handleAskP_1_1_0_0
T_poll__handleAskP_1_1_0_1
T_poll__handleAskP_1_1_1_0
T_poll__handleAskP_1_1_1_1
T_poll__handleAskP_1_1_1_2
T_poll__handleAskP_1_1_2_0
T_poll__handleAskP_1_1_2_1
T_poll__handleAskP_1_1_2_2
T_poll__handleAskP_1_2_0_0
T_poll__handleAskP_1_2_0_2
T_poll__handleAskP_1_2_1_0
T_poll__handleAskP_1_2_1_1
T_poll__handleAskP_1_2_1_2
T_poll__handleAskP_1_2_2_0
T_poll__handleAskP_1_2_2_1
T_poll__handleAskP_1_2_2_2
T_poll__handleRI_0_0
T_poll__handleRI_0_1
T_poll__handleRI_0_2
T_poll__handleRI_1_0
T_poll__handleRI_1_1
T_poll__handleRI_2_0
T_poll__handleRI_2_2
T_poll__handleRP_0_0
T_poll__handleRP_0_1
T_poll__handleRP_0_2
T_poll__handleRP_1_0
T_poll__handleRP_1_1
T_poll__handleRP_1_2
T_poll__handleRP_2_0
T_poll__handleRP_2_1
T_poll__handleRP_2_2
T_poll__iAmPrimary_0
T_poll__iAmPrimary_1
T_poll__iAmPrimary_2
T_poll__iAmSecondary_0_0
T_poll__iAmSecondary_0_1
T_poll__iAmSecondary_0_2
T_poll__iAmSecondary_1_1
T_poll__iAmSecondary_1_2
T_poll__iAmSecondary_2_0
T_sendAnnPs__end_0
T_poll__start_0
T_sendAnnPs__end_1
T_sendAnnPs__end_2
T_sendAnnPs__send_0_0_0
T_sendAnnPs__send_0_0_1
T_sendAnnPs__send_0_0_2
T_sendAnnPs__send_0_1_0
T_sendAnnPs__send_0_1_1
T_sendAnnPs__send_0_1_2
T_sendAnnPs__send_0_2_0
T_startNeg__end_0
T_sendAnnPs__send_1_1_2
T_sendAnnPs__send_1_2_0
T_sendAnnPs__send_1_2_1
T_sendAnnPs__send_1_2_2
T_sendAnnPs__start_0
T_startNeg__send_0_0_0
T_startNeg__send_0_0_1
T_startNeg__send_0_0_2
T_startNeg__send_0_1_0
T_startNeg__send_0_1_1
T_startNeg__send_0_2_0
T_startNeg__send_0_2_2
T_startNeg__send_1_0_0
T_startNeg__send_1_0_1
T_startNeg__send_1_0_2
T_startNeg__send_1_1_0
T_startNeg__send_1_1_1
T_startNeg__send_1_1_2
T_startNeg__send_1_2_0
T_startNeg__send_1_2_1
T_startNeg__send_1_2_2
T_startNeg__start_0
T_startSec_0
T_startSec_1
T_startSec_2
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.001sec
1001 1444
iterations count:2940 (7), effective:32 (0)
initing FirstDep: 0m 0.001sec
413 760 1710
iterations count:3319 (8), effective:40 (0)
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_NeoElection-COL-2"
export BK_EXAMINATION="ReachabilityDeadlock"
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/S_NeoElection-COL-2.tgz
mv S_NeoElection-COL-2 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 S_NeoElection-COL-2, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r185kn-smll-146444130500989"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 ;