fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r112-csrt-152666469300297
Last Updated
June 26, 2018

About the Execution of LoLA for NeoElection-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
171.760 2462.00 2933.00 19.80 TTFTFFTTFFFFTFFT normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 37K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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 46K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 64K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K 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 35K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 33K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 62K 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 911K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeoElection-PT-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469300297
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527027010212

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeoElection-PT-3 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating NeoElection-PT-3 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ NeoElection-PT-3 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1988/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 972
lola: finding significant places
lola: 972 places, 1016 transitions, 300 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 472 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-3-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (P-negotiation_3_2_DONE + P-negotiation_1_0_NONE + P-negotiation_1_3_CO + P-negotiation_3_1_CO + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_1_2_CO + P-negotiation_0_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_3_DONE + P-negotiation_1_3_NONE + P-negotiation_2_1_CO + P-negotiation_3_2_NONE + P-negotiation_3_1_DONE + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_3_3_NONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_0_3_NONE + P-negotiation_3_0_CO + P-negotiation_3_3_DONE + P-negotiation_1_1_DONE + P-negotiation_3_0_DONE + P-negotiation_2_2_DONE + P-negotiation_0_3_DONE + P-negotiation_2_3_CO + P-negotiation_1_1_CO + P-negotiation_0_0_NONE + P-negotiation_1_1_NONE + P-negotiation_3_0_NONE + P-negotiation_2_2_CO + P-negotiation_0_3_CO + P-negotiation_3_3_CO + P-negotiation_1_2_NONE + P-negotiation_3_1_NONE + P-negotiation_2_3_NONE + P-negotiation_2_0_CO + P-negotiation_1_0_DONE + P-negotiation_3_2_CO + P-negotiation_0_1_CO + P-negotiation_0_2_DONE + P-negotiation_2_1_DONE + P-negotiation_1_3_DONE <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + P-electedPrimary_3)
lola: after: (9 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + P-electedPrimary_3)
lola: LP says that atomic proposition is always false: (9 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + P-electedPrimary_3)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-stage_2_SEC + P-stage_3_NEG + P-stage_1_SEC + P-stage_0_SEC + P-stage_3_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_3_PRIM + P-stage_0_NEG + P-stage_1_PRIM)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-masterState_1_T_2 + P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_3_F_2 + P-masterState_3_F_1 + P-masterState_3_F_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_1_F_3 + P-masterState_0_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_3_T_3 + P-masterState_3_T_2 + P-masterState_3_T_1 + P-masterState_3_T_0 + P-masterState_0_T_3 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_2 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_3 + P-masterState_2_T_2 + P-masterState_2_T_1 + P-masterState_2_T_0 + P-masterState_2_F_3 + P-masterState_0_F_3 + P-masterState_3_F_3 + P-masterState_1_T_3 <= P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_3)
lola: after: (3 <= P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_3)
lola: place invariant simplifies atomic proposition
lola: before: (P-sendAnnPs__broadcasting_3_3 + P-sendAnnPs__broadcasting_3_2 + P-sendAnnPs__broadcasting_3_1 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_3 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= P-crashed_3 + P-crashed_2 + P-crashed_1 + P-crashed_0)
lola: after: (P-sendAnnPs__broadcasting_3_3 + P-sendAnnPs__broadcasting_3_2 + P-sendAnnPs__broadcasting_3_1 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_3 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= 0)
lola: LP says that atomic proposition is always true: (P-sendAnnPs__broadcasting_3_3 + P-sendAnnPs__broadcasting_3_2 + P-sendAnnPs__broadcasting_3_1 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_3 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= 0)
lola: LP says that atomic proposition is always true: (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + P-poll__waitingMessage_3 <= P-poll__pollEnd_3 + P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= P-dead_3 + P-dead_2 + P-dead_1 + P-dead_0)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always true: (P-sendAnnPs__broadcasting_3_3 + P-sendAnnPs__broadcasting_3_2 + P-sendAnnPs__broadcasting_3_1 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_3 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + P-poll__waitingMessage_3)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-negotiation_3_2_DONE + P-negotiation_1_0_NONE + P-negotiation_1_3_CO + P-negotiation_3_1_CO + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_1_2_CO + P-negotiation_0_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_3_DONE + P-negotiation_1_3_NONE + P-negotiation_2_1_CO + P-negotiation_3_2_NONE + P-negotiation_3_1_DONE + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_3_3_NONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_0_3_NONE + P-negotiation_3_0_CO + P-negotiation_3_3_DONE + P-negotiation_1_1_DONE + P-negotiation_3_0_DONE + P-negotiation_2_2_DONE + P-negotiation_0_3_DONE + P-negotiation_2_3_CO + P-negotiation_1_1_CO + P-negotiation_0_0_NONE + P-negotiation_1_1_NONE + P-negotiation_3_0_NONE + P-negotiation_2_2_CO + P-negotiation_0_3_CO + P-negotiation_3_3_CO + P-negotiation_1_2_NONE + P-negotiation_3_1_NONE + P-negotiation_2_3_NONE + P-negotiation_2_0_CO + P-negotiation_1_0_DONE + P-negotiation_3_2_CO + P-negotiation_0_1_CO + P-negotiation_0_2_DONE + P-negotiation_2_1_DONE + P-negotiation_1_3_DONE)
lola: after: (0 <= 6)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-dead_3 + P-dead_2 + P-dead_1 + P-dead_0)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 <= P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 + P-electionFailed_3)
lola: after: (P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 <= 0)
lola: LP says that atomic proposition is always true: (P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-masterState_1_T_2 + P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_3_F_2 + P-masterState_3_F_1 + P-masterState_3_F_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_1_F_3 + P-masterState_0_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_3_T_3 + P-masterState_3_T_2 + P-masterState_3_T_1 + P-masterState_3_T_0 + P-masterState_0_T_3 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_2 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_3 + P-masterState_2_T_2 + P-masterState_2_T_1 + P-masterState_2_T_0 + P-masterState_2_F_3 + P-masterState_0_F_3 + P-masterState_3_F_3 + P-masterState_1_T_3)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + P-poll__waitingMessage_3)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= P-poll__networl_0_3_AnsP_3 + P-poll__networl_0_3_AnsP_2 + P-poll__networl_0_3_AnsP_1 + P-poll__networl_0_0_AnsP_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_1_2_AnsP_3 + P-poll__networl_3_1_AnsP_3 + P-poll__networl_3_1_AnsP_2 + P-poll__networl_3_1_AnsP_1 + P-poll__networl_2_2_AnsP_3 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_1_3_AnsP_3 + P-poll__networl_1_3_AnsP_2 + P-poll__networl_1_3_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_2_1_AnsP_3 + P-poll__networl_1_0_AnsP_3 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_3 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_3_2_AnsP_3 + P-poll__networl_3_0_AnsP_1 + P-poll__networl_3_0_AnsP_2 + P-poll__networl_3_0_AnsP_3 + P-poll__networl_3_2_AnsP_2 + P-poll__networl_3_2_AnsP_1 + P-poll__networl_2_3_AnsP_3 + P-poll__networl_2_3_AnsP_2 + P-poll__networl_2_3_AnsP_1 + P-poll__networl_2_0_AnsP_3 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_1_1_AnsP_3 + P-poll__networl_3_3_AnsP_1 + P-poll__networl_3_3_AnsP_2 + P-poll__networl_3_3_AnsP_3 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_0_2_AnsP_3 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_0_2_AnsP_1 + P-poll__networl_0_3_AI_1 + P-poll__networl_0_3_AI_2 + P-poll__networl_0_2_AnsP_0 + P-poll__networl_0_3_AI_3 + P-poll__networl_0_3_AI_0 + P-poll__networl_2_2_AI_0 + P-poll__networl_3_2_RP_3 + P-poll__networl_2_2_AI_1 + P-poll__networl_2_2_AI_2 + P-poll__networl_2_2_AI_3 + P-poll__networl_3_2_RP_2 + P-poll__networl_3_2_RP_1 + P-poll__networl_3_2_RP_0 + P-poll__networl_1_1_AnnP_3 + P-poll__networl_1_1_AnnP_2 + P-poll__networl_1_1_AnnP_1 + P-poll__networl_1_1_AnnP_0 + P-poll__networl_1_3_RP_3 + P-poll__networl_1_3_RP_2 + P-poll__networl_1_3_RP_1 + P-poll__networl_1_3_RP_0 + P-poll__networl_0_3_AskP_0 + P-poll__networl_0_3_AskP_1 + P-poll__networl_0_3_AskP_2 + P-poll__networl_0_3_AskP_3 + P-poll__networl_2_0_AnnP_0 + P-poll__networl_2_0_AnnP_1 + P-poll__networl_2_0_AnnP_2 + P-poll__networl_2_0_AnnP_3 + P-poll__networl_1_1_AnsP_0 + P-poll__networl_3_3_AnsP_0 + P-poll__networl_3_3_AI_0 + P-poll__networl_3_3_AI_1 + P-poll__networl_3_3_AI_2 + P-poll__networl_3_3_AI_3 + P-poll__networl_3_3_RI_3 + P-poll__networl_3_3_RI_2 + P-poll__networl_1_2_AskP_0 + P-poll__networl_1_2_AskP_1 + P-poll__networl_1_2_AskP_2 + P-poll__networl_1_2_AskP_3 + P-poll__networl_3_3_RI_1 + P-poll__networl_0_1_RI_0 + P-poll__networl_0_1_RI_1 + P-poll__networl_0_1_RI_2 + P-poll__networl_0_1_RI_3 + P-poll__networl_2_0_RI_0 + P-poll__networl_2_0_RI_1 + P-poll__networl_2_0_RI_2 + P-poll__networl_2_0_RI_3 + P-poll__networl_3_3_RI_0 + P-poll__networl_0_0_AskP_3 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_0 + P-poll__networl_3_0_AI_3 + P-poll__networl_2_0_AnsP_0 + P-poll__networl_3_0_AI_2 + P-poll__networl_3_0_AI_1 + P-poll__networl_3_0_AI_0 + P-poll__networl_2_3_AnnP_0 + P-poll__networl_2_3_AnnP_1 + P-poll__networl_2_3_AnnP_2 + P-poll__networl_2_3_AnnP_3 + P-poll__networl_1_1_AI_3 + P-poll__networl_1_1_AI_2 + P-poll__networl_0_0_RP_0 + P-poll__networl_0_0_RP_1 + P-poll__networl_0_0_RP_2 + P-poll__networl_0_0_RP_3 + P-poll__networl_1_1_AI_1 + P-poll__networl_1_1_AI_0 + P-poll__networl_2_1_AskP_0 + P-poll__networl_2_1_AskP_1 + P-poll__networl_2_1_AskP_2 + P-poll__networl_2_1_AskP_3 + P-poll__networl_0_2_AnnP_3 + P-poll__networl_0_2_AnnP_2 + P-poll__networl_0_2_AnnP_1 + P-poll__networl_0_2_AnnP_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_2_RI_3 + P-poll__networl_2_1_RP_3 + P-poll__networl_2_1_RP_2 + P-poll__networl_2_1_RP_1 + P-poll__networl_3_1_RI_0 + P-poll__networl_3_1_RI_1 + P-poll__networl_3_1_RI_2 + P-poll__networl_3_1_RI_3 + P-poll__networl_2_1_RP_0 + P-poll__networl_3_1_AskP_3 + P-poll__networl_3_2_AnnP_0 + P-poll__networl_3_2_AnnP_1 + P-poll__networl_3_2_AnnP_2 + P-poll__networl_3_2_AnnP_3 + P-poll__networl_3_1_AskP_2 + P-poll__networl_3_1_AskP_1 + P-poll__networl_2_3_AnsP_0 + P-poll__networl_3_1_AskP_0 + P-poll__networl_0_2_RP_3 + P-poll__networl_0_2_RP_2 + P-poll__networl_0_2_RP_1 + P-poll__networl_3_0_AskP_0 + P-poll__networl_3_0_AskP_1 + P-poll__networl_3_0_AskP_2 + P-poll__networl_3_0_AskP_3 + P-poll__networl_1_1_RP_0 + P-poll__networl_1_1_RP_1 + P-poll__networl_1_1_RP_2 + P-poll__networl_1_1_RP_3 + 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_AnnP_3 + P-poll__networl_3_0_RP_0 + P-poll__networl_3_0_RP_1 + P-poll__networl_3_0_RP_2 + P-poll__networl_3_0_RP_3 + P-poll__networl_0_2_RP_0 + P-poll__networl_0_1_AI_0 + P-poll__networl_0_1_AI_1 + P-poll__networl_0_1_AI_2 + P-poll__networl_0_1_AI_3 + P-poll__networl_2_0_AI_0 + P-poll__networl_2_0_AI_1 + P-poll__networl_2_0_AI_2 + P-poll__networl_2_0_AI_3 + P-poll__networl_2_3_RI_0 + P-poll__networl_2_3_RI_1 + P-poll__networl_2_3_RI_2 + P-poll__networl_2_3_RI_3 + P-poll__networl_3_3_AnnP_3 + P-poll__networl_3_3_AnnP_2 + P-poll__networl_3_3_AnnP_1 + P-poll__networl_3_3_AnnP_0 + P-poll__networl_3_2_AnsP_0 + P-poll__networl_3_0_AnsP_0 + P-poll__networl_0_3_RP_0 + P-poll__networl_0_3_RP_1 + P-poll__networl_0_3_RP_2 + P-poll__networl_0_3_RP_3 + P-poll__networl_1_0_AnnP_0 + P-poll__networl_1_0_AnnP_1 + P-poll__networl_1_0_AnnP_2 + P-poll__networl_1_0_AnnP_3 + P-poll__networl_2_2_RP_0 + P-poll__networl_2_2_RP_1 + P-poll__networl_2_2_RP_2 + P-poll__networl_2_2_RP_3 + P-poll__networl_3_3_AskP_0 + P-poll__networl_3_3_AskP_1 + P-poll__networl_3_3_AskP_2 + P-poll__networl_3_3_AskP_3 + 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_1_2_AI_3 + P-poll__networl_3_1_AI_0 + P-poll__networl_3_1_AI_1 + P-poll__networl_3_1_AI_2 + P-poll__networl_3_1_AI_3 + P-poll__networl_2_2_RI_3 + P-poll__networl_2_2_RI_2 + P-poll__networl_2_2_RI_1 + 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_2_AskP_3 + P-poll__networl_2_2_RI_0 + P-poll__networl_0_3_RI_3 + P-poll__networl_0_3_RI_2 + P-poll__networl_3_3_RP_0 + P-poll__networl_3_3_RP_1 + P-poll__networl_3_3_RP_2 + P-poll__networl_3_3_RP_3 + P-poll__networl_1_0_AnsP_0 + P-poll__networl_0_3_RI_1 + P-poll__networl_0_3_RI_0 + P-poll__networl_0_0_AI_3 + P-poll__networl_1_3_AnnP_0 + P-poll__networl_1_3_AnnP_1 + P-poll__networl_1_3_AnnP_2 + P-poll__networl_1_3_AnnP_3 + P-poll__networl_0_0_AI_2 + P-poll__networl_0_0_AI_1 + P-poll__networl_0_0_AI_0 + P-poll__networl_2_3_AI_0 + P-poll__networl_2_3_AI_1 + P-poll__networl_2_3_AI_2 + P-poll__networl_2_3_AI_3 + P-poll__networl_2_2_AskP_3 + 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_1_AskP_0 + P-poll__networl_1_1_AskP_1 + P-poll__networl_1_1_AskP_2 + P-poll__networl_1_1_AskP_3 + P-poll__networl_1_0_RP_3 + P-poll__networl_1_0_RI_0 + P-poll__networl_1_0_RI_1 + P-poll__networl_1_0_RI_2 + P-poll__networl_1_0_RI_3 + P-poll__networl_1_0_RP_2 + P-poll__networl_1_0_RP_1 + P-poll__networl_1_0_RP_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_2_AnnP_3 + P-poll__networl_1_3_AnsP_0 + P-poll__networl_2_1_AnsP_0 + P-poll__networl_2_0_AskP_0 + P-poll__networl_2_0_AskP_1 + P-poll__networl_2_0_AskP_2 + P-poll__networl_2_0_AskP_3 + P-poll__networl_3_0_AnnP_3 + P-poll__networl_3_0_AnnP_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_0_2_RI_3 + P-poll__networl_3_0_AnnP_1 + 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_1_RI_3 + P-poll__networl_3_0_AnnP_0 + P-poll__networl_3_0_RI_3 + P-poll__networl_3_0_RI_2 + P-poll__networl_3_0_RI_1 + P-poll__networl_3_1_AnnP_0 + P-poll__networl_3_1_AnnP_1 + P-poll__networl_3_1_AnnP_2 + P-poll__networl_3_1_AnnP_3 + P-poll__networl_3_0_RI_0 + P-poll__networl_2_2_AnsP_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_1_RP_3 + P-poll__networl_0_0_AnnP_0 + P-poll__networl_0_0_AnnP_1 + P-poll__networl_0_0_AnnP_2 + P-poll__networl_0_0_AnnP_3 + P-poll__networl_2_0_RP_0 + P-poll__networl_2_0_RP_1 + P-poll__networl_2_0_RP_2 + P-poll__networl_2_0_RP_3 + P-poll__networl_2_3_AskP_0 + P-poll__networl_2_3_AskP_1 + P-poll__networl_2_3_AskP_2 + P-poll__networl_2_3_AskP_3 + P-poll__networl_1_1_RI_3 + P-poll__networl_1_1_RI_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_0_AI_3 + P-poll__networl_1_3_RI_0 + P-poll__networl_1_3_RI_1 + P-poll__networl_1_3_RI_2 + P-poll__networl_1_3_RI_3 + P-poll__networl_1_1_RI_1 + P-poll__networl_3_2_RI_0 + P-poll__networl_3_2_RI_1 + P-poll__networl_3_2_RI_2 + P-poll__networl_3_2_RI_3 + P-poll__networl_1_1_RI_0 + P-poll__networl_1_3_AskP_3 + P-poll__networl_1_3_AskP_2 + P-poll__networl_1_3_AskP_1 + P-poll__networl_1_3_AskP_0 + P-poll__networl_3_1_AnsP_0 + P-poll__networl_1_2_AnsP_0 + P-poll__networl_1_2_RP_0 + P-poll__networl_1_2_RP_1 + P-poll__networl_1_2_RP_2 + P-poll__networl_1_2_RP_3 + P-poll__networl_3_2_AskP_0 + P-poll__networl_3_2_AskP_1 + P-poll__networl_3_2_AskP_2 + P-poll__networl_3_2_AskP_3 + P-poll__networl_3_1_RP_0 + P-poll__networl_3_1_RP_1 + P-poll__networl_3_1_RP_2 + P-poll__networl_3_1_RP_3 + P-poll__networl_0_0_AnsP_0 + P-poll__networl_0_3_AnnP_0 + P-poll__networl_0_3_AnnP_1 + P-poll__networl_0_3_AnnP_2 + P-poll__networl_0_3_AnnP_3 + P-poll__networl_2_1_AnnP_3 + P-poll__networl_0_2_AI_0 + P-poll__networl_0_2_AI_1 + P-poll__networl_0_2_AI_2 + P-poll__networl_0_2_AI_3 + P-poll__networl_2_1_AI_0 + P-poll__networl_2_1_AnnP_2 + P-poll__networl_2_1_AI_1 + P-poll__networl_2_1_AI_2 + P-poll__networl_2_1_AI_3 + P-poll__networl_2_1_AnnP_1 + P-poll__networl_2_1_AnnP_0 + 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_1_AskP_3 + P-poll__networl_0_0_RI_3 + P-poll__networl_2_3_RP_0 + P-poll__networl_2_3_RP_1 + P-poll__networl_2_3_RP_2 + P-poll__networl_2_3_RP_3 + P-poll__networl_0_0_RI_2 + 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_2_AnnP_3 + P-poll__networl_0_0_RI_1 + P-poll__networl_1_3_AI_0 + P-poll__networl_1_3_AI_1 + P-poll__networl_1_3_AI_2 + P-poll__networl_0_3_AnsP_0 + P-poll__networl_1_3_AI_3 + P-poll__networl_0_0_RI_0 + P-poll__networl_1_0_AskP_0 + P-poll__networl_1_0_AskP_1 + P-poll__networl_1_0_AskP_2 + P-poll__networl_1_0_AskP_3 + P-poll__networl_3_2_AI_0 + P-poll__networl_3_2_AI_1 + P-poll__networl_3_2_AI_2 + P-poll__networl_3_2_AI_3)
lola: after: (1 <= P-poll__networl_0_3_AnsP_3 + P-poll__networl_0_3_AnsP_2 + P-poll__networl_0_3_AnsP_1 + P-poll__networl_0_0_AnsP_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_1_2_AnsP_3 + P-poll__networl_3_1_AnsP_3 + P-poll__networl_3_1_AnsP_2 + P-poll__networl_3_1_AnsP_1 + P-poll__networl_2_2_AnsP_3 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_1_3_AnsP_3 + P-poll__networl_1_3_AnsP_2 + P-poll__networl_1_3_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_2_1_AnsP_3 + P-poll__networl_1_0_AnsP_3 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_3 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_3_2_AnsP_3 + P-poll__networl_3_0_AnsP_1 + P-poll__networl_3_0_AnsP_2 + P-poll__networl_3_0_AnsP_3 + P-poll__networl_3_2_AnsP_2 + P-poll__networl_3_2_AnsP_1 + P-poll__networl_2_3_AnsP_3 + P-poll__networl_2_3_AnsP_2 + P-poll__networl_2_3_AnsP_1 + P-poll__networl_2_0_AnsP_3 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_1_1_AnsP_3 + P-poll__networl_3_3_AnsP_1 + P-poll__networl_3_3_AnsP_2 + P-poll__networl_3_3_AnsP_3 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_0_2_AnsP_3 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_0_2_AnsP_1)
lola: LP says that atomic proposition is always false: (1 <= P-poll__networl_0_3_AnsP_3 + P-poll__networl_0_3_AnsP_2 + P-poll__networl_0_3_AnsP_1 + P-poll__networl_0_0_AnsP_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_1_2_AnsP_3 + P-poll__networl_3_1_AnsP_3 + P-poll__networl_3_1_AnsP_2 + P-poll__networl_3_1_AnsP_1 + P-poll__networl_2_2_AnsP_3 + P-poll__networl_2_2_AnsP_2 + P-poll__networl_2_2_AnsP_1 + P-poll__networl_1_3_AnsP_3 + P-poll__networl_1_3_AnsP_2 + P-poll__networl_1_3_AnsP_1 + P-poll__networl_2_1_AnsP_1 + P-poll__networl_2_1_AnsP_2 + P-poll__networl_2_1_AnsP_3 + P-poll__networl_1_0_AnsP_3 + P-poll__networl_1_0_AnsP_2 + P-poll__networl_1_0_AnsP_1 + P-poll__networl_0_1_AnsP_3 + P-poll__networl_0_1_AnsP_2 + P-poll__networl_0_1_AnsP_1 + P-poll__networl_3_2_AnsP_3 + P-poll__networl_3_0_AnsP_1 + P-poll__networl_3_0_AnsP_2 + P-poll__networl_3_0_AnsP_3 + P-poll__networl_3_2_AnsP_2 + P-poll__networl_3_2_AnsP_1 + P-poll__networl_2_3_AnsP_3 + P-poll__networl_2_3_AnsP_2 + P-poll__networl_2_3_AnsP_1 + P-poll__networl_2_0_AnsP_3 + P-poll__networl_2_0_AnsP_2 + P-poll__networl_2_0_AnsP_1 + P-poll__networl_1_1_AnsP_3 + P-poll__networl_3_3_AnsP_1 + P-poll__networl_3_3_AnsP_2 + P-poll__networl_3_3_AnsP_3 + P-poll__networl_1_1_AnsP_2 + P-poll__networl_1_1_AnsP_1 + P-poll__networl_0_2_AnsP_3 + P-poll__networl_0_2_AnsP_2 + P-poll__networl_0_2_AnsP_1)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__pollEnd_3 + P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0 <= P-network_2_2_AnnP_0 + P-network_3_0_RI_0 + P-network_1_3_AnsP_0 + P-network_1_3_AnsP_1 + P-network_1_3_AnsP_2 + P-network_1_3_AnsP_3 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_2_0_AskP_0 + P-network_1_0_RP_0 + P-network_1_3_AnnP_0 + P-network_1_0_AnsP_3 + P-network_1_0_AnsP_2 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_0_0_RI_0 + P-network_0_0_AI_0 + P-network_0_3_RI_0 + P-network_0_2_AskP_0 + P-network_3_2_AI_0 + P-network_1_3_AI_0 + P-network_2_2_RI_0 + P-network_3_1_AnnP_0 + P-network_0_1_AnsP_3 + P-network_0_1_AnsP_2 + P-network_0_1_AnsP_1 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_2_AnsP_3 + P-network_0_1_AnsP_0 + P-network_2_3_RP_0 + P-network_3_3_AskP_0 + P-network_1_0_AnnP_0 + P-network_0_0_AnnP_0 + P-network_3_2_AnsP_3 + P-network_3_2_AnsP_2 + P-network_0_2_RP_0 + P-network_3_2_AnsP_1 + P-network_3_2_AnsP_0 + P-network_2_1_AI_0 + P-network_0_2_AI_0 + P-network_3_1_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_3_0_AskP_0 + P-network_2_3_AnsP_3 + P-network_2_3_AnsP_2 + P-network_2_1_RP_0 + P-network_2_3_AnsP_1 + P-network_2_3_AnsP_0 + P-network_3_2_AnnP_0 + P-network_2_3_AskP_0 + P-network_3_2_RI_0 + P-network_1_1_AI_0 + P-network_1_3_RI_0 + P-network_1_0_AI_0 + P-network_3_0_AI_0 + P-network_2_0_RP_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_3_3_RI_0 + P-network_2_3_AnnP_0 + P-network_3_1_AnsP_0 + P-network_3_1_AnsP_1 + P-network_3_1_AnsP_2 + P-network_3_1_AnsP_3 + P-network_2_0_AnsP_3 + 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_3 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_3_2_AskP_0 + P-network_1_1_AnsP_0 + P-network_2_0_AnnP_0 + P-network_1_3_RP_0 + P-network_1_0_RI_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_0_0_AnsP_3 + P-network_0_3_AnnP_0 + P-network_0_3_AskP_0 + P-network_2_3_AI_0 + P-network_3_2_RP_0 + P-network_0_2_AnsP_3 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_3_3_RP_0 + P-network_0_3_AI_0 + P-network_1_1_AnnP_0 + P-network_2_2_AI_0 + P-network_3_3_AnsP_3 + P-network_3_3_AnsP_2 + P-network_3_3_AnsP_1 + P-network_0_1_AskP_0 + P-network_3_3_AnsP_0 + P-network_3_1_AI_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_0_3_RP_0 + P-network_3_1_AskP_0 + P-network_3_3_AnnP_0 + P-network_3_0_AnsP_3 + P-network_3_0_AnsP_2 + P-network_3_0_AnsP_1 + P-network_3_0_AnsP_0 + P-network_2_3_RI_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_3_0_RP_0 + P-network_2_2_AskP_0 + P-network_1_1_RP_0 + P-network_2_1_AnsP_3 + P-network_2_1_AnsP_2 + P-network_1_2_AnnP_0 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_3_1_RI_0 + P-network_0_3_AnsP_0 + P-network_0_3_AnsP_1 + P-network_0_3_AnsP_2 + P-network_0_3_AnsP_3 + P-network_1_0_AskP_0 + P-network_3_0_AnnP_0 + P-network_1_2_RI_0 + P-network_1_3_AskP_0 + P-network_3_3_AI_0 + P-network_0_0_RP_0 + P-network_1_2_AnsP_3 + P-network_1_2_AnsP_2 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_0 + P-network_2_1_AnnP_0 + P-network_0_1_RI_0 + P-network_2_0_RI_0 + P-network_0_1_RI_3 + P-network_0_1_RI_2 + P-network_0_1_RI_1 + P-network_2_0_RI_1 + P-network_2_0_RI_2 + P-network_2_0_RI_3 + P-network_2_1_AnnP_1 + P-network_2_1_AnnP_2 + P-network_2_1_AnnP_3 + P-network_3_3_AI_3 + P-network_0_0_RP_1 + P-network_0_0_RP_2 + P-network_0_0_RP_3 + P-network_3_3_AI_2 + P-network_3_3_AI_1 + P-network_1_3_AskP_1 + P-network_1_3_AskP_2 + P-network_1_3_AskP_3 + P-network_1_0_AskP_3 + P-network_1_2_RI_1 + P-network_1_2_RI_2 + P-network_1_2_RI_3 + P-network_1_0_AskP_2 + P-network_3_0_AnnP_1 + P-network_3_0_AnnP_2 + P-network_3_0_AnnP_3 + P-network_1_0_AskP_1 + P-network_1_2_AnnP_3 + P-network_3_1_RI_1 + P-network_3_1_RI_2 + P-network_3_1_RI_3 + P-network_1_2_AnnP_2 + P-network_1_2_AnnP_1 + P-network_1_1_RP_1 + P-network_1_1_RP_2 + P-network_1_1_RP_3 + P-network_2_2_AskP_1 + P-network_2_2_AskP_2 + P-network_2_2_AskP_3 + P-network_3_0_RP_1 + P-network_3_0_RP_2 + P-network_3_0_RP_3 + P-network_0_1_AI_1 + P-network_0_1_AI_2 + P-network_0_1_AI_3 + P-network_2_0_AI_1 + P-network_2_0_AI_2 + P-network_2_0_AI_3 + P-network_2_3_RI_1 + P-network_2_3_RI_2 + P-network_2_3_RI_3 + P-network_3_3_AnnP_1 + P-network_3_3_AnnP_2 + P-network_3_3_AnnP_3 + P-network_3_1_AskP_1 + P-network_3_1_AskP_2 + P-network_3_1_AskP_3 + P-network_0_3_RP_1 + P-network_0_3_RP_2 + P-network_0_3_RP_3 + P-network_0_2_AnnP_1 + P-network_0_2_AnnP_2 + P-network_0_2_AnnP_3 + P-network_2_2_RP_1 + P-network_2_2_RP_2 + P-network_2_2_RP_3 + P-network_1_2_AI_1 + P-network_1_2_AI_2 + P-network_1_2_AI_3 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_0_0_AskP_3 + P-network_3_1_AI_1 + P-network_3_1_AI_2 + P-network_3_1_AI_3 + P-network_0_1_AskP_3 + P-network_0_1_AskP_2 + P-network_0_1_AskP_1 + P-network_2_2_AI_3 + P-network_2_2_AI_2 + P-network_2_2_AI_1 + P-network_0_3_AI_3 + P-network_0_3_AI_2 + P-network_0_3_AI_1 + P-network_1_1_AnnP_1 + P-network_1_1_AnnP_2 + P-network_1_1_AnnP_3 + P-network_3_3_RP_1 + P-network_3_3_RP_2 + P-network_3_3_RP_3 + P-network_3_2_RP_3 + P-network_3_2_RP_2 + P-network_3_2_RP_1 + P-network_0_3_AnnP_3 + P-network_0_3_AnnP_2 + P-network_2_3_AI_1 + P-network_2_3_AI_2 + P-network_2_3_AI_3 + P-network_0_3_AnnP_1 + P-network_0_3_AskP_1 + P-network_0_3_AskP_2 + P-network_0_3_AskP_3 + P-network_1_3_RP_3 + P-network_1_3_RP_2 + P-network_1_3_RP_1 + P-network_1_0_RI_1 + P-network_1_0_RI_2 + P-network_1_0_RI_3 + P-network_3_2_AskP_3 + P-network_2_0_AnnP_1 + P-network_2_0_AnnP_2 + P-network_2_0_AnnP_3 + P-network_3_2_AskP_2 + P-network_3_2_AskP_1 + P-network_1_2_AskP_1 + P-network_1_2_AskP_2 + P-network_1_2_AskP_3 + P-network_0_2_RI_1 + P-network_0_2_RI_2 + P-network_0_2_RI_3 + P-network_2_1_RI_1 + P-network_2_1_RI_2 + P-network_2_1_RI_3 + P-network_3_3_RI_3 + P-network_3_3_RI_2 + P-network_2_3_AnnP_1 + P-network_2_3_AnnP_2 + P-network_2_3_AnnP_3 + P-network_3_3_RI_1 + P-network_0_1_RP_1 + P-network_0_1_RP_2 + P-network_0_1_RP_3 + P-network_2_1_AskP_1 + P-network_2_1_AskP_2 + P-network_2_1_AskP_3 + P-network_2_0_RP_1 + P-network_2_0_RP_2 + P-network_2_0_RP_3 + P-network_3_0_AI_3 + P-network_3_0_AI_2 + P-network_3_0_AI_1 + P-network_1_1_AI_3 + P-network_1_1_AI_2 + P-network_1_0_AI_1 + P-network_1_0_AI_2 + P-network_1_0_AI_3 + P-network_1_1_AI_1 + P-network_1_3_RI_1 + P-network_1_3_RI_2 + P-network_1_3_RI_3 + P-network_2_3_AskP_3 + P-network_2_3_AskP_2 + P-network_2_3_AskP_1 + P-network_3_2_RI_1 + P-network_3_2_RI_2 + P-network_3_2_RI_3 + P-network_2_1_RP_3 + P-network_3_2_AnnP_1 + P-network_3_2_AnnP_2 + P-network_3_2_AnnP_3 + P-network_2_1_RP_2 + P-network_2_1_RP_1 + P-network_3_0_AskP_1 + P-network_3_0_AskP_2 + P-network_3_0_AskP_3 + P-network_0_1_AnnP_1 + P-network_0_1_AnnP_2 + P-network_0_1_AnnP_3 + P-network_1_2_RP_1 + P-network_1_2_RP_2 + P-network_1_2_RP_3 + P-network_3_1_RP_1 + P-network_3_1_RP_2 + P-network_3_1_RP_3 + P-network_0_2_AI_1 + P-network_0_2_AI_2 + P-network_0_2_AI_3 + P-network_0_2_RP_3 + P-network_2_1_AI_1 + P-network_2_1_AI_2 + P-network_2_1_AI_3 + P-network_0_2_RP_2 + P-network_0_2_RP_1 + P-network_0_0_AnnP_3 + P-network_0_0_AnnP_2 + P-network_0_0_AnnP_1 + P-network_1_0_AnnP_1 + P-network_1_0_AnnP_2 + P-network_1_0_AnnP_3 + P-network_3_3_AskP_1 + P-network_3_3_AskP_2 + P-network_3_3_AskP_3 + P-network_2_3_RP_1 + P-network_2_3_RP_2 + P-network_2_3_RP_3 + P-network_3_1_AnnP_3 + P-network_3_1_AnnP_2 + P-network_3_1_AnnP_1 + P-network_2_2_RI_3 + P-network_2_2_RI_2 + P-network_2_2_RI_1 + P-network_1_3_AI_1 + P-network_1_3_AI_2 + P-network_1_3_AI_3 + P-network_0_3_RI_3 + P-network_3_2_AI_1 + P-network_3_2_AI_2 + P-network_3_2_AI_3 + P-network_0_3_RI_2 + P-network_0_2_AskP_1 + P-network_0_2_AskP_2 + P-network_0_2_AskP_3 + P-network_0_3_RI_1 + P-network_0_0_AI_3 + P-network_0_0_AI_2 + P-network_0_0_AI_1 + P-network_0_0_RI_1 + P-network_0_0_RI_2 + P-network_0_0_RI_3 + P-network_1_0_RP_3 + P-network_1_0_RP_2 + P-network_1_0_RP_1 + P-network_1_3_AnnP_1 + P-network_1_3_AnnP_2 + P-network_1_3_AnnP_3 + P-network_2_0_AskP_3 + P-network_2_0_AskP_2 + P-network_2_0_AskP_1 + P-network_1_1_AskP_1 + P-network_1_1_AskP_2 + P-network_1_1_AskP_3 + P-network_1_1_RI_1 + P-network_1_1_RI_2 + P-network_1_1_RI_3 + P-network_2_2_AnnP_3 + P-network_2_2_AnnP_2 + P-network_2_2_AnnP_1 + P-network_3_0_RI_1 + P-network_3_0_RI_2 + P-network_3_0_RI_3)
lola: after: (P-poll__pollEnd_3 + P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0 <= P-network_2_2_AnnP_0 + P-network_3_0_RI_0 + P-network_1_3_AnsP_0 + P-network_1_3_AnsP_1 + P-network_1_3_AnsP_2 + P-network_1_3_AnsP_3 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_2_0_AskP_0 + P-network_1_0_RP_0 + P-network_1_3_AnnP_0 + P-network_1_0_AnsP_3 + P-network_1_0_AnsP_2 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_0_0_RI_0 + P-network_0_0_AI_0 + P-network_0_3_RI_0 + P-network_0_2_AskP_0 + P-network_3_2_AI_0 + P-network_1_3_AI_0 + P-network_2_2_RI_0 + P-network_3_1_AnnP_0 + P-network_0_1_AnsP_3 + P-network_0_1_AnsP_2 + P-network_0_1_AnsP_1 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_2_AnsP_3 + P-network_0_1_AnsP_0 + P-network_2_3_RP_0 + P-network_3_3_AskP_0 + P-network_1_0_AnnP_0 + P-network_0_0_AnnP_0 + P-network_3_2_AnsP_3 + P-network_3_2_AnsP_2 + P-network_0_2_RP_0 + P-network_3_2_AnsP_1 + P-network_3_2_AnsP_0 + P-network_2_1_AI_0 + P-network_0_2_AI_0 + P-network_3_1_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_3_0_AskP_0 + P-network_2_3_AnsP_3 + P-network_2_3_AnsP_2 + P-network_2_1_RP_0 + P-network_2_3_AnsP_1 + P-network_2_3_AnsP_0 + P-network_3_2_AnnP_0 + P-network_2_3_AskP_0 + P-network_3_2_RI_0 + P-network_1_1_AI_0 + P-network_1_3_RI_0 + P-network_1_0_AI_0 + P-network_3_0_AI_0 + P-network_2_0_RP_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_3_3_RI_0 + P-network_2_3_AnnP_0 + P-network_3_1_AnsP_0 + P-network_3_1_AnsP_1 + P-network_3_1_AnsP_2 + P-network_3_1_AnsP_3 + P-network_2_0_AnsP_3 + 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_3 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_3_2_AskP_0 + P-network_1_1_AnsP_0 + P-network_2_0_AnnP_0 + P-network_1_3_RP_0 + P-network_1_0_RI_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_0_0_AnsP_3 + P-network_0_3_AnnP_0 + P-network_0_3_AskP_0 + P-network_2_3_AI_0 + P-network_3_2_RP_0 + P-network_0_2_AnsP_3 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_3_3_RP_0 + P-network_0_3_AI_0 + P-network_1_1_AnnP_0 + P-network_2_2_AI_0 + P-network_3_3_AnsP_3 + P-network_3_3_AnsP_2 + P-network_3_3_AnsP_1 + P-network_0_1_AskP_0 + P-network_3_3_AnsP_0 + P-network_3_1_AI_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_0_3_RP_0 + P-network_3_1_AskP_0 + P-network_3_3_AnnP_0 + P-network_3_0_AnsP_3 + P-network_3_0_AnsP_2 + P-network_3_0_AnsP_1 + P-network_3_0_AnsP_0 + P-network_2_3_RI_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_3_0_RP_0 + P-network_2_2_AskP_0 + P-network_1_1_RP_0 + P-network_2_1_AnsP_3 + P-network_2_1_AnsP_2 + P-network_1_2_AnnP_0 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_3_1_RI_0 + P-network_0_3_AnsP_0 + P-network_0_3_AnsP_1 + P-network_0_3_AnsP_2 + P-network_0_3_AnsP_3 + P-network_1_0_AskP_0 + P-network_3_0_AnnP_0 + P-network_1_2_RI_0 + P-network_1_3_AskP_0 + P-network_3_3_AI_0 + P-network_0_0_RP_0 + P-network_1_2_AnsP_3 + P-network_1_2_AnsP_2 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_0 + P-network_2_1_AnnP_0 + P-network_0_1_RI_0 + P-network_2_0_RI_0)
lola: place invariant simplifies atomic proposition
lola: before: (P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + P-electedPrimary_3 <= P-masterList_3_3_0 + P-masterList_3_3_1 + P-masterList_3_3_2 + P-masterList_3_3_3 + P-masterList_3_2_3 + P-masterList_3_2_2 + P-masterList_3_2_1 + P-masterList_3_2_0 + P-masterList_0_3_3 + P-masterList_0_3_2 + P-masterList_0_3_1 + P-masterList_0_3_0 + P-masterList_3_1_3 + P-masterList_3_1_2 + P-masterList_3_1_1 + P-masterList_3_1_0 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_1_3 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_1_2_3 + P-masterList_1_3_0 + P-masterList_1_3_1 + P-masterList_1_3_2 + P-masterList_1_3_3 + P-masterList_0_2_3 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_3 + 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_1_3 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 + P-masterList_2_2_3 + P-masterList_2_3_0 + P-masterList_2_3_1 + P-masterList_2_3_2 + P-masterList_2_3_3)
lola: after: (P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + P-electedPrimary_3 <= 6)
lola: LP says that atomic proposition is always true: (P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + P-electedPrimary_3 <= 6)
lola: place invariant simplifies atomic proposition
lola: before: (P-masterState_1_T_2 + P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_3_F_2 + P-masterState_3_F_1 + P-masterState_3_F_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_1_F_3 + P-masterState_0_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_3_T_3 + P-masterState_3_T_2 + P-masterState_3_T_1 + P-masterState_3_T_0 + P-masterState_0_T_3 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_2 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_3 + P-masterState_2_T_2 + P-masterState_2_T_1 + P-masterState_2_T_0 + P-masterState_2_F_3 + P-masterState_0_F_3 + P-masterState_3_F_3 + P-masterState_1_T_3 <= P-crashed_3 + P-crashed_2 + P-crashed_1 + P-crashed_0)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-masterList_3_3_0 + P-masterList_3_3_1 + P-masterList_3_3_2 + P-masterList_3_3_3 + P-masterList_3_2_3 + P-masterList_3_2_2 + P-masterList_3_2_1 + P-masterList_3_2_0 + P-masterList_0_3_3 + P-masterList_0_3_2 + P-masterList_0_3_1 + P-masterList_0_3_0 + P-masterList_3_1_3 + P-masterList_3_1_2 + P-masterList_3_1_1 + P-masterList_3_1_0 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_1_3 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_1_2_3 + P-masterList_1_3_0 + P-masterList_1_3_1 + P-masterList_1_3_2 + P-masterList_1_3_3 + P-masterList_0_2_3 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_3 + 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_1_3 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 + P-masterList_2_2_3 + P-masterList_2_3_0 + P-masterList_2_3_1 + P-masterList_2_3_2 + P-masterList_2_3_3 <= P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_3)
lola: after: (6 <= P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_3)
lola: LP says that atomic proposition is always false: (6 <= P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_3)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + P-poll__waitingMessage_3 <= P-masterList_3_3_0 + P-masterList_3_3_1 + P-masterList_3_3_2 + P-masterList_3_3_3 + P-masterList_3_2_3 + P-masterList_3_2_2 + P-masterList_3_2_1 + P-masterList_3_2_0 + P-masterList_0_3_3 + P-masterList_0_3_2 + P-masterList_0_3_1 + P-masterList_0_3_0 + P-masterList_3_1_3 + P-masterList_3_1_2 + P-masterList_3_1_1 + P-masterList_3_1_0 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_1_3 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_1_2_3 + P-masterList_1_3_0 + P-masterList_1_3_1 + P-masterList_1_3_2 + P-masterList_1_3_3 + P-masterList_0_2_3 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_3 + 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_1_3 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 + P-masterList_2_2_3 + P-masterList_2_3_0 + P-masterList_2_3_1 + P-masterList_2_3_2 + P-masterList_2_3_3)
lola: after: (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + P-poll__waitingMessage_3 <= 6)
lola: LP says that atomic proposition is always true: (P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + P-poll__waitingMessage_3 <= 6)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= P-negotiation_3_2_DONE + P-negotiation_1_0_NONE + P-negotiation_1_3_CO + P-negotiation_3_1_CO + P-negotiation_0_2_NONE + P-negotiation_2_1_NONE + P-negotiation_0_0_CO + P-negotiation_1_2_CO + P-negotiation_0_2_CO + P-negotiation_2_0_NONE + P-negotiation_0_1_NONE + P-negotiation_2_3_DONE + P-negotiation_1_3_NONE + P-negotiation_2_1_CO + P-negotiation_3_2_NONE + P-negotiation_3_1_DONE + P-negotiation_0_0_DONE + P-negotiation_1_2_DONE + P-negotiation_2_0_DONE + P-negotiation_0_1_DONE + P-negotiation_3_3_NONE + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_0_3_NONE + P-negotiation_3_0_CO + P-negotiation_3_3_DONE + P-negotiation_1_1_DONE + P-negotiation_3_0_DONE + P-negotiation_2_2_DONE + P-negotiation_0_3_DONE + P-negotiation_2_3_CO + P-negotiation_1_1_CO + P-negotiation_0_0_NONE + P-negotiation_1_1_NONE + P-negotiation_3_0_NONE + P-negotiation_2_2_CO + P-negotiation_0_3_CO + P-negotiation_3_3_CO + P-negotiation_1_2_NONE + P-negotiation_3_1_NONE + P-negotiation_2_3_NONE + P-negotiation_2_0_CO + P-negotiation_1_0_DONE + P-negotiation_3_2_CO + P-negotiation_0_1_CO + P-negotiation_0_2_DONE + P-negotiation_2_1_DONE + P-negotiation_1_3_DONE)
lola: after: (0 <= 8)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-crashed_3 + P-crashed_2 + P-crashed_1 + P-crashed_0 <= P-masterList_3_3_0 + P-masterList_3_3_1 + P-masterList_3_3_2 + P-masterList_3_3_3 + P-masterList_3_2_3 + P-masterList_3_2_2 + P-masterList_3_2_1 + P-masterList_3_2_0 + P-masterList_0_3_3 + P-masterList_0_3_2 + P-masterList_0_3_1 + P-masterList_0_3_0 + P-masterList_3_1_3 + P-masterList_3_1_2 + P-masterList_3_1_1 + P-masterList_3_1_0 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_1_3 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_1_2_3 + P-masterList_1_3_0 + P-masterList_1_3_1 + P-masterList_1_3_2 + P-masterList_1_3_3 + P-masterList_0_2_3 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_3 + 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_1_3 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 + P-masterList_2_2_3 + P-masterList_2_3_0 + P-masterList_2_3_1 + P-masterList_2_3_2 + P-masterList_2_3_3)
lola: after: (0 <= 6)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-dead_3 + P-dead_2 + P-dead_1 + P-dead_0 <= P-sendAnnPs__broadcasting_3_3 + P-sendAnnPs__broadcasting_3_2 + P-sendAnnPs__broadcasting_3_1 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_3 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1)
lola: after: (0 <= P-sendAnnPs__broadcasting_3_3 + P-sendAnnPs__broadcasting_3_2 + P-sendAnnPs__broadcasting_3_1 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_0_3 + P-sendAnnPs__broadcasting_0_2 + P-sendAnnPs__broadcasting_0_1)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 <= P-crashed_3 + P-crashed_2 + P-crashed_1 + P-crashed_0)
lola: after: (P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-masterState_1_T_2 + P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_3_F_2 + P-masterState_3_F_1 + P-masterState_3_F_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_1_F_3 + P-masterState_0_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_3_T_3 + P-masterState_3_T_2 + P-masterState_3_T_1 + P-masterState_3_T_0 + P-masterState_0_T_3 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_2 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_2_T_3 + P-masterState_2_T_2 + P-masterState_2_T_1 + P-masterState_2_T_0 + P-masterState_2_F_3 + P-masterState_0_F_3 + P-masterState_3_F_3 + P-masterState_1_T_3 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3)
lola: after: (3 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3)
lola: LP says that atomic proposition is always false: (3 <= P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3)
lola: place invariant simplifies atomic proposition
lola: before: (P-sendAnnPs__broadcasting_0_1 <= P-poll__networl_0_0_AskP_0)
lola: after: (P-sendAnnPs__broadcasting_0_1 <= 0)
lola: LP says that atomic proposition is always true: (P-sendAnnPs__broadcasting_0_1 <= 0)
lola: LP says that atomic proposition is always false: (1 <= P-poll__waitingMessage_0)
lola: LP says that atomic proposition is always false: (2 <= P-poll__networl_0_2_AnsP_2)
lola: place invariant simplifies atomic proposition
lola: before: (P-network_1_3_AI_3 <= P-poll__networl_2_3_AnnP_0)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (1 <= P-masterState_0_F_3)
lola: LP says that atomic proposition is always false: (2 <= P-poll__handlingMessage_2)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_0_0_AnnP_2 <= P-network_0_3_AI_2)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_0_2_RI_2 <= P-poll__networl_2_3_AI_2)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-negotiation_0_2_DONE <= P-network_0_1_RP_3)
lola: after: (P-negotiation_0_2_DONE <= 0)
lola: LP says that atomic proposition is always true: (P-negotiation_0_2_DONE <= 0)
lola: LP says that atomic proposition is always true: (P-poll__networl_2_3_AnsP_3 <= P-poll__handlingMessage_2)
lola: place invariant simplifies atomic proposition
lola: before: (P-sendAnnPs__broadcasting_2_3 <= P-poll__networl_2_3_AI_2)
lola: after: (P-sendAnnPs__broadcasting_2_3 <= 0)
lola: LP says that atomic proposition is always true: (P-sendAnnPs__broadcasting_2_3 <= 0)
lola: LP says that atomic proposition is always false: (1 <= P-negotiation_0_2_NONE)
lola: LP says that atomic proposition is always false: (1 <= P-sendAnnPs__broadcasting_1_2)
lola: place invariant simplifies atomic proposition
lola: before: (P-network_1_1_RP_1 <= P-network_3_0_AI_1)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-network_2_1_AskP_3)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (1 <= P-poll__networl_2_0_RP_0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-poll__networl_3_0_RI_0)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (2 <= P-poll__networl_2_2_AnnP_2)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (1 <= P-poll__networl_3_3_AI_0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_2_1_AskP_1 <= P-network_2_2_AI_0)
lola: after: (0 <= P-network_2_2_AI_0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_3_2_AnsP_1 <= P-network_2_0_RP_3)
lola: after: (P-poll__networl_3_2_AnsP_1 <= 0)
lola: LP says that atomic proposition is always true: (P-poll__networl_3_2_AnsP_1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= P-network_1_2_AnnP_2)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-poll__networl_1_3_AnnP_0)
lola: after: (3 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (2 <= P-network_2_1_AnnP_1)
lola: after: (2 <= 0)
lola: always false
lola: (NOT((E (F (FALSE)) AND TRUE)) OR (3 <= P-startNeg__broadcasting_1_1 + P-startNeg__broadcasting_2_1 + P-startNeg__broadcasting_2_2 + P-startNeg__broadcasting_2_3 + P-startNeg__broadcasting_0_1 + P-startNeg__broadcasting_3_1 + P-startNeg__broadcasting_3_2 + P-startNeg__broadcasting_3_3 + P-startNeg__broadcasting_0_2 + P-startNeg__broadcasting_0_3 + P-startNeg__broadcasting_1_2 + P-startNeg__broadcasting_1_3)) : ((2 <= P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3) OR A (F (A (G (TRUE))))) : A (F ((FALSE OR E (G (FALSE))))) : (E (G (E (F (TRUE)))) OR ((A (X (TRUE)) AND FALSE) OR (((1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2 + P-electionInit_3) AND ((3 <= P-poll__pollEnd_3 + P-poll__pollEnd_2 + P-poll__pollEnd_1 + P-poll__pollEnd_0) OR (2 <= P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3))) AND E (F ((3 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2 + P-electionInit_3)))))) : ((() OR E (F (()))) AND E ((() U ()))) : E (G (((1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2 + P-electionInit_3)))) : E (X (E (G (TRUE)))) : E (G (())) : E (F (())) : (A (X (TRUE)) AND A ((TRUE U FALSE))) : (E (G (())) OR E (F (E (X (FALSE))))) : E (F (A (F (FALSE)))) : (E (G (())) OR FALSE) : E ((TRUE U FALSE)) : E (F (())) : NOT((E (F (())) AND A (X (TRUE))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges

FORMULA NeoElection-PT-3-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUElola: ========================================

lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola:
FORMULA NeoElection-PT-3-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges

FORMULA NeoElection-PT-3-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2 + P-electionInit_3))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((1 <= P-electionInit_1 + P-electionInit_0 + P-electionInit_2 + P-electionInit_3))))
lola: processed formula length: 90
lola: 93 rewrites
lola: closed formula file NeoElection-PT-3-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 436 markings, 513 edges
lola: ========================================

FORMULA NeoElection-PT-3-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes no no yes yes no no no no yes no no yes
lola:
preliminary result: yes yes no yes no no yes yes no no no no yes no no yes
lola: memory consumption: 23444 KB
lola: time consumption: 2 seconds

BK_STOP 1527027012674

--------------------
content from 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="NeoElection-PT-3"
export BK_EXAMINATION="CTLCardinality"
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/NeoElection-PT-3.tgz
mv NeoElection-PT-3 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 lola"
echo " Input is NeoElection-PT-3, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r112-csrt-152666469300297"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;