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

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

=== Now, execution of the tool begins

BK_START 1463660570129

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ NeoElection-PT-6
FORMULA NeoElection-COL-6-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-11 CANNOT_COMPUTE
FORMULA NeoElection-COL-6-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-6-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: 13265/65536 symbol table entries, 1397 collisions
lola: preprocessing...
lola: finding significant places
lola: 4830 places, 8435 transitions, 1197 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2401 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-6-ReachabilityCardinality.task
lola: read: AG (!((!(P-poll__handlingMessage_0 + P-poll__handlingMessage_1 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5 + P-poll__handlingMessage_6 <= P-poll__networl_0_0_AskP_0 + P-poll__networl_0_0_AskP_1 + P-poll__networl_0_0_AskP_2 + P-poll__networl_0_0_AskP_3 + P-poll__networl_0_0_AskP_4 + P-poll__networl_0_0_AskP_5 + P-poll__networl_0_0_... (shortened)
lola: formula length: 492736
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-poll__networl_3_5_RI_6 + -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_6 + -P-poll__networl_3_2_AI_5 + -P-poll__networl_3_2_AI_4 + -P-poll__networl_3_2_AI_3 + -P-poll__networl_3_2_AI_2 + -P-poll__networl_3_2_AI_1 + -P-poll__networl_3_2_AI_0 + -P-... (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 152 bytes per marking, with 19 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-6-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-6-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-poll__waitingMessage_3 + -P-poll__waitingMessage_6 + -P-poll__waitingMessage_5 + -P-poll__waitingMessage_4 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_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 152 bytes per marking, with 19 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 2 will run for 131 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 + -P-crashed_6 <= -3)
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 152 bytes per marking, with 19 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 3 will run for 141 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-stage_1_PRIM + -P-stage_0_NEG + P-masterState_6_F_6 + P-masterState_1_T_6 + -P-stage_6_PRIM + P-masterState_3_F_6 + -P-stage_5_NEG + -P-stage_4_SEC + -P-stage_3_PRIM + P-masterState_0_F_6 + -P-stage_2_NEG + -P-stage_0_PRIM + P-masterState_5_F_6 + -P-stage_5_PRIM + P-masterState_2_F_6 + -P-stage_4_NEG + -P-stage_6_NEG + -P-stage_2_PRIM + P-masterState_4_F_6 + -P-stage_1_NEG + -P-stage_0_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 152 bytes per marking, with 19 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-6-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-6-ReachabilityCardinality-3.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 4 will run for 151 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((-P-electionInit_6 + -P-electionInit_5 + -P-electionInit_3 + P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 + P-electedSecondary_4 + P-electedSecondary_5 + P-electedSecondary_6 + -P-electionInit_0 + -P-electionInit_1 + -P-electionInit_2 + -P-electionInit_4 <= 0 AND -P-poll__waitingMessage_3 + -P-poll__waitingMessage_6 + -P-poll__waitingMessage_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 152 bytes per marking, with 19 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 10 literals
lola: write sara problem file to NeoElection-COL-6-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-electionInit_6 + -P-electionInit_5 + -P-electionInit_3 + -P-electionInit_0 + -P-electionInit_1 + -P-electionInit_2 + -P-electionInit_4 <= -1 AND (-P-sendAnnPs__broadcasting_0_1 + -P-sendAnnPs__broadcasting_0_2 + -P-sendAnnPs__broadcasting_0_3 + -P-sendAnnPs__broadcasting_0_4 + -P-sendAnnPs__broadcasting_0_5 + -P-sendAnnPs__broadcasting_0_6 + -P-sendAnnPs__broadcasting_1_1 + -P-sendAnnPs__b... (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 152 bytes per marking, with 19 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 10 literals
lola: write sara problem file to NeoElection-COL-6-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-6-ReachabilityCardinality-5.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 6 will run for 178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-network_3_0_RI_6 + -P-network_3_0_RI_5 + -P-network_3_0_RI_4 + -P-network_3_0_RI_3 + -P-network_3_0_RI_2 + -P-network_3_0_RI_1 + -P-network_2_2_AnnP_1 + -P-network_5_1_AskP_6 + -P-network_5_1_AskP_5 + -P-network_5_1_AskP_4 + -P-network_5_1_AskP_3 + -P-network_5_1_AskP_2 + -P-network_5_1_AskP_1 + -P-network_2_2_AnnP_2 + -P-network_2_2_AnnP_3 + -P-network_2_2_AnnP_4 + -P-network_2_2_AnnP_5 +... (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 152 bytes per marking, with 19 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-6-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-6-ReachabilityCardinality-6.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 7 will run for 196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((P-masterList_2_3_6 + 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_6 + 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-masterState_6_F_6 + P-masterList_5_2_0 + P-masterList_5_2_1 + P-masterList_5_2_2 + P-masterList_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 152 bytes per marking, with 19 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-6-ReachabilityCardinality-7.sara
lola: subprocess 8 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: calling and running sara
lola: ========================================
lola: ...considering subproblem: AG ((-P-network_3_0_RI_6 + -P-network_3_0_RI_5 + -P-network_3_0_RI_4 + -P-network_3_0_RI_3 + -P-network_3_0_RI_2 + -P-network_3_0_RI_1 + -P-network_2_2_AnnP_1 + -P-network_5_1_AskP_6 + -P-network_5_1_AskP_5 + -P-network_5_1_AskP_4 + -P-network_5_1_AskP_3 + -P-network_5_1_AskP_2 + -P-network_5_1_AskP_1 + -P-network_2_2_AnnP_2 + -P-network_2_2_AnnP_3 + -P-network_2_2_AnnP_4 + -P-network_2_2_AnnP_5 +... (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 152 bytes per marking, with 19 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-6-ReachabilityCardinality-7.sara.
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-6-ReachabilityCardinality-8.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((P-poll__networl_3_5_RI_6 + 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_6 + P-poll__networl_3_2_AI_5 + P-poll__networl_3_2_AI_4 + P-poll__networl_3_2_AI_3 + P-poll__networl_3_2_AI_2 + P-poll__networl_3_2_AI_1 + P-poll__networl_3_2_AI_0 + P-poll__networl_1... (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 152 bytes per marking, with 19 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-6-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-6-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (P-masterList_2_3_6 + 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_6 + 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-masterList_5_2_2 + P-masterList_5_2_3 + P-masterList_5_2_4... (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 152 bytes per marking, with 19 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-6-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-6-ReachabilityCardinality-10.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 11 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-poll__waitingMessage_3 + -P-poll__waitingMessage_6 + -P-poll__waitingMessage_5 + -P-poll__waitingMessage_4 + -P-poll__waitingMessage_2 + -P-poll__waitingMessage_1 + -P-poll__waitingMessage_0 <= -3 OR P-masterState_6_F_6 + P-masterState_1_T_6 + P-masterState_3_F_6 + P-masterState_0_F_6 + P-masterState_5_F_6 + P-masterState_2_F_6 + P-masterState_4_F_6 + P-masterState_2_T_0 + P-masterState_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 152 bytes per marking, with 19 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-6-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-6-ReachabilityCardinality-11.sara.

sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 348 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-crashed_6 > -2 AND ((-P-masterState_6_F_6 + -P-masterState_1_T_6 + -P-masterState_3_F_6 + -P-masterState_0_F_6 + -P-masterState_5_F_6 + -P-masterState_2_F_6 + -P-masterState_4_F_6 + -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-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 152 bytes per marking, with 19 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 13 will run for 464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-electedPrimary_0 + -P-electedPrimary_1 + -P-electedPrimary_2 + -P-electedPrimary_3 + -P-electedPrimary_4 + -P-electedPrimary_5 + -P-electedPrimary_6 > -2 AND (-P-masterState_6_F_6 + -P-masterState_1_T_6 + -P-masterState_3_F_6 + -P-masterState_0_F_6 + -P-masterState_5_F_6 + -P-masterState_2_F_6 + -P-masterState_4_F_6 + -P-masterState_2_T_0 + -P-masterState_2_T_1 + -P-masterState_2_T_2 + -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 152 bytes per marking, with 19 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: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 696 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-masterState_6_F_6 + -P-masterState_1_T_6 + -P-masterState_3_F_6 + -P-masterState_0_F_6 + -P-masterState_5_F_6 + -P-masterState_2_F_6 + -P-masterState_4_F_6 + P-electedSecondary_0 + P-electedSecondary_1 + P-electedSecondary_2 + P-electedSecondary_3 + P-electedSecondary_4 + P-electedSecondary_5 + P-electedSecondary_6 + -P-masterState_2_T_0 + -P-masterState_2_T_1 + -P-masterState_2_T_2 + -P-m... (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 152 bytes per marking, with 19 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-6-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-6-ReachabilityCardinality-14.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 15 will run for 1370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-polling_6 + -P-polling_5 + -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 <= -3 OR -P-stage_1_PRIM + -P-stage_0_NEG + -P-stage_6_PRIM + -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_6_NEG + -P-stage_2_PRIM + -P-stage_1_NEG + -P-stage_0_SEC + P-electedPrimary_0 + P-electedPrimary_1... (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 152 bytes per marking, with 19 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-6-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file NeoElection-COL-6-ReachabilityCardinality-15.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: RESULT
lola: summary: no no no yes yes no no no yes yes no unknown yes no no yes

BK_STOP 1463662762930

--------------------
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-6"
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-6.tgz
mv NeoElection-PT-6 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-6, 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-146363810900115"
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 ;