fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r257-smll-167863532300117
Last Updated
May 14, 2023

About the Execution of Marcie for NeoElection-COL-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5471.647 7272.00 7070.00 0.00 2 0 ? 0 2 2 2 2 4 0 2 0 ? ? 0 2 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r257-smll-167863532300117.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is NeoElection-COL-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532300117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 15:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:23 model.pnml

--------------------
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 NeoElection-COL-2-UpperBounds-00
FORMULA_NAME NeoElection-COL-2-UpperBounds-01
FORMULA_NAME NeoElection-COL-2-UpperBounds-02
FORMULA_NAME NeoElection-COL-2-UpperBounds-03
FORMULA_NAME NeoElection-COL-2-UpperBounds-04
FORMULA_NAME NeoElection-COL-2-UpperBounds-05
FORMULA_NAME NeoElection-COL-2-UpperBounds-06
FORMULA_NAME NeoElection-COL-2-UpperBounds-07
FORMULA_NAME NeoElection-COL-2-UpperBounds-08
FORMULA_NAME NeoElection-COL-2-UpperBounds-09
FORMULA_NAME NeoElection-COL-2-UpperBounds-10
FORMULA_NAME NeoElection-COL-2-UpperBounds-11
FORMULA_NAME NeoElection-COL-2-UpperBounds-12
FORMULA_NAME NeoElection-COL-2-UpperBounds-13
FORMULA_NAME NeoElection-COL-2-UpperBounds-14
FORMULA_NAME NeoElection-COL-2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678693066197

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-2
Not applying reductions.
Model is COL
UpperBounds COL
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Unfolding complete |P|=195|T|=375|A|=2106
Time for unfolding: 0m 1.558sec

Net: NeoElection_COL_2
(NrP: 195 NrTr: 375 NrArc: 2106)

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

net check time: 0m 0.000sec

init dd package: 0m 3.405sec


RS generation: 0m 0.038sec


-> reachability set: #nodes 484 (4.8e+02) #states 241



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

checking: place_bound(P_electedSecondary_C_M_0,P_electedSecondary_C_M_1,P_electedSecondary_C_M_2)
normalized: place_bound(P_electedSecondary_C_M_0,P_electedSecondary_C_M_1,P_electedSecondary_C_M_2)

-> the formula is 0

FORMULA NeoElection-COL-2-UpperBounds-03 0 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: place_bound(P_polling_C_M_0,P_polling_C_M_1,P_polling_C_M_2)
normalized: place_bound(P_polling_C_M_0,P_polling_C_M_1,P_polling_C_M_2)

-> the formula is 2

FORMULA NeoElection-COL-2-UpperBounds-06 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_poll__handlingMessage_C_M_0,P_poll__handlingMessage_C_M_1,P_poll__handlingMessage_C_M_2)
normalized: place_bound(P_poll__handlingMessage_C_M_0,P_poll__handlingMessage_C_M_1,P_poll__handlingMessage_C_M_2)

-> the formula is 2

FORMULA NeoElection-COL-2-UpperBounds-07 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_poll__pollEnd_C_M_0,P_poll__pollEnd_C_M_1,P_poll__pollEnd_C_M_2)
normalized: place_bound(P_poll__pollEnd_C_M_0,P_poll__pollEnd_C_M_1,P_poll__pollEnd_C_M_2)

-> the formula is 2

FORMULA NeoElection-COL-2-UpperBounds-10 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_electedPrimary_C_M_0,P_electedPrimary_C_M_1,P_electedPrimary_C_M_2)
normalized: place_bound(P_electedPrimary_C_M_0,P_electedPrimary_C_M_1,P_electedPrimary_C_M_2)

-> the formula is 0

FORMULA NeoElection-COL-2-UpperBounds-11 0 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_poll__waitingMessage_C_M_0,P_poll__waitingMessage_C_M_1,P_poll__waitingMessage_C_M_2)
normalized: place_bound(P_poll__waitingMessage_C_M_0,P_poll__waitingMessage_C_M_1,P_poll__waitingMessage_C_M_2)

-> the formula is 0

FORMULA NeoElection-COL-2-UpperBounds-14 0 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_electionInit_C_M_0,P_electionInit_C_M_1,P_electionInit_C_M_2)
normalized: place_bound(P_electionInit_C_M_0,P_electionInit_C_M_1,P_electionInit_C_M_2)

-> the formula is 2

FORMULA NeoElection-COL-2-UpperBounds-15 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_startNeg__broadcasting_C_M_0_C_POS_1,P_startNeg__broadcasting_C_M_0_C_POS_2,P_startNeg__broadcasting_C_M_1_C_POS_1,P_startNeg__broadcasting_C_M_1_C_POS_2,P_startNeg__broadcasting_C_M_2_C_POS_1,P_startNeg__broadcasting_C_M_2_C_POS_2)
normalized: place_bound(P_startNeg__broadcasting_C_M_0_C_POS_1,P_startNeg__broadcasting_C_M_0_C_POS_2,P_startNeg__broadcasting_C_M_1_C_POS_1,P_startNeg__broadcasting_C_M_1_C_POS_2,P_startNeg__broadcasting_C_M_2_C_POS_1,P_startNeg__broadcasting_C_M_2_C_POS_2)

-> the formula is 2

FORMULA NeoElection-COL-2-UpperBounds-00 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_sendAnnPs__broadcasting_C_M_0_C_POS_1,P_sendAnnPs__broadcasting_C_M_0_C_POS_2,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)
normalized: place_bound(P_sendAnnPs__broadcasting_C_M_0_C_POS_1,P_sendAnnPs__broadcasting_C_M_0_C_POS_2,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)

-> the formula is 0

FORMULA NeoElection-COL-2-UpperBounds-09 0 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(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_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)
normalized: place_bound(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_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)

-> the formula is 0

FORMULA NeoElection-COL-2-UpperBounds-01 0 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_masterState_C_M_0_C_BOOL_F_C_M_0,P_masterState_C_M_0_C_BOOL_F_C_M_1,P_masterState_C_M_0_C_BOOL_F_C_M_2,P_masterState_C_M_0_C_BOOL_T_C_M_0,P_masterState_C_M_0_C_BOOL_T_C_M_1,P_masterState_C_M_0_C_BOOL_T_C_M_2,P_masterState_C_M_1_C_BOOL_F_C_M_0,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_1_C_BOOL_T_C_M_0,P_masterState_C_M_1_C_BOOL_T_C_M_1,P_masterState_C_M_1_C_BOOL_T_C_M_2,P_masterState_C_M_2_C_BOOL_F_C_M_0,P_masterState_C_M_2_C_BOOL_F_C_M_1,P_masterState_C_M_2_C_BOOL_F_C_M_2,P_masterState_C_M_2_C_BOOL_T_C_M_0,P_masterState_C_M_2_C_BOOL_T_C_M_1,P_masterState_C_M_2_C_BOOL_T_C_M_2)
normalized: place_bound(P_masterState_C_M_0_C_BOOL_F_C_M_0,P_masterState_C_M_0_C_BOOL_F_C_M_1,P_masterState_C_M_0_C_BOOL_F_C_M_2,P_masterState_C_M_0_C_BOOL_T_C_M_0,P_masterState_C_M_0_C_BOOL_T_C_M_1,P_masterState_C_M_0_C_BOOL_T_C_M_2,P_masterState_C_M_1_C_BOOL_F_C_M_0,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_1_C_BOOL_T_C_M_0,P_masterState_C_M_1_C_BOOL_T_C_M_1,P_masterState_C_M_1_C_BOOL_T_C_M_2,P_masterState_C_M_2_C_BOOL_F_C_M_0,P_masterState_C_M_2_C_BOOL_F_C_M_1,P_masterState_C_M_2_C_BOOL_F_C_M_2,P_masterState_C_M_2_C_BOOL_T_C_M_0,P_masterState_C_M_2_C_BOOL_T_C_M_1,P_masterState_C_M_2_C_BOOL_T_C_M_2)

-> the formula is 2

FORMULA NeoElection-COL-2-UpperBounds-04 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_negotiation_C_M_0_C_M_0_C_NEGSTEP_CO,P_negotiation_C_M_0_C_M_0_C_NEGSTEP_DONE,P_negotiation_C_M_0_C_M_0_C_NEGSTEP_NONE,P_negotiation_C_M_0_C_M_1_C_NEGSTEP_CO,P_negotiation_C_M_0_C_M_1_C_NEGSTEP_DONE,P_negotiation_C_M_0_C_M_1_C_NEGSTEP_NONE,P_negotiation_C_M_0_C_M_2_C_NEGSTEP_CO,P_negotiation_C_M_0_C_M_2_C_NEGSTEP_DONE,P_negotiation_C_M_0_C_M_2_C_NEGSTEP_NONE,P_negotiation_C_M_1_C_M_0_C_NEGSTEP_CO,P_negotiation_C_M_1_C_M_0_C_NEGSTEP_DONE,P_negotiation_C_M_1_C_M_0_C_NEGSTEP_NONE,P_negotiation_C_M_1_C_M_1_C_NEGSTEP_CO,P_negotiation_C_M_1_C_M_1_C_NEGSTEP_DONE,P_negotiation_C_M_1_C_M_1_C_NEGSTEP_NONE,P_negotiation_C_M_1_C_M_2_C_NEGSTEP_CO,P_negotiation_C_M_1_C_M_2_C_NEGSTEP_DONE,P_negotiation_C_M_1_C_M_2_C_NEGSTEP_NONE,P_negotiation_C_M_2_C_M_0_C_NEGSTEP_CO,P_negotiation_C_M_2_C_M_0_C_NEGSTEP_DONE,P_negotiation_C_M_2_C_M_0_C_NEGSTEP_NONE,P_negotiation_C_M_2_C_M_1_C_NEGSTEP_CO,P_negotiation_C_M_2_C_M_1_C_NEGSTEP_DONE,P_negotiation_C_M_2_C_M_1_C_NEGSTEP_NONE,P_negotiation_C_M_2_C_M_2_C_NEGSTEP_CO,P_negotiation_C_M_2_C_M_2_C_NEGSTEP_DONE,P_negotiation_C_M_2_C_M_2_C_NEGSTEP_NONE)
normalized: place_bound(P_negotiation_C_M_0_C_M_0_C_NEGSTEP_CO,P_negotiation_C_M_0_C_M_0_C_NEGSTEP_DONE,P_negotiation_C_M_0_C_M_0_C_NEGSTEP_NONE,P_negotiation_C_M_0_C_M_1_C_NEGSTEP_CO,P_negotiation_C_M_0_C_M_1_C_NEGSTEP_DONE,P_negotiation_C_M_0_C_M_1_C_NEGSTEP_NONE,P_negotiation_C_M_0_C_M_2_C_NEGSTEP_CO,P_negotiation_C_M_0_C_M_2_C_NEGSTEP_DONE,P_negotiation_C_M_0_C_M_2_C_NEGSTEP_NONE,P_negotiation_C_M_1_C_M_0_C_NEGSTEP_CO,P_negotiation_C_M_1_C_M_0_C_NEGSTEP_DONE,P_negotiation_C_M_1_C_M_0_C_NEGSTEP_NONE,P_negotiation_C_M_1_C_M_1_C_NEGSTEP_CO,P_negotiation_C_M_1_C_M_1_C_NEGSTEP_DONE,P_negotiation_C_M_1_C_M_1_C_NEGSTEP_NONE,P_negotiation_C_M_1_C_M_2_C_NEGSTEP_CO,P_negotiation_C_M_1_C_M_2_C_NEGSTEP_DONE,P_negotiation_C_M_1_C_M_2_C_NEGSTEP_NONE,P_negotiation_C_M_2_C_M_0_C_NEGSTEP_CO,P_negotiation_C_M_2_C_M_0_C_NEGSTEP_DONE,P_negotiation_C_M_2_C_M_0_C_NEGSTEP_NONE,P_negotiation_C_M_2_C_M_1_C_NEGSTEP_CO,P_negotiation_C_M_2_C_M_1_C_NEGSTEP_DONE,P_negotiation_C_M_2_C_M_1_C_NEGSTEP_NONE,P_negotiation_C_M_2_C_M_2_C_NEGSTEP_CO,P_negotiation_C_M_2_C_M_2_C_NEGSTEP_DONE,P_negotiation_C_M_2_C_M_2_C_NEGSTEP_NONE)

-> the formula is 4

FORMULA NeoElection-COL-2-UpperBounds-08 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_network_C_M_0_C_M_0_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_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_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_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_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_network_C_M_0_C_M_1_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_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_network_C_M_0_C_M_2_C_MT_AI_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_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_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_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_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_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_1_C_M_2_C_MT_AI_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_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_AskP_C_M_0,P_network_C_M_1_C_M_2_C_MT_RI_C_M_0,P_network_C_M_1_C_M_2_C_MT_RP_C_M_0,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_AI_C_M_0,P_network_C_M_2_C_M_1_C_MT_AnnP_C_M_0,P_network_C_M_2_C_M_1_C_MT_AnsP_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_AskP_C_M_0,P_network_C_M_2_C_M_1_C_MT_RI_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_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_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)
normalized: place_bound(P_network_C_M_0_C_M_0_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_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_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_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_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_network_C_M_0_C_M_1_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_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_network_C_M_0_C_M_2_C_MT_AI_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_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_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_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_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_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_1_C_M_2_C_MT_AI_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_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_AskP_C_M_0,P_network_C_M_1_C_M_2_C_MT_RI_C_M_0,P_network_C_M_1_C_M_2_C_MT_RP_C_M_0,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_AI_C_M_0,P_network_C_M_2_C_M_1_C_MT_AnnP_C_M_0,P_network_C_M_2_C_M_1_C_MT_AnsP_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_AskP_C_M_0,P_network_C_M_2_C_M_1_C_MT_RI_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_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_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)

-> the formula is 2

FORMULA NeoElection-COL-2-UpperBounds-05 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 20406 (2.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 20885 122077 142962
used/not used/entry size/cache size: 121100 66987764 16 1024MB
basic ops cache: hits/miss/sum: 16 18965 18981
used/not used/entry size/cache size: 56454 16720762 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 72 484 556
used/not used/entry size/cache size: 484 8388124 32 256MB
max state cache: hits/miss/sum: 936 6292 7228
used/not used/entry size/cache size: 484 8388124 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67088755
1 20098
2 11
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.205sec


BK_STOP 1678693073469

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
P_electionInit_C_M_0
P_electedSecondary_C_M_2
P_electedSecondary_C_M_1
P_electedSecondary_C_M_0
P_electedPrimary_C_M_2
P_electedPrimary_C_M_1
P_electedPrimary_C_M_0
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_masterList_C_M_1_C_POS_1_C_M_0
P_masterList_C_M_0_C_POS_2_C_M_2
P_masterList_C_M_0_C_POS_2_C_M_1
P_masterList_C_M_2_C_POS_1_C_M_0
P_masterList_C_M_0_C_POS_1_C_M_0
P_masterList_C_M_0_C_POS_2_C_M_0
P_masterList_C_M_0_C_POS_1_C_M_2
P_masterList_C_M_0_C_POS_1_C_M_1
P_negotiation_C_M_1_C_M_0_C_NEGSTEP_NONE
P_masterList_C_M_1_C_POS_2_C_M_2
P_network_C_M_2_C_M_1_C_MT_AnnP_C_M_0
P_masterState_C_M_2_C_BOOL_F_C_M_2
P_masterState_C_M_1_C_BOOL_F_C_M_1
P_masterState_C_M_1_C_BOOL_F_C_M_2
P_negotiation_C_M_0_C_M_0_C_NEGSTEP_CO
P_negotiation_C_M_0_C_M_2_C_NEGSTEP_CO
P_masterState_C_M_2_C_BOOL_T_C_M_2
P_masterState_C_M_2_C_BOOL_F_C_M_1
P_negotiation_C_M_0_C_M_2_C_NEGSTEP_DONE
P_negotiation_C_M_0_C_M_1_C_NEGSTEP_NONE
P_negotiation_C_M_0_C_M_0_C_NEGSTEP_DONE
P_negotiation_C_M_0_C_M_1_C_NEGSTEP_CO
P_negotiation_C_M_2_C_M_0_C_NEGSTEP_NONE
P_negotiation_C_M_1_C_M_1_C_NEGSTEP_NONE
P_negotiation_C_M_2_C_M_0_C_NEGSTEP_CO
P_negotiation_C_M_2_C_M_0_C_NEGSTEP_DONE
P_negotiation_C_M_2_C_M_2_C_NEGSTEP_CO
P_negotiation_C_M_2_C_M_2_C_NEGSTEP_NONE
P_negotiation_C_M_1_C_M_1_C_NEGSTEP_CO
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_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_network_C_M_0_C_M_0_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_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_network_C_M_0_C_M_0_C_MT_AskP_C_M_0
P_negotiation_C_M_0_C_M_0_C_NEGSTEP_NONE
P_negotiation_C_M_0_C_M_1_C_NEGSTEP_DONE
P_negotiation_C_M_1_C_M_0_C_NEGSTEP_CO
P_negotiation_C_M_1_C_M_0_C_NEGSTEP_DONE
P_negotiation_C_M_0_C_M_2_C_NEGSTEP_NONE
P_masterState_C_M_2_C_BOOL_T_C_M_1
P_masterState_C_M_2_C_BOOL_F_C_M_0
P_masterState_C_M_1_C_BOOL_T_C_M_1
P_masterState_C_M_1_C_BOOL_T_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_T_C_M_0
P_masterState_C_M_0_C_BOOL_F_C_M_2
P_masterState_C_M_0_C_BOOL_F_C_M_1
P_masterState_C_M_0_C_BOOL_F_C_M_0
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_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_RP_C_M_0
P_network_C_M_2_C_M_2_C_MT_AI_C_M_0
P_network_C_M_0_C_M_0_C_MT_RI_C_M_0
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_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_network_C_M_0_C_M_1_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_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_network_C_M_0_C_M_2_C_MT_AI_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_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_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_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_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_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_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
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_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_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_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

The net has transition(s) that can never fire:
T_poll__end_0
T_poll__handleAI1_0_0_0
T_poll__handleAI1_0_1_0
T_poll__handleAI1_1_1_1
T_poll__handleAI1_0_2_0
T_poll__handleAI1_1_0_0
T_poll__handleAI1_1_0_1
T_poll__handleAI1_1_1_0
T_poll__handleAI1_2_1_2
T_poll__handleAI1_2_2_0
T_poll__handleAI1_1_2_0
T_poll__handleAI1_1_2_1
T_poll__handleAI1_2_0_0
T_poll__handleAI1_2_0_1
T_poll__handleAI1_2_0_2
T_poll__handleAI2_0_0_0_1_2
T_poll__handleAI1_2_1_0
T_poll__handleAI2_0_0_2_0_2
T_poll__handleAI1_2_2_1
T_poll__handleAI2_0_0_1_2_1
T_poll__handleAI1_2_2_2
T_poll__handleAI2_0_0_0_0_1
T_poll__handleAI2_0_0_0_0_2
T_poll__handleAI2_0_0_0_1_1
T_poll__handleAI2_0_0_0_2_1
T_poll__handleAI2_0_0_0_2_2
T_poll__handleAI2_0_0_1_0_1
T_poll__handleAI2_0_0_1_0_2
T_poll__handleAI2_0_0_1_1_1
T_poll__handleAI2_0_0_1_1_2
T_poll__handleAI2_1_0_0_2_1
T_poll__handleAI2_1_0_0_2_2
T_poll__handleAI2_0_0_1_2_2
T_poll__handleAI2_1_0_2_2_2
T_poll__handleAI2_0_0_2_0_1
T_poll__handleAnsP2_0_0_1_1
T_poll__handleAI2_1_1_0_0_2
T_poll__handleAI2_0_0_2_1_1
T_poll__handleAI2_0_0_2_1_2
T_poll__handleAI2_0_0_2_2_1
T_poll__handleAI2_0_0_2_2_2
T_poll__handleAI2_0_1_0_0_2
T_poll__handleAI2_0_1_0_1_2
T_poll__handleAI2_1_1_2_1_2
T_poll__handleAI2_0_1_1_0_2
T_poll__handleAI2_0_1_1_1_2
T_poll__handleAI2_0_1_1_2_2
T_poll__handleAI2_0_1_2_0_2
T_poll__handleAI2_0_1_2_1_2
T_poll__handleAI2_0_1_2_2_2
T_poll__handleAI2_1_0_0_0_1
T_poll__handleAI2_1_0_0_0_2
T_poll__handleAI2_1_0_0_1_1
T_poll__handleAI2_1_0_0_1_2
T_poll__handleAnnP1_1_2_0_0
T_poll__handleAI2_1_0_1_0_1
T_poll__handleAI2_1_0_1_0_2
T_poll__handleAI2_1_0_1_1_1
T_poll__handleAI2_1_0_1_1_2
T_poll__handleAI2_1_0_1_2_1
T_poll__handleAI2_1_0_1_2_2
T_poll__handleAI2_1_0_2_0_1
T_poll__handleAI2_1_0_2_0_2
T_poll__handleAnsP2_1_0_2_1
T_poll__handleAnsP2_1_0_2_0
T_poll__handleAI2_1_0_2_1_1
T_poll__handleAI2_1_0_2_1_2
T_poll__handleAI2_1_0_2_2_1
T_poll__handleAskP_0_2_0_2
T_poll__handleAnsP2_0_0_1_2
T_poll__handleAnsP2_0_0_2_0
T_poll__handleAI2_1_1_0_1_2
T_poll__handleAI2_1_1_1_0_2
T_poll__handleAI2_1_1_1_1_2
T_poll__handleAI2_1_1_1_2_2
T_poll__handleAI2_1_1_2_0_2
T_poll__handleAnsP2_1_2_1_0
T_poll__handleAnsP2_1_2_1_1
T_poll__handleAI2_1_1_2_2_2
T_poll__handleAnnP1_0_0_1_0
T_poll__handleAnnP1_0_0_1_1
T_poll__handleAnnP1_0_0_1_2
T_poll__handleAnnP1_0_0_2_0
T_poll__handleAnnP1_0_0_2_1
T_poll__handleAnnP1_0_0_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_2_0
T_poll__handleAnnP1_0_1_2_1
T_poll__handleAnnP1_0_1_2_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_1_0
T_poll__handleAnnP1_1_0_1_1
T_poll__handleAnnP1_1_0_1_2
T_poll__handleAnnP1_1_0_2_0
T_poll__handleAnnP1_1_0_2_1
T_poll__handleAnnP1_1_0_2_2
T_poll__handleAnnP1_1_1_0_0
T_poll__handleAnnP1_1_1_0_1
T_poll__handleAnnP1_1_1_0_2
T_poll__handleAnnP1_1_1_2_0
T_poll__handleAnnP1_1_1_2_1
T_poll__handleAnsP3_1_2_1_2_1
T_poll__handleAnsP3_1_2_1_2_0
T_poll__handleAnnP1_1_1_2_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_1_2_0_1
T_poll__handleAnnP1_1_2_0_2
T_poll__handleAnnP1_1_2_1_0
T_poll__handleAnnP1_1_2_1_1
T_poll__handleAnnP1_1_2_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_1_2
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__handleAnsP2_0_0_1_0
T_poll__handleAskP_0_2_1_2
T_poll__handleAskP_0_2_2_0
T_poll__handleAskP_0_2_2_1
T_poll__handleAnsP2_0_0_2_1
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__handleAnsP2_1_0_1_0
T_poll__handleAnsP2_1_0_1_1
T_poll__handleAskP_0_2_1_1
T_poll__handleAskP_0_2_1_0
T_poll__handleAnsP2_1_0_1_2
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_sendAnnPs__send_0_2_2
T_sendAnnPs__send_1_0_0
T_sendAnnPs__send_1_0_1
T_poll__handleAnsP2_1_2_1_2
T_poll__handleAnsP2_1_2_2_0
T_poll__handleAnsP2_1_2_2_1
T_poll__handleAnsP2_1_2_2_2
T_poll__handleAnsP3_0_0_1_2_0
T_poll__handleAnsP3_0_0_1_2_1
T_poll__handleAnsP3_0_0_1_2_2
T_poll__handleAnsP3_0_0_2_1_0
T_poll__handleAnsP3_0_0_2_1_1
T_poll__handleAnsP3_0_0_2_1_2
T_poll__handleAnsP3_0_1_1_2_0
T_poll__handleAnsP3_0_1_1_2_1
T_poll__handleAnsP3_0_1_1_2_2
T_poll__handleAnsP3_0_1_2_1_0
T_poll__handleAnsP3_0_1_2_1_1
T_poll__handleAnsP3_0_1_2_1_2
T_poll__handleAnsP3_0_2_1_2_0
T_poll__handleAnsP3_0_2_1_2_1
T_poll__handleAnsP3_0_2_1_2_2
T_poll__handleAnsP3_0_2_2_1_0
T_poll__handleAnsP3_0_2_2_1_1
T_poll__handleAnsP3_0_2_2_1_2
T_poll__handleAnsP3_1_0_1_2_0
T_poll__handleAnsP3_1_0_1_2_1
T_poll__handleAnsP3_1_0_1_2_2
T_poll__handleAnsP3_1_0_2_1_0
T_poll__handleAnsP3_1_0_2_1_1
T_poll__handleAnsP3_1_0_2_1_2
T_poll__handleAnsP3_1_1_1_2_0
T_poll__handleAnsP3_1_1_1_2_1
T_poll__handleAnsP3_1_1_1_2_2
T_poll__handleAnsP3_1_1_2_1_0
T_poll__handleAnsP3_1_1_2_1_1
T_poll__handleAnsP3_1_1_2_1_2
T_poll__handleAnsP3_1_2_1_2_2
T_poll__handleAnsP3_1_2_2_1_0
T_poll__handleAnsP3_1_2_2_1_1
T_poll__handleAnsP3_1_2_2_1_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_1_1_2
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_0_2_2_2
T_poll__handleAskP_1_0_0_0
T_poll__handleAskP_1_0_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_0
T_poll__iAmSecondary_1_1
T_poll__iAmSecondary_1_2
T_poll__iAmSecondary_2_0
T_poll__iAmSecondary_2_1
T_poll__iAmSecondary_2_2
T_poll__start_0
T_sendAnnPs__end_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_sendAnnPs__send_0_2_1
T_sendAnnPs__send_1_0_2
T_sendAnnPs__send_1_1_0
T_sendAnnPs__send_1_1_1
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_sendAnnPs__start_1
T_sendAnnPs__start_2
T_startNeg__end_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 for constant places
P_masterList_C_M_0_C_POS_1_C_M_0
P_masterList_C_M_0_C_POS_1_C_M_1
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_masterList_C_M_0_C_POS_2_C_M_2
P_masterList_C_M_1_C_POS_1_C_M_0
P_masterList_C_M_1_C_POS_1_C_M_1
P_masterList_C_M_1_C_POS_1_C_M_2
P_masterList_C_M_1_C_POS_2_C_M_0
P_masterList_C_M_1_C_POS_2_C_M_1
P_masterList_C_M_1_C_POS_2_C_M_2
P_masterList_C_M_2_C_POS_1_C_M_0
P_masterList_C_M_2_C_POS_1_C_M_1
P_masterList_C_M_2_C_POS_1_C_M_2
P_masterList_C_M_2_C_POS_2_C_M_0
P_masterList_C_M_2_C_POS_2_C_M_1
P_masterList_C_M_2_C_POS_2_C_M_2
found 18 constant places
error, while parsing formula #2
mcc_parse.icc:773: Exception: error while creating MCC formula: 'P_electionFailed' is no valid id!
error, while parsing formula #12
mcc_parse.icc:773: Exception: error while creating MCC formula: 'P_crashed' is no valid id!
error, while parsing formula #13
mcc_parse.icc:773: Exception: error while creating MCC formula: 'P_dead' is no valid id!
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


iterations count:697 (1), effective:49 (0)

initing FirstDep: 0m 0.000sec

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="NeoElection-COL-2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is NeoElection-COL-2, 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 r257-smll-167863532300117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-2.tgz
mv NeoElection-COL-2 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;