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 S_LamportFastMutEx-PT-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158kn-blw3-146416414900261
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464210901366

bkconf 3600
===========================================================================================
===========================================================================================
S_LamportFastMutEx-PT-4: translating Petri net model.pnml into LoLA format
S_LamportFastMutEx-PT-4: translating formula ReachabilityFireability into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py ReachabilityFireability.xml
touch formulae;


in benchkit_head lolaszeit 3540
ReachabilityFireability @ S_LamportFastMutEx-PT-4
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-ReachabilityFireability-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 365/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 135 places, 230 transitions, 98 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 327 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-4-ReachabilityFireability.task
lola: read: AG (!(((!(((((((((((((((((((((((((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)) OR FIREABLE(T-sety_9_10)) OR FIREABLE(T-sety_9_11)) OR FIREABLE(T-sety_9_12)) OR FIREABLE(T-sety_9_13)) OR FIREABLE(T-sety_9_14)) OR FIREABLE(T-s... (shortened)
lola: formula length: 26550
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((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) OR (FIREABLE(T-sety_9_10) OR (FIREABLE(T-sety_9_11) OR (FIREABLE(T-sety_9_12) OR (FIREABLE(T-sety_9_13) OR (FIREABLE(T-sety_9_14) OR (FIREABLE(T-sety_9_15) OR (FIREABLE(T-set... (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 392 bytes per marking, with 0 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 not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-yeqi_15_1) AND (! FIREABLE(T-yeqi_15_7) AND (! FIREABLE(T-yeqi_15_13) AND (! FIREABLE(T-yeqi_15_19) AND ! FIREABLE(T-yeqi_15_25))))) OR ((! FIREABLE(T-sety_9_1) AND (! FIREABLE(T-sety_9_2) AND (! FIREABLE(T-sety_9_3) AND (! FIREABLE(T-sety_9_4) AND (! FIREABLE(T-sety_9_5) AND (! FIREABLE(T-sety_9_6) AND (! FIREABLE(T-sety_9_7) AND (! FIREABLE(T-sety_9_8) AND (! FIREABLE(T-sety_9... (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 392 bytes per marking, with 0 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 335544331100 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(T-setbi_2_1) AND (! FIREABLE(T-setbi_2_2) AND (! FIREABLE(T-setbi_2_3) AND (! FIREABLE(T-setbi_2_4) AND (! FIREABLE(T-setbi_2_5) AND (! FIREABLE(T-setbi_2_6) AND (! FIREABLE(T-setbi_2_7) AND (! FIREABLE(T-setbi_2_8) AND (! FIREABLE(T-setbi_2_9) AND ! FIREABLE(T-setbi_2_10)))))))))) OR ((! FIREABLE(T-forod_13_1) AND (! FIREABLE(T-forod_13_2) AND (! FIREABLE(T-forod_13_3) AND (! FI... (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 392 bytes per marking, with 0 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 not invariant.
lola: Transformation into DNF: expect 8235975084 literals
lola: DNF formula is too big, sara cannot be used
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((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 (FIREABLE(T-setx_3_10) OR (FIREABLE(T-setx_3_11) OR (FIREABLE(T-setx_3_12) OR (FIREABLE(T-setx_3_13) OR (FIREABLE(T-setx_3_14) OR (FIREABLE(T-setx_3_15) OR (FIREABLE(T-set... (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 392 bytes per marking, with 0 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 68736589496160 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-await_13_1) AND (! FIREABLE(T-await_13_2) AND (! FIREABLE(T-await_13_3) AND (! FIREABLE(T-await_13_4) AND (! FIREABLE(T-await_13_5) AND (! FIREABLE(T-await_13_6) AND (! FIREABLE(T-await_13_7) AND (! FIREABLE(T-await_13_8) AND (! FIREABLE(T-await_13_9) AND (! FIREABLE(T-await_13_10) AND (! FIREABLE(T-await_13_11) AND (! FIREABLE(T-await_13_12) AND (! FIREABLE(T-await_13_13) AND (... (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 392 bytes per marking, with 0 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 2033492662685350 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(T-setbi_5_1) AND (! FIREABLE(T-setbi_5_2) AND (! FIREABLE(T-setbi_5_3) AND (! FIREABLE(T-setbi_5_4) AND (! FIREABLE(T-setbi_5_5) AND (! FIREABLE(T-setbi_5_6) AND (! FIREABLE(T-setbi_5_7) AND (! FIREABLE(T-setbi_5_8) AND (! FIREABLE(T-setbi_5_9) AND (! FIREABLE(T-setbi_5_10) AND (! FIREABLE(T-forod_13_1) AND (! FIREABLE(T-forod_13_2) AND (! FIREABLE(T-forod_13_3) AND (! 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 392 bytes per marking, with 0 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 71039079112 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T-yeq0_4_1) AND (! FIREABLE(T-yeq0_4_2) AND (! FIREABLE(T-yeq0_4_3) AND (! FIREABLE(T-yeq0_4_4) AND (! FIREABLE(T-yeq0_4_5) AND (! FIREABLE(T-yeqi_15_1) AND (! FIREABLE(T-yeqi_15_7) AND (! FIREABLE(T-yeqi_15_13) AND (! FIREABLE(T-yeqi_15_19) AND ! FIREABLE(T-yeqi_15_25)))))))))) 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 ... (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 392 bytes per marking, with 0 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 1125900014216806272 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-ynei_15_2) OR (FIREABLE(T-ynei_15_3) OR (FIREABLE(T-ynei_15_4) OR (FIREABLE(T-ynei_15_5) OR (FIREABLE(T-ynei_15_6) OR (FIREABLE(T-ynei_15_8) OR (FIREABLE(T-ynei_15_9) OR (FIREABLE(T-ynei_15_10) OR (FIREABLE(T-ynei_15_11) OR (FIREABLE(T-ynei_15_12) OR (FIREABLE(T-ynei_15_14) OR (FIREABLE(T-ynei_15_15) OR (FIREABLE(T-ynei_15_16) OR (FIREABLE(T-ynei_15_17) OR (FIREABLE(T-ynei_15_18) O... (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 392 bytes per marking, with 0 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 40 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-forod_13_1) OR (FIREABLE(T-forod_13_2) OR (FIREABLE(T-forod_13_3) OR (FIREABLE(T-forod_13_4) OR FIREABLE(T-forod_13_5))))))
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 392 bytes per marking, with 0 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 25 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityFireability-8.sara
lola: subprocess 9 will run for 493 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: calling and running sara
lola: ...considering subproblem: EF ((((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-setbi_11_7) OR (FIREABLE(T-setbi_11_8) OR (FIREABLE(T-setbi_11_9) OR FIREABLE(T-setbi_11_10)))))))))) AND (FIREABLE(T-ynei_15_2) OR (FIREABLE(T-ynei_15_3) OR (FIREABLE(T-ynei_15_4) OR (FIREABLE(T-ynei_15_5) OR (FIREABLE(... (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 392 bytes per marking, with 0 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 671090345 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityFireability-8.sara.
lola: ========================================
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-forod_13_1) OR (FIREABLE(T-forod_13_2) OR (FIREABLE(T-forod_13_3) OR (FIREABLE(T-forod_13_4) OR FIREABLE(T-forod_13_5))))))
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 392 bytes per marking, with 0 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 25 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityFireability-10.sara
lola: subprocess 11 will run for 691 seconds at most (--localtimelimit=0)
lola: lola: ========================================
========================================
lola: ...considering subproblem: AG ((((FIREABLE(T-xeqi_10_1) OR (FIREABLE(T-xeqi_10_7) OR (FIREABLE(T-xeqi_10_13) OR (FIREABLE(T-xeqi_10_19) OR FIREABLE(T-xeqi_10_25))))) 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) OR (FIREABLE(T-sety_9_10) OR (FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: lola: calling and running sara
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 392 bytes per marking, with 0 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 not invariant.
lola: ========================================
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityFireability-10.sara.
lola: subprocess 12 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T-fordo_12_1) AND (! FIREABLE(T-fordo_12_2) AND (! FIREABLE(T-fordo_12_3) AND (! FIREABLE(T-fordo_12_4) AND (! FIREABLE(T-fordo_12_5) AND ((FIREABLE(T-yeqi_15_1) OR (FIREABLE(T-yeqi_15_7) OR (FIREABLE(T-yeqi_15_13) OR (FIREABLE(T-yeqi_15_19) OR FIREABLE(T-yeqi_15_25))))) 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 ... (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 392 bytes per marking, with 0 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 770 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityFireability-12.sara
sara: place or transition ordering is non-deterministic
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1152 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((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-await_13_10) OR (FIREABLE(T-await_13_11) OR (FIREABLE(T-await_13_12) OR (FIREABLE(T-await_13_13) OR (FIREABLE(T-await_13_14) OR (FIREABLE(T-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 392 bytes per marking, with 0 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 85 literals
lola: write sara problem file to LamportFastMutEx-COL-4-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-4-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T-yeqi_15_1) OR (FIREABLE(T-yeqi_15_7) OR (FIREABLE(T-yeqi_15_13) OR (FIREABLE(T-yeqi_15_19) OR (FIREABLE(T-yeqi_15_25) OR ((FIREABLE(T-awaity_1) OR (FIREABLE(T-awaity_2) OR (FIREABLE(T-awaity_3) OR (FIREABLE(T-awaity_4) OR FIREABLE(T-awaity_5))))) 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 (FIREA... (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 392 bytes per marking, with 0 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 25820 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((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 (FIREABLE(T-setx_3_10) OR (FIREABLE(T-setx_3_11) OR (FIREABLE(T-setx_3_12) OR (FIREABLE(T-setx_3_13) OR (FIREABLE(T-setx_3_14) OR (FIREABLE(T-setx_3_15) OR (FIREABLE(T-set... (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 392 bytes per marking, with 0 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 445200203638 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: no yes no yes yes yes yes yes yes yes yes no yes yes yes no

BK_STOP 1464210985878

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

parsing of model.pnml complete

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="S_LamportFastMutEx-PT-4"
export BK_EXAMINATION="ReachabilityFireability"
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/S_LamportFastMutEx-PT-4.tgz
mv S_LamportFastMutEx-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 S_LamportFastMutEx-PT-4, 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 r158kn-blw3-146416414900261"
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 ;