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 PolyORBLF-PT-S06J04T04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369089000774
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463732330056

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBLF-PT-S06J04T04
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-0 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-2 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-9 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityFireability-15 CANNOT_COMPUTE
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: 7448/65536 symbol table entries, 4121 collisions
lola: preprocessing...
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T04-ReachabilityFireability.task
lola: read: AG (!((((FIREABLE(T_1148_4) OR FIREABLE(T_1148_1)) OR FIREABLE(T_1148_2)) OR FIREABLE(T_1148_3)))) : EF ((((((((((((((((((((FIREABLE(WillPerformWork_0_2) OR FIREABLE(WillPerformWork_3_3)) OR FIREABLE(WillPerformWork_4_1)) OR FIREABLE(WillPerformWork_4_3)) OR FIREABLE(WillPerformWork_0_4)) OR FIREABLE(WillPerformWork_3_1)) OR FIREABLE(WillPerformWork_1_4)) OR FIREABLE(WillPerformWork_4_2)) OR FIREA... (shortened)
lola: formula length: 197157
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 30 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T_1148_4) AND (! FIREABLE(T_1148_1) AND (! FIREABLE(T_1148_2) AND ! FIREABLE(T_1148_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 1616 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 4 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 30 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(WillPerformWork_0_2) OR (FIREABLE(WillPerformWork_3_3) OR (FIREABLE(WillPerformWork_4_1) OR (FIREABLE(WillPerformWork_4_3) OR (FIREABLE(WillPerformWork_0_4) OR (FIREABLE(WillPerformWork_3_1) OR (FIREABLE(WillPerformWork_1_4) OR (FIREABLE(WillPerformWork_4_2) OR (FIREABLE(WillPerformWork_1_1) OR (FIREABLE(WillPerformWork_4_4) OR (FIREABLE(WillPerformWork_1_3) OR (FIREABLE(WillPerformW... (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 1616 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 20 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityFireability.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 32 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(T_1115_2_1_4) AND (! FIREABLE(T_1115_1_4_4) AND (! FIREABLE(T_1115_0_4_2) AND (! FIREABLE(T_1115_2_1_3) AND (! FIREABLE(T_1115_1_2_1) AND (! FIREABLE(T_1115_4_1_2) AND (! FIREABLE(T_1115_0_3_1) AND (! FIREABLE(T_1115_3_4_2) AND (! FIREABLE(T_1115_3_4_3) AND (! FIREABLE(T_1115_3_2_2) AND (! FIREABLE(T_1115_1_2_4) AND (! FIREABLE(T_1115_2_4_1) AND (! FIREABLE(T_1115_1_6_2) AND (! F... (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 1616 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 574226494179083581536580924126785437696 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 32 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_2317_4) OR (FIREABLE(T_2317_1) OR (FIREABLE(T_2317_3) OR FIREABLE(T_2317_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 1616 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 8 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityFireability-3.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 35 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1444_2) OR (FIREABLE(T_1444_1) OR (FIREABLE(T_1444_3) OR FIREABLE(T_1444_4)))) AND (((! FIREABLE(NeedMonitoring_1) AND (! FIREABLE(NeedMonitoring_3) AND (! FIREABLE(NeedMonitoring_2) AND ! FIREABLE(NeedMonitoring_4)))) OR (! FIREABLE(T_0376_2_2) AND (! FIREABLE(T_0376_3_3) AND (! FIREABLE(T_0376_4_4) AND (! FIREABLE(T_0376_5_5) AND (! FIREABLE(T_0376_6_6) AND ! FIREABLE(T_0376_1_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 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 179452 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 35 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(T_1115_2_1_4) OR (FIREABLE(T_1115_1_4_4) OR (FIREABLE(T_1115_0_4_2) OR (FIREABLE(T_1115_2_1_3) OR (FIREABLE(T_1115_1_2_1) OR (FIREABLE(T_1115_4_1_2) OR (FIREABLE(T_1115_0_3_1) OR (FIREABLE(T_1115_3_4_2) OR (FIREABLE(T_1115_3_4_3) OR (FIREABLE(T_1115_3_2_2) OR (FIREABLE(T_1115_1_2_4) OR (FIREABLE(T_1115_2_4_1) OR (FIREABLE(T_1115_1_6_2) OR (FIREABLE(T_1115_3_5_3) OR (FIREABLE(T_1115... (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 1616 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 148873535527910577765226390751398592512 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 39 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T_1171_4) OR (FIREABLE(T_1171_3) OR (FIREABLE(T_1171_2) OR (FIREABLE(T_1171_1) OR (! FIREABLE(DummyOR1_3) AND (! FIREABLE(DummyOR1_4) AND (! FIREABLE(DummyOR1_2) AND ! FIREABLE(DummyOR1_1)))))))))
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 1616 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 20 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityFireability-6.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 43 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1147_2) OR (FIREABLE(T_1147_4) OR (FIREABLE(T_1147_3) OR FIREABLE(T_1147_1)))))
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 1616 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 4 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityFireability-7.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 48 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(T_2285_1_3) AND (! FIREABLE(T_2285_4_4) AND (! FIREABLE(T_2285_4_2) AND (! FIREABLE(T_2285_3_2) AND (! FIREABLE(T_2285_2_4) AND (! FIREABLE(T_2285_2_2) AND (! FIREABLE(T_2285_1_1) AND (! FIREABLE(T_2285_3_4) AND (! FIREABLE(T_2285_2_1) AND (! FIREABLE(T_2285_4_3) AND (! FIREABLE(T_2285_3_1) AND (! FIREABLE(T_2285_1_4) AND (! FIREABLE(T_2285_3_3) AND (! FIREABLE(T_2285_4_1) AND (!... (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 1616 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 54 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T_1148_4) AND (! FIREABLE(T_1148_1) AND (! FIREABLE(T_1148_2) AND (! FIREABLE(T_1148_3) AND (! FIREABLE(T_2577_3_3) AND (! FIREABLE(T_2577_4_1) AND (! FIREABLE(T_2577_6_1) AND (! FIREABLE(T_2577_1_3) AND (! FIREABLE(T_2577_5_4) AND (! FIREABLE(T_2577_5_1) AND (! FIREABLE(T_2577_1_2) AND (! FIREABLE(T_2577_2_3) AND (! FIREABLE(T_2577_6_2) AND (! FIREABLE(T_2577_5_3) AND (! FIREABLE... (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 1616 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 2172650296 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 55 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1618_4) OR (FIREABLE(T_1618_2) OR (FIREABLE(T_1618_3) OR FIREABLE(T_1618_1)))))
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 1616 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 8 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityFireability-10.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 66 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1094_2) OR (FIREABLE(T_1094_1) OR (FIREABLE(T_1094_4) OR FIREABLE(T_1094_3)))) AND (FIREABLE(DummyOR2_1) OR (FIREABLE(DummyOR2_4) OR (FIREABLE(DummyOR2_2) OR (FIREABLE(DummyOR2_3) OR (FIREABLE(GoIdle_3) OR (FIREABLE(GoIdle_4) OR (FIREABLE(GoIdle_2) OR FIREABLE(GoIdle_1))))))))))
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 1616 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 96 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityFireability-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 66 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T_2285_1_3) AND (! FIREABLE(T_2285_4_4) AND (! FIREABLE(T_2285_4_2) AND (! FIREABLE(T_2285_3_2) AND (! FIREABLE(T_2285_2_4) AND (! FIREABLE(T_2285_2_2) AND (! FIREABLE(T_2285_1_1) AND (! FIREABLE(T_2285_3_4) AND (! FIREABLE(T_2285_2_1) AND (! FIREABLE(T_2285_4_3) AND (! FIREABLE(T_2285_3_1) AND (! FIREABLE(T_2285_1_4) AND (! FIREABLE(T_2285_3_3) AND (! FIREABLE(T_2285_4_1) 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 1616 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 5869870829386187285817392363568826941440 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 65 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(LeaveCSPW_1) OR (FIREABLE(LeaveCSPW_2) OR (FIREABLE(LeaveCSPW_3) OR (FIREABLE(LeaveCSPW_4) OR ((! FIREABLE(EnterCSIS_6_4) AND (! FIREABLE(EnterCSIS_6_1) AND (! FIREABLE(EnterCSIS_1_3) AND (! FIREABLE(EnterCSIS_3_1) AND (! FIREABLE(EnterCSIS_5_1) AND (! FIREABLE(EnterCSIS_5_4) AND (! FIREABLE(EnterCSIS_2_3) AND (! FIREABLE(EnterCSIS_5_2) AND (! FIREABLE(EnterCSIS_4_1) AND (! FIREABLE(... (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 1616 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 488038239082748 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 66 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Run_4) OR (FIREABLE(Run_3) OR (FIREABLE(Run_2) OR (FIREABLE(Run_1) OR (! FIREABLE(T_1730_4_3) AND (! FIREABLE(T_1730_3_3) AND (! FIREABLE(T_1730_4_1) AND (! FIREABLE(T_1730_0_4) AND (! FIREABLE(T_1730_3_2) AND (! FIREABLE(T_1730_1_1) AND (! FIREABLE(T_1730_2_1) AND (! FIREABLE(T_1730_1_4) AND (! FIREABLE(T_1730_0_3) AND (! FIREABLE(T_1730_2_4) AND (! FIREABLE(T_1730_0_1) AND (! 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 1616 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 18874322 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 132 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(WillPerformWork_0_2) OR (FIREABLE(WillPerformWork_3_3) OR (FIREABLE(WillPerformWork_4_1) OR (FIREABLE(WillPerformWork_4_3) OR (FIREABLE(WillPerformWork_0_4) OR (FIREABLE(WillPerformWork_3_1) OR (FIREABLE(WillPerformWork_1_4) OR (FIREABLE(WillPerformWork_4_2) OR (FIREABLE(WillPerformWork_1_1) OR (FIREABLE(WillPerformWork_4_4) OR (FIREABLE(WillPerformWork_1_3) OR (FIREABLE(WillPerform... (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 1616 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 16196 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
lola: time limit reached - aborting
lola: preliminary result: unknown yes unknown yes unknown no no yes yes unknown yes unknown unknown unknown yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: caught signal User defined signal 1 - aborting LoLA

BK_STOP 1463735870692

--------------------
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="PolyORBLF-PT-S06J04T04"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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 PolyORBLF-PT-S06J04T04, 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 r086kn-ebro-146369089000774"
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 ;