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 SharedMemory-PT-000010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110kn-smll-146373288900369
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463781534450

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ SharedMemory-PT-000010
FORMULA SharedMemory-COL-000010-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000010-ReachabilityFireability-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: 341/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 131 places, 210 transitions, 110 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 240 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000010-ReachabilityFireability.task
lola: read: EF (!(!(!((((((((((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1)) OR FIREABLE(Req_Ext_Acc_4)) OR FIREABLE(Req_Ext_Acc_3)) OR FIREABLE(Req_Ext_Acc_6)) OR FIREABLE(Req_Ext_Acc_5)) OR FIREABLE(Req_Ext_Acc_9)) OR FIREABLE(Req_Ext_Acc_10)) OR FIREABLE(Req_Ext_Acc_7)) OR FIREABLE(Req_Ext_Acc_8)))))) : AG ((((((((((((FIREABLE(Req_Ext_Acc_2) OR FIREABLE(Req_Ext_Acc_1)) OR FIREABLE(Req_Ext_Acc_4)) OR ... (shortened)
lola: formula length: 81636
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 ((! FIREABLE(Req_Ext_Acc_2) AND (! FIREABLE(Req_Ext_Acc_1) AND (! FIREABLE(Req_Ext_Acc_4) AND (! FIREABLE(Req_Ext_Acc_3) AND (! FIREABLE(Req_Ext_Acc_6) AND (! FIREABLE(Req_Ext_Acc_5) AND (! FIREABLE(Req_Ext_Acc_9) AND (! FIREABLE(Req_Ext_Acc_10) AND (! FIREABLE(Req_Ext_Acc_7) AND ! FIREABLE(Req_Ext_Acc_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 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 10 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityFireability.sara
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Req_Ext_Acc_2) OR (FIREABLE(Req_Ext_Acc_1) OR (FIREABLE(Req_Ext_Acc_4) OR (FIREABLE(Req_Ext_Acc_3) OR (FIREABLE(Req_Ext_Acc_6) OR (FIREABLE(Req_Ext_Acc_5) OR (FIREABLE(Req_Ext_Acc_9) OR (FIREABLE(Req_Ext_Acc_10) OR (FIREABLE(Req_Ext_Acc_7) OR (FIREABLE(Req_Ext_Acc_8) OR (((FIREABLE(End_Own_Acc_3_3) OR (FIREABLE(End_Own_Acc_4_4) OR (FIREABLE(End_Own_Acc_1_1) OR (FIREABLE(End_Own_Acc_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: lola: checking invariancecalling and running sara

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 18 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(Begin_Own_Acc_10) OR (FIREABLE(Begin_Own_Acc_9) OR (FIREABLE(Begin_Own_Acc_8) OR (FIREABLE(Begin_Own_Acc_7) OR (FIREABLE(Begin_Own_Acc_6) OR (FIREABLE(Begin_Own_Acc_5) OR (FIREABLE(Begin_Own_Acc_4) OR (FIREABLE(Begin_Own_Acc_3) OR (FIREABLE(Begin_Own_Acc_1) OR FIREABLE(Begin_Own_Acc_2)))))))))) AND (FIREABLE(End_Own_Acc_3_3) OR (FIREABLE(End_Own_Acc_4_4) OR (FIREABLE(End_Own_Acc_1_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Req_Ext_Acc_2) AND (! FIREABLE(Req_Ext_Acc_1) AND (! FIREABLE(Req_Ext_Acc_4) AND (! FIREABLE(Req_Ext_Acc_3) AND (! FIREABLE(Req_Ext_Acc_6) AND (! FIREABLE(Req_Ext_Acc_5) AND (! FIREABLE(Req_Ext_Acc_9) AND (! FIREABLE(Req_Ext_Acc_10) AND (! FIREABLE(Req_Ext_Acc_7) AND ! FIREABLE(Req_Ext_Acc_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 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)sara:
try reading problem file SharedMemory-COL-000010-ReachabilityFireability.sara.
lola: ========================================
lola: ...considering subproblem: AG (((((! FIREABLE(Req_Ext_Acc_2) AND (! FIREABLE(Req_Ext_Acc_1) AND (! FIREABLE(Req_Ext_Acc_4) AND (! FIREABLE(Req_Ext_Acc_3) AND (! FIREABLE(Req_Ext_Acc_6) AND (! FIREABLE(Req_Ext_Acc_5) AND (! FIREABLE(Req_Ext_Acc_9) AND (! FIREABLE(Req_Ext_Acc_10) AND (! FIREABLE(Req_Ext_Acc_7) AND ! FIREABLE(Req_Ext_Acc_8)))))))))) OR (FIREABLE(Begin_Own_Acc_10) OR (FIREABLE(Begin_Own_Acc_9) OR (FIREABLE(Begi... (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 18 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(Begin_Ext_Acc_8_2) AND (! FIREABLE(Begin_Ext_Acc_7_2) AND (! FIREABLE(Begin_Ext_Acc_6_2) AND (! FIREABLE(Begin_Ext_Acc_5_2) AND (! FIREABLE(Begin_Ext_Acc_4_2) AND (! FIREABLE(Begin_Ext_Acc_3_2) AND (! FIREABLE(Begin_Ext_Acc_1_2) AND (! FIREABLE(Begin_Ext_Acc_10_1) AND (! FIREABLE(Begin_Ext_Acc_9_1) AND (! FIREABLE(Begin_Ext_Acc_8_1) AND (! FIREABLE(Begin_Ext_Acc_7_1) AND (! FIREAB... (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 18 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 6643195830 literals
lola: DNF formula is too big, sara cannot be used
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(End_Own_Acc_3_3) AND (! FIREABLE(End_Own_Acc_4_4) AND (! FIREABLE(End_Own_Acc_1_1) AND (! FIREABLE(End_Own_Acc_2_2) AND (! FIREABLE(End_Own_Acc_9_9) AND (! FIREABLE(End_Own_Acc_10_10) AND (! FIREABLE(End_Own_Acc_7_7) AND (! FIREABLE(End_Own_Acc_8_8) AND (! FIREABLE(End_Own_Acc_5_5) AND (! FIREABLE(End_Own_Acc_6_6) AND ((! FIREABLE(Begin_Ext_Acc_8_2) AND (! FIREABLE(Begin_Ext_Acc_7_... (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 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Begin_Own_Acc_10) OR (FIREABLE(Begin_Own_Acc_9) OR (FIREABLE(Begin_Own_Acc_8) OR (FIREABLE(Begin_Own_Acc_7) OR (FIREABLE(Begin_Own_Acc_6) OR (FIREABLE(Begin_Own_Acc_5) OR (FIREABLE(Begin_Own_Acc_4) OR (FIREABLE(Begin_Own_Acc_3) OR (FIREABLE(Begin_Own_Acc_1) OR (FIREABLE(Begin_Own_Acc_2) OR (FIREABLE(Begin_Ext_Acc_8_2) OR (FIREABLE(Begin_Ext_Acc_7_2) OR (FIREABLE(Begin_Ext_Acc_6_2) 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 16 bytes per marking, with 18 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 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Begin_Ext_Acc_8_2) AND (! FIREABLE(Begin_Ext_Acc_7_2) AND (! FIREABLE(Begin_Ext_Acc_6_2) AND (! FIREABLE(Begin_Ext_Acc_5_2) AND (! FIREABLE(Begin_Ext_Acc_4_2) AND (! FIREABLE(Begin_Ext_Acc_3_2) AND (! FIREABLE(Begin_Ext_Acc_1_2) AND (! FIREABLE(Begin_Ext_Acc_10_1) AND (! FIREABLE(Begin_Ext_Acc_9_1) AND (! FIREABLE(Begin_Ext_Acc_8_1) AND (! FIREABLE(Begin_Ext_Acc_7_1) AND (! FIREABL... (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 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Req_Ext_Acc_2) OR (FIREABLE(Req_Ext_Acc_1) OR (FIREABLE(Req_Ext_Acc_4) OR (FIREABLE(Req_Ext_Acc_3) OR (FIREABLE(Req_Ext_Acc_6) OR (FIREABLE(Req_Ext_Acc_5) OR (FIREABLE(Req_Ext_Acc_9) OR (FIREABLE(Req_Ext_Acc_10) OR (FIREABLE(Req_Ext_Acc_7) OR FIREABLE(Req_Ext_Acc_8)))))))))) AND ((FIREABLE(End_Ext_Acc_5_1) OR (FIREABLE(End_Ext_Acc_4_1) OR (FIREABLE(End_Ext_Acc_7_1) OR (FIREABLE(End_... (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 18 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 82800 literals
lola: write sara problem file to SharedMemory-COL-000010-ReachabilityFireability-9.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000010-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Begin_Own_Acc_10) OR (FIREABLE(Begin_Own_Acc_9) OR (FIREABLE(Begin_Own_Acc_8) OR (FIREABLE(Begin_Own_Acc_7) OR (FIREABLE(Begin_Own_Acc_6) OR (FIREABLE(Begin_Own_Acc_5) OR (FIREABLE(Begin_Own_Acc_4) OR (FIREABLE(Begin_Own_Acc_3) OR (FIREABLE(Begin_Own_Acc_1) OR FIREABLE(Begin_Own_Acc_2)))))))))))
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 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 10 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(Req_Ext_Acc_2) OR (FIREABLE(Req_Ext_Acc_1) OR (FIREABLE(Req_Ext_Acc_4) OR (FIREABLE(Req_Ext_Acc_3) OR (FIREABLE(Req_Ext_Acc_6) OR (FIREABLE(Req_Ext_Acc_5) OR (FIREABLE(Req_Ext_Acc_9) OR (FIREABLE(Req_Ext_Acc_10) OR (FIREABLE(Req_Ext_Acc_7) OR FIREABLE(Req_Ext_Acc_8)))))))))) AND (FIREABLE(Begin_Own_Acc_10) OR (FIREABLE(Begin_Own_Acc_9) OR (FIREABLE(Begin_Own_Acc_8) OR (FIREABLE(Beg... (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 18 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 34039057915542069302536493719215955066396606464 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Begin_Own_Acc_10) OR (FIREABLE(Begin_Own_Acc_9) OR (FIREABLE(Begin_Own_Acc_8) OR (FIREABLE(Begin_Own_Acc_7) OR (FIREABLE(Begin_Own_Acc_6) OR (FIREABLE(Begin_Own_Acc_5) OR (FIREABLE(Begin_Own_Acc_4) OR (FIREABLE(Begin_Own_Acc_3) OR (FIREABLE(Begin_Own_Acc_1) OR (FIREABLE(Begin_Own_Acc_2) OR (! FIREABLE(End_Ext_Acc_5_1) AND (! FIREABLE(End_Ext_Acc_4_1) AND (! FIREABLE(End_Ext_Acc_7_1) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 18 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 13 will run for 1170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Req_Ext_Acc_2) OR (FIREABLE(Req_Ext_Acc_1) OR (FIREABLE(Req_Ext_Acc_4) OR (FIREABLE(Req_Ext_Acc_3) OR (FIREABLE(Req_Ext_Acc_6) OR (FIREABLE(Req_Ext_Acc_5) OR (FIREABLE(Req_Ext_Acc_9) OR (FIREABLE(Req_Ext_Acc_10) OR (FIREABLE(Req_Ext_Acc_7) OR FIREABLE(Req_Ext_Acc_8)))))))))))
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 18 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 14 will run for 1756 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Begin_Own_Acc_10) OR (FIREABLE(Begin_Own_Acc_9) OR (FIREABLE(Begin_Own_Acc_8) OR (FIREABLE(Begin_Own_Acc_7) OR (FIREABLE(Begin_Own_Acc_6) OR (FIREABLE(Begin_Own_Acc_5) OR (FIREABLE(Begin_Own_Acc_4) OR (FIREABLE(Begin_Own_Acc_3) OR (FIREABLE(Begin_Own_Acc_1) OR FIREABLE(Begin_Own_Acc_2)))))))))))
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 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 10 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Begin_Own_Acc_10) AND (! FIREABLE(Begin_Own_Acc_9) AND (! FIREABLE(Begin_Own_Acc_8) AND (! FIREABLE(Begin_Own_Acc_7) AND (! FIREABLE(Begin_Own_Acc_6) AND (! FIREABLE(Begin_Own_Acc_5) AND (! FIREABLE(Begin_Own_Acc_4) AND (! FIREABLE(Begin_Own_Acc_3) AND (! FIREABLE(Begin_Own_Acc_1) AND (! FIREABLE(Begin_Own_Acc_2) AND (((! FIREABLE(Begin_Own_Acc_10) AND (! FIREABLE(Begin_Own_Acc_9) ... (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 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: yes no no yes no yes yes no yes no no yes no no no yes

BK_STOP 1463781562132

--------------------
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="SharedMemory-PT-000010"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-PT-000010.tgz
mv SharedMemory-PT-000010 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 SharedMemory-PT-000010, 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 r110kn-smll-146373288900369"
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 ;