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

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

=== Now, execution of the tool begins

BK_START 1463646857869

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ NeoElection-PT-4
FORMULA NeoElection-COL-4-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-CTLCardinality-5 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-CTLCardinality-8 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-CTLCardinality-9 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-CTLCardinality-10 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-CTLCardinality-11 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-CTLCardinality-13 CANNOT_COMPUTE
FORMULA NeoElection-COL-4-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-4-CTLCardinality-15 CANNOT_COMPUTE
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-CTLCardinality.task
lola: read: AF ((AX (P-electionInit_0 + P-electionInit_1 + P-electionInit_2 + P-electionInit_3 + P-electionInit_4 <= P-stage_0_NEG + P-stage_0_PRIM + P-stage_0_SEC + P-stage_1_NEG + P-stage_1_PRIM + P-stage_1_SEC + P-stage_2_NEG + P-stage_2_PRIM + P-stage_2_SEC + P-stage_3_NEG + P-stage_3_PRIM + P-stage_3_SEC + P-stage_4_NEG + P-stage_4_PRIM + P-stage_4_SEC) AND EG (P-stage_0_NEG + P-stage_0_PRIM + P-stage_0_... (shortened)
lola: formula length: 141215
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((AX (-P-stage_1_PRIM + -P-stage_0_NEG + P-electionInit_4 + P-electionInit_3 + P-electionInit_2 + -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-electionInit_0 + P-electionInit_1 + -P-stage_3_NEG + -P-stage_2_SEC <= 0) AND EG (P-stage_1_PRIM + P-stage... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX(-P-stage_1_PRIM + -P-stage_0_NEG + P-electionInit_4 + P-electionInit_3 + P-electionInit_2 + -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-electionInit_0 + P-electionInit_1 + -P-stage_3_NEG + -P-stage_2_SEC <= 0) AND !(A(TRUE U !(P-stage_1_P... (shortened)
lola: processed formula length: 741
lola: 2627982 rewrites
lola: formula mentions 20 of 1830 places; total mentions: 40
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: 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 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 <= -2)
lola: processed formula length: 88
lola: 2627980 rewrites
lola: formula mentions 5 of 1830 places; total mentions: 5
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: 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 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AF (-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(TRUE U -P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 > -1))))
lola: processed formula length: 103
lola: 2627981 rewrites
lola: formula mentions 5 of 1830 places; total mentions: 5
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: 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 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((EF (P-crashed_0 + P-crashed_1 + P-crashed_2 + P-crashed_3 + P-crashed_4 + -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 <= 0) AND (-P-poll__handlingMessage_4 + -P-poll__handlingMessage_3 + -P-poll__handlingMessage_2 + -P-poll__handlingMessage_0 + -P-poll__handlingMessage_1 <= -1 OR (P-masterState_1_T_4 + P-masterState_3_F_4 + P-masterState_0_F_4 + P-masterState_2_F_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (E(TRUE U P-crashed_0 + P-crashed_1 + P-crashed_2 + P-crashed_3 + P-crashed_4 + -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 <= 0) AND (-P-poll__handlingMessage_4 + -P-poll__handlingMessage_3 + -P-poll__handlingMessage_2 + -P-poll__handlingMessage_0 + -P-poll__handlingMessage_1 <= -1 OR (P-masterState_1_T_4 + P-masterState_3_F_4 + P-masterState_0_F_4 + P-master... (shortened)
lola: processed formula length: 2854
lola: 2627981 rewrites
lola: formula mentions 110 of 1830 places; total mentions: 110
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: 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 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A(-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 a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-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_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-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_3... (shortened)
lola: processed formula length: 22421
lola: 2627980 rewrites
lola: formula mentions 770 of 1830 places; total mentions: 770
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: 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 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-P-startNeg__broadcasting_1_4 + -P-startNeg__broadcasting_1_3 + -P-startNeg__broadcasting_0_4 + -P-startNeg__broadcasting_0_3 + -P-startNeg__broadcasting_4_4 + -P-startNeg__broadcasting_4_3 + -P-startNeg__broadcasting_4_2 + -P-startNeg__broadcasting_4_1 + -P-startNeg__broadcasting_3_4 + -P-startNeg__broadcasting_3_3 + -P-startNeg__broadcasting_3_2 + -P-startNeg__broadcasting_3_1 + -P-startNeg_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-P-startNeg__broadcasting_1_4 + -P-startNeg__broadcasting_1_3 + -P-startNeg__broadcasting_0_4 + -P-startNeg__broadcasting_0_3 + -P-startNeg__broadcasting_4_4 + -P-startNeg__broadcasting_4_3 + -P-startNeg__broadcasting_4_2 + -P-startNeg__broadcasting_4_1 + -P-startNeg__broadcasting_3_4 + -P-startNeg__broadcasting_3_3 + -P-startNeg__broadcasting_3_2 + -P-startNeg__broadcasting_3_1 + -P-startNeg__... (shortened)
lola: processed formula length: 647
lola: 2627980 rewrites
lola: formula mentions 20 of 1830 places; total mentions: 20
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 > -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-sendAnnPs__broadcasting_0_1 + -P-sendAnnPs__broadcasting_0_2 + -P-sendAnnPs__broadcasting_0_3 + -P-sendAnnPs__broadcasting_0_4 + -P-sendAnnPs__broadcasting_1_1 + -P-sendAnnPs__broadcasting_1_2 + -P-sendAnnPs__broadcasting_1_3 + -P-sendAnnPs__broadcasting_1_4 + -P-sendAnnPs__broadcasting_2_1 + -P-sendAnnPs__broadcasting_2_2 + -P-sendAnnPs__broadcasting_2_3 + -P-sendAnnPs__broadcasting_2_4 + -P-s... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-P-poll__handlingMessage_4 + -P-poll__handlingMessage_3 + -P-poll__handlingMessage_2 + -P-poll__handlingMessage_0 + -P-poll__handlingMessage_1 <= -2 U -P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-P-poll__handlingMessage_4 + -P-poll__handlingMessage_3 + -P-poll__handlingMessage_2 + -P-poll__handlingMessage_0 + -P-poll__handlingMessage_1 <= -2 U -P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 <= -3)
lola: processed formula length: 217
lola: 2627980 rewrites
lola: formula mentions 10 of 1830 places; total mentions: 10
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF (-P-electedSecondary_4 + -P-electedSecondary_3 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 <= -2) U -P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U -P-electedSecondary_4 + -P-electedSecondary_3 + -P-electedSecondary_2 + -P-electedSecondary_1 + -P-electedSecondary_0 <= -2) U -P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 <= -2)
lola: processed formula length: 202
lola: 2627981 rewrites
lola: formula mentions 10 of 1830 places; total mentions: 10
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG (-P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(-P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 > -3))))
lola: processed formula length: 103
lola: 2627981 rewrites
lola: formula mentions 5 of 1830 places; total mentions: 5
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: 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 7 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-startNeg__broadcasting_1_4 + -P-startNeg__broadcasting_1_3 + -P-startNeg__broadcasting_0_4 + -P-startNeg__broadcasting_0_3 + -P-startNeg__broadcasting_4_4 + -P-startNeg__broadcasting_4_3 + -P-startNeg__broadcasting_4_2 + -P-startNeg__broadcasting_4_1 + -P-startNeg__broadcasting_3_4 + -P-startNeg__broadcasting_3_3 + -P-startNeg__broadcasting_3_2 + -P-startNeg__broadcasting_3_1 + -P-startNeg... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 397 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_AI_3 + P-networ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((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_3_AI_3 + P-pol... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((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_3_AI_3 + P-pol... (shortened)
lola: processed formula length: 23433
lola: 2627980 rewrites
lola: formula mentions 860 of 1830 places; total mentions: 860
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 397 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_0_4 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_4 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting_2_4 + P-sendA... (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_0_4 + P-sendAnnPs__broadcasting_1_1 + P-sendAnnPs__broadcasting_1_2 + P-sendAnnPs__broadcasting_1_3 + P-sendAnnPs__broadcasting_1_4 + P-sendAnnPs__broadcasting_2_1 + P-sendAnnPs__broadcasting_2_2 + P-sendAnnPs__broadcasting_2_3 + P-sendAnnPs__broadcasting... (shortened)
lola: processed formula length: 957
lola: 2627981 rewrites
lola: formula mentions 35 of 1830 places; total mentions: 35
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((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-negoti... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((E(TRUE U -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_NO... (shortened)
lola: processed formula length: 23106
lola: 2627981 rewrites
lola: formula mentions 835 of 1830 places; total mentions: 835
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 397 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 <= -2)
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 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 13 will run for 530 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (A(-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 <= -1 U -P-electionFailed_4 + -P-electionFailed_3 + -P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(-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 <= -1 U -P-electionFailed_4 + -P-electionFailed_3 + -P-electionFailed_2 + -P-electionFailed_1 + -P-electionFailed_0 <= -2))
lola: processed formula length: 392
lola: 2627981 rewrites
lola: formula mentions 20 of 1830 places; total mentions: 20
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 530 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P-masterState_1_T_4 + P-masterState_3_F_4 + -P-electionInit_4 + -P-electionInit_3 + -P-electionInit_2 + 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-mas... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 15 will run for 1060 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 <= -3 OR AF (-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-masterStat... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1060 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-crashed_0 + -P-crashed_1 + -P-crashed_2 + -P-crashed_3 + -P-crashed_4 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-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_A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-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_A... (shortened)
lola: processed formula length: 19161
lola: 2627980 rewrites
lola: formula mentions 825 of 1830 places; total mentions: 825
lola: closed formula file NeoElection-COL-4-CTLCardinality.task
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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: RESULT
lola: summary: no no yes yes no unknown yes yes unknown unknown unknown unknown no unknown yes unknown
lola: ========================================

BK_STOP 1463649337788

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