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

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

=== Now, execution of the tool begins

BK_START 1463691933307

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ Peterson-PT-2
FORMULA Peterson-COL-2-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-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: 228/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 102 places, 126 transitions, 91 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 189 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-2-ReachabilityFireability.task
lola: read: EF ((((((FIREABLE(EndLoop_2_1) OR FIREABLE(EndLoop_0_1)) OR FIREABLE(EndLoop_1_1)) OR FIREABLE(EndLoop_1_0)) OR FIREABLE(EndLoop_2_0)) OR FIREABLE(EndLoop_0_0))) : AG (!(!(!((((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1)) OR FIREABLE(AccessCS_0)) AND ((FIREABLE(Ask_1) OR FIREABLE(Ask_2)) OR FIREABLE(Ask_0))))))) : EF (((FIREABLE(BecomeIdle_2) OR FIREABLE(BecomeIdle_1)) OR FIREABLE(BecomeIdle_0)))... (shortened)
lola: formula length: 11306
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(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_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 12 bytes per marking, with 5 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 6 literals
lola: write sara problem file to Peterson-COL-2-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(AccessCS_2) AND (! FIREABLE(AccessCS_1) AND ! FIREABLE(AccessCS_0))) OR (! FIREABLE(Ask_1) AND (! FIREABLE(Ask_2) AND ! FIREABLE(Ask_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 12 bytes per marking, with 5 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 27 literals
lola: write sara problem file to Peterson-COL-2-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
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: EF ((FIREABLE(BecomeIdle_2) OR (FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_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 12 bytes per marking, with 5 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 6 literals
lola: SUBRESULT
lola: result: yes
lola: write sara problem file to Peterson-COL-2-ReachabilityFireability-2.sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(AccessCS_2) AND (! FIREABLE(AccessCS_1) AND ! FIREABLE(AccessCS_0))) OR (FIREABLE(UpdateTurn_0_0_0) OR (FIREABLE(UpdateTurn_1_0_0) OR (FIREABLE(UpdateTurn_1_1_0) OR (FIREABLE(UpdateTurn_2_1_0) OR (FIREABLE(UpdateTurn_2_0_0) OR (FIREABLE(UpdateTurn_0_1_0) OR (FIREABLE(UpdateTurn_0_2_1) OR (FIREABLE(UpdateTurn_2_1_1) OR (FIREABLE(UpdateTurn_2_2_1) OR (FIREABLE(UpdateTurn_1_2_1) 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 12 bytes per marking, with 5 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 3145665 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(BecomeIdle_2) OR (FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_0))) AND ((! FIREABLE(BecomeIdle_2) AND (! FIREABLE(BecomeIdle_1) AND ! FIREABLE(BecomeIdle_0))) OR (! FIREABLE(TurnDiff_1_0_1) AND (! FIREABLE(TurnDiff_1_2_0) AND (! FIREABLE(TurnDiff_0_2_0) AND (! FIREABLE(TurnDiff_2_1_0) AND (! FIREABLE(TurnDiff_0_2_1) AND (! FIREABLE(TurnDiff_2_1_1) AND (! FIREABLE(TurnDiff_0_1_1) 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 12 bytes per marking, with 5 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 1695828 literals
lola: DNF formula is too big, sara cannot be used
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: EF (((FIREABLE(Alone1_0_2_0) OR (FIREABLE(Alone1_2_1_0) OR (FIREABLE(Alone1_0_1_0) OR (FIREABLE(Alone1_2_0_0) OR (FIREABLE(Alone1_1_0_0) OR (FIREABLE(Alone1_1_0_1) OR (FIREABLE(Alone1_1_2_0) OR (FIREABLE(Alone1_0_1_1) OR (FIREABLE(Alone1_2_0_1) OR (FIREABLE(Alone1_0_2_1) OR (FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1)))))))))))) AND ((FIREABLE(TurnEqual_1_0) OR (FIREABLE(TurnEqual_2_0) OR (FI... (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 12 bytes per marking, with 5 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 5304 literals
lola: write sara problem file to Peterson-COL-2-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAlone_1_0_1) OR (FIREABLE(NotAlone_1_2_0) OR (FIREABLE(NotAlone_0_1_1) OR (FIREABLE(NotAlone_2_0_1) OR (FIREABLE(NotAlone_1_0_0) OR (FIREABLE(NotAlone_2_1_1) OR (FIREABLE(NotAlone_0_2_1) OR (FIREABLE(NotAlone_1_2_1) OR (FIREABLE(TurnDiff_1_0_1) OR (FIREABLE(TurnDiff_... (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 12 bytes per marking, with 5 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 838860726 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 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(AccessCS_2) OR (FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_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 12 bytes per marking, with 5 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(BecomeIdle_2) AND (! FIREABLE(BecomeIdle_1) AND ! FIREABLE(BecomeIdle_0))) OR ((! FIREABLE(ContinueLoop_2_1_0) AND (! FIREABLE(ContinueLoop_0_2_0) AND (! FIREABLE(ContinueLoop_1_2_0) AND (! FIREABLE(ContinueLoop_2_2_0) AND (! FIREABLE(ContinueLoop_0_0_1) AND (! FIREABLE(ContinueLoop_1_0_1) AND (! FIREABLE(ContinueLoop_2_0_1) AND (! FIREABLE(ContinueLoop_0_1_1) AND (! FIREABLE(Cont... (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 12 bytes per marking, with 5 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 2478 literals
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((! FIREABLE(AccessCS_2) AND (! FIREABLE(AccessCS_1) AND ! FIREABLE(AccessCS_0))) OR (! FIREABLE(AccessCS_2) AND (! FIREABLE(AccessCS_1) AND (! FIREABLE(AccessCS_0) AND (! FIREABLE(TurnEqual_1_0) AND (! FIREABLE(TurnEqual_2_0) AND (! FIREABLE(TurnEqual_0_0) AND (! FIREABLE(TurnEqual_2_1) AND (! FIREABLE(TurnEqual_0_1) AND ! FIREABLE(TurnEqual_1_1)))))))))) AND (FIREABLE(BecomeIdle_2) OR (FIRE... (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 12 bytes per marking, with 5 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 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(AccessCS_2) OR (FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))) AND (! FIREABLE(UpdateTurn_0_0_0) AND (! FIREABLE(UpdateTurn_1_0_0) AND (! FIREABLE(UpdateTurn_1_1_0) AND (! FIREABLE(UpdateTurn_2_1_0) AND (! FIREABLE(UpdateTurn_2_0_0) AND (! FIREABLE(UpdateTurn_0_1_0) AND (! FIREABLE(UpdateTurn_0_2_1) AND (! FIREABLE(UpdateTurn_2_1_1) AND (! FIREABLE(UpdateTurn_2_2_1) AND (! 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 12 bytes per marking, with 5 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 25165752 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(UpdateTurn_0_0_0) AND (! FIREABLE(UpdateTurn_1_0_0) AND (! FIREABLE(UpdateTurn_1_1_0) AND (! FIREABLE(UpdateTurn_2_1_0) AND (! FIREABLE(UpdateTurn_2_0_0) AND (! FIREABLE(UpdateTurn_0_1_0) AND (! FIREABLE(UpdateTurn_0_2_1) AND (! FIREABLE(UpdateTurn_2_1_1) AND (! FIREABLE(UpdateTurn_2_2_1) AND (! FIREABLE(UpdateTurn_1_2_1) AND (! FIREABLE(UpdateTurn_2_0_1) AND (! FIREABLE(UpdateTu... (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 12 bytes per marking, with 5 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 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Alone1_0_2_0) OR (FIREABLE(Alone1_2_1_0) OR (FIREABLE(Alone1_0_1_0) OR (FIREABLE(Alone1_2_0_0) OR (FIREABLE(Alone1_1_0_0) OR (FIREABLE(Alone1_1_0_1) OR (FIREABLE(Alone1_1_2_0) OR (FIREABLE(Alone1_0_1_1) OR (FIREABLE(Alone1_2_0_1) OR (FIREABLE(Alone1_0_2_1) OR (FIREABLE(Alone1_2_1_1) OR (FIREABLE(Alone1_1_2_1) OR (FIREABLE(UpdateTurn_0_0_0) OR (FIREABLE(UpdateTurn_1_0_0) 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 12 bytes per marking, with 5 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 7371180 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(EndLoop_2_1) AND (! FIREABLE(EndLoop_0_1) AND (! FIREABLE(EndLoop_1_1) AND (! FIREABLE(EndLoop_1_0) AND (! FIREABLE(EndLoop_2_0) AND (! FIREABLE(EndLoop_0_0) AND (! FIREABLE(AccessCS_2) AND (! FIREABLE(AccessCS_1) AND ! FIREABLE(AccessCS_0))))))))) OR (FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAl... (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 12 bytes per marking, with 5 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 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(BecomeIdle_2) OR (FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_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 12 bytes per marking, with 5 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 6 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: write sara problem file to Peterson-COL-2-ReachabilityFireability-14.sara
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(BecomeIdle_2) AND (! FIREABLE(BecomeIdle_1) AND ! FIREABLE(BecomeIdle_0))) OR (FIREABLE(Identity_1_1) OR (FIREABLE(Identity_2_1) OR (FIREABLE(Identity_0_0) OR (FIREABLE(Identity_1_0) OR (FIREABLE(Identity_2_0) OR FIREABLE(Identity_0_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 12 bytes per marking, with 5 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 24 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: write sara problem file to Peterson-COL-2-ReachabilityFireability-15.sara
lola: lola: RESULT
========================================lola:
summary: yes no yes no no no yes yes no no yes yes no no yes no
lola: calling and running sara
sara: try reading problem file Peterson-COL-2-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic


BK_STOP 1463691934976

--------------------
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="Peterson-PT-2"
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/Peterson-PT-2.tgz
mv Peterson-PT-2 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 Peterson-PT-2, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086kn-ebro-146369088100063"
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 ;