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 LamportFastMutEx-PT-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358897000268
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463601225394

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ LamportFastMutEx-PT-5
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-5-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: 492/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 174 places, 318 transitions, 124 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 452 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-5-ReachabilityCardinality.task
lola: read: EF (3 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5) : AG (!(((3 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 AND P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_0_3 + P-done_0_4 + P-done_0_5 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4... (shortened)
lola: formula length: 8950
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-awaity_5 + -P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_0 <= -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 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P-setx_3_5 + -P-setx_3_4 + -P-setx_3_3 + -P-setx_3_2 + -P-setx_3_1 + -P-setx_3_0 > -3 OR (-P-done_5_5 + -P-done_5_4 + -P-done_5_3 + -P-done_5_2 + -P-done_5_1 + -P-done_5_0 + -P-done_4_5 + -P-done_4_4 + -P-done_4_3 + -P-done_4_2 + -P-done_4_1 + -P-done_4_0 + -P-done_3_5 + -P-done_3_4 + -P-done_3_3 + -P-done_3_2 + -P-done_3_1 + -P-done_3_0 + -P-done_2_5 + -P-done_2_4 + -P-done_2_3 + -P-done_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P-CS_21_5 + -P-CS_21_4 + -P-CS_21_3 + -P-CS_21_2 + -P-CS_21_1 + -P-CS_21_0 + P-fordo_12_5 + P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P-await_13_5 + P-await_13_4 + P-await_13_3 + P-await_13_2 + P-await_13_1 + P-await_13_0 + -P-ifxi_10_5 + -P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_0 <= 0 AND (-P-b_3_true + -P-b_4_true + -P-b_1_false + -P-b_2_true + -P-b_5_true + -P-b_0_true + -P-b_0_false + -P-b_2_false + -P-b_3_false + -P-b_4_false + -P-b_5_false + -P-b_1_true <= -1 OR (P-ifyi_15_5 + P-ifyi_15_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-ify0_4_5 + -P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 + P-ifyi_15_5 + P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-ifyi_15_1 + P-ifyi_15_0 > 0 AND ((-P-sety_9_5 + -P-sety_9_4 + -P-sety_9_3 + -P-sety_9_2 + -P-sety_9_1 + -P-sety_9_0 <= -2 AND P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4_4 + P-wait_4_5 + P-wait_3_5 + P-wait_3_4 + P-wait_3_3 + P-wait_3_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 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((P-fordo_12_5 + P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + -P-ifxi_10_5 + -P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_0 > 0 AND (-P-ifyi_15_5 + -P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 > -2 AND (-x_5 + -x_4 + -x_3 + -x_2 + -x_1 + -x_0 + P-awaity_5 + P-awaity_4 + P-awaity_3 + P-awaity_2 + P-awaity_1 + P-a... (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 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-5-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P-fordo_12_5 + P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + -P-ify0_4_5 + -P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 > 0 OR (P-CS_21_5 + P-CS_21_4 + P-CS_21_3 + P-CS_21_2 + P-CS_21_1 + P-CS_21_0 + -P-ifyi_15_5 + -P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 > 0 OR (-P-CS_21_5 + -P-CS_21_4 + -P-CS_21_3 + -P-CS_21... (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 16 bytes per marking, with 4 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 7 literals
lola: write sara problem file to LamportFastMutEx-COL-5-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-5-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 22525)
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-y_5 + -y_4 + -y_3 + -y_2 + -y_1 + -y_0 + P-setbi_24_5 + P-setbi_24_4 + P-setbi_24_3 + P-setbi_24_2 + P-setbi_24_1 + P-setbi_24_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P-done_5_5 + P-done_5_4 + P-done_5_3 + P-done_5_2 + P-done_5_1 + P-done_5_0 + P-done_4_5 + P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_1 + P-done_4_0 + P-done_3_5 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_1 + P-done_3_0 + P-done_2_5 + P-done_2_4 + P-done_2_3 + P-done_2_2 + P-done_2_1 + P-done_2_0 + P-done_1_5 + P-done_1_4 + P-done_1_3 + P-done_1_2 + P-done_1_1 + P-done_1_0 + P-don... (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 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-5-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-P-wait_4_0 + -P-wait_4_1 + -P-wait_4_2 + -P-wait_4_3 + -P-wait_4_4 + -P-wait_4_5 + -P-wait_3_5 + -P-wait_3_4 + -P-wait_3_3 + -P-wait_3_2 + -P-wait_3_1 + -P-wait_3_0 + -P-wait_5_0 + -P-wait_2_5 + -P-wait_2_4 + -P-wait_2_3 + -P-wait_2_2 + -P-wait_2_1 + -P-wait_2_0 + -P-wait_1_5 + -P-wait_1_4 + -P-wait_1_3 + -P-wait_1_2 + -P-wait_1_1 + -P-wait_1_0 + P-start_1_5 + P-start_1_4 + P-start_1_3 + 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 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: calling and running sara
lola: ========================================
lola: subprocess 10 will run for 530 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-x_5 + P-fordo_12_5 + P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + -x_4 + -x_3 + -x_2 + -x_1 + -x_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality-10.sara
sara: try reading problem file LamportFastMutEx-COL-5-ReachabilityCardinality-9.sara.
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-5-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((x_5 + x_4 + x_3 + x_2 + x_1 + x_0 + -P-ifxi_10_5 + -P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_0 <= 0 AND -P-ifxi_10_5 + -P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_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 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-5-ReachabilityCardinality-11.sara.

sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-ify0_4_5 + -P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 <= -2 AND (-P-setbi_11_5 + -P-setbi_11_4 + -P-setbi_11_3 + -P-setbi_11_2 + -P-setbi_11_1 + -P-setbi_11_0 > -1 AND -P-awaity_5 + -P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_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 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1061 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((P-await_13_5 + P-await_13_4 + P-await_13_3 + P-await_13_2 + P-await_13_1 + P-await_13_0 + -P-ifxi_10_5 + -P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_0 > 0 AND (-x_5 + -x_4 + -x_3 + -x_2 + -x_1 + -x_0 > -2 OR P-setbi_5_5 + P-setbi_5_4 + P-setbi_5_3 + P-setbi_5_2 + P-setbi_5_1 + P-setbi_5_0 + -P-start_1_5 + -P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_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 16 bytes per marking, with 4 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 LamportFastMutEx-COL-5-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P-ify0_4_5 + -P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 + P-ifxi_10_5 + P-ifxi_10_4 + P-ifxi_10_3 + P-ifxi_10_2 + P-ifxi_10_1 + P-ifxi_10_0 > 0 AND (-P-CS_21_5 + -P-CS_21_4 + -P-CS_21_3 + -P-CS_21_2 + -P-CS_21_1 + -P-CS_21_0 + P-fordo_12_5 + P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 > 0 AND (-P-setbi_5_5 + -P-setbi_5_4 + -P-setbi_5_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 16 bytes per marking, with 4 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 6 literals
lola: write sara problem file to LamportFastMutEx-COL-5-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-5-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-y_5 + -y_4 + -y_3 + -y_2 + -y_1 + -y_0 > -3 OR P-fordo_12_5 + P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + -P-start_1_5 + -P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_1 + -P-start_1_0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 4 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola: summary: yes no no no yes yes unknown no no no no yes yes yes yes yes

BK_STOP 1463601580971

--------------------
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="LamportFastMutEx-PT-5"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/hulinhub/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/LamportFastMutEx-PT-5.tgz
mv LamportFastMutEx-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 LamportFastMutEx-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 r062kn-blw3-146358897000268"
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 ;