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-000005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110kn-smll-146373288900358
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463780120944

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ SharedMemory-PT-000005
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SharedMemory-COL-000005-ReachabilityCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 96/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 41 places, 55 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000005-ReachabilityCardinality.task
lola: read: AG (((Active_1 + Active_3 + Active_2 + Active_4 + Active_5 <= Memory_2 + Memory_1 + Memory_4 + Memory_3 + Memory_5 AND Ext_Mem_Acc_2_1 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc... (shortened)
lola: formula length: 6781
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 ((Active_5 + Active_4 + Active_3 + Active_2 + Active_1 + -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 <= 0 AND -Active_5 + -Active_4 + -Active_3 + -Active_2 + -Active_1 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality.sara
lola: lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
========================================
lola: ========================================
lola: ...considering subproblem: EF ((-Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 > -3 AND (-Queue_5 + -Queue_4 + -Queue_3 + -Queue_2 + -Queue_1 > -1 OR Memory_5 + Memory_4 + Memory_3 + Memory_2 + Memory_1 + -Queue_5 + -Queue_4 + -Queue_3 + -Queue_2 + -Queue_1 > 0)))
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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Active_5 + -Active_4 + -Active_3 + -Active_2 + -Active_1 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc... (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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Active_5 + -Active_4 + -Active_3 + -Active_2 + -Active_1 + Ext_Bus > 0 AND ((-Ext_Bus <= -2 OR -Queue_5 + -Queue_4 + -Queue_3 + -Queue_2 + -Queue_1 <= -2) AND (Active_5 + Active_4 + Active_3 + Active_2 + Active_1 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 <= 0 AND -Ext_Mem_Acc_5_4 + -Ext_Mem_Acc_5_3 + -Ext_Mem_Acc_5_2 + -Ext_Mem_Acc_5_1 + -Ext_Mem_Acc_4_5 + -E... (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 4 bytes per marking, with 2 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 8 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Active_5 + -Active_4 + -Active_3 + -Active_2 + -Active_1 > -1 AND (Ext_Bus + -Queue_5 + -Queue_4 + -Queue_3 + -Queue_2 + -Queue_1 > 0 AND -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 > -2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 + Queue_5 + Queue_4 + Queue_3 + Queue_2 + Queue_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-5.sara.
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 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Ext_Mem_Acc_5_4 + -Ext_Mem_Acc_5_3 + -Ext_Mem_Acc_5_2 + -Ext_Mem_Acc_5_1 + -Ext_Mem_Acc_4_5 + -Ext_Mem_Acc_4_3 + -Ext_Mem_Acc_4_2 + -Ext_Mem_Acc_4_1 + -Ext_Mem_Acc_3_5 + -Ext_Mem_Acc_3_4 + -Ext_Mem_Acc_3_2 + -Ext_Mem_Acc_3_1 + -Ext_Mem_Acc_2_5 + -Ext_Mem_Acc_2_4 + -Ext_Mem_Acc_2_3 + -Ext_Mem_Acc_2_1 + -Ext_Mem_Acc_1_5 + -Ext_Mem_Acc_1_4 + -Ext_Mem_Acc_1_3 + -Ext_Mem_Acc_1_2 > -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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 > -1 OR (-Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 > -2 AND (-Ext_Bus + OwnMemAcc_5 + OwnMemAcc_4 + OwnMemAcc_3 + OwnMemAcc_2 + OwnMemAcc_1 <= 0 AND -Memory_5 + -Memory_4 + -Memory_3 + -Memory_2 + -Memory_1 + Ext_Bus <= 0))))
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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-Queue_5 + -Queue_4 + -Queue_3 + -Queue_2 + -Queue_1 > -3 OR Active_5 + Active_4 + Active_3 + Active_2 + Active_1 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 > 0) AND ((-Ext_Mem_Acc_5_4 + -Ext_Mem_Acc_5_3 + -Ext_Mem_Acc_5_2 + -Ext_Mem_Acc_5_1 + Memory_5 + Memory_4 + Memory_3 + Memory_2 + Memory_1 + -Ext_Mem_Acc_4_5 + -Ext_Mem_Acc_4_3 + -Ext_Mem_Acc_4_2 + -Ext_M... (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 4 bytes per marking, with 2 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 16 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Ext_Mem_Acc_5_4 + -Ext_Mem_Acc_5_3 + -Ext_Mem_Acc_5_2 + -Ext_Mem_Acc_5_1 + -Ext_Mem_Acc_4_5 + -Ext_Mem_Acc_4_3 + -Ext_Mem_Acc_4_2 + -Ext_Mem_Acc_4_1 + -Ext_Mem_Acc_3_5 + -Ext_Mem_Acc_3_4 + -Ext_Mem_Acc_3_2 + -Ext_Mem_Acc_3_1 + -Ext_Mem_Acc_2_5 + -Ext_Mem_Acc_2_4 + -Ext_Mem_Acc_2_3 + -Ext_Mem_Acc_2_1 + -Ext_Mem_Acc_1_5 + -Ext_Mem_Acc_1_4 + -Ext_Mem_Acc_1_3 + -Ext_Mem_Acc_1_2 <= -3 AND -Queue_... (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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Ext_Bus <= -2)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Memory_5 + Memory_4 + Memory_3 + Memory_2 + Memory_1 + -Ext_Bus <= 0)
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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Memory_5 + Memory_4 + Memory_3 + Memory_2 + Memory_1 + -Ext_Bus <= 0)
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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Ext_Bus > -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 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-Queue_5 + -Queue_4 + -Queue_3 + -Queue_2 + -Queue_1 > -3 OR -Ext_Mem_Acc_5_4 + -Ext_Mem_Acc_5_3 + -Ext_Mem_Acc_5_2 + -Ext_Mem_Acc_5_1 + -Ext_Mem_Acc_4_5 + -Ext_Mem_Acc_4_3 + -Ext_Mem_Acc_4_2 + -Ext_Mem_Acc_4_1 + -Ext_Mem_Acc_3_5 + -Ext_Mem_Acc_3_4 + -Ext_Mem_Acc_3_2 + -Ext_Mem_Acc_3_1 + -Ext_Mem_Acc_2_5 + -Ext_Mem_Acc_2_4 + -Ext_Mem_Acc_2_3 + -Ext_Mem_Acc_2_1 + -Ext_Mem_Acc_1_5 + -Ext_Mem_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 4 bytes per marking, with 2 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 8 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Active_5 + -Active_4 + -Active_3 + -Active_2 + -Active_1 + Queue_5 + Queue_4 + Queue_3 + Queue_2 + Queue_1 > 0 AND (-Active_5 + -Active_4 + -Active_3 + -Active_2 + -Active_1 <= -2 OR Memory_5 + Memory_4 + Memory_3 + Memory_2 + Memory_1 + -OwnMemAcc_5 + -OwnMemAcc_4 + -OwnMemAcc_3 + -OwnMemAcc_2 + -OwnMemAcc_1 <= 0)) OR (-Ext_Mem_Acc_5_4 + -Ext_Mem_Acc_5_3 + -Ext_Mem_Acc_5_2 + -Ext_Mem_Acc_5... (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 4 bytes per marking, with 2 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 9 literals
lola: write sara problem file to SharedMemory-COL-000005-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file SharedMemory-COL-000005-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola: summary: no no yes no no yes yes no no no no no no yes no yes

BK_STOP 1463780121245

--------------------
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-000005"
export BK_EXAMINATION="ReachabilityCardinality"
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-000005.tgz
mv SharedMemory-PT-000005 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-000005, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r110kn-smll-146373288900358"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;