Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 320K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is NeoElection-PT-2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666473900294
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-00
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-01
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-02
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-03
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-04
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-05
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-06
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-07
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-08
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-09
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-10
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-11
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-12
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-13
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-14
FORMULA_NAME NeoElection-PT-2-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1527152415761


BK_STOP 1527152459412

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using NeoElection-PT-2 as instance name.
Using NeoElection as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 167, 'Memory': 112.18, 'Tool': 'lola'}, {'Time': 310, 'Memory': 111.07, 'Tool': 'lola'}, {'Time': 1914, 'Memory': 1751.27, 'Tool': 'marcie'}, {'Time': 1917, 'Memory': 1812.06, 'Tool': 'marcie'}, {'Time': 4404, 'Memory': 403.63, 'Tool': 'itstools'}, {'Time': 4447, 'Memory': 451.87, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 26.37125748502994x far from the best tool lola.
ReachabilityFireability lola NeoElection-PT-2...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
NeoElection-PT-2: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ NeoElection-PT-2 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 795/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 438 places, 357 transitions, 153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 213 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-2-ReachabilityFireability.task
lola: A (G (((((NOT FIREABLE(T-poll__handleAI2_7) AND NOT FIREABLE(T-poll__handleAI2_8) AND NOT FIREABLE(T-poll__handleAI2_9) AND NOT FIREABLE(T-poll__handleAI2_10) AND NOT FIREABLE(T-poll__handleAI2_11) AND NOT FIREABLE(T-poll__handleAI2_12) AND NOT FIREABLE(T-poll__handleAI2_13) AND NOT FIREABLE(T-poll__handleAI2_14) AND NOT FIREABLE(T-poll__handleAI2_15) AND NOT FIREABLE(T-poll__handleAI2_16) AND NOT FIREABLE(T-poll__handleAI2_17) AND NOT FIREABLE(T-poll__handleAI2_18) AND NOT FIREABLE(T-poll__handleAI2_25) AND NOT FIREABLE(T-poll__handleAI2_26) AND NOT FIREABLE(T-poll__handleAI2_27) AND NOT FIREABLE(T-poll__handleAI2_28) AND NOT FIREABLE(T-poll__handleAI2_29) AND NOT FIREABLE(T-poll__handleAI2_30) AND NOT FIREABLE(T-poll__handleAI2_31) AND NOT FIREABLE(T-poll__handleAI2_32) AND NOT FIREABLE(T-poll__handleAI2_33) AND NOT FIREABLE(T-poll__handleAI2_34) AND NOT FIREABLE(T-poll__handleAI2_35) AND NOT FIREABLE(T-poll__handleAI2_36) AND NOT FIREABLE(T-poll__handleAI2_43) AND NOT FIREABLE(T-poll__handleAI2_44) AND NOT FIREABLE(T-poll__handleAI2_45) AND NOT FIREABLE(T-poll__handleAI2_46) AND NOT FIREABLE(T-poll__handleAI2_47) AND NOT FIREABLE(T-poll__handleAI2_48) AND NOT FIREABLE(T-poll__handleAI2_49) AND NOT FIREABLE(T-poll__handleAI2_50) AND NOT FIREABLE(T-poll__handleAI2_51) AND NOT FIREABLE(T-poll__handleAI2_52) AND NOT FIREABLE(T-poll__handleAI2_53) AND NOT FIREABLE(T-poll__handleAI2_54) AND NOT FIREABLE(T-poll__handleAI2_67) AND NOT FIREABLE(T-poll__handleAI2_68) AND NOT FIREABLE(T-poll__handleAI2_69) AND NOT FIREABLE(T-poll__handleAI2_70) AND NOT FIREABLE(T-poll__handleAI2_71) AND NOT FIREABLE(T-poll__handleAI2_72) AND NOT FIREABLE(T-poll__handleAI2_85) AND NOT FIREABLE(T-poll__handleAI2_86) AND NOT FIREABLE(T-poll__handleAI2_87) AND NOT FIREABLE(T-poll__handleAI2_88) AND NOT FIREABLE(T-poll__handleAI2_89) AND NOT FIREABLE(T-poll__handleAI2_90) AND NOT FIREABLE(T-poll__handleAI2_103) AND NOT FIREABLE(T-poll__handleAI2_104) AND NOT FIREABLE(T-poll__handleAI2_105) AND NOT FIREABLE(T-poll__handleAI2_106) AND NOT FIREABLE(T-poll__handleAI2_107) AND NOT FIREABLE(T-poll__handleAI2_108)) OR (NOT FIREABLE(T-poll__handleAnnP1_2) AND NOT FIREABLE(T-poll__handleAnnP1_3) AND NOT FIREABLE(T-poll__handleAnnP1_5) AND NOT FIREABLE(T-poll__handleAnnP1_6) AND NOT FIREABLE(T-poll__handleAnnP1_8) AND NOT FIREABLE(T-poll__handleAnnP1_9) AND NOT FIREABLE(T-poll__handleAnnP1_11) AND NOT FIREABLE(T-poll__handleAnnP1_12) AND NOT FIREABLE(T-poll__handleAnnP1_14) AND NOT FIREABLE(T-poll__handleAnnP1_15) AND NOT FIREABLE(T-poll__handleAnnP1_17) AND NOT FIREABLE(T-poll__handleAnnP1_18) AND NOT FIREABLE(T-poll__handleAnnP1_19) AND NOT FIREABLE(T-poll__handleAnnP1_21) AND NOT FIREABLE(T-poll__handleAnnP1_22) AND NOT FIREABLE(T-poll__handleAnnP1_24) AND NOT FIREABLE(T-poll__handleAnnP1_25) AND NOT FIREABLE(T-poll__handleAnnP1_27) AND NOT FIREABLE(T-poll__handleAnnP1_28) AND NOT FIREABLE(T-poll__handleAnnP1_30) AND NOT FIREABLE(T-poll__handleAnnP1_31) AND NOT FIREABLE(T-poll__handleAnnP1_33) AND NOT FIREABLE(T-poll__handleAnnP1_34) AND NOT FIREABLE(T-poll__handleAnnP1_36) AND NOT FIREABLE(T-poll__handleAnnP1_37) AND NOT FIREABLE(T-poll__handleAnnP1_38) AND NOT FIREABLE(T-poll__handleAnnP1_40) AND NOT FIREABLE(T-poll__handleAnnP1_41) AND NOT FIREABLE(T-poll__handleAnnP1_43) AND NOT FIREABLE(T-poll__handleAnnP1_44) AND NOT FIREABLE(T-poll__handleAnnP1_46) AND NOT FIREABLE(T-poll__handleAnnP1_47) AND NOT FIREABLE(T-poll__handleAnnP1_49) AND NOT FIREABLE(T-poll__handleAnnP1_50) AND NOT FIREABLE(T-poll__handleAnnP1_52) AND NOT FIREABLE(T-poll__handleAnnP1_53))) AND (FIREABLE(T-poll__handleAskP_1) OR FIREABLE(T-poll__handleAskP_2) OR FIREABLE(T-poll__handleAskP_3) OR FIREABLE(T-poll__handleAskP_4) OR FIREABLE(T-poll__handleAskP_5) OR FIREABLE(T-poll__handleAskP_6) OR FIREABLE(T-poll__handleAskP_7) OR FIREABLE(T-poll__handleAskP_8) OR FIREABLE(T-poll__handleAskP_9) OR FIREABLE(T-poll__handleAskP_10) OR FIREABLE(T-poll__handleAskP_11) OR FIREABLE(T-poll__handleAskP_12) OR FIREABLE(T-poll__handleAskP_13) OR FIREABLE(T-poll__handleAskP_14) OR FIREABLE(T-poll__handleAskP_15) OR FIREABLE(T-poll__handleAskP_16) OR FIREABLE(T-poll__handleAskP_17) OR FIREABLE(T-poll__handleAskP_18) OR FIREABLE(T-poll__handleAskP_19) OR FIREABLE(T-poll__handleAskP_20) OR FIREABLE(T-poll__handleAskP_21) OR FIREABLE(T-poll__handleAskP_22) OR FIREABLE(T-poll__handleAskP_23) OR FIREABLE(T-poll__handleAskP_24) OR FIREABLE(T-poll__handleAskP_25) OR FIREABLE(T-poll__handleAskP_26) OR FIREABLE(T-poll__handleAskP_27) OR FIREABLE(T-poll__handleAskP_28) OR FIREABLE(T-poll__handleAskP_29) OR FIREABLE(T-poll__handleAskP_30) OR FIREABLE(T-poll__handleAskP_31) OR FIREABLE(T-poll__handleAskP_32) OR FIREABLE(T-poll__handleAskP_33) OR FIREABLE(T-poll__handleAskP_34) OR FIREABLE(T-poll__handleAskP_35) OR FIREABLE(T-poll__handleAskP_36) OR FIREABLE(T-poll__handleAskP_37) OR FIREABLE(T-poll__handleAskP_38) OR FIREABLE(T-poll__handleAskP_39) OR FIREABLE(T-poll__handleAskP_40) OR FIREABLE(T-poll__handleAskP_41) OR FIREABLE(T-poll__handleAskP_42) OR FIREABLE(T-poll__handleAskP_43) OR FIREABLE(T-poll__handleAskP_44) OR FIREABLE(T-poll__handleAskP_45) OR FIREABLE(T-poll__handleAskP_46) OR FIREABLE(T-poll__handleAskP_47) OR FIREABLE(T-poll__handleAskP_48) OR FIREABLE(T-poll__handleAskP_49) OR FIREABLE(T-poll__handleAskP_50) OR FIREABLE(T-poll__handleAskP_51) OR FIREABLE(T-poll__handleAskP_52) OR FIREABLE(T-poll__handleAskP_53) OR FIREABLE(T-poll__handleAskP_54))) OR ((FIREABLE(T-startNeg__end_1) OR FIREABLE(T-startNeg__end_2) OR FIREABLE(T-startNeg__end_3)) AND (FIREABLE(T-poll__end_1) OR FIREABLE(T-poll__end_2) OR FIREABLE(T-poll__end_3)))))) : A (G ((NOT FIREABLE(T-sendAnnPs__start_1) AND NOT FIREABLE(T-sendAnnPs__start_2) AND NOT FIREABLE(T-sendAnnPs__start_3) AND NOT FIREABLE(T-poll__handleAnsP3_9) AND NOT FIREABLE(T-poll__handleAnsP3_12) AND NOT FIREABLE(T-poll__handleAnsP3_14) AND NOT FIREABLE(T-poll__handleAnsP3_17) AND NOT FIREABLE(T-poll__handleAnsP3_27) AND NOT FIREABLE(T-poll__handleAnsP3_30) AND NOT FIREABLE(T-poll__handleAnsP3_32) AND NOT FIREABLE(T-poll__handleAnsP3_35) AND NOT FIREABLE(T-poll__handleAnsP3_45) AND NOT FIREABLE(T-poll__handleAnsP3_48) AND NOT FIREABLE(T-poll__handleAnsP3_50) AND NOT FIREABLE(T-poll__handleAnsP3_53) AND NOT FIREABLE(T-poll__handleAnsP3_63) AND NOT FIREABLE(T-poll__handleAnsP3_66) AND NOT FIREABLE(T-poll__handleAnsP3_68) AND NOT FIREABLE(T-poll__handleAnsP3_71) AND NOT FIREABLE(T-poll__handleAnsP3_81) AND NOT FIREABLE(T-poll__handleAnsP3_84) AND NOT FIREABLE(T-poll__handleAnsP3_86) AND NOT FIREABLE(T-poll__handleAnsP3_89) AND NOT FIREABLE(T-poll__handleAnsP3_99) AND NOT FIREABLE(T-poll__handleAnsP3_102) AND NOT FIREABLE(T-poll__handleAnsP3_104) AND NOT FIREABLE(T-poll__handleAnsP3_107) AND NOT FIREABLE(T-poll__handleAnsP3_117) AND NOT FIREABLE(T-poll__handleAnsP3_120) AND NOT FIREABLE(T-poll__handleAnsP3_122) AND NOT FIREABLE(T-poll__handleAnsP3_125) AND NOT FIREABLE(T-poll__handleAnsP3_135) AND NOT FIREABLE(T-poll__handleAnsP3_138) AND NOT FIREABLE(T-poll__handleAnsP3_140) AND NOT FIREABLE(T-poll__handleAnsP3_143) AND NOT FIREABLE(T-poll__handleAnsP3_153) AND NOT FIREABLE(T-poll__handleAnsP3_156) AND NOT FIREABLE(T-poll__handleAnsP3_158) AND NOT FIREABLE(T-poll__handleAnsP3_161) AND NOT FIREABLE(T-poll__handleAnnP1_2) AND NOT FIREABLE(T-poll__handleAnnP1_3) AND NOT FIREABLE(T-poll__handleAnnP1_5) AND NOT FIREABLE(T-poll__handleAnnP1_6) AND NOT FIREABLE(T-poll__handleAnnP1_8) AND NOT FIREABLE(T-poll__handleAnnP1_9) AND NOT FIREABLE(T-poll__handleAnnP1_11) AND NOT FIREABLE(T-poll__handleAnnP1_12) AND NOT FIREABLE(T-poll__handleAnnP1_14) AND NOT FIREABLE(T-poll__handleAnnP1_15) AND NOT FIREABLE(T-poll__handleAnnP1_17) AND NOT FIREABLE(T-poll__handleAnnP1_18) AND NOT FIREABLE(T-poll__handleAnnP1_19) AND NOT FIREABLE(T-poll__handleAnnP1_21) AND NOT FIREABLE(T-poll__handleAnnP1_22) AND NOT FIREABLE(T-poll__handleAnnP1_24) AND NOT FIREABLE(T-poll__handleAnnP1_25) AND NOT FIREABLE(T-poll__handleAnnP1_27) AND NOT FIREABLE(T-poll__handleAnnP1_28) AND NOT FIREABLE(T-poll__handleAnnP1_30) AND NOT FIREABLE(T-poll__handleAnnP1_31) AND NOT FIREABLE(T-poll__handleAnnP1_33) AND NOT FIREABLE(T-poll__handleAnnP1_34) AND NOT FIREABLE(T-poll__handleAnnP1_36) AND NOT FIREABLE(T-poll__handleAnnP1_37) AND NOT FIREABLE(T-poll__handleAnnP1_38) AND NOT FIREABLE(T-poll__handleAnnP1_40) AND NOT FIREABLE(T-poll__handleAnnP1_41) AND NOT FIREABLE(T-poll__handleAnnP1_43) AND NOT FIREABLE(T-poll__handleAnnP1_44) AND NOT FIREABLE(T-poll__handleAnnP1_46) AND NOT FIREABLE(T-poll__handleAnnP1_47) AND NOT FIREABLE(T-poll__handleAnnP1_49) AND NOT FIREABLE(T-poll__handleAnnP1_50) AND NOT FIREABLE(T-poll__handleAnnP1_52) AND NOT FIREABLE(T-poll__handleAnnP1_53)))) : E (F ((NOT FIREABLE(T-poll__handleAnsP3_9) AND NOT FIREABLE(T-poll__handleAnsP3_12) AND NOT FIREABLE(T-poll__handleAnsP3_14) AND NOT FIREABLE(T-poll__handleAnsP3_17) AND NOT FIREABLE(T-poll__handleAnsP3_27) AND NOT FIREABLE(T-poll__handleAnsP3_30) AND NOT FIREABLE(T-poll__handleAnsP3_32) AND NOT FIREABLE(T-poll__handleAnsP3_35) AND NOT FIREABLE(T-poll__handleAnsP3_45) AND NOT FIREABLE(T-poll__handleAnsP3_48) AND NOT FIREABLE(T-poll__handleAnsP3_50) AND NOT FIREABLE(T-poll__handleAnsP3_53) AND NOT FIREABLE(T-poll__handleAnsP3_63) AND NOT FIREABLE(T-poll__handleAnsP3_66) AND NOT FIREABLE(T-poll__handleAnsP3_68) AND NOT FIREABLE(T-poll__handleAnsP3_71) AND NOT FIREABLE(T-poll__handleAnsP3_81) AND NOT FIREABLE(T-poll__handleAnsP3_84) AND NOT FIREABLE(T-poll__handleAnsP3_86) AND NOT FIREABLE(T-poll__handleAnsP3_89) AND NOT FIREABLE(T-poll__handleAnsP3_99) AND NOT FIREABLE(T-poll__handleAnsP3_102) AND NOT FIREABLE(T-poll__handleAnsP3_104) AND NOT FIREABLE(T-poll__handleAnsP3_107) AND NOT FIREABLE(T-poll__handleAnsP3_117) AND NOT FIREABLE(T-poll__handleAnsP3_120) AND NOT FIREABLE(T-poll__handleAnsP3_122) AND NOT FIREABLE(T-poll__handleAnsP3_125) AND NOT FIREABLE(T-poll__handleAnsP3_135) AND NOT FIREABLE(T-poll__handleAnsP3_138) AND NOT FIREABLE(T-poll__handleAnsP3_140) AND NOT FIREABLE(T-poll__handleAnsP3_143) AND NOT FIREABLE(T-poll__handleAnsP3_153) AND NOT FIREABLE(T-poll__handleAnsP3_156) AND NOT FIREABLE(T-poll__handleAnsP3_158) AND NOT FIREABLE(T-poll__handleAnsP3_161)))) : E (F ((FIREABLE(T-startSec_1) OR FIREABLE(T-startSec_2) OR FIREABLE(T-startSec_3) OR FIREABLE(T-poll__handleRP_1) OR FIREABLE(T-poll__handleRP_2) OR FIREABLE(T-poll__handleRP_3) OR FIREABLE(T-poll__handleRP_4) OR FIREABLE(T-poll__handleRP_5) OR FIREABLE(T-poll__handleRP_6) OR FIREABLE(T-poll__handleRP_7) OR FIREABLE(T-poll__handleRP_8) OR FIREABLE(T-poll__handleRP_9) OR FIREABLE(T-sendAnnPs__send_1) OR FIREABLE(T-sendAnnPs__send_2) OR FIREABLE(T-sendAnnPs__send_3) OR FIREABLE(T-sendAnnPs__send_7) OR FIREABLE(T-sendAnnPs__send_8) OR FIREABLE(T-sendAnnPs__send_9) OR FIREABLE(T-sendAnnPs__send_13) OR FIREABLE(T-sendAnnPs__send_14) OR FIREABLE(T-sendAnnPs__send_15) OR ((FIREABLE(T-poll__handleAI1_1) OR FIREABLE(T-poll__handleAI1_2) OR FIREABLE(T-poll__handleAI1_3) OR FIREABLE(T-poll__handleAI1_10) OR FIREABLE(T-poll__handleAI1_11) OR FIREABLE(T-poll__handleAI1_12) OR FIREABLE(T-poll__handleAI1_13) OR FIREABLE(T-poll__handleAI1_14) OR FIREABLE(T-poll__handleAI1_15) OR FIREABLE(T-poll__handleAI1_19) OR FIREABLE(T-poll__handleAI1_20) OR FIREABLE(T-poll__handleAI1_21) OR FIREABLE(T-poll__handleAI1_22) OR FIREABLE(T-poll__handleAI1_23) OR FIREABLE(T-poll__handleAI1_24) OR FIREABLE(T-poll__handleAI1_25) OR FIREABLE(T-poll__handleAI1_26) OR FIREABLE(T-poll__handleAI1_27)) AND (FIREABLE(T-sendAnnPs__end_1) OR FIREABLE(T-sendAnnPs__end_2) OR FIREABLE(T-sendAnnPs__end_3))) OR ((FIREABLE(T-poll__start_1) OR FIREABLE(T-poll__start_2) OR FIREABLE(T-poll__start_3)) AND (FIREABLE(T-sendAnnPs__send_1) OR FIREABLE(T-sendAnnPs__send_2) OR FIREABLE(T-sendAnnPs__send_3) OR FIREABLE(T-sendAnnPs__send_7) OR FIREABLE(T-sendAnnPs__send_8) OR FIREABLE(T-sendAnnPs__send_9) OR FIREABLE(T-sendAnnPs__send_13) OR FIREABLE(T-sendAnnPs__send_14) OR FIREABLE(T-sendAnnPs__send_15)))))) : A (G ((NOT FIREABLE(T-poll__handleAI1_1) AND NOT FIREABLE(T-poll__handleAI1_2) AND NOT FIREABLE(T-poll__handleAI1_3) AND NOT FIREABLE(T-poll__handleAI1_10) AND NOT FIREABLE(T-poll__handleAI1_11) AND NOT FIREABLE(T-poll__handleAI1_12) AND NOT FIREABLE(T-poll__handleAI1_13) AND NOT FIREABLE(T-poll__handleAI1_14) AND NOT FIREABLE(T-poll__handleAI1_15) AND NOT FIREABLE(T-poll__handleAI1_19) AND NOT FIREABLE(T-poll__handleAI1_20) AND NOT FIREABLE(T-poll__handleAI1_21) AND NOT FIREABLE(T-poll__handleAI1_22) AND NOT FIREABLE(T-poll__handleAI1_23) AND NOT FIREABLE(T-poll__handleAI1_24) AND NOT FIREABLE(T-poll__handleAI1_25) AND NOT FIREABLE(T-poll__handleAI1_26) AND NOT FIREABLE(T-poll__handleAI1_27) AND (FIREABLE(T-poll__iAmSecondary_1) OR FIREABLE(T-poll__iAmSecondary_2) OR FIREABLE(T-poll__iAmSecondary_3) OR FIREABLE(T-poll__iAmSecondary_4) OR FIREABLE(T-poll__iAmSecondary_5) OR FIREABLE(T-poll__iAmSecondary_6) OR FIREABLE(T-poll__iAmSecondary_7) OR FIREABLE(T-poll__iAmSecondary_8) OR FIREABLE(T-poll__iAmSecondary_9))))) : E (F ((FIREABLE(T-poll__handleAnsP3_9) OR FIREABLE(T-poll__handleAnsP3_12) OR FIREABLE(T-poll__handleAnsP3_14) OR FIREABLE(T-poll__handleAnsP3_17) OR FIREABLE(T-poll__handleAnsP3_27) OR FIREABLE(T-poll__handleAnsP3_30) OR FIREABLE(T-poll__handleAnsP3_32) OR FIREABLE(T-poll__handleAnsP3_35) OR FIREABLE(T-poll__handleAnsP3_45) OR FIREABLE(T-poll__handleAnsP3_48) OR FIREABLE(T-poll__handleAnsP3_50) OR FIREABLE(T-poll__handleAnsP3_53) OR FIREABLE(T-poll__handleAnsP3_63) OR FIREABLE(T-poll__handleAnsP3_66) OR FIREABLE(T-poll__handleAnsP3_68) OR FIREABLE(T-poll__handleAnsP3_71) OR FIREABLE(T-poll__handleAnsP3_81) OR FIREABLE(T-poll__handleAnsP3_84) OR FIREABLE(T-poll__handleAnsP3_86) OR FIREABLE(T-poll__handleAnsP3_89) OR FIREABLE(T-poll__handleAnsP3_99) OR FIREABLE(T-poll__handleAnsP3_102) OR FIREABLE(T-poll__handleAnsP3_104) OR FIREABLE(T-poll__handleAnsP3_107) OR FIREABLE(T-poll__handleAnsP3_117) OR FIREABLE(T-poll__handleAnsP3_120) OR FIREABLE(T-poll__handleAnsP3_122) OR FIREABLE(T-poll__handleAnsP3_125) OR FIREABLE(T-poll__handleAnsP3_135) OR FIREABLE(T-poll__handleAnsP3_138) OR FIREABLE(T-poll__handleAnsP3_140) OR FIREABLE(T-poll__handleAnsP3_143) OR FIREABLE(T-poll__handleAnsP3_153) OR FIREABLE(T-poll__handleAnsP3_156) OR FIREABLE(T-poll__handleAnsP3_158) OR FIREABLE(T-poll__handleAnsP3_161) OR FIREABLE(T-poll__handleAnnP1_2) OR FIREABLE(T-poll__handleAnnP1_3) OR FIREABLE(T-poll__handleAnnP1_5) OR FIREABLE(T-poll__handleAnnP1_6) OR FIREABLE(T-poll__handleAnnP1_8) OR FIREABLE(T-poll__handleAnnP1_9) OR FIREABLE(T-poll__handleAnnP1_11) OR FIREABLE(T-poll__handleAnnP1_12) OR FIREABLE(T-poll__handleAnnP1_14) OR FIREABLE(T-poll__handleAnnP1_15) OR FIREABLE(T-poll__handleAnnP1_17) OR FIREABLE(T-poll__handleAnnP1_18) OR FIREABLE(T-poll__handleAnnP1_19) OR FIREABLE(T-poll__handleAnnP1_21) OR FIREABLE(T-poll__handleAnnP1_22) OR FIREABLE(T-poll__handleAnnP1_24) OR FIREABLE(T-poll__handleAnnP1_25) OR FIREABLE(T-poll__handleAnnP1_27) OR FIREABLE(T-poll__handleAnnP1_28) OR FIREABLE(T-poll__handleAnnP1_30) OR FIREABLE(T-poll__handleAnnP1_31) OR FIREABLE(T-poll__handleAnnP1_33) OR FIREABLE(T-poll__handleAnnP1_34) OR FIREABLE(T-poll__handleAnnP1_36) OR FIREABLE(T-poll__handleAnnP1_37) OR FIREABLE(T-poll__handleAnnP1_38) OR FIREABLE(T-poll__handleAnnP1_40) OR FIREABLE(T-poll__handleAnnP1_41) OR FIREABLE(T-poll__handleAnnP1_43) OR FIREABLE(T-poll__handleAnnP1_44) OR FIREABLE(T-poll__handleAnnP1_46) OR FIREABLE(T-poll__handleAnnP1_47) OR FIREABLE(T-poll__handleAnnP1_49) OR FIREABLE(T-poll__handleAnnP1_50) OR FIREABLE(T-poll__handleAnnP1_52) OR FIREABLE(T-poll__handleAnnP1_53) OR FIREABLE(T-poll__handleAI1_1) OR FIREABLE(T-poll__handleAI1_2) OR FIREABLE(T-poll__handleAI1_3) OR FIREABLE(T-poll__handleAI1_10) OR FIREABLE(T-poll__handleAI1_11) OR FIREABLE(T-poll__handleAI1_12) OR FIREABLE(T-poll__handleAI1_13) OR FIREABLE(T-poll__handleAI1_14) OR FIREABLE(T-poll__handleAI1_15) OR FIREABLE(T-poll__handleAI1_19) OR FIREABLE(T-poll__handleAI1_20) OR FIREABLE(T-poll__handleAI1_21) OR FIREABLE(T-poll__handleAI1_22) OR FIREABLE(T-poll__handleAI1_23) OR FIREABLE(T-poll__handleAI1_24) OR
FIREABLE(T-poll__handleAI1_25) OR FIREABLE(T-poll__handleAI1_26) OR FIREABLE(T-poll__handleAI1_27)))) : E (F ((NOT FIREABLE(T-poll__handleAnsP2_3) AND NOT FIREABLE(T-poll__handleAnsP2_4) AND NOT FIREABLE(T-poll__handleAnsP2_5) AND NOT FIREABLE(T-poll__handleAnsP2_6) AND NOT FIREABLE(T-poll__handleAnsP2_9) AND NOT FIREABLE(T-poll__handleAnsP2_10) AND NOT FIREABLE(T-poll__handleAnsP2_11) AND NOT FIREABLE(T-poll__handleAnsP2_12) AND NOT FIREABLE(T-poll__handleAnsP2_15) AND NOT FIREABLE(T-poll__handleAnsP2_16) AND NOT FIREABLE(T-poll__handleAnsP2_17) AND NOT FIREABLE(T-poll__handleAnsP2_18) AND NOT FIREABLE(T-poll__handleAnsP2_21) AND NOT FIREABLE(T-poll__handleAnsP2_22) AND NOT FIREABLE(T-poll__handleAnsP2_23) AND NOT FIREABLE(T-poll__handleAnsP2_24) AND NOT FIREABLE(T-poll__handleAnsP2_27) AND NOT FIREABLE(T-poll__handleAnsP2_28) AND NOT FIREABLE(T-poll__handleAnsP2_29) AND NOT FIREABLE(T-poll__handleAnsP2_30) AND NOT FIREABLE(T-poll__handleAnsP2_33) AND NOT FIREABLE(T-poll__handleAnsP2_34) AND NOT FIREABLE(T-poll__handleAnsP2_35) AND NOT FIREABLE(T-poll__handleAnsP2_36) AND NOT FIREABLE(T-poll__handleAnsP2_39) AND NOT FIREABLE(T-poll__handleAnsP2_40) AND NOT FIREABLE(T-poll__handleAnsP2_41) AND NOT FIREABLE(T-poll__handleAnsP2_42) AND NOT FIREABLE(T-poll__handleAnsP2_45) AND NOT FIREABLE(T-poll__handleAnsP2_46) AND NOT FIREABLE(T-poll__handleAnsP2_47) AND NOT FIREABLE(T-poll__handleAnsP2_48) AND NOT FIREABLE(T-poll__handleAnsP2_51) AND NOT FIREABLE(T-poll__handleAnsP2_52) AND NOT FIREABLE(T-poll__handleAnsP2_53) AND NOT FIREABLE(T-poll__handleAnsP2_54)))) : A (G ((NOT FIREABLE(T-startNeg__start_1) AND NOT FIREABLE(T-startNeg__start_2) AND NOT FIREABLE(T-startNeg__start_3)))) : E (F ((NOT FIREABLE(T-poll__handleAskP_24) OR NOT FIREABLE(T-poll__handleAnsP4_6) OR NOT FIREABLE(T-poll__handleAI2_10) OR (FIREABLE(T-poll__handleAI1_20) AND FIREABLE(T-poll__handleAnsP3_140))))) : E (F ((((FIREABLE(T-poll__handleAI2_26) AND FIREABLE(T-poll__handleAnsP2_40)) OR FIREABLE(T-poll__handleAnsP4_27) OR (FIREABLE(T-poll__handleAnsP3_135) AND FIREABLE(T-poll__handleAnnP1_50))) AND (NOT FIREABLE(T-poll__handleAnsP2_3) OR NOT FIREABLE(T-poll__handleAskP_26) OR (NOT FIREABLE(T-poll__end_1) AND NOT FIREABLE(T-poll__handleAI2_46)))))) : A (G (FIREABLE(T-poll__handleAnsP3_107))) : E (F ((FIREABLE(T-poll__handleAI2_28) AND (FIREABLE(T-poll__handleAI2_107) OR FIREABLE(T-poll__handleAnsP4_48))))) : E (F ((FIREABLE(T-poll__handleAnsP4_3) OR FIREABLE(T-poll__handleAskP_40)))) : A (G (FIREABLE(T-poll__handleAnsP3_161))) : E (F (FIREABLE(T-poll__handleAnsP2_23))) : A (G (((NOT FIREABLE(T-startNeg__send_7) AND NOT FIREABLE(T-poll__handleAskP_51)) OR NOT FIREABLE(T-poll__handleAI2_49) OR NOT FIREABLE(T-poll__handleRI_9))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((NOT FIREABLE(T-poll__handleAI2_7) AND NOT FIREABLE(T-poll__handleAI2_8) AND NOT FIREABLE(T-poll__handleAI2_9) AND NOT FIREABLE(T-poll__handleAI2_10) AND NOT FIREABLE(T-poll__handleAI2_11) AND NOT FIREABLE(T-poll__handleAI2_12) AND NOT FIREABLE(T-poll__handleAI2_13) AND NOT FIREABLE(T-poll__handleAI2_14) AND NOT FIREABLE(T-poll__handleAI2_15) AND NOT FIREABLE(T-poll__handleAI2_16) AND NOT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T-sendAnnPs__start_1) AND NOT FIREABLE(T-sendAnnPs__start_2) AND NOT FIREABLE(T-sendAnnPs__start_3) AND NOT FIREABLE(T-poll__handleAnsP3_9) AND NOT FIREABLE(T-poll__handleAnsP3_12) AND NOT FIREABLE(T-poll__handleAnsP3_14) AND NOT FIREABLE(T-poll__handleAnsP3_17) AND NOT FIREABLE(T-poll__handleAnsP3_27) AND NOT FIREABLE(T-poll__handleAnsP3_30) AND NOT FIREABLE(T-poll__handleAnsP... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 219 literals and 75 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 173 markings, 280 edges
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T-poll__handleAnsP3_9) AND NOT FIREABLE(T-poll__handleAnsP3_12) AND NOT FIREABLE(T-poll__handleAnsP3_14) AND NOT FIREABLE(T-poll__handleAnsP3_17) AND NOT FIREABLE(T-poll__handleAnsP3_27) AND NOT FIREABLE(T-poll__handleAnsP3_30) AND NOT FIREABLE(T-poll__handleAnsP3_32) AND NOT FIREABLE(T-poll__handleAnsP3_35) AND NOT FIREABLE(T-poll__handleAnsP3_45) AND NOT FIREABLE(T-poll__hand... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-startSec_1) OR FIREABLE(T-startSec_2) OR FIREABLE(T-startSec_3) OR FIREABLE(T-poll__handleRP_1) OR FIREABLE(T-poll__handleRP_2) OR FIREABLE(T-poll__handleRP_3) OR FIREABLE(T-poll__handleRP_4) OR FIREABLE(T-poll__handleRP_5) OR FIREABLE(T-poll__handleRP_6) OR FIREABLE(T-poll__handleRP_7) OR FIREABLE(T-poll__handleRP_8) OR FIREABLE(T-poll__handleRP_9) OR FIREABLE(T-send... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 336 literals and 102 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 241 markings, 422 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T-poll__handleAI1_1) AND NOT FIREABLE(T-poll__handleAI1_2) AND NOT FIREABLE(T-poll__handleAI1_3) AND NOT FIREABLE(T-poll__handleAI1_10) AND NOT FIREABLE(T-poll__handleAI1_11) AND NOT FIREABLE(T-poll__handleAI1_12) AND NOT FIREABLE(T-poll__handleAI1_13) AND NOT FIREABLE(T-poll__handleAI1_14) AND NOT FIREABLE(T-poll__handleAI1_15) AND NOT FIREABLE(T-poll__handleAI1_19) AND NOT FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-poll__handleAnsP3_9) OR FIREABLE(T-poll__handleAnsP3_12) OR FIREABLE(T-poll__handleAnsP3_14) OR FIREABLE(T-poll__handleAnsP3_17) OR FIREABLE(T-poll__handleAnsP3_27) OR FIREABLE(T-poll__handleAnsP3_30) OR FIREABLE(T-poll__handleAnsP3_32) OR FIREABLE(T-poll__handleAnsP3_35) OR FIREABLE(T-poll__handleAnsP3_45) OR FIREABLE(T-poll__handleAnsP3_48) OR FIREABLE(T-poll__handleA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 270 literals and 90 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T-poll__handleAnsP2_3) AND NOT FIREABLE(T-poll__handleAnsP2_4) AND NOT FIREABLE(T-poll__handleAnsP2_5) AND NOT FIREABLE(T-poll__handleAnsP2_6) AND NOT FIREABLE(T-poll__handleAnsP2_9) AND NOT FIREABLE(T-poll__handleAnsP2_10) AND NOT FIREABLE(T-poll__handleAnsP2_11) AND NOT FIREABLE(T-poll__handleAnsP2_12) AND NOT FIREABLE(T-poll__handleAnsP2_15) AND NOT FIREABLE(T-poll__handleAn... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T-startNeg__start_1) AND NOT FIREABLE(T-startNeg__start_2) AND NOT FIREABLE(T-startNeg__start_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability-7.sara
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T-poll__handleAskP_24) OR NOT FIREABLE(T-poll__handleAnsP4_6) OR NOT FIREABLE(T-poll__handleAI2_10) OR (FIREABLE(T-poll__handleAI1_20) AND FIREABLE(T-poll__handleAnsP3_140)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 16 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file NeoElection-PT-2-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(T-poll__handleAI2_26) AND FIREABLE(T-poll__handleAnsP2_40)) OR FIREABLE(T-poll__handleAnsP4_27) OR (FIREABLE(T-poll__handleAnsP3_135) AND FIREABLE(T-poll__handleAnnP1_50))) AND (NOT FIREABLE(T-poll__handleAnsP2_3) OR NOT FIREABLE(T-poll__handleAskP_26) OR (NOT FIREABLE(T-poll__end_1) AND NOT FIREABLE(T-poll__handleAI2_46))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 164 literals and 25 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 151 markings, 192 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(T-poll__handleAnsP3_107)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability-10.sara
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-poll__handleAI2_28) AND (FIREABLE(T-poll__handleAI2_107) OR FIREABLE(T-poll__handleAnsP4_48)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 15 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability-11.sara
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: lola: state equation: calling and running sara
========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-poll__handleAnsP4_3) OR FIREABLE(T-poll__handleAskP_40))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file NeoElection-PT-2-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 117 markings, 142 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(T-poll__handleAnsP3_161)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability-13.sara
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: calling and running sara
sara: try reading problem file NeoElection-PT-2-ReachabilityFireability-13.sara.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(T-poll__handleAnsP2_23)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
sara: place or transition ordering is non-deterministic
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file NeoElection-PT-2-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 169 markings, 248 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(T-startNeg__send_7) AND NOT FIREABLE(T-poll__handleAskP_51)) OR NOT FIREABLE(T-poll__handleAI2_49) OR NOT FIREABLE(T-poll__handleRI_9))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to NeoElection-PT-2-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 10 markings, 13 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes no yes no no no no no no yes


FORMULA NeoElection-PT-2-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeoElection-PT-2-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-PT-2"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-2.tgz
mv NeoElection-PT-2 execution
cd execution
pwd
ls -lh

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