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-3254
Executing tool lola
Input is LamportFastMutEx-PT-2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484700180
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494625912741


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ LamportFastMutEx-PT-2 @ 3540 seconds
----- Start make result stdout -----
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: 165/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 69 places, 96 transitions, 52 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 137 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-2-ReachabilityFireability.task
lola: A (G ((FIREABLE(T-setx_3_1) OR FIREABLE(T-setx_3_2) OR FIREABLE(T-setx_3_3) OR FIREABLE(T-setx_3_4) OR FIREABLE(T-setx_3_5) OR FIREABLE(T-setx_3_6) OR FIREABLE(T-setx_3_7) OR FIREABLE(T-setx_3_8) OR FIREABLE(T-setx_3_9)))) : E (F (((FIREABLE(T-yeqi_15_1) OR FIREABLE(T-yeqi_15_5) OR FIREABLE(T-yeqi_15_9) OR ((FIREABLE(T-await_13_1) OR FIREABLE(T-await_13_2) OR FIREABLE(T-await_13_3) OR FIREABLE(T-await_13_4) OR FIREABLE(T-await_13_5) OR FIREABLE(T-await_13_6) OR FIREABLE(T-await_13_7) OR FIREABLE(T-await_13_8) OR FIREABLE(T-await_13_9)) AND (FIREABLE(T-setbi_11_1) OR FIREABLE(T-setbi_11_2) OR FIREABLE(T-setbi_11_3) OR FIREABLE(T-setbi_11_4) OR FIREABLE(T-setbi_11_5) OR FIREABLE(T-setbi_11_6))) OR FIREABLE(T-setx_3_1) OR FIREABLE(T-setx_3_2) OR FIREABLE(T-setx_3_3) OR FIREABLE(T-setx_3_4) OR FIREABLE(T-setx_3_5) OR FIREABLE(T-setx_3_6) OR FIREABLE(T-setx_3_7) OR FIREABLE(T-setx_3_8) OR FIREABLE(T-setx_3_9)) AND (FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3) OR ((FIREABLE(T-xeqi_10_1) OR FIREABLE(T-xeqi_10_5) OR FIREABLE(T-xeqi_10_9)) AND (FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3)) AND (FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3) OR FIREABLE(T-forod_13_1) OR FIREABLE(T-forod_13_2) OR FIREABLE(T-forod_13_3))))))) : E (F ((FIREABLE(T-setbi_11_1) OR FIREABLE(T-setbi_11_2) OR FIREABLE(T-setbi_11_3) OR FIREABLE(T-setbi_11_4) OR FIREABLE(T-setbi_11_5) OR FIREABLE(T-setbi_11_6) OR FIREABLE(T-xeqi_10_1) OR FIREABLE(T-xeqi_10_5) OR FIREABLE(T-xeqi_10_9) OR ((FIREABLE(T-ynei_15_2) OR FIREABLE(T-ynei_15_3) OR FIREABLE(T-ynei_15_4) OR FIREABLE(T-ynei_15_6) OR FIREABLE(T-ynei_15_7) OR FIREABLE(T-ynei_15_8)) AND (FIREABLE(T-yne0_4_2) OR FIREABLE(T-yne0_4_3) OR FIREABLE(T-yne0_4_5) OR FIREABLE(T-yne0_4_6) OR FIREABLE(T-yne0_4_8) OR FIREABLE(T-yne0_4_9))) OR ((FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2) OR FIREABLE(T-sety_9_3) OR FIREABLE(T-sety_9_4) OR FIREABLE(T-sety_9_5) OR FIREABLE(T-sety_9_6) OR FIREABLE(T-sety_9_7) OR FIREABLE(T-sety_9_8) OR FIREABLE(T-sety_9_9)) AND (FIREABLE(T-setx_3_1) OR FIREABLE(T-setx_3_2) OR FIREABLE(T-setx_3_3) OR FIREABLE(T-setx_3_4) OR FIREABLE(T-setx_3_5) OR FIREABLE(T-setx_3_6) OR FIREABLE(T-setx_3_7) OR FIREABLE(T-setx_3_8) OR FIREABLE(T-setx_3_9))) OR (NOT FIREABLE(T-xeqi_10_1) AND NOT FIREABLE(T-xeqi_10_5) AND NOT FIREABLE(T-xeqi_10_9) AND (FIREABLE(T-setbi_2_1) OR FIREABLE(T-setbi_2_2) OR FIREABLE(T-setbi_2_3) OR FIREABLE(T-setbi_2_4) OR FIREABLE(T-setbi_2_5) OR FIREABLE(T-setbi_2_6) OR FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3)) AND NOT FIREABLE(T-yeqi_15_1) AND NOT FIREABLE(T-yeqi_15_5) AND NOT FIREABLE(T-yeqi_15_9) AND (FIREABLE(T-xeqi_10_1) OR FIREABLE(T-xeqi_10_5) OR FIREABLE(T-xeqi_10_9)))))) : E (F ((FIREABLE(T-await_13_1) OR FIREABLE(T-await_13_2) OR FIREABLE(T-await_13_3) OR FIREABLE(T-await_13_4) OR FIREABLE(T-await_13_5) OR FIREABLE(T-await_13_6) OR FIREABLE(T-await_13_7) OR FIREABLE(T-await_13_8) OR FIREABLE(T-await_13_9) OR FIREABLE(T-forod_13_1) OR FIREABLE(T-forod_13_2) OR FIREABLE(T-forod_13_3) OR (NOT FIREABLE(T-sety_9_1) AND NOT FIREABLE(T-sety_9_2) AND NOT FIREABLE(T-sety_9_3) AND NOT FIREABLE(T-sety_9_4) AND NOT FIREABLE(T-sety_9_5) AND NOT FIREABLE(T-sety_9_6) AND NOT FIREABLE(T-sety_9_7) AND NOT FIREABLE(T-sety_9_8) AND NOT FIREABLE(T-sety_9_9) AND (FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2) OR FIREABLE(T-sety_9_3) OR FIREABLE(T-sety_9_4) OR FIREABLE(T-sety_9_5) OR FIREABLE(T-sety_9_6) OR FIREABLE(T-sety_9_7) OR FIREABLE(T-sety_9_8) OR FIREABLE(T-sety_9_9)))))) : E (F ((NOT FIREABLE(T-yne0_4_2) AND NOT FIREABLE(T-yne0_4_3) AND NOT FIREABLE(T-yne0_4_5) AND NOT FIREABLE(T-yne0_4_6) AND NOT FIREABLE(T-yne0_4_8) AND NOT FIREABLE(T-yne0_4_9) AND (FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3)) AND (FIREABLE(T-xnei_10_2) OR FIREABLE(T-xnei_10_3) OR FIREABLE(T-xnei_10_4) OR FIREABLE(T-xnei_10_6) OR FIREABLE(T-xnei_10_7) OR FIREABLE(T-xnei_10_8) OR (NOT FIREABLE(T-yeqi_15_1) AND NOT FIREABLE(T-yeqi_15_5) AND NOT FIREABLE(T-yeqi_15_9)) OR (NOT FIREABLE(T-ynei_15_2) AND NOT FIREABLE(T-ynei_15_3) AND NOT FIREABLE(T-ynei_15_4) AND NOT FIREABLE(T-ynei_15_6) AND NOT FIREABLE(T-ynei_15_7) AND NOT FIREABLE(T-ynei_15_8)))))) : A (G ((NOT FIREABLE(T-yne0_4_2) AND NOT FIREABLE(T-yne0_4_3) AND NOT FIREABLE(T-yne0_4_5) AND NOT FIREABLE(T-yne0_4_6) AND NOT FIREABLE(T-yne0_4_8) AND NOT FIREABLE(T-yne0_4_9) AND (FIREABLE(T-setbi_24_1) OR FIREABLE(T-setbi_24_2) OR FIREABLE(T-setbi_24_3) OR FIREABLE(T-setbi_24_4) OR FIREABLE(T-setbi_24_5) OR FIREABLE(T-setbi_24_6))))) : E (F ((NOT FIREABLE(T-sety0_23_1) AND NOT FIREABLE(T-sety0_23_2) AND NOT FIREABLE(T-sety0_23_3) AND NOT FIREABLE(T-sety0_23_4) AND NOT FIREABLE(T-sety0_23_5) AND NOT FIREABLE(T-sety0_23_6) AND NOT FIREABLE(T-sety0_23_7) AND NOT FIREABLE(T-sety0_23_8) AND NOT FIREABLE(T-sety0_23_9)))) : E (F (((FIREABLE(T-yeqi_15_1) OR FIREABLE(T-yeqi_15_5) OR FIREABLE(T-yeqi_15_9) OR FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3)) AND (FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3)) AND (FIREABLE(T-sety0_23_1) OR FIREABLE(T-sety0_23_2) OR FIREABLE(T-sety0_23_3) OR FIREABLE(T-sety0_23_4) OR FIREABLE(T-sety0_23_5) OR FIREABLE(T-sety0_23_6) OR FIREABLE(T-sety0_23_7) OR FIREABLE(T-sety0_23_8) OR FIREABLE(T-sety0_23_9)) AND (FIREABLE(T-await_13_1) OR FIREABLE(T-await_13_2) OR FIREABLE(T-await_13_3) OR FIREABLE(T-await_13_4) OR FIREABLE(T-await_13_5) OR FIREABLE(T-await_13_6) OR FIREABLE(T-await_13_7) OR FIREABLE(T-await_13_8) OR FIREABLE(T-await_13_9))))) : A (G ((NOT FIREABLE(T-forod_13_1) AND NOT FIREABLE(T-forod_13_2) AND NOT FIREABLE(T-forod_13_3) AND (FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3))))) : E (F (((NOT FIREABLE(T-setx_3_1) AND NOT FIREABLE(T-setx_3_2) AND NOT FIREABLE(T-setx_3_3) AND NOT FIREABLE(T-setx_3_4) AND NOT FIREABLE(T-setx_3_5) AND NOT FIREABLE(T-setx_3_6) AND NOT FIREABLE(T-setx_3_7) AND NOT FIREABLE(T-setx_3_8) AND NOT FIREABLE(T-setx_3_9) AND (FIREABLE(T-setbi_11_1) OR FIREABLE(T-setbi_11_2) OR FIREABLE(T-setbi_11_3) OR FIREABLE(T-setbi_11_4) OR FIREABLE(T-setbi_11_5) OR FIREABLE(T-setbi_11_6) OR ((FIREABLE(T-sety0_23_1) OR FIREABLE(T-sety0_23_2) OR FIREABLE(T-sety0_23_3) OR FIREABLE(T-sety0_23_4) OR FIREABLE(T-sety0_23_5) OR FIREABLE(T-sety0_23_6) OR FIREABLE(T-sety0_23_7) OR FIREABLE(T-sety0_23_8) OR FIREABLE(T-sety0_23_9)) AND (FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3))))) OR (NOT FIREABLE(T-xnei_10_2) AND NOT FIREABLE(T-xnei_10_3) AND NOT FIREABLE(T-xnei_10_4) AND NOT FIREABLE(T-xnei_10_6) AND NOT FIREABLE(T-xnei_10_7) AND NOT FIREABLE(T-xnei_10_8))))) : E (F ((FIREABLE(T-xeqi_10_1) OR FIREABLE(T-xeqi_10_5) OR FIREABLE(T-xeqi_10_9)))) : E (F ((FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2) OR FIREABLE(T-sety_9_3) OR FIREABLE(T-sety_9_4) OR FIREABLE(T-sety_9_5) OR FIREABLE(T-sety_9_6) OR FIREABLE(T-sety_9_7) OR FIREABLE(T-sety_9_8) OR FIREABLE(T-sety_9_9)))) : E (F ((FIREABLE(T-xnei_10_2) OR FIREABLE(T-xnei_10_3) OR FIREABLE(T-xnei_10_4) OR FIREABLE(T-xnei_10_6) OR FIREABLE(T-xnei_10_7) OR FIREABLE(T-xnei_10_8)))) : A (G ((NOT FIREABLE(T-xnei_10_2) AND NOT FIREABLE(T-xnei_10_3) AND NOT FIREABLE(T-xnei_10_4) AND NOT FIREABLE(T-xnei_10_6) AND NOT FIREABLE(T-xnei_10_7) AND NOT FIREABLE(T-xnei_10_8) AND NOT FIREABLE(T-await_13_1) AND NOT FIREABLE(T-await_13_2) AND NOT FIREABLE(T-await_13_3) AND NOT FIREABLE(T-await_13_4) AND NOT FIREABLE(T-await_13_5) AND NOT FIREABLE(T-await_13_6) AND NOT FIREABLE(T-await_13_7) AND NOT FIREABLE(T-await_13_8) AND NOT FIREABLE(T-await_13_9) AND NOT FIREABLE(T-xnei_10_2) AND NOT FIREABLE(T-xnei_10_3) AND NOT FIREABLE(T-xnei_10_4) AND NOT FIREABLE(T-xnei_10_6) AND NOT FIREABLE(T-xnei_10_7) AND NOT FIREABLE(T-xnei_10_8) AND (FIREABLE(T-fordo_12_1) OR FIREABLE(T-fordo_12_2) OR FIREABLE(T-fordo_12_3))))) : A (G ((NOT FIREABLE(T-sety0_23_1) AND NOT FIREABLE(T-sety0_23_2) AND NOT FIREABLE(T-sety0_23_3) AND NOT FIREABLE(T-sety0_23_4) AND NOT FIREABLE(T-sety0_23_5) AND NOT FIREABLE(T-sety0_23_6) AND NOT FIREABLE(T-sety0_23_7) AND NOT FIREABLE(T-sety0_23_8) AND NOT FIREABLE(T-sety0_23_9)))) : E (F ((FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T-setx_3_1) OR FIREABLE(T-setx_3_2) OR FIREABLE(T-setx_3_3) OR FIREABLE(T-setx_3_4) OR FIREABLE(T-setx_3_5) OR FIREABLE(T-setx_3_6) OR FIREABLE(T-setx_3_7) OR FIREABLE(T-setx_3_8) OR FIREABLE(T-setx_3_9))))
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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(T-yeqi_15_1) OR FIREABLE(T-yeqi_15_5) OR FIREABLE(T-yeqi_15_9) OR ((FIREABLE(T-await_13_1) OR FIREABLE(T-await_13_2) OR FIREABLE(T-await_13_3) OR FIREABLE(T-await_13_4) OR FIREABLE(T-await_13_5) OR FIREABLE(T-await_13_6) OR FIREABLE(T-await_13_7) OR FIREABLE(T-await_13_8) OR FIREABLE(T-await_13_9)) AND (FIREABLE(T-setbi_11_1) OR FIREABLE(T-setbi_11_2) OR FIREABLE(T-se... (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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-setbi_11_1) OR FIREABLE(T-setbi_11_2) OR FIREABLE(T-setbi_11_3) OR FIREABLE(T-setbi_11_4) OR FIREABLE(T-setbi_11_5) OR FIREABLE(T-setbi_11_6) OR FIREABLE(T-xeqi_10_1) OR FIREABLE(T-xeqi_10_5) OR FIREABLE(T-xeqi_10_9) OR ((FIREABLE(T-ynei_15_2) OR FIREABLE(T-ynei_15_3) OR FIREABLE(T-ynei_15_4) OR FIREABLE(T-ynei_15_6) OR FIREABLE(T-ynei_15_7) OR FIREABLE(T-ynei_15_8)... (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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-await_13_1) OR FIREABLE(T-await_13_2) OR FIREABLE(T-await_13_3) OR FIREABLE(T-await_13_4) OR FIREABLE(T-await_13_5) OR FIREABLE(T-await_13_6) OR FIREABLE(T-await_13_7) OR FIREABLE(T-await_13_8) OR FIREABLE(T-await_13_9) OR FIREABLE(T-forod_13_1) OR FIREABLE(T-forod_13_2) OR FIREABLE(T-forod_13_3) OR (NOT FIREABLE(T-sety_9_1) AND NOT FIREABLE(T-sety_9_2) AND NOT FIREAB... (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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T-yne0_4_2) AND NOT FIREABLE(T-yne0_4_3) AND NOT FIREABLE(T-yne0_4_5) AND NOT FIREABLE(T-yne0_4_6) AND NOT FIREABLE(T-yne0_4_8) AND NOT FIREABLE(T-yne0_4_9) AND (FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3)) AND (FIREABLE(T-xnei_10_2) OR FIREABLE(T-xnei_10_3) OR FIREABLE(T-xnei_10_4) OR FIREABLE(T-xnei_10_6) OR FIREABLE(T-xnei_10_7) OR FIREABLE(T-... (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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T-yne0_4_2) AND NOT FIREABLE(T-yne0_4_3) AND NOT FIREABLE(T-yne0_4_5) AND NOT FIREABLE(T-yne0_4_6) AND NOT FIREABLE(T-yne0_4_8) AND NOT FIREABLE(T-yne0_4_9) AND (FIREABLE(T-setbi_24_1) OR FIREABLE(T-setbi_24_2) OR FIREABLE(T-setbi_24_3) OR FIREABLE(T-setbi_24_4) OR FIREABLE(T-setbi_24_5) OR FIREABLE(T-setbi_24_6)))))
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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T-sety0_23_1) AND NOT FIREABLE(T-sety0_23_2) AND NOT FIREABLE(T-sety0_23_3) AND NOT FIREABLE(T-sety0_23_4) AND NOT FIREABLE(T-sety0_23_5) AND NOT FIREABLE(T-sety0_23_6) AND NOT FIREABLE(T-sety0_23_7) AND NOT FIREABLE(T-sety0_23_8) AND NOT FIREABLE(T-sety0_23_9))))
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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(T-yeqi_15_1) OR FIREABLE(T-yeqi_15_5) OR FIREABLE(T-yeqi_15_9) OR FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3)) AND (FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3)) AND (FIREABLE(T-sety0_23_1) OR FIREABLE(T-sety0_23_2) OR FIREABLE(T-sety0_23_3) OR FIREABLE(T-sety0_23_4) OR FIREABLE(T-sety0_23_5) OR FIREABLE(T-sety0_23_6) OR... (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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T-forod_13_1) AND NOT FIREABLE(T-forod_13_2) AND NOT FIREABLE(T-forod_13_3) AND (FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3)))))
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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 33 literals and 11 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(T-setx_3_1) AND NOT FIREABLE(T-setx_3_2) AND NOT FIREABLE(T-setx_3_3) AND NOT FIREABLE(T-setx_3_4) AND NOT FIREABLE(T-setx_3_5) AND NOT FIREABLE(T-setx_3_6) AND NOT FIREABLE(T-setx_3_7) AND NOT FIREABLE(T-setx_3_8) AND NOT FIREABLE(T-setx_3_9) AND (FIREABLE(T-setbi_11_1) OR FIREABLE(T-setbi_11_2) OR FIREABLE(T-setbi_11_3) OR FIREABLE(T-setbi_11_4) OR FIREABLE(T-setbi_11_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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-xeqi_10_1) OR FIREABLE(T-xeqi_10_5) OR FIREABLE(T-xeqi_10_9))))
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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityFireability-10.sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2) OR FIREABLE(T-sety_9_3) OR FIREABLE(T-sety_9_4) OR FIREABLE(T-sety_9_5) OR FIREABLE(T-sety_9_6) OR FIREABLE(T-sety_9_7) OR FIREABLE(T-sety_9_8) OR FIREABLE(T-sety_9_9))))
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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 18 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-xnei_10_2) OR FIREABLE(T-xnei_10_3) OR FIREABLE(T-xnei_10_4) OR FIREABLE(T-xnei_10_6) OR FIREABLE(T-xnei_10_7) OR FIREABLE(T-xnei_10_8))))
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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityFireability-12.sara
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T-xnei_10_2) AND NOT FIREABLE(T-xnei_10_3) AND NOT FIREABLE(T-xnei_10_4) AND NOT FIREABLE(T-xnei_10_6) AND NOT FIREABLE(T-xnei_10_7) AND NOT FIREABLE(T-xnei_10_8) AND NOT FIREABLE(T-await_13_1) AND NOT FIREABLE(T-await_13_2) AND NOT FIREABLE(T-await_13_3) AND NOT FIREABLE(T-await_13_4) AND NOT FIREABLE(T-await_13_5) AND NOT FIREABLE(T-await_13_6) AND NOT FIREABLE(T-await_13_7) ... (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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 42 literals and 16 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityFireability-13.sara
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T-sety0_23_1) AND NOT FIREABLE(T-sety0_23_2) AND NOT FIREABLE(T-sety0_23_3) AND NOT FIREABLE(T-sety0_23_4) AND NOT FIREABLE(T-sety0_23_5) AND NOT FIREABLE(T-sety0_23_6) AND NOT FIREABLE(T-sety0_23_7) AND NOT FIREABLE(T-sety0_23_8) AND NOT FIREABLE(T-sety0_23_9))))
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 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 18 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: lola: state equation: calling and running sara
STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: ========================================RESULT

lola:
SUMMARY: no yes yes yes yes no yes no no yes yes yes yes no no yes
sara: try reading problem file LamportFastMutEx-COL-2-ReachabilityFireability-11.sara.
sara: try reading problem file LamportFastMutEx-COL-2-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494625912867

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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-2"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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-2.tgz
mv LamportFastMutEx-PT-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is LamportFastMutEx-PT-2, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r038-blw7-149440484700180"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;