Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_NeoElection-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650100266
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-COL-2-LTLCardinality-0
FORMULA_NAME NeoElection-COL-2-LTLCardinality-1
FORMULA_NAME NeoElection-COL-2-LTLCardinality-10
FORMULA_NAME NeoElection-COL-2-LTLCardinality-11
FORMULA_NAME NeoElection-COL-2-LTLCardinality-12
FORMULA_NAME NeoElection-COL-2-LTLCardinality-13
FORMULA_NAME NeoElection-COL-2-LTLCardinality-14
FORMULA_NAME NeoElection-COL-2-LTLCardinality-15
FORMULA_NAME NeoElection-COL-2-LTLCardinality-2
FORMULA_NAME NeoElection-COL-2-LTLCardinality-3
FORMULA_NAME NeoElection-COL-2-LTLCardinality-4
FORMULA_NAME NeoElection-COL-2-LTLCardinality-5
FORMULA_NAME NeoElection-COL-2-LTLCardinality-6
FORMULA_NAME NeoElection-COL-2-LTLCardinality-7
FORMULA_NAME NeoElection-COL-2-LTLCardinality-8
FORMULA_NAME NeoElection-COL-2-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496369131474


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


checking for too many tokens
===========================================================================================
S_NeoElection-PT-2: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_NeoElection-PT-2 @ 3540 seconds
----- 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-COL-2-LTLCardinality.task
lola: A (X ((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-dead_2 + P-dead_1 + P-dead_0))) : A (G (X (F (F ((1 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2)))))) : A ((((2 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0) U (P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2)) U (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2))) : A (G ((F ((3 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)) U G ((P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0))))) : A (F ((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))) : A (G ((X ((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2)) U F ((P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2))))) : A ((3 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2)) : A ((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 (F (F (G (G ((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-crashed_2 + P-crashed_1 + P-crashed_0)))))) : A ((G (X ((3 <= P-polling_0 + P-polling_1 + P-polling_2))) U G (G ((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0))))) : A ((F (G ((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))) U (P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2))) : A (G (F (G (F ((2 <= P-dead_2 + P-dead_1 + P-dead_0)))))) : A ((((1 <= 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) U (3 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)) U F (G ((3 <= 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))))) : A ((P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 <= 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)) : A (G (X (G (X ((2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2)))))) : A (G (X (F ((2 <= P-crashed_2 + P-crashed_1 + P-crashed_0)))))
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 (X ((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-dead_2 + P-dead_1 + P-dead_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((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-dead_2 + P-dead_1 + P-dead_0)))
lola: processed formula: A (X ((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-dead_2 + P-dead_1 + P-dead_0)))
lola: processed formula length: 233
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F (F ((1 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (F ((1 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2)))))
lola: processed formula: A (G (X (F ((1 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2)))))
lola: processed formula length: 83
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0) U (P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2)) U (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0) U (P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2)) U (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2)))
lola: processed formula: A ((((2 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0) U (P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2)) U (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2)))
lola: processed formula length: 348
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((3 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)) U G ((P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((3 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)) U G ((P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0)))))
lola: processed formula: A (G ((F ((3 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)) U G ((P-electionInit_1 + P-electionInit_0 + P-electionInit_2 <= P-crashed_2 + P-crashed_1 + P-crashed_0)))))
lola: processed formula length: 184
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((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__net... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((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)))
lola: processed formula: A (F ((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__net... (shortened)
lola: processed formula length: 4548
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2)) U F ((P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2)) U F ((P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2)))))
lola: processed formula: A (G ((X ((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2)) U F ((P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2)))))
lola: processed formula length: 279
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2)
lola: processed formula length: 67
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((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-nego... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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-negotia... (shortened)
lola: processed formula length: 741
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (G ((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-crashed_2 + P-crashed_1 + P-crashed_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G ((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-crashed_2 + P-crashed_1 + P-crashed_0)))))
lola: processed formula: A (F (G (G ((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-crashed_2 + P-crashed_1 + P-crashed_0)))))
lola: processed formula length: 250
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((3 <= P-polling_0 + P-polling_1 + P-polling_2))) U G (G ((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((3 <= P-polling_0 + P-polling_1 + P-polling_2))) U G (G ((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)))))
lola: processed formula: A ((G (X ((3 <= P-polling_0 + P-polling_1 + P-polling_2))) U G (G ((P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)))))
lola: processed formula length: 173
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((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))) U (P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2)))
lola: processed formula: A ((F (G ((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_... (shortened)
lola: processed formula length: 4704
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (F ((2 <= P-dead_2 + P-dead_1 + P-dead_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (F ((2 <= P-dead_2 + P-dead_1 + P-dead_0)))))
lola: processed formula: A (G (G (F ((2 <= P-dead_2 + P-dead_1 + P-dead_0)))))
lola: processed formula length: 53
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= 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 LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= 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) U (3 <= P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)) U F (G ((3 <= 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)))))
lola: processed formula: A ((((1 <= 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: processed formula length: 937
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 <= 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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 <= 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_R... (shortened)
lola: processed formula length: 3633
lola: 1 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (X ((2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2))))))
lola: processed formula: A (G (X (G (X ((2 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2))))))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F ((2 <= P-crashed_2 + P-crashed_1 + P-crashed_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (F ((2 <= P-crashed_2 + P-crashed_1 + P-crashed_0)))))
lola: processed formula: A (G (X (F ((2 <= P-crashed_2 + P-crashed_1 + P-crashed_0)))))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 438 places; total mentions: 0
lola: closed formula file NeoElection-COL-2-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 616 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no no no no yes yes yes no no yes no no
FORMULA NeoElection-COL-2-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-COL-2-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496369131786

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_NeoElection-PT-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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/S_NeoElection-PT-2.tgz
mv S_NeoElection-PT-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_NeoElection-PT-2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441650100266"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;