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

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

=== Now, execution of the tool begins

BK_START 1463649377766

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ NeoElection-PT-4
FORMULA NeoElection-COL-4-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-ReachabilityCardinality-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: 4170/65536 symbol table entries, 89 collisions
lola: preprocessing...
lola: finding significant places
lola: 1830 places, 2340 transitions, 515 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 895 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-4-ReachabilityCardinality.task
lola: read: AG (P-poll__pollEnd_0 + P-poll__pollEnd_1 + P-poll__pollEnd_2 + P-poll__pollEnd_3 + P-poll__pollEnd_4 <= P-network_0_0_AskP_0 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_0_0_AskP_3 + P-network_0_0_AskP_4 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_0_0_AnsP_3 + P-network_0_0_AnsP_4 + P-network_0_0_RI_0 + P-network_0_0_RI_1 + P-network_0_0_RI_2 + P-... (shortened)
lola: formula length: 140484
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-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_2_2_AnnP_2 + -P-network_2_2_AnnP_3 + -P-network_2_2_AnnP_4 + -P-network_1_1_RI_4 + -P-network_1_1_RI_3 + -P-network_1_1_RI_2 + -P-network_1_1_RI_1 + -P-network_4_3_AI_4 + -P-network_4_3_AI_3 + -P-network_4_3_AI_2 + -P-network_4_3_AI_1 + -P-network_2_4_AI_4 + -P-network_2_4... (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 68 bytes per marking, with 29 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 233 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 + -P-poll__pollEnd_4 > -2)
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 68 bytes per marking, with 29 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-P-electedSecondary_4 + -P-electedSecondary_3 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 + P-poll__pollEnd_0 + P-poll__pollEnd_1 + P-poll__pollEnd_2 + P-poll__pollEnd_3 + P-poll__pollEnd_4 > 0 AND P-negotiation_1_3_DONE + P-negotiation_4_0_DONE + P-negotiation_2_1_DONE + P-negotiation_0_2_DONE + P-negotiation_3_4_NONE + P-negotiation_0_1_CO + P-negotiation_4_4_CO... (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 68 bytes per marking, with 29 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: Transformation into DNF: expect 6 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityCardinality-2.sara
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: AG ((-P-negotiation_1_3_DONE + -P-negotiation_4_0_DONE + -P-negotiation_2_1_DONE + -P-negotiation_0_2_DONE + -P-negotiation_3_4_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-negotiation_2_3_NONE + -P-negotiation_0_4_NONE + -P-negotiation_3_1_NONE + -P-negotiation_1_2_NONE + -P-negotiatio... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariancelola:
calling and running sara
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
sara: try reading problem file NeoElection-COL-4-ReachabilityCardinality-2.sara.
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 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-electionFailed_4 + -P-electionFailed_3 + -P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 <= -1)
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 68 bytes per marking, with 29 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 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-negotiation_1_3_DONE + -P-negotiation_4_0_DONE + -P-negotiation_2_1_DONE + -P-negotiation_0_2_DONE + -P-negotiation_3_4_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-negotiation_2_3_NONE + -P-negotiation_0_4_NONE + P-electionInit_4 + P-electionInit_3 + P-electionInit_2 + -P-negoti... (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 68 bytes per marking, with 29 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 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 <= -3 OR (-P-stage_1_PRIM + -P-stage_0_NEG + -P-stage_4_SEC + -P-stage_3_PRIM + -P-stage_2_NEG + -P-stage_0_PRIM + P-dead_0 + P-dead_1 + P-dead_2 + P-dead_3 + P-dead_4 + -P-stage_4_NEG + -P-stage_2_PRIM + -P-stage_1_NEG + -P-stage_0_SEC + -P-stage_3_SEC + -P-stage_1_SEC + -P-stage_4_PRIM + -P-stage_3_NEG + -P-stage_2_SEC... (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 68 bytes per marking, with 29 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: Transformation into DNF: expect 4 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 + P-dead_0 + P-dead_1 + P-dead_2 + P-dead_3 + P-dead_4 <= 0)
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 68 bytes per marking, with 29 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 8 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-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_2_2_AnnP_2 + -P-network_2_2_AnnP_3 + -P-network_2_2_AnnP_4 + -P-network_1_1_RI_4 + -P-network_1_1_RI_3 + -P-network_1_1_RI_2 + -P-network_1_1_RI_1 + -P-network_4_3_AI_4 + -P-network_4_3_AI_3 + -P-network_4_3_AI_2 + -P-network_4_3_AI_1 + -P-network_2_4_AI_4 + -P-network_2_... (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 68 bytes per marking, with 29 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: Transformation into DNF: expect 2 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((P-negotiation_1_3_DONE + P-negotiation_4_0_DONE + P-negotiation_2_1_DONE + P-negotiation_0_2_DONE + P-negotiation_3_4_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-negotiation_2_3_NONE + P-negotiation_0_4_NONE + P-negotiation_3_1_NONE + P-negotiation_1_2_NONE + P-negotiation_1_4_CO + P-neg... (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 68 bytes per marking, with 29 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 10 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-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_4 + -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_4_AskP_0 + -P-poll__networl_1_3_AI_4 + -P-poll__networl_0_3_AnsP_0 + -P-poll__networl_1... (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 68 bytes per marking, with 29 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-stage_1_PRIM + -P-stage_0_NEG + -P-stage_4_SEC + -P-stage_3_PRIM + -P-stage_2_NEG + -P-stage_0_PRIM + -P-stage_4_NEG + -P-stage_2_PRIM + -P-stage_1_NEG + -P-stage_0_SEC + -P-stage_3_SEC + -P-stage_1_SEC + -P-stage_4_PRIM + -P-stage_3_NEG + -P-stage_2_SEC <= -2 AND ((-P-stage_1_PRIM + -P-stage_0_NEG + -P-stage_4_SEC + -P-stage_3_PRIM + -P-stage_2_NEG + -P-stage_0_PRIM + -P-stage_4_NEG + -P-... (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 68 bytes per marking, with 29 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: Transformation into DNF: expect 5 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-masterState_1_T_4 + -P-masterState_3_F_4 + -P-masterState_0_F_4 + -P-masterState_2_F_4 + -P-masterState_4_F_4 + -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_4_F_3 + -P-masterState_4_F_2 + -P-masterState_4_F_1 + -P-masterState_4_F_0 + -P-masterState_2_F_0 + -P-masterState_2_F_1 + -P-masterState_2_F_2 + -P-m... (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 68 bytes per marking, with 29 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: Transformation into DNF: expect 4 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityCardinality-12.sara
lola: subprocess 13 will run for 1162 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-poll__waitingMessage_3 + -P-poll__waitingMessage_4 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 <= -3 AND -P-poll__handlingMessage_4 + -P-poll__handlingMessage_3 + -P-poll__handlingMessage_2 + P-crashed_0 + P-crashed_1 + P-crashed_2 + P-crashed_3 + P-crashed_4 + -P-poll__handlingMessage_0 + -P-poll__handlingMessage_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 29 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: Transformation into DNF: expect 2 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
sara: try reading problem file NeoElection-COL-4-ReachabilityCardinality-12.sara.
lola: subprocess 14 will run for 1743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-electedSecondary_4 + -P-electedSecondary_3 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 <= -2)
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 68 bytes per marking, with 29 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to NeoElection-COL-4-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-masterState_1_T_4 + -P-masterState_3_F_4 + -P-masterState_0_F_4 + -P-masterState_2_F_4 + -P-masterState_4_F_4 + -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_4_F_3 + -P-masterState_4_F_2 + -P-masterState_4_F_1 + -P-masterState_4_F_0 + -P-masterState_2_F_0 + -P-masterState_2_F_1 + -P-masterState_2_F_2 + -P-ma... (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 68 bytes per marking, with 29 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: RESULTTransformation into DNF: expect 1 literals

lola: summary: no no yes yes no yes yes yes yes no no yes yes no no yes
lola: write sara problem file to NeoElection-COL-4-ReachabilityCardinality-15.sara
lola: ========================================
lola: calling and running sara
sara: try reading problem file NeoElection-COL-4-ReachabilityCardinality-15.sara.

BK_STOP 1463649434065

--------------------
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-4"
export BK_EXAMINATION="ReachabilityCardinality"
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-4.tgz
mv NeoElection-PT-4 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-4, examination is ReachabilityCardinality"
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-146363810900097"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;