fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r074kn-smll-146363810900106
Last Updated
June 30, 2016

About the Execution of LoLa for NeoElection-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
714.260 188212.00 280812.00 410.30 TFTTFFFFTFTTTFFT normal

Execution Chart

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

Trace from the execution

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


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

=== Now, execution of the tool begins

BK_START 1463654654072

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ NeoElection-PT-5
FORMULA NeoElection-COL-5-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-ReachabilityCardinality-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-ReachabilityCardinality.task
lola: read: EF (2 <= P-poll__handlingMessage_0 + P-poll__handlingMessage_1 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5) : EF ((((1 <= P-poll__waitingMessage_0 + P-poll__waitingMessage_1 + P-poll__waitingMessage_2 + P-poll__waitingMessage_3 + P-poll__waitingMessage_4 + P-poll__waitingMessage_5 AND 1 <= P-masterList_0_1_0 + P-masterList_0_1_1 +... (shortened)
lola: formula length: 159020
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 213 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-poll__handlingMessage_5 + -P-poll__handlingMessage_4 + -P-poll__handlingMessage_3 + -P-poll__handlingMessage_2 + -P-poll__handlingMessage_0 + -P-poll__handlingMessage_1 <= -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 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((-P-poll__waitingMessage_3 + -P-poll__waitingMessage_5 + -P-poll__waitingMessage_4 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 <= -1 AND -P-masterList_2_3_5 + -P-masterList_2_3_4 + -P-masterList_2_3_3 + -P-masterList_2_3_2 + -P-masterList_2_3_1 + -P-masterList_2_3_0 + -P-masterList_5_1_5 + -P-masterList_5_1_4 + -P-masterList_5_1_3 + -P-masterList_5_1_2... (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 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: no
lola: The predicate is unreachable.
lola: Transformation into DNF: expect 8 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality.sara
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: calling and running sara
lola: ...considering subproblem: EF ((-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 + -P-crashed_5 <= -3 OR ((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-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 + -P-crashed_5 + P-stage_5_PRIM + P-stage_4_NEG + P-stage_2_PRIM + P-stage_1_NEG + P-stage_0_SEC + P-stage_3... (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 104 bytes per marking, with 22 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-5-ReachabilityCardinality.sara.
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 7 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-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_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_5_SEC + -P-stage_3_NEG + -P-stage_2_SEC > -1 AND (-P-electionFailed_5 + -P-electionFailed_4 + -P-electionFailed_3 + -P-electi... (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 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: no
lola: The predicate is unreachable.
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-3.sara
lola: subprocess 4 will run for 284 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-crashed_5 + -P-electedPrimary_0 + -P-electedPrimary_1 + -P-electedPrimary_2 + -P-electedPrimary_3 + -P-electedPrimary_4 + -P-electedPrimary_5 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
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 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-4.sara
sara: try reading problem file NeoElection-COL-5-ReachabilityCardinality-3.sara.
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
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 5 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-P-poll__waitingMessage_3 + -P-poll__waitingMessage_5 + -P-poll__waitingMessage_4 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 > -1 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... (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 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: Transformation into DNF: expect 4 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 + -P-dead_5 > -1 OR (-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-negotiati... (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 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 7 will run for 378 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-crashed_0 + P-crashed_1 + P-crashed_2 + P-crashed_3 + P-crashed_4 + P-crashed_5 + -P-startNeg__broadcasting_5_5 + -P-startNeg__broadcasting_5_4 + -P-startNeg__broadcasting_5_3 + -P-startNeg__broadcasting_5_2 + -P-startNeg__broadcasting_5_1 + -P-startNeg__broadcasti... (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 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: Transformation into DNF: expect 2 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityCardinality-7.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 8 will run for 424 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... (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 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityCardinality-8.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 9 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-P-polling_5 + -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 > -2 OR P-masterList_2_3_5 + P-masterList_2_3_4 + P-masterList_2_3_3 + P-masterList_2_3_2 + P-masterList_2_3_1 + P-masterList_2_3_0 + P-masterList_5_1_5 + P-masterList_5_1_4 + P-masterList_5_1_3 + P-masterList_5_1_2 + P-masterList_5_1_1 + P-masterList_5_1_0 + P-masterList_5_2_0 + P-masterList_5_2_1 + 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 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: Transformation into DNF: expect 3 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityCardinality-9.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 10 will run for 563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-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-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 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: Transformation into DNF: expect 5 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityCardinality-10.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 11 will run for 674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-polling_5 + -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 <= -3 AND P-startNeg__broadcasting_1_5 + P-startNeg__broadcasting_1_4 + P-startNeg__broadcasting_0_5 + P-startNeg__broadcasting_0_4 + P-startNeg__broadcasting_5_5 + P-startNeg__broadcasting_5_4 + P-startNeg__broadcasting_5_3 + P-startNeg__broadcasting_5_2 + P-startNeg__broadcasting_5_1 + -P-polling_5 + -P-... (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 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: Transformation into DNF: expect 2 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 842 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((P-poll__waitingMessage_3 + -P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 + -P-dead_5 + P-poll__waitingMessage_5 + P-poll__waitingMessage_4 + P-poll__waitingMessage_2 + P-poll__waitingMessage_1 + P-poll__waitingMessage_0 > 0 AND -P-masterList_2_3_5 + -P-masterList_2_3_4 + -P-masterList_2_3_3 + -P-masterList_2_3_2 + -P-masterList_2_3_1 + -P-masterList_2_3_0 + -P-masterList_5_1_5 + ... (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 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: no
lola: Transformation into DNF: expect 4 literals
lola: The predicate is unreachable.
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-12.sara
lola: subprocess 13 will run for 1123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 + -P-crashed_5 <= -1)
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 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: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1685 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file NeoElection-COL-5-ReachabilityCardinality-12.sara.
lola: ...considering subproblem: EF (((P-poll__waitingMessage_3 + -P-electedSecondary_0 + -P-electedSecondary_1 + -P-electedSecondary_2 + -P-electedSecondary_3 + -P-electedSecondary_4 + -P-electedSecondary_5 + P-poll__waitingMessage_5 + P-poll__waitingMessage_4 + P-poll__waitingMessage_2 + P-poll__waitingMessage_1 + P-poll__waitingMessage_0 > 0 AND -P-startNeg__broadcasting_1_5 + -P-startNeg__broadcasting_1_4 + -P-startNeg__broad... (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 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: Transformation into DNF: expect 4 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-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 3362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-P-poll__waitingMessage_3 + -P-poll__waitingMessage_5 + -P-poll__waitingMessage_4 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 > -3 AND (-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-electedSeco... (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 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: Transformation into DNF: expect 5 literals
lola: write sara problem file to NeoElection-COL-5-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-5-ReachabilityCardinality-15.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: RESULT
lola: summary: yes no yes no yes yes yes no no yes yes yes no no no no

BK_STOP 1463654842284

--------------------
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="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-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 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-146363810900106"
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 ;