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)
...............................................................
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 320K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is NeoElection-PT-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472500292
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527140289090


BK_STOP 1527140332669

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using NeoElection-PT-2 as instance name.
Using NeoElection as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 181, 'Memory': 110.7, 'Tool': 'lola'}, {'Time': 285, 'Memory': 109.87, 'Tool': 'lola'}, {'Time': 2658, 'Memory': 2209.21, 'Tool': 'marcie'}, {'Time': 2658, 'Memory': 2209.32, 'Tool': 'marcie'}, {'Time': 3603, 'Memory': 338.09, 'Tool': 'itstools'}, {'Time': 3932, 'Memory': 306.14, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 19.906077348066297x far from the best tool lola.
ReachabilityCardinality lola NeoElection-PT-2...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
NeoElection-PT-2: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
NeoElection-PT-2: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ NeoElection-PT-2 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 795/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 438 places, 357 transitions, 153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 213 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-2-ReachabilityCardinality.task
lola: A (G ((((P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + 1 <= P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2) AND (P-polling_0 + P-polling_1 + P-polling_2 + 1 <= P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_2_2_AI_2 + P-poll__networl_2_2_AI_1 + P-poll__networl_2_2_AI_0 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_2 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl_0_0_RP_2 + P-poll__networl_2_1_AskP_0 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_2 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_0 + P-poll__networl_1_2_RI_0 + P-poll__networl_1_2_RI_1 + P-poll__networl_1_2_RI_2 + P-poll__networl_1_1_AI_2 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_0 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_1_1_RP_0 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_2 + P-poll__networl_0_1_AnnP_0 + P-poll__networl_0_1_AnnP_1 + P-poll__networl_0_1_AnnP_2 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_0_2_AnnP_0 + P-poll__networl_2_1_RP_2 + P-poll__networl_2_1_RP_1 + P-poll__networl_2_1_RP_0 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_2_RP_1 + P-poll__networl_0_2_RP_0 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_0_1_AnsP_0 + P-poll__networl_1_2_AI_0 + P-poll__networl_1_2_AI_1 + P-poll__networl_1_2_AI_2 + P-poll__networl_2_2_RI_2 + P-poll__networl_2_2_RI_1 + P-poll__networl_2_2_RI_0 + P-poll__networl_0_2_AskP_0 + P-poll__networl_0_2_AskP_1 + P-poll__networl_0_2_AskP_2 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_2_AskP_2 + P-poll__networl_2_2_AskP_1 + P-poll__networl_2_2_AskP_0 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_0 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_2_2_AnnP_0 + P-poll__networl_2_2_AnnP_1 + P-poll__networl_2_2_AnnP_2 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_0_2_RI_0 + P-poll__networl_0_2_RI_1 + P-poll__networl_0_2_RI_2 + P-poll__networl_2_1_RI_0 + P-poll__networl_2_1_RI_1 + P-poll__networl_2_1_RI_2 + P-poll__networl_2_2_AnsP_0 + P-poll__networl_1_1_RI_2 + P-poll__networl_1_1_RI_1 + P-poll__networl_1_1_RI_0 + P-poll__networl_0_1_RP_0 + P-poll__networl_0_1_RP_1 + P-poll__networl_0_1_RP_2 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_2 + P-poll__networl_1_0_AI_0 + P-poll__networl_1_0_AI_1 + P-poll__networl_1_0_AI_2 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_2_1_AnnP_0 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_0_0_RI_2 + P-poll__networl_0_1_AskP_0 + P-poll__networl_0_1_AskP_1 + P-poll__networl_0_1_AskP_2 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_0 + P-poll__networl_1_2_AnnP_0 + P-poll__networl_1_2_AnnP_1 + P-poll__networl_1_2_AnnP_2 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2)) OR (P-dead_2 + P-dead_1 + P-dead_0 <= P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2)))) : A (G (((3 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2) AND (P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 <= P-polling_0 + P-polling_1 + P-polling_2) AND (P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 <= P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM) AND ((P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2 + 1 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0) OR (P-polling_0 + P-polling_1 + P-polling_2 <= 2))))) : E (F (((3 <= P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_1_CO + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_1_1_DONE + P-negotiation_1_1_CO + P-negotiation_2_2_DONE + P-negotiation_0_0_NONE + P-negotiation_1_1_NONE + P-negotiation_2_2_CO + P-negotiation_1_2_NONE + P-negotiation_2_0_CO + P-negotiation_1_0_DONE + P-negotiation_0_1_CO + P-negotiation_0_2_DONE + P-negotiation_2_1_DONE) AND (1 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2) AND (P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2) AND (P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2)))) : A (G ((((1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2) AND (P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_2_2_AI_2 + P-poll__networl_2_2_AI_1 + P-poll__networl_2_2_AI_0 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_2 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl_0_0_RP_2 + P-poll__networl_2_1_AskP_0 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_2 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_0 + P-poll__networl_1_2_RI_0 + P-poll__networl_1_2_RI_1 + P-poll__networl_1_2_RI_2 + P-poll__networl_1_1_AI_2 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_0 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_1_1_RP_0 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_2 + P-poll__networl_0_1_AnnP_0 + P-poll__networl_0_1_AnnP_1 + P-poll__networl_0_1_AnnP_2 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_0_2_AnnP_0 + P-poll__networl_2_1_RP_2 + P-poll__networl_2_1_RP_1 + P-poll__networl_2_1_RP_0 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_2_RP_1 + P-poll__networl_0_2_RP_0 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_0_1_AnsP_0 + P-poll__networl_1_2_AI_0 + P-poll__networl_1_2_AI_1 + P-poll__networl_1_2_AI_2 + P-poll__networl_2_2_RI_2 + P-poll__networl_2_2_RI_1 + P-poll__networl_2_2_RI_0 + P-poll__networl_0_2_AskP_0 + P-poll__networl_0_2_AskP_1 + P-poll__networl_0_2_AskP_2 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_2_AskP_2 + P-poll__networl_2_2_AskP_1 + P-poll__networl_2_2_AskP_0 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_0 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_2_2_AnnP_0 + P-poll__networl_2_2_AnnP_1 + P-poll__networl_2_2_AnnP_2 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_0_2_RI_0 + P-poll__networl_0_2_RI_1 + P-poll__networl_0_2_RI_2 + P-poll__networl_2_1_RI_0 + P-poll__networl_2_1_RI_1 + P-poll__networl_2_1_RI_2 + P-poll__networl_2_2_AnsP_0 + P-poll__networl_1_1_RI_2 + P-poll__networl_1_1_RI_1 + P-poll__networl_1_1_RI_0 + P-poll__networl_0_1_RP_0 + P-poll__networl_0_1_RP_1 + P-poll__networl_0_1_RP_2 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_2 + P-poll__networl_1_0_AI_0 + P-poll__networl_1_0_AI_1 + P-poll__networl_1_0_AI_2 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_2_1_AnnP_0 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_0_0_RI_2 + P-poll__networl_0_1_AskP_0 + P-poll__networl_0_1_AskP_1 + P-poll__networl_0_1_AskP_2 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_0 + P-poll__networl_1_2_AnnP_0 + P-poll__networl_1_2_AnnP_1 + P-poll__networl_1_2_AnnP_2 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2 <= P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2) AND (P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_1_AI_0 + P-network_0_0_AnnP_0 + P-network_0_2_AI_0 + P-network_0_2_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_1_0_AI_0 + P-network_2_1_RP_0 + P-network_2_0_RP_0 + P-network_1_1_AI_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_2_0_AnsP_2 + P-network_2_0_AnsP_1 + P-network_2_0_AnsP_0 + P-network_2_1_RI_0 + P-network_0_2_RI_0 + P-network_1_2_AskP_0 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_1_1_AnsP_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_2_0_AnnP_0 + P-network_1_0_RI_0 + P-network_2_2_AI_0 + P-network_0_1_AskP_0 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_1_1_AnnP_0 + P-network_0_0_AskP_0 + P-network_1_2_AI_0 + P-network_2_2_RP_0 + P-network_0_2_AnnP_0 + P-network_1_2_AnnP_0 + P-network_1_0_AskP_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_2_2_AskP_0 + P-network_0_1_RI_0 + P-network_1_1_RP_0 + P-network_2_0_RI_0 + P-network_2_1_AnsP_2 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_1_2_RI_0 + P-network_2_1_AnnP_0 + P-network_1_2_AnsP_0 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_2 + P-network_0_0_RP_0 + P-network_0_0_RP_1 + P-network_0_0_RP_2 + P-network_2_1_AnnP_2 + P-network_2_1_AnnP_1 + P-network_1_2_RI_1 + P-network_1_2_RI_2 + P-network_2_0_RI_2 + P-network_2_0_RI_1 + P-network_0_1_RI_2 + P-network_0_1_RI_1 + P-network_1_1_RP_1 + P-network_1_1_RP_2 + P-network_2_2_AskP_1 + P-network_2_2_AskP_2 + P-network_1_0_AskP_2 + P-network_0_1_AI_1 + P-network_0_1_AI_2 + P-network_1_0_AskP_1 + P-network_2_0_AI_1 + P-network_2_0_AI_2 + P-network_1_2_AnnP_2 + P-network_1_2_AnnP_1 + P-network_0_2_AnnP_1 + P-network_0_2_AnnP_2 + P-network_2_2_RP_1 + P-network_2_2_RP_2 + P-network_1_2_AI_1 + P-network_1_2_AI_2 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_1_1_AnnP_1 + P-network_1_1_AnnP_2 + P-network_0_1_AskP_2 + P-network_0_1_AskP_1 + P-network_2_2_AI_2 + P-network_2_2_AI_1 + P-network_1_0_RI_1 + P-network_1_0_RI_2 + P-network_2_0_AnnP_1 + P-network_2_0_AnnP_2 + P-network_1_2_AskP_1 + P-network_1_2_AskP_2 + P-network_0_2_RI_1 + P-network_0_2_RI_2 + P-network_2_1_RI_1 + P-network_2_1_RI_2 + P-network_1_1_AI_2 + P-network_0_1_RP_1 + P-network_0_1_RP_2 + P-network_1_1_AI_1 + P-network_2_1_AskP_1 + P-network_2_1_AskP_2 + P-network_2_0_RP_1 + P-network_2_0_RP_2 + P-network_2_1_RP_2 + P-network_2_1_RP_1 + P-network_1_0_AI_1 + P-network_1_0_AI_2 + P-network_0_1_AnnP_1 + P-network_0_1_AnnP_2 + P-network_0_2_RP_2 + P-network_1_2_RP_1 + P-network_1_2_RP_2 + P-network_0_2_RP_1 + P-network_0_0_AnnP_2 + P-network_0_0_AnnP_1 + P-network_0_2_AI_1 + P-network_0_2_AI_2 + P-network_2_1_AI_1 + P-network_2_1_AI_2 + P-network_2_2_RI_2 + P-network_1_0_AnnP_1 + P-network_1_0_AnnP_2 + P-network_2_2_RI_1 + P-network_0_0_AI_2 + P-network_0_0_AI_1 + P-network_0_2_AskP_1 + P-network_0_2_AskP_2 + P-network_1_0_RP_2 + P-network_1_0_RP_1 + P-network_0_0_RI_1 + P-network_0_0_RI_2 + P-network_2_0_AskP_2 + P-network_2_0_AskP_1 + P-network_2_2_AnnP_2 + P-network_1_1_AskP_1 + P-network_1_1_AskP_2 + P-network_2_2_AnnP_1 + P-network_1_1_RI_1 + P-network_1_1_RI_2 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2) AND (P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-startNeg__broadcasting_2_1 +
P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2)) OR ((P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2 + 1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2) AND (P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2 <= P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_2_2_AI_2 + P-poll__networl_2_2_AI_1 + P-poll__networl_2_2_AI_0 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_2 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl_0_0_RP_2 + P-poll__networl_2_1_AskP_0 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_2 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_0 + P-poll__networl_1_2_RI_0 + P-poll__networl_1_2_RI_1 + P-poll__networl_1_2_RI_2 + P-poll__networl_1_1_AI_2 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_0 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_1_1_RP_0 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_2 + P-poll__networl_0_1_AnnP_0 + P-poll__networl_0_1_AnnP_1 + P-poll__networl_0_1_AnnP_2 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_0_2_AnnP_0 + P-poll__networl_2_1_RP_2 + P-poll__networl_2_1_RP_1 + P-poll__networl_2_1_RP_0 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_2_RP_1 + P-poll__networl_0_2_RP_0 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_0_1_AnsP_0 + P-poll__networl_1_2_AI_0 + P-poll__networl_1_2_AI_1 + P-poll__networl_1_2_AI_2 + P-poll__networl_2_2_RI_2 + P-poll__networl_2_2_RI_1 + P-poll__networl_2_2_RI_0 + P-poll__networl_0_2_AskP_0 + P-poll__networl_0_2_AskP_1 + P-poll__networl_0_2_AskP_2 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_2_AskP_2 + P-poll__networl_2_2_AskP_1 + P-poll__networl_2_2_AskP_0 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_0 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_2_2_AnnP_0 + P-poll__networl_2_2_AnnP_1 + P-poll__networl_2_2_AnnP_2 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_0_2_RI_0 + P-poll__networl_0_2_RI_1 + P-poll__networl_0_2_RI_2 + P-poll__networl_2_1_RI_0 + P-poll__networl_2_1_RI_1 + P-poll__networl_2_1_RI_2 + P-poll__networl_2_2_AnsP_0 + P-poll__networl_1_1_RI_2 + P-poll__networl_1_1_RI_1 + P-poll__networl_1_1_RI_0 + P-poll__networl_0_1_RP_0 + P-poll__networl_0_1_RP_1 + P-poll__networl_0_1_RP_2 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_2 + P-poll__networl_1_0_AI_0 + P-poll__networl_1_0_AI_1 + P-poll__networl_1_0_AI_2 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_2_1_AnnP_0 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_0_0_RI_2 + P-poll__networl_0_1_AskP_0 + P-poll__networl_0_1_AskP_1 + P-poll__networl_0_1_AskP_2 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_0 + P-poll__networl_1_2_AnnP_0 + P-poll__networl_1_2_AnnP_1 + P-poll__networl_1_2_AnnP_2 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2))))) : E (F (((P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= 0) OR (1 <= P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_1_AI_0 + P-network_0_0_AnnP_0 + P-network_0_2_AI_0 + P-network_0_2_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_1_0_AI_0 + P-network_2_1_RP_0 + P-network_2_0_RP_0 + P-network_1_1_AI_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_2_0_AnsP_2 + P-network_2_0_AnsP_1 + P-network_2_0_AnsP_0 + P-network_2_1_RI_0 + P-network_0_2_RI_0 + P-network_1_2_AskP_0 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_1_1_AnsP_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_2_0_AnnP_0 + P-network_1_0_RI_0 + P-network_2_2_AI_0 + P-network_0_1_AskP_0 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_1_1_AnnP_0 + P-network_0_0_AskP_0 + P-network_1_2_AI_0 + P-network_2_2_RP_0 + P-network_0_2_AnnP_0 + P-network_1_2_AnnP_0 + P-network_1_0_AskP_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_2_2_AskP_0 + P-network_0_1_RI_0 + P-network_1_1_RP_0 + P-network_2_0_RI_0 + P-network_2_1_AnsP_2 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_1_2_RI_0 + P-network_2_1_AnnP_0 + P-network_1_2_AnsP_0 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_2 + P-network_0_0_RP_0 + P-network_0_0_RP_1 + P-network_0_0_RP_2 + P-network_2_1_AnnP_2 + P-network_2_1_AnnP_1 + P-network_1_2_RI_1 + P-network_1_2_RI_2 + P-network_2_0_RI_2 + P-network_2_0_RI_1 + P-network_0_1_RI_2 + P-network_0_1_RI_1 + P-network_1_1_RP_1 + P-network_1_1_RP_2 + P-network_2_2_AskP_1 + P-network_2_2_AskP_2 + P-network_1_0_AskP_2 + P-network_0_1_AI_1 + P-network_0_1_AI_2 + P-network_1_0_AskP_1 + P-network_2_0_AI_1 + P-network_2_0_AI_2 + P-network_1_2_AnnP_2 + P-network_1_2_AnnP_1 + P-network_0_2_AnnP_1 + P-network_0_2_AnnP_2 + P-network_2_2_RP_1 + P-network_2_2_RP_2 + P-network_1_2_AI_1 + P-network_1_2_AI_2 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_1_1_AnnP_1 + P-network_1_1_AnnP_2 + P-network_0_1_AskP_2 + P-network_0_1_AskP_1 + P-network_2_2_AI_2 + P-network_2_2_AI_1 + P-network_1_0_RI_1 + P-network_1_0_RI_2 + P-network_2_0_AnnP_1 + P-network_2_0_AnnP_2 + P-network_1_2_AskP_1 + P-network_1_2_AskP_2 + P-network_0_2_RI_1 + P-network_0_2_RI_2 + P-network_2_1_RI_1 + P-network_2_1_RI_2 + P-network_1_1_AI_2 + P-network_0_1_RP_1 + P-network_0_1_RP_2 + P-network_1_1_AI_1 + P-network_2_1_AskP_1 + P-network_2_1_AskP_2 + P-network_2_0_RP_1 + P-network_2_0_RP_2 + P-network_2_1_RP_2 + P-network_2_1_RP_1 + P-network_1_0_AI_1 + P-network_1_0_AI_2 + P-network_0_1_AnnP_1 + P-network_0_1_AnnP_2 + P-network_0_2_RP_2 + P-network_1_2_RP_1 + P-network_1_2_RP_2 + P-network_0_2_RP_1 + P-network_0_0_AnnP_2 + P-network_0_0_AnnP_1 + P-network_0_2_AI_1 + P-network_0_2_AI_2 + P-network_2_1_AI_1 + P-network_2_1_AI_2 + P-network_2_2_RI_2 + P-network_1_0_AnnP_1 + P-network_1_0_AnnP_2 + P-network_2_2_RI_1 + P-network_0_0_AI_2 + P-network_0_0_AI_1 + P-network_0_2_AskP_1 + P-network_0_2_AskP_2 + P-network_1_0_RP_2 + P-network_1_0_RP_1 + P-network_0_0_RI_1 + P-network_0_0_RI_2 + P-network_2_0_AskP_2 + P-network_2_0_AskP_1 + P-network_2_2_AnnP_2 + P-network_1_1_AskP_1 + P-network_1_1_AskP_2 + P-network_2_2_AnnP_1 + P-network_1_1_RI_1 + P-network_1_1_RI_2)))) : E (F ((((P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0) AND (2 <= P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2)) OR ((1 <= P-polling_0 + P-polling_1 + P-polling_2) AND (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2)) OR (P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_1_AI_0 + P-network_0_0_AnnP_0 + P-network_0_2_AI_0 + P-network_0_2_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_1_0_AI_0 + P-network_2_1_RP_0 + P-network_2_0_RP_0 + P-network_1_1_AI_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_2_0_AnsP_2 + P-network_2_0_AnsP_1 + P-network_2_0_AnsP_0 + P-network_2_1_RI_0 + P-network_0_2_RI_0 + P-network_1_2_AskP_0 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_1_1_AnsP_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_2_0_AnnP_0 + P-network_1_0_RI_0 + P-network_2_2_AI_0 + P-network_0_1_AskP_0 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_1_1_AnnP_0 + P-network_0_0_AskP_0 + P-network_1_2_AI_0 + P-network_2_2_RP_0 + P-network_0_2_AnnP_0 + P-network_1_2_AnnP_0 + P-network_1_0_AskP_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_2_2_AskP_0 + P-network_0_1_RI_0 + P-network_1_1_RP_0 + P-network_2_0_RI_0 + P-network_2_1_AnsP_2 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_1_2_RI_0 + P-network_2_1_AnnP_0 + P-network_1_2_AnsP_0 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_2 + P-network_0_0_RP_0 + P-network_0_0_RP_1 + P-network_0_0_RP_2 + P-network_2_1_AnnP_2 + P-network_2_1_AnnP_1 + P-network_1_2_RI_1 + P-network_1_2_RI_2 + P-network_2_0_RI_2 + P-network_2_0_RI_1 + P-network_0_1_RI_2 + P-network_0_1_RI_1 + P-network_1_1_RP_1 + P-network_1_1_RP_2 + P-network_2_2_AskP_1 + P-network_2_2_AskP_2 + P-network_1_0_AskP_2 + P-network_0_1_AI_1 + P-network_0_1_AI_2 + P-network_1_0_AskP_1 + P-network_2_0_AI_1 + P-network_2_0_AI_2 + P-network_1_2_AnnP_2 + P-network_1_2_AnnP_1 + P-network_0_2_AnnP_1 + P-network_0_2_AnnP_2 + P-network_2_2_RP_1 + P-network_2_2_RP_2 + P-network_1_2_AI_1 + P-network_1_2_AI_2 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_1_1_AnnP_1 + P-network_1_1_AnnP_2 + P-network_0_1_AskP_2 + P-network_0_1_AskP_1 + P-network_2_2_AI_2 + P-network_2_2_AI_1 + P-network_1_0_RI_1 + P-network_1_0_RI_2 + P-network_2_0_AnnP_1 + P-network_2_0_AnnP_2 + P-network_1_2_AskP_1 + P-network_1_2_AskP_2 + P-network_0_2_RI_1 + P-network_0_2_RI_2 + P-network_2_1_RI_1 + P-network_2_1_RI_2 + P-network_1_1_AI_2 + P-network_0_1_RP_1 + P-network_0_1_RP_2 + P-network_1_1_AI_1 + P-network_2_1_AskP_1 + P-network_2_1_AskP_2 + P-network_2_0_RP_1 + P-network_2_0_RP_2 + P-network_2_1_RP_2 + P-network_2_1_RP_1 + P-network_1_0_AI_1 + P-network_1_0_AI_2 + P-network_0_1_AnnP_1 + P-network_0_1_AnnP_2 + P-network_0_2_RP_2 + P-network_1_2_RP_1 + P-network_1_2_RP_2 + P-network_0_2_RP_1 + P-network_0_0_AnnP_2 + P-network_0_0_AnnP_1 + P-network_0_2_AI_1 + P-network_0_2_AI_2 + P-network_2_1_AI_1 + P-network_2_1_AI_2 + P-network_2_2_RI_2 + P-network_1_0_AnnP_1 + P-network_1_0_AnnP_2 + P-network_2_2_RI_1 + P-network_0_0_AI_2 + P-network_0_0_AI_1 + P-network_0_2_AskP_1 + P-network_0_2_AskP_2 + P-network_1_0_RP_2 + P-network_1_0_RP_1 + P-network_0_0_RI_1 + P-network_0_0_RI_2 + P-network_2_0_AskP_2 + P-network_2_0_AskP_1 + P-network_2_2_AnnP_2 + P-network_1_1_AskP_1 + P-network_1_1_AskP_2 + P-network_2_2_AnnP_1 + P-network_1_1_RI_1 + P-network_1_1_RI_2 <= P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2)))) : E (F ((P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_1_CO + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_1_1_DONE + P-negotiation_1_1_CO + P-negotiation_2_2_DONE + P-negotiation_0_0_NONE + P-negotiation_1_1_NONE + P-negotiation_2_2_CO + P-negotiation_1_2_NONE + P-negotiation_2_0_CO + P-negotiation_1_0_DONE + P-negotiation_0_1_CO + P-negotiation_0_2_DONE + P-negotiation_2_1_DONE <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2))) : A (G (((2 <= P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_1_CO + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_1_1_DONE + P-negotiation_1_1_CO + P-negotiation_2_2_DONE + P-negotiation_0_0_NONE + P-negotiation_1_1_NONE + P-negotiation_2_2_CO + P-negotiation_1_2_NONE + P-negotiation_2_0_CO + P-negotiation_1_0_DONE + P-negotiation_0_1_CO + P-negotiation_0_2_DONE + P-negotiation_2_1_DONE) OR (3 <= P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_2_2_AI_2 + P-poll__networl_2_2_AI_1 + P-poll__networl_2_2_AI_0 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_2 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl
_0_0_RP_2 + P-poll__networl_2_1_AskP_0 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_2 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_0 + P-poll__networl_1_2_RI_0 + P-poll__networl_1_2_RI_1 + P-poll__networl_1_2_RI_2 + P-poll__networl_1_1_AI_2 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_0 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_1_1_RP_0 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_2 + P-poll__networl_0_1_AnnP_0 + P-poll__networl_0_1_AnnP_1 + P-poll__networl_0_1_AnnP_2 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_0_2_AnnP_0 + P-poll__networl_2_1_RP_2 + P-poll__networl_2_1_RP_1 + P-poll__networl_2_1_RP_0 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_2_RP_1 + P-poll__networl_0_2_RP_0 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_0_1_AnsP_0 + P-poll__networl_1_2_AI_0 + P-poll__networl_1_2_AI_1 + P-poll__networl_1_2_AI_2 + P-poll__networl_2_2_RI_2 + P-poll__networl_2_2_RI_1 + P-poll__networl_2_2_RI_0 + P-poll__networl_0_2_AskP_0 + P-poll__networl_0_2_AskP_1 + P-poll__networl_0_2_AskP_2 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_2_AskP_2 + P-poll__networl_2_2_AskP_1 + P-poll__networl_2_2_AskP_0 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_0 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_2_2_AnnP_0 + P-poll__networl_2_2_AnnP_1 + P-poll__networl_2_2_AnnP_2 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_0_2_RI_0 + P-poll__networl_0_2_RI_1 + P-poll__networl_0_2_RI_2 + P-poll__networl_2_1_RI_0 + P-poll__networl_2_1_RI_1 + P-poll__networl_2_1_RI_2 + P-poll__networl_2_2_AnsP_0 + P-poll__networl_1_1_RI_2 + P-poll__networl_1_1_RI_1 + P-poll__networl_1_1_RI_0 + P-poll__networl_0_1_RP_0 + P-poll__networl_0_1_RP_1 + P-poll__networl_0_1_RP_2 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_2 + P-poll__networl_1_0_AI_0 + P-poll__networl_1_0_AI_1 + P-poll__networl_1_0_AI_2 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_2_1_AnnP_0 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_0_0_RI_2 + P-poll__networl_0_1_AskP_0 + P-poll__networl_0_1_AskP_1 + P-poll__networl_0_1_AskP_2 + P-poll__networl_0_0_RI_1 + P-poll__networl_0_0_RI_0 + P-poll__networl_1_2_AnnP_0 + P-poll__networl_1_2_AnnP_1 + P-poll__networl_1_2_AnnP_2 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2) OR (P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_F_2 + P-masterState_0_F_2 + P-masterState_1_T_2 <= 2) OR (P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2) OR (P-polling_0 + P-polling_1 + P-polling_2 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2) OR ((2 <= P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM) AND (2 <= P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2))))) : A (G (((P-network_2_0_AI_1 <= 2) OR (P-poll__networl_1_0_AnsP_0 + 1 <= P-network_2_1_AskP_1) OR ((P-poll__networl_0_0_AI_1 + 1 <= P-network_1_1_AskP_1) AND (P-network_0_1_AI_0 <= 1))))) : E (F (((P-crashed_0 + 1 <= P-poll__networl_2_1_AI_1) OR (P-poll__networl_2_2_AnsP_0 + 1 <= P-masterState_2_F_2) OR ((P-poll__networl_2_1_AI_0 <= P-masterList_1_1_2) AND (3 <= P-poll__networl_1_0_AskP_1) AND (P-poll__networl_2_2_AI_2 <= 2))))) : E (F (((P-sendAnnPs__broadcasting_0_2 + 1 <= P-network_0_1_AI_2) AND (P-electionInit_2 <= 2)))) : E (F ((((P-network_0_1_AnsP_0 + 1 <= P-masterState_1_T_2) OR (P-electedPrimary_2 <= 2)) AND (P-network_2_2_AnnP_1 <= P-poll__networl_0_2_AnnP_2)))) : A (G ((P-network_1_2_RI_2 + 1 <= P-network_0_0_RI_2))) : E (F ((((2 <= P-poll__networl_1_2_RI_1) OR (1 <= P-network_2_2_AnnP_1) OR (P-poll__networl_2_1_RI_2 <= P-network_0_0_AnsP_0)) AND (P-network_0_2_AI_2 <= 2)))) : A (G (((P-masterState_0_F_1 <= 2) AND (P-poll__networl_2_0_RP_1 <= 1) AND (P-network_2_1_AnnP_1 <= 1) AND (P-network_1_0_AnsP_0 + 1 <= P-network_0_0_AI_1)))) : E (F (((3 <= P-network_2_1_AskP_2) OR ((P-network_0_1_RI_1 <= P-network_0_0_RI_2) AND (1 <= P-poll__networl_2_1_AI_1) AND (P-network_2_0_AskP_2 <= P-network_0_1_AnsP_1) AND (P-crashed_0 <= P-masterState_0_T_2)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + 1 <= P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_1_2) AND (P-polling_0 + P-polling_1 + P-polling_2 + 1 <= P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2) AND (P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-mas... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_1_CO + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_1_1_DONE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2) AND (P-poll__networl_0_0_AnsP_2 + P-poll__networl_0_0_AnsP_1 + P-poll__networl_1_2_AnsP_1 + P-poll__networl_1_2_AnsP_2 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_2 + P-poll... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= 0) OR (1 <= P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-netw... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0) AND (2 <= P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_0_2 + P-sta... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_1_CO + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_1_1_DONE + P-n... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 241 markings, 448 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= P-negotiation_1_0_NONE + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_0_2_CO + P-negotiation_1_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_1_CO + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_1_1_DONE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-network_2_0_AI_1 <= 2) OR (P-poll__networl_1_0_AnsP_0 + 1 <= P-network_2_1_AskP_1) OR ((P-poll__networl_0_0_AI_1 + 1 <= P-network_1_1_AskP_1) AND (P-network_0_1_AI_0 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P-crashed_0 + 1 <= P-poll__networl_2_1_AI_1) OR (P-poll__networl_2_2_AnsP_0 + 1 <= P-masterState_2_F_2) OR ((P-poll__networl_2_1_AI_0 <= P-masterList_1_1_2) AND (3 <= P-poll__networl_1_0_AskP_1) AND (P-poll__networl_2_2_AI_2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 151 markings, 192 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P-sendAnnPs__broadcasting_0_2 + 1 <= P-network_0_1_AI_2) AND (P-electionInit_2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityCardinality-10.sara
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((P-network_0_1_AnsP_0 + 1 <= P-masterState_1_T_2) OR (P-electedPrimary_2 <= 2)) AND (P-network_2_2_AnnP_1 <= P-poll__networl_0_2_AnnP_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P-network_1_2_RI_2 + 1 <= P-network_0_0_RI_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= P-poll__networl_1_2_RI_1) OR (1 <= P-network_2_2_AnnP_1) OR (P-poll__networl_2_1_RI_2 <= P-network_0_0_AnsP_0)) AND (P-network_0_2_AI_2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-masterState_0_F_1 <= 2) AND (P-poll__networl_2_0_RP_1 <= 1) AND (P-network_2_1_AnnP_1 <= 1) AND (P-network_1_0_AnsP_0 + 1 <= P-network_0_0_AI_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= P-network_2_1_AskP_2) OR ((P-network_0_1_RI_1 <= P-network_0_0_RI_2) AND (1 <= P-poll__networl_2_1_AI_1) AND (P-network_2_0_AskP_2 <= P-network_0_1_AnsP_1) AND (P-crashed_0 <= P-masterState_0_T_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes no yes yes no no yes no yes no no
FORMULA NeoElection-PT-2-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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-PT-2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/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/NeoElection-PT-2.tgz
mv NeoElection-PT-2 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is NeoElection-PT-2, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-csrt-152666472500292"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 ;