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 Raft-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140400175
=====================================================================

--------------------
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 Raft-PT-06-CTLFireability-0
FORMULA_NAME Raft-PT-06-CTLFireability-1
FORMULA_NAME Raft-PT-06-CTLFireability-10
FORMULA_NAME Raft-PT-06-CTLFireability-11
FORMULA_NAME Raft-PT-06-CTLFireability-12
FORMULA_NAME Raft-PT-06-CTLFireability-13
FORMULA_NAME Raft-PT-06-CTLFireability-14
FORMULA_NAME Raft-PT-06-CTLFireability-15
FORMULA_NAME Raft-PT-06-CTLFireability-2
FORMULA_NAME Raft-PT-06-CTLFireability-3
FORMULA_NAME Raft-PT-06-CTLFireability-4
FORMULA_NAME Raft-PT-06-CTLFireability-5
FORMULA_NAME Raft-PT-06-CTLFireability-6
FORMULA_NAME Raft-PT-06-CTLFireability-7
FORMULA_NAME Raft-PT-06-CTLFireability-8
FORMULA_NAME Raft-PT-06-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1463735892635

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLFireability @ Raft-PT-06
FORMULA Raft-PT-06-CTLFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-06-CTLFireability-1 CANNOT_COMPUTE
FORMULA Raft-PT-06-CTLFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-06-CTLFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-06-CTLFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-06-CTLFireability-5 CANNOT_COMPUTE
FORMULA Raft-PT-06-CTLFireability-6 CANNOT_COMPUTE
FORMULA Raft-PT-06-CTLFireability-7 CANNOT_COMPUTE
FORMULA Raft-PT-06-CTLFireability-8 CANNOT_COMPUTE
FORMULA Raft-PT-06-CTLFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-06-CTLFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-06-CTLFireability-11 CANNOT_COMPUTE
FORMULA Raft-PT-06-CTLFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-06-CTLFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-06-CTLFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-06-CTLFireability-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: 520/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 188 places, 332 transitions, 152 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 325 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-06-CTLFireability.task
lola: read: (AX (FIREABLE(t311)) OR A((FIREABLE(t42) OR FIREABLE(t328)) U EF (FIREABLE(t17)))) : (FIREABLE(t129) OR (EG (AF (FIREABLE(t60))) OR AX (EF (FIREABLE(t10))))) : !(EF (EF (FIREABLE(t26)))) : EF ((FIREABLE(t26) AND (!(!(FIREABLE(t121))) AND (FIREABLE(t209) OR (FIREABLE(t236) AND FIREABLE(t260)))))) : AG (!(FIREABLE(t10))) : EX (EF ((!(FIREABLE(t112)) AND FIREABLE(t60)))) : A(FIREABLE(t183) U EF ((FIR... (shortened)
lola: formula length: 1377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX (FIREABLE(t311)) OR A((FIREABLE(t42) OR FIREABLE(t328)) U EF (FIREABLE(t17))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (FIREABLE(t311))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(FIREABLE(t311))
lola: processed formula length: 18
lola: 76 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((FIREABLE(t42) OR FIREABLE(t328)) U EF (FIREABLE(t17)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(t42) OR FIREABLE(t328)) U E(TRUE U FIREABLE(t17)))
lola: processed formula length: 62
lola: 77 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t129) OR (EG (AF (FIREABLE(t60))) OR AX (EF (FIREABLE(t10)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t129)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AF (FIREABLE(t60)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(TRUE U FIREABLE(t60)))))
lola: processed formula length: 39
lola: 77 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(t26))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t26) AND (FIREABLE(t121) AND (FIREABLE(t209) OR (FIREABLE(t236) AND FIREABLE(t260))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 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 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(t10))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EF ((! FIREABLE(t112) AND FIREABLE(t60))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (! FIREABLE(t112) AND FIREABLE(t60))))
lola: processed formula length: 50
lola: 77 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(FIREABLE(t183) U EF ((FIREABLE(t59) AND FIREABLE(t72))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(FIREABLE(t183) U E(TRUE U (FIREABLE(t59) AND FIREABLE(t72))))
lola: processed formula length: 63
lola: 77 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((! FIREABLE(t320) OR ! FIREABLE(t21))) OR (FIREABLE(t294) OR (AF ((FIREABLE(t288) AND FIREABLE(t319))) OR EX (AX (! FIREABLE(t129))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t320) OR ! FIREABLE(t21)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t294)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((FIREABLE(t288) AND FIREABLE(t319)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(t288) AND FIREABLE(t319)))
lola: processed formula length: 45
lola: 76 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG (! FIREABLE(t290)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(! FIREABLE(t290)))))
lola: processed formula length: 42
lola: 77 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t170) OR (! FIREABLE(t222) OR (FIREABLE(t97) OR (FIREABLE(t156) OR (FIREABLE(t296) OR AG ((FIREABLE(t89) OR FIREABLE(t206)))))))) AND (AG ((! FIREABLE(t24) OR FIREABLE(t247))) OR A((FIREABLE(t170) AND FIREABLE(t135)) U FIREABLE(t168))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t170)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(t222)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t24) OR FIREABLE(t247)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((FIREABLE(t170) AND FIREABLE(t135)) U FIREABLE(t168))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(t170) AND FIREABLE(t135)) U FIREABLE(t168))
lola: processed formula length: 55
lola: 76 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================lola: SUBRESULT
lola: result: no
lola:
The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (FIREABLE(t256)) OR EX (! FIREABLE(t130)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (FIREABLE(t256))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t256))
lola: processed formula length: 24
lola: 76 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (((! FIREABLE(t98) OR ! FIREABLE(t260)) AND FIREABLE(t227))) AND AF (EG (! FIREABLE(t129))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(t98) OR ! FIREABLE(t260)) AND FIREABLE(t227)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 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 12 will run for 525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG (! FIREABLE(t129)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !(! FIREABLE(t129)))))
lola: processed formula length: 42
lola: 77 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 12 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t170)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t278) OR (FIREABLE(t313) AND (EG (! FIREABLE(t214)) OR ! FIREABLE(t218))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t278)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t313)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E((FIREABLE(t68) AND FIREABLE(t72)) U FIREABLE(t185)) AND ((AG (! FIREABLE(t66)) OR AF (FIREABLE(t55))) AND EX ((FIREABLE(t311) AND FIREABLE(t261)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((FIREABLE(t68) AND FIREABLE(t72)) U FIREABLE(t185))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(t68) AND FIREABLE(t72)) U FIREABLE(t185))
lola: processed formula length: 53
lola: 76 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 1734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (! FIREABLE(t225) AND (FIREABLE(t58) AND (EF (FIREABLE(t151)) AND FIREABLE(t233))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(t225)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t151))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 608 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 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t233)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Raft-PT-06-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola: summary: yes unknown no yes no unknown unknown unknown unknown no yes unknown no no no no
lola: ========================================

BK_STOP 1463737699068

--------------------
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="Raft-PT-06"
export BK_EXAMINATION="CTLFireability"
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/Raft-PT-06.tgz
mv Raft-PT-06 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 Raft-PT-06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098kn-smll-146369140400175"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;