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-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363810900084
=====================================================================

--------------------
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-3-CTLCardinality-0
FORMULA_NAME NeoElection-COL-3-CTLCardinality-1
FORMULA_NAME NeoElection-COL-3-CTLCardinality-10
FORMULA_NAME NeoElection-COL-3-CTLCardinality-11
FORMULA_NAME NeoElection-COL-3-CTLCardinality-12
FORMULA_NAME NeoElection-COL-3-CTLCardinality-13
FORMULA_NAME NeoElection-COL-3-CTLCardinality-14
FORMULA_NAME NeoElection-COL-3-CTLCardinality-15
FORMULA_NAME NeoElection-COL-3-CTLCardinality-2
FORMULA_NAME NeoElection-COL-3-CTLCardinality-3
FORMULA_NAME NeoElection-COL-3-CTLCardinality-4
FORMULA_NAME NeoElection-COL-3-CTLCardinality-5
FORMULA_NAME NeoElection-COL-3-CTLCardinality-6
FORMULA_NAME NeoElection-COL-3-CTLCardinality-7
FORMULA_NAME NeoElection-COL-3-CTLCardinality-8
FORMULA_NAME NeoElection-COL-3-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463645088350

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ NeoElection-PT-3
FORMULA NeoElection-COL-3-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-3-CTLCardinality-15 TRUE 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: 1988/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 972 places, 1016 transitions, 300 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 472 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-3-CTLCardinality.task
lola: read: EF (3 <= P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 + P-electedPrimary_3) : EG (EF (!(P-masterList_0_1_0 + P-masterList_0_1_1 + P-masterList_0_1_2 + P-masterList_0_1_3 + P-masterList_0_2_0 + P-masterList_0_2_1 + P-masterList_0_2_2 + P-masterList_0_2_3 + P-masterList_0_3_0 + P-masterList_0_3_1 + P-masterList_0_3_2 + P-masterList_0_3_3 + P-masterList_1_1_0 + P-masterList_1_1_1 + P-... (shortened)
lola: formula length: 23049
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-electedPrimary_3 + -P-electedPrimary_2 + -P-electedPrimary_1 + -P-electedPrimary_0 <= -3)
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 40 bytes per marking, with 20 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: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_2_2_3 + P-masterList_2_2_2 + P-masterList_2_2_1 + P-masterList_2_2_0 + P-masterList_2_1_3 + P-masterList_2_1_2 + P-masterList_2_1_1 + P-masterList_2_1_0 + P-masterList_0_1_0 + P-masterList_0_1_1 + P-masterList_0_1_2 + P-masterList_0_1_3 + P-masterList_0_2_0 + P-masterList_0_2_1 + P-masterList_0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_2_2_3 + P-masterList_2_2_2 + P-masterList_2_2_1 + P-masterList_2_2_0 + P-masterList_2_1_3 + P-masterList_2_1_2 + P-masterList_2_1_1 + P-masterList_2_1_0 + P-masterList_0_1_0 + P-masterList_0_1_1 + P-masterList_0_1_2 + P-masterList_0_1_3 + P-masterList_0_2_0 + P-masterList_0_2_1 + ... (shortened)
lola: processed formula length: 1083
lola: 129674 rewrites
lola: formula mentions 52 of 972 places; total mentions: 52
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_2_2_3 + P-masterList_2_2_2 + P-masterList_2_2_1 + P-masterList_2_2_0 + P-masterList_2_1_3 + P-masterList_2_1_2 + P-masterList_2_1_1 + P-masterList_2_1_0 + P-masterList_0_1_0 + P-masterList_0_1_1 + P-masterList_0_1_2 + P-masterList_0_1_3 + P-masterList_0_2_0 + P-masterList_0_2_1 + P-masterList_0_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 40 bytes per marking, with 20 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: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF ((-P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 <= -1 AND -P-poll__waitingMessage_3 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness 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 <= -1 AND -P-poll__waitingMessage_3 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 <= -2)))))
lola: processed formula length: 199
lola: 129674 rewrites
lola: formula mentions 8 of 972 places; total mentions: 8
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG (-P-stage_1_PRIM + -P-stage_0_NEG + -P-stage_3_PRIM + -P-stage_2_NEG + -P-stage_0_PRIM + -P-stage_2_PRIM + -P-stage_1_NEG + -P-stage_3_SEC + -P-stage_0_SEC + -P-stage_1_SEC + -P-stage_3_NEG + -P-stage_2_SEC > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !(-P-stage_1_PRIM + -P-stage_0_NEG + -P-stage_3_PRIM + -P-stage_2_NEG + -P-stage_0_PRIM + -P-stage_2_PRIM + -P-stage_1_NEG + -P-stage_3_SEC + -P-stage_0_SEC + -P-stage_1_SEC + -P-stage_3_NEG + -P-stage_2_SEC > -2))))
lola: processed formula length: 236
lola: 129674 rewrites
lola: formula mentions 12 of 972 places; total mentions: 12
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AF ((P-electionFailed_3 + P-electionFailed_2 + P-electionFailed_1 + P-electionFailed_0 + -P-electedSecondary_3 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 <= 0 AND -P-poll__waitingMessage_3 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(TRUE U (P-electionFailed_3 + P-electionFailed_2 + P-electionFailed_1 + P-electionFailed_0 + -P-electedSecondary_3 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 <= 0 AND -P-poll__waitingMessage_3 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 <= -3)))))
lola: processed formula length: 330
lola: 129674 rewrites
lola: formula mentions 12 of 972 places; total mentions: 12
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: subprocess 6 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF (-P-sendAnnPs__broadcasting_0_1 + -P-sendAnnPs__broadcasting_0_2 + -P-sendAnnPs__broadcasting_0_3 + -P-sendAnnPs__broadcasting_1_1 + -P-sendAnnPs__broadcasting_1_2 + -P-sendAnnPs__broadcasting_1_3 + -P-sendAnnPs__broadcasting_2_1 + -P-sendAnnPs__broadcasting_2_2 + -P-sendAnnPs__broadcasting_2_3 + -P-sendAnnPs__broadcasting_3_1 + -P-sendAnnPs__broadcasting_3_2 + -P-sendAnnPs__broadcasting_3_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U -P-sendAnnPs__broadcasting_0_1 + -P-sendAnnPs__broadcasting_0_2 + -P-sendAnnPs__broadcasting_0_3 + -P-sendAnnPs__broadcasting_1_1 + -P-sendAnnPs__broadcasting_1_2 + -P-sendAnnPs__broadcasting_1_3 + -P-sendAnnPs__broadcasting_2_1 + -P-sendAnnPs__broadcasting_2_2 + -P-sendAnnPs__broadcasting_2_3 + -P-sendAnnPs__broadcasting_3_1 + -P-sendAnnPs__broadcasting_3_2 + -P-sendAnnPs__b... (shortened)
lola: processed formula length: 425
lola: 129674 rewrites
lola: formula mentions 12 of 972 places; total mentions: 12
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: subprocess 7 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-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_3 + -P-poll__networl_1_0_AskP_2 + -P-poll__networl_1_0_AskP_1 + -P-poll__networl_1_0_AskP_0 + -P-poll__networl_0_0_RI_0 + -P-poll__networl_0_3_AnsP_0 + -P-poll__networl_1_3_AI_3 + -P-poll__networl_1_3_AI_2 + -P-poll__networl_1_3_AI_1 + -P-poll__networl_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -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_3 + -P-poll__networl_1_0_AskP_2 + -P-poll__networl_1_0_AskP_1 + -P-poll__networl_1_0_AskP_0 + -P-poll__networl_0_0_RI_0 + -P-poll__networl_0_3_AnsP_0 + -P-poll__networl_1_3_AI_3 + -P-poll__networl_1_3_AI_2 + -P-poll__networl_1_3_AI_1 + -P-p... (shortened)
lola: processed formula length: 11164
lola: 129674 rewrites
lola: formula mentions 384 of 972 places; total mentions: 384
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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 8 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(P-negotiation_1_3_DONE + P-negotiation_2_1_DONE + P-negotiation_0_2_DONE + P-negotiation_0_1_CO + P-negotiation_3_2_CO + P-negotiation_1_0_DONE + P-negotiation_2_0_CO + P-negotiation_2_3_NONE + P-negotiation_3_1_NONE + P-negotiation_1_2_NONE + P-negotiation_3_3_CO + -P-poll__waitingMessage_3 + P-negotiation_0_3_CO + P-negotiation_2_2_CO + P-negotiation_3_0_NONE + P-negotiation_1_1_NONE + P-negot... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(P-negotiation_1_3_DONE + P-negotiation_2_1_DONE + P-negotiation_0_2_DONE + P-negotiation_0_1_CO + P-negotiation_3_2_CO + P-negotiation_1_0_DONE + P-negotiation_2_0_CO + P-negotiation_2_3_NONE + P-negotiation_3_1_NONE + P-negotiation_1_2_NONE + P-negotiation_3_3_CO + -P-poll__waitingMessage_3 + P-negotiation_0_3_CO + P-negotiation_2_2_CO + P-negotiation_3_0_NONE + P-negotiation_1_1_NONE + P-negot... (shortened)
lola: processed formula length: 1502
lola: 129674 rewrites
lola: formula mentions 56 of 972 places; total mentions: 60
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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 9 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 <= -2)
lola: processed formula length: 73
lola: 129673 rewrites
lola: formula mentions 4 of 972 places; total mentions: 4
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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 10 will run for 585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EG (-P-electedPrimary_3 + -P-electedPrimary_2 + -P-electedPrimary_1 + -P-electedPrimary_0 <= -3) OR (EF (P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_2_2_3 + P-masterList_2_2_2 + P-masterList_2_2_1 + P-masterList_2_2_0 + P-masterList_2_1_3 + P-masterList_2_1_2 + P-masterList_2_1_1 + P-masterList_2_1_0 + P-masterList_0_1_0 + P-masterList_0_1_1 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-P-electedPrimary_3 + -P-electedPrimary_2 + -P-electedPrimary_1 + -P-electedPrimary_0 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-P-electedPrimary_3 + -P-electedPrimary_2 + -P-electedPrimary_1 + -P-electedPrimary_0 <= -3)))
lola: processed formula length: 107
lola: 129673 rewrites
lola: formula mentions 4 of 972 places; total mentions: 4
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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 11 will run for 702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_2_2_3 + P-masterList_2_2_2 + P-masterList_2_2_1 + P-masterList_2_2_0 + P-masterList_2_1_3 + P-masterList_2_1_2 + P-masterList_2_1_1 + P-masterList_2_1_0 + P-masterList_0_1_0 + P-masterList_0_1_1 + P-masterList_0_1_2 + P-masterList_0_1_3 + P-masterList_0_2_0 + P-masterList_0_2_1 + P-masterList_0_2_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 40 bytes per marking, with 20 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: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-poll__pollEnd_0 + -P-poll__pollEnd_1 + -P-poll__pollEnd_2 + -P-poll__pollEnd_3 <= -3)
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 40 bytes per marking, with 20 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: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P-stage_1_PRIM + P-stage_0_NEG + P-stage_3_PRIM + P-stage_2_NEG + P-stage_0_PRIM + P-stage_2_PRIM + P-stage_1_NEG + P-stage_3_SEC + P-stage_0_SEC + P-stage_1_SEC + -P-poll__pollEnd_0 + -P-poll__pollEnd_1 + -P-poll__pollEnd_2 + -P-poll__pollEnd_3 + P-stage_3_NEG + P-stage_2_SEC <= 0 AND (-P-poll__pollEnd_0 + -P-poll__pollEnd_1 + -P-poll__pollEnd_2 + -P-poll__pollEnd_3 <= -2 AND -P-electionInit_3 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: lola: subprocess 11 will run for 693 seconds at most (--localtimelimit=0)
========================================
lola: ========================================
lola: ...considering subproblem: EG (EX (-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + P-poll__pollEnd_0 + P-poll__pollEnd_1 + P-poll__pollEnd_2 + P-poll__pollEnd_3 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(EX(-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + P-poll__pollEnd_0 + P-poll__pollEnd_1 + P-poll__pollEnd_2 + P-poll__pollEnd_3 <= 0))))
lola: processed formula length: 162
lola: 129674 rewrites
lola: formula mentions 8 of 972 places; total mentions: 8
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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 12 will run for 863 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file NeoElection-COL-3-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 1151 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (A(-P-masterList_2_3_3 + -P-masterList_2_3_2 + -P-masterList_2_3_1 + -P-masterList_2_3_0 + -P-masterList_2_2_3 + -P-masterList_2_2_2 + -P-masterList_2_2_1 + -P-masterList_2_2_0 + -P-masterList_2_1_3 + -P-masterList_2_1_2 + -P-masterList_2_1_1 + -P-masterList_2_1_0 + -P-masterList_0_1_0 + -P-masterList_0_1_1 + -P-masterList_0_1_2 + -P-masterList_0_1_3 + -P-masterList_0_2_0 + -P-masterList_0_2_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A(-P-masterList_2_3_3 + -P-masterList_2_3_2 + -P-masterList_2_3_1 + -P-masterList_2_3_0 + -P-masterList_2_2_3 + -P-masterList_2_2_2 + -P-masterList_2_2_1 + -P-masterList_2_2_0 + -P-masterList_2_1_3 + -P-masterList_2_1_2 + -P-masterList_2_1_1 + -P-masterList_2_1_0 + -P-masterList_0_1_0 + -P-masterList_0_1_1 + -P-masterList_0_1_2 + -P-masterList_0_1_3 + -P-masterList_0_2_0 + -P-masterList_0... (shortened)
lola: processed formula length: 1190
lola: 129674 rewrites
lola: formula mentions 52 of 972 places; total mentions: 52
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: subprocess 14 will run for 1726 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((AG (-P-masterList_2_3_3 + -P-masterList_2_3_2 + -P-masterList_2_3_1 + -P-masterList_2_3_0 + -P-masterList_2_2_3 + -P-masterList_2_2_2 + -P-masterList_2_2_1 + -P-masterList_2_2_0 + -P-masterList_2_1_3 + -P-masterList_2_1_2 + -P-masterList_2_1_1 + -P-masterList_2_1_0 + -P-masterList_0_1_0 + -P-masterList_0_1_1 + -P-masterList_0_1_2 + -P-masterList_0_1_3 + -P-masterList_0_2_0 + -P-masterList_0_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((!(E(TRUE U !(-P-masterList_2_3_3 + -P-masterList_2_3_2 + -P-masterList_2_3_1 + -P-masterList_2_3_0 + -P-masterList_2_2_3 + -P-masterList_2_2_2 + -P-masterList_2_2_1 + -P-masterList_2_2_0 + -P-masterList_2_1_3 + -P-masterList_2_1_2 + -P-masterList_2_1_1 + -P-masterList_2_1_0 + -P-masterList_0_1_0 + -P-masterList_0_1_1 + -P-masterList_0_1_2 + -P-masterList_0_1_3 + -P-masterList_0_2_0 + -P-master... (shortened)
lola: processed formula length: 1169
lola: 129674 rewrites
lola: formula mentions 52 of 972 places; total mentions: 52
lola: closed formula file NeoElection-COL-3-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: RESULT
lola: summary: no yes no no no no no yes yes no no no no no yes yes
lola: ========================================

BK_STOP 1463645182595

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeoElection-PT-3"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/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-3.tgz
mv NeoElection-PT-3 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-3, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r074kn-smll-146363810900084"
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 ;