Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................................
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is NeoElection-PT-5, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363810900102
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1463651140788

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ NeoElection-PT-5
FORMULA NeoElection-COL-5-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-CTLCardinality-3 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-CTLCardinality-5 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-CTLCardinality-6 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-CTLCardinality-8 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-CTLCardinality-9 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-CTLCardinality-11 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-CTLCardinality-13 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-CTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 7764/65536 symbol table entries, 409 collisions
lola: preprocessing...
lola: finding significant places
lola: 3090 places, 4674 transitions, 810 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1524 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-5-CTLCardinality.task
lola: read: AX ((AG (P-poll__pollEnd_0 + P-poll__pollEnd_1 + P-poll__pollEnd_2 + P-poll__pollEnd_3 + P-poll__pollEnd_4 + P-poll__pollEnd_5 <= P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3 + P-polling_4 + P-polling_5) AND AX (1 <= P-masterState_0_F_0 + P-masterState_0_F_1 + P-masterState_0_F_2 + P-masterState_0_F_3 + P-masterState_0_F_4 + P-masterState_0_F_5 + P-masterState_0_T_0 + P-masterState_0_T_1 ... (shortened)
lola: formula length: 374497
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 193 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((AG (-P-polling_5 + -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 + P-poll__pollEnd_0 + P-poll__pollEnd_1 + P-poll__pollEnd_2 + P-poll__pollEnd_3 + P-poll__pollEnd_4 + P-poll__pollEnd_5 <= 0) AND AX (-P-masterState_1_T_5 + -P-masterState_3_F_5 + -P-masterState_0_F_5 + -P-masterState_5_F_5 + -P-masterState_2_F_5 + -P-masterState_4_F_5 + -P-masterState_2_T_0 + -P-maste... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((!(E(TRUE U !(-P-polling_5 + -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 + P-poll__pollEnd_0 + P-poll__pollEnd_1 + P-poll__pollEnd_2 + P-poll__pollEnd_3 + P-poll__pollEnd_4 + P-poll__pollEnd_5 <= 0))) AND AX(-P-masterState_1_T_5 + -P-masterState_3_F_5 + -P-masterState_0_F_5 + -P-masterState_5_F_5 + -P-masterState_2_F_5 + -P-masterState_4_F_5 + -P-masterState_2_T_0 +... (shortened)
lola: processed formula length: 1902
lola: 13213890 rewrites
lola: formula mentions 84 of 3090 places; total mentions: 84
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AF (-P-electionInit_5 + -P-electionInit_3 + -P-electionInit_2 + -P-electionInit_0 + -P-electionInit_1 + -P-electionInit_4 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(TRUE U -P-electionInit_5 + -P-electionInit_3 + -P-electionInit_2 + -P-electionInit_0 + -P-electionInit_1 + -P-electionInit_4 > -3))))
lola: processed formula length: 148
lola: 13213889 rewrites
lola: formula mentions 6 of 3090 places; total mentions: 6
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-P-electionFailed_5 + -P-electionFailed_4 + -P-electionFailed_3 + -P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 <= -3) AND P-poll__networl_3_5_RI_5 + P-poll__networl_3_5_RI_4 + P-poll__networl_3_5_RI_3 + P-poll__networl_3_5_RI_2 + P-poll__networl_3_5_RI_1 + P-poll__networl_3_5_RI_0 + P-poll__networl_3_2_AI_5 + P-poll__networl_3_2_AI_4 + P-poll__networl_3_2_AI_3 + P-poll__net... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-P-electionFailed_5 + -P-electionFailed_4 + -P-electionFailed_3 + -P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -P-electionFailed_5 + -P-electionFailed_4 + -P-electionFailed_3 + -P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 <= -3)
lola: processed formula length: 145
lola: 13213888 rewrites
lola: formula mentions 6 of 3090 places; total mentions: 6
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG ((-P-masterState_1_T_5 + -P-masterState_3_F_5 + P-electionFailed_5 + P-electionFailed_4 + P-electionFailed_3 + P-electionFailed_2 + P-electionFailed_1 + P-electionFailed_0 + -P-masterState_0_F_5 + -P-masterState_5_F_5 + -P-masterState_2_F_5 + -P-masterState_4_F_5 + -P-masterState_2_T_0 + -P-masterState_2_T_1 + -P-masterState_2_T_2 + -P-masterState_2_T_3 + -P-masterState_2_T_4 + -P-masterSta... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !((-P-masterState_1_T_5 + -P-masterState_3_F_5 + P-electionFailed_5 + P-electionFailed_4 + P-electionFailed_3 + P-electionFailed_2 + P-electionFailed_1 + P-electionFailed_0 + -P-masterState_0_F_5 + -P-masterState_5_F_5 + -P-masterState_2_F_5 + -P-masterState_4_F_5 + -P-masterState_2_T_0 + -P-masterState_2_T_1 + -P-masterState_2_T_2 + -P-masterState_2_T_3 + -P-masterState_2_T_4 ... (shortened)
lola: processed formula length: 3739
lola: 13213889 rewrites
lola: formula mentions 138 of 3090 places; total mentions: 138
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-P-poll__networl_3_5_RI_5 + -P-poll__networl_3_5_RI_4 + -P-poll__networl_3_5_RI_3 + -P-poll__networl_3_5_RI_2 + -P-poll__networl_3_5_RI_1 + -P-poll__networl_3_5_RI_0 + -P-poll__networl_3_2_AI_5 + -P-poll__networl_3_2_AI_4 + -P-poll__networl_3_2_AI_3 + -P-poll__networl_3_2_AI_2 + -P-poll__networl_3_2_AI_1 + -P-poll__networl_3_2_AI_0 + -P-poll__networl_1_0_AskP_5 + -P-poll__networl_1_0_AskP_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -P-poll__networl_3_5_RI_5 + -P-poll__networl_3_5_RI_4 + -P-poll__networl_3_5_RI_3 + -P-poll__networl_3_5_RI_2 + -P-poll__networl_3_5_RI_1 + -P-poll__networl_3_5_RI_0 + -P-poll__networl_3_2_AI_5 + -P-poll__networl_3_2_AI_4 + -P-poll__networl_3_2_AI_3 + -P-poll__networl_3_2_AI_2 + -P-poll__networl_3_2_AI_1 + -P-poll__networl_3_2_AI_0 + -P-poll__networl_1_0_AskP_5 + -P-poll__net... (shortened)
lola: processed formula length: 37612
lola: 13213889 rewrites
lola: formula mentions 1296 of 3090 places; total mentions: 1296
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (P-negotiation_1_3_DONE + P-negotiation_4_5_NONE + P-negotiation_5_0_CO + P-negotiation_4_0_DONE + P-negotiation_2_1_DONE + P-negotiation_2_5_CO + P-negotiation_5_3_NONE + P-negotiation_0_2_DONE + P-negotiation_3_4_NONE + P-negotiation_1_5_NONE + P-negotiation_0_1_CO + P-negotiation_4_4_CO + P-negotiation_3_2_CO + P-negotiation_1_0_DONE + P-negotiation_4_2_NONE + P-negotiation_2_0_CO + P-negot... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (P-negotiation_1_3_DONE + P-negotiation_4_5_NONE + P-negotiation_5_0_CO + P-negotiation_4_0_DONE + P-negotiation_2_1_DONE + P-negotiation_2_5_CO + P-negotiation_5_3_NONE + P-negotiation_0_2_DONE + P-negotiation_3_4_NONE + P-negotiation_1_5_NONE + P-negotiation_0_1_CO + P-negotiation_4_4_CO + P-negotiation_3_2_CO + P-negotiation_1_0_DONE + P-negotiation_4_2_NONE + P-negotiation_2_0_CO + P-negoti... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((P-poll__networl_3_5_RI_5 + P-poll__networl_3_5_RI_4 + P-poll__networl_3_5_RI_3 + P-poll__networl_3_5_RI_2 + P-poll__networl_3_5_RI_1 + P-poll__networl_3_5_RI_0 + P-poll__networl_3_2_AI_5 + P-poll__networl_3_2_AI_4 + P-poll__networl_3_2_AI_3 + P-poll__networl_3_2_AI_2 + P-poll__networl_3_2_AI_1 + P-poll__networl_3_2_AI_0 + P-poll__networl_1_0_AskP_5 + P-poll__networl_1_0_AskP_4 + P-poll__netw... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P-poll__networl_3_5_RI_5 + P-poll__networl_3_5_RI_4 + P-poll__networl_3_5_RI_3 + P-poll__networl_3_5_RI_2 + P-poll__networl_3_5_RI_1 + P-poll__networl_3_5_RI_0 + P-poll__networl_3_2_AI_5 + P-poll__networl_3_2_AI_4 + P-poll__networl_3_2_AI_3 + P-poll__networl_3_2_AI_2 + P-poll__networl_3_2_AI_1 + P-poll__networl_3_2_AI_0 + P-poll__networl_1_0_AskP_5 + P-poll__networl_1_0_AskP_4 + P-poll__netwo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (AG (-P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 + -P-dead_5 <= -2)) AND (-P-poll__handlingMessage_5 + -P-poll__handlingMessage_4 + -P-poll__handlingMessage_3 + -P-poll__handlingMessage_2 + -P-poll__handlingMessage_0 + -P-poll__handlingMessage_1 > -3 AND -P-poll__waitingMessage_3 + P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 + P-elect... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG (-P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 + -P-dead_5 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !(-P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 + -P-dead_5 <= -2))))
lola: processed formula length: 101
lola: 13213889 rewrites
lola: formula mentions 6 of 3090 places; total mentions: 6
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG ((P-masterState_1_T_5 + P-masterState_3_F_5 + -P-electionFailed_5 + -P-electionFailed_4 + -P-electionFailed_3 + -P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 + P-masterState_0_F_5 + P-masterState_5_F_5 + P-masterState_2_F_5 + P-masterState_4_F_5 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_T_3 + P-masterState_2_T_4 + P-masterState_2_T_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((P-masterState_1_T_5 + P-masterState_3_F_5 + -P-electionFailed_5 + -P-electionFailed_4 + -P-electionFailed_3 + -P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 + P-masterState_0_F_5 + P-masterState_5_F_5 + P-masterState_2_F_5 + P-masterState_4_F_5 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_T_3 + P-masterState_2_T_4 + P-masterState_2_T_5 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((P-masterState_1_T_5 + P-masterState_3_F_5 + -P-electionFailed_5 + -P-electionFailed_4 + -P-electionFailed_3 + -P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 + P-masterState_0_F_5 + P-masterState_5_F_5 + P-masterState_2_F_5 + P-masterState_4_F_5 + P-masterState_2_T_0 + P-masterState_2_T_1 + P-masterState_2_T_2 + P-masterState_2_T_3 + P-masterState_2_T_4 + P-masterStat... (shortened)
lola: processed formula length: 1868
lola: 13213888 rewrites
lola: formula mentions 84 of 3090 places; total mentions: 84
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((-P-poll__waitingMessage_3 + -P-poll__waitingMessage_5 + -P-poll__waitingMessage_4 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 <= -2 AND -P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 + -P-crashed_5 <= -2) OR (-P-polling_5 + -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 <= -1 OR P-poll__handlingMessag... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((-P-poll__waitingMessage_3 + -P-poll__waitingMessage_5 + -P-poll__waitingMessage_4 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 <= -2 AND -P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 + -P-crashed_5 <= -2) OR (-P-polling_5 + -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 <= -1 OR P-poll__handl... (shortened)
lola: processed formula length: 706
lola: 13213888 rewrites
lola: formula mentions 30 of 3090 places; total mentions: 30
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((P-electionInit_5 + P-electionInit_3 + P-electionInit_2 + -P-poll__pollEnd_0 + -P-poll__pollEnd_1 + -P-poll__pollEnd_2 + -P-poll__pollEnd_3 + -P-poll__pollEnd_4 + -P-poll__pollEnd_5 + P-electionInit_0 + P-electionInit_1 + P-electionInit_4 <= 0 AND (-P-stage_1_PRIM + -P-stage_0_NEG + -P-stage_5_NEG + -P-stage_4_SEC + -P-stage_3_PRIM + -P-stage_2_NEG + -P-stage_0_PRIM + -P-stage_5_PRIM + -P-stage... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((P-electionInit_5 + P-electionInit_3 + P-electionInit_2 + -P-poll__pollEnd_0 + -P-poll__pollEnd_1 + -P-poll__pollEnd_2 + -P-poll__pollEnd_3 + -P-poll__pollEnd_4 + -P-poll__pollEnd_5 + P-electionInit_0 + P-electionInit_1 + P-electionInit_4 <= 0 AND (-P-stage_1_PRIM + -P-stage_0_NEG + -P-stage_5_NEG + -P-stage_4_SEC + -P-stage_3_PRIM + -P-stage_2_NEG + -P-stage_0_PRIM + -P-stage_5_PRIM + -P-stage_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 6 atomic propositions
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-startNeg__broadcasting_1_5 + -P-startNeg__broadcasting_1_4 + -P-startNeg__broadcasting_0_5 + -P-startNeg__broadcasting_0_4 + P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 + P-electedSecondary_4 + P-electedSecondary_5 + -P-startNeg__broadcasting_5_5 + -P-startNeg__broadcasting_5_4 + -P-startNeg__broadcasting_5_3 + -P-startNeg__broadcasting_5_2 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (-P-negotiation_1_3_DONE + -P-negotiation_4_5_NONE + -P-negotiation_5_0_CO + P-masterState_1_T_5 + -P-negotiation_4_0_DONE + -P-negotiation_2_1_DONE + -P-negotiation_2_5_CO + -P-negotiation_5_3_NONE + -P-negotiation_0_2_DONE + -P-negotiation_3_4_NONE + -P-negotiation_1_5_NONE + -P-negotiation_0_1_CO + -P-negotiation_4_4_CO + -P-negotiation_3_2_CO + -P-negotiation_1_0_DONE + -P-negotiation_4_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-negotiation_1_3_DONE + -P-negotiation_4_5_NONE + -P-negotiation_5_0_CO + P-masterState_1_T_5 + -P-negotiation_4_0_DONE + -P-negotiation_2_1_DONE + -P-negotiation_2_5_CO + -P-negotiation_5_3_NONE + -P-negotiation_0_2_DONE + -P-negotiation_3_4_NONE + -P-negotiation_1_5_NONE + -P-negotiation_0_1_CO + -P-negotiation_4_4_CO + -P-negotiation_3_2_CO + -P-negotiation_1_0_DONE + -P-negotiation_4_2_N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 + -P-crashed_5 + P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 + P-electedSecondary_4 + P-electedSecondary_5 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (AG (-P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 + -P-dead_5 <= -2)) OR P-electionInit_5 + P-electionInit_3 + P-electionInit_2 + -P-poll__waitingMessage_3 + -P-poll__waitingMessage_5 + -P-poll__waitingMessage_4 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 + P-electionInit_0 + P-electionInit_1 + P-electionInit_4 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 + -P-dead_5 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !(-P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 + -P-dead_5 <= -2))))
lola: processed formula length: 101
lola: 13213889 rewrites
lola: formula mentions 6 of 3090 places; total mentions: 6
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-P-masterState_1_T_5 + -P-masterState_3_F_5 + -P-masterState_0_F_5 + -P-masterState_5_F_5 + -P-masterState_2_F_5 + -P-masterState_4_F_5 + -P-masterState_2_T_0 + -P-masterState_2_T_1 + -P-masterState_2_T_2 + -P-masterState_2_T_3 + -P-masterState_2_T_4 + -P-masterState_2_T_5 + -P-masterState_4_F_4 + -P-masterState_4_F_3 + -P-masterState_4_F_2 + -P-masterState_4_F_1 + -P-masterState_4_F_0 + -P-maste... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-masterState_1_T_5 + -P-masterState_3_F_5 + -P-masterState_0_F_5 + -P-masterState_5_F_5 + -P-masterState_2_F_5 + -P-masterState_4_F_5 + -P-masterState_2_T_0 + -P-masterState_2_T_1 + -P-masterState_2_T_2 + -P-masterState_2_T_3 + -P-masterState_2_T_4 + -P-masterState_2_T_5 + -P-masterState_4_F_4 + -P-masterState_4_F_3 + -P-masterState_4_F_2 + -P-masterState_4_F_1 + -P-masterState_4_F_0 + -P-master... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-P-network_3_0_RI_5 + -P-network_3_0_RI_4 + -P-network_3_0_RI_3 + -P-network_3_0_RI_2 + -P-network_3_0_RI_1 + -P-network_2_2_AnnP_1 + -P-network_5_1_AskP_5 + -P-network_5_1_AskP_4 + -P-network_5_1_AskP_3 + -P-network_5_1_AskP_2 + -P-network_5_1_AskP_1 + -P-network_2_2_AnnP_2 + -P-network_2_2_AnnP_3 + -P-network_2_2_AnnP_4 + -P-network_2_2_AnnP_5 + -P-network_1_1_RI_5 + -P-network_1_1_RI_4 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-P-network_3_0_RI_5 + -P-network_3_0_RI_4 + -P-network_3_0_RI_3 + -P-network_3_0_RI_2 + -P-network_3_0_RI_1 + -P-network_2_2_AnnP_1 + -P-network_5_1_AskP_5 + -P-network_5_1_AskP_4 + -P-network_5_1_AskP_3 + -P-network_5_1_AskP_2 + -P-network_5_1_AskP_1 + -P-network_2_2_AnnP_2 + -P-network_2_2_AnnP_3 + -P-network_2_2_AnnP_4 + -P-network_2_2_AnnP_5 + -P-network_1_1_RI_5 + -P-network_1_1_RI_... (shortened)
lola: processed formula length: 63229
lola: 13213888 rewrites
lola: formula mentions 1506 of 3090 places; total mentions: 2802
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG (-P-negotiation_1_3_DONE + -P-negotiation_4_5_NONE + -P-negotiation_5_0_CO + -P-negotiation_4_0_DONE + -P-negotiation_2_1_DONE + -P-negotiation_2_5_CO + -P-negotiation_5_3_NONE + -P-negotiation_0_2_DONE + -P-negotiation_3_4_NONE + -P-negotiation_1_5_NONE + -P-negotiation_0_1_CO + -P-negotiation_4_4_CO + -P-negotiation_3_2_CO + -P-negotiation_1_0_DONE + -P-negotiation_4_2_NONE + -P-negotiati... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(-P-negotiation_1_3_DONE + -P-negotiation_4_5_NONE + -P-negotiation_5_0_CO + -P-negotiation_4_0_DONE + -P-negotiation_2_1_DONE + -P-negotiation_2_5_CO + -P-negotiation_5_3_NONE + -P-negotiation_0_2_DONE + -P-negotiation_3_4_NONE + -P-negotiation_1_5_NONE + -P-negotiation_0_1_CO + -P-negotiation_4_4_CO + -P-negotiation_3_2_CO + -P-negotiation_1_0_DONE + -P-negotiation_4_2_NONE ... (shortened)
lola: processed formula length: 2764
lola: 13213889 rewrites
lola: formula mentions 108 of 3090 places; total mentions: 108
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-P-poll__waitingMessage_3 + P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + P-electedPrimary_3 + P-electedPrimary_4 + P-electedPrimary_5 + -P-poll__waitingMessage_5 + -P-poll__waitingMessage_4 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -P-poll__waitingMessage_3 + P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + P-electedPrimary_3 + P-electedPrimary_4 + P-electedPrimary_5 + -P-poll__waitingMessage_5 + -P-poll__waitingMessage_4 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 > 0)
lola: processed formula length: 305
lola: 13213888 rewrites
lola: formula mentions 12 of 3090 places; total mentions: 12
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 935 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EF (P-electionInit_5 + P-electionInit_3 + P-electionInit_2 + -P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 + -P-crashed_5 + P-electionInit_0 + P-electionInit_1 + P-electionInit_4 <= 0) U AG (-P-network_3_0_RI_5 + -P-network_3_0_RI_4 + -P-network_3_0_RI_3 + -P-network_3_0_RI_2 + -P-network_3_0_RI_1 + -P-network_2_2_AnnP_1 + -P-network_5_1_AskP_5 + -P-network_5_1_AskP_4 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U P-electionInit_5 + P-electionInit_3 + P-electionInit_2 + -P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 + -P-crashed_5 + P-electionInit_0 + P-electionInit_1 + P-electionInit_4 <= 0) U !(E(TRUE U !(-P-network_3_0_RI_5 + -P-network_3_0_RI_4 + -P-network_3_0_RI_3 + -P-network_3_0_RI_2 + -P-network_3_0_RI_1 + -P-network_2_2_AnnP_1 + -P-network_5_1_AskP_5 + -P-netwo... (shortened)
lola: processed formula length: 33828
lola: 13213890 rewrites
lola: formula mentions 1488 of 3090 places; total mentions: 1488
lola: closed formula file NeoElection-COL-5-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: RESULT
lola: summary: no yes no unknown yes unknown unknown no unknown unknown yes unknown no unknown no no

BK_STOP 1463653745604

--------------------
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-5"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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-5.tgz
mv NeoElection-PT-5 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is NeoElection-PT-5, 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 r074kn-smll-146363810900102"
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 ;