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 Planning-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088600490
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463716127123

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLFireability @ Planning-PT-none
FORMULA Planning-PT-none-CTLFireability-0 CANNOT_COMPUTE
FORMULA Planning-PT-none-CTLFireability-1 CANNOT_COMPUTE
FORMULA Planning-PT-none-CTLFireability-2 CANNOT_COMPUTE
FORMULA Planning-PT-none-CTLFireability-3 CANNOT_COMPUTE
FORMULA Planning-PT-none-CTLFireability-4 CANNOT_COMPUTE
FORMULA Planning-PT-none-CTLFireability-5 CANNOT_COMPUTE
FORMULA Planning-PT-none-CTLFireability-6 CANNOT_COMPUTE
FORMULA Planning-PT-none-CTLFireability-7 CANNOT_COMPUTE
FORMULA Planning-PT-none-CTLFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Planning-PT-none-CTLFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Planning-PT-none-CTLFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Planning-PT-none-CTLFireability-11 CANNOT_COMPUTE
FORMULA Planning-PT-none-CTLFireability-12 CANNOT_COMPUTE
FORMULA Planning-PT-none-CTLFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Planning-PT-none-CTLFireability-14 CANNOT_COMPUTE
FORMULA Planning-PT-none-CTLFireability-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: 254/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 126 places, 128 transitions, 82 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 124 transition conflict sets
lola: TASK
lola: reading formula from Planning-PT-none-CTLFireability.task
lola: read: !(EX (AG (!(FIREABLE(t28))))) : AG (((!(FIREABLE(t101)) OR EF (FIREABLE(t19))) AND (EG (FIREABLE(t126)) OR (!(FIREABLE(t54)) OR (FIREABLE(t74) OR FIREABLE(t53)))))) : !(!(EF (EX (FIREABLE(t122))))) : (((E(FIREABLE(t63) U FIREABLE(t92)) AND (EF (FIREABLE(t68)) AND AF (FIREABLE(t34)))) AND E((FIREABLE(t88) OR FIREABLE(t124)) U (FIREABLE(t94) AND FIREABLE(t128)))) OR FIREABLE(t82)) : AF (EF (FIREABLE... (shortened)
lola: formula length: 1749
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 (EF (FIREABLE(t28)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U FIREABLE(t28)))
lola: processed formula length: 27
lola: 79 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(t101) OR EF (FIREABLE(t19))) AND (EG (FIREABLE(t126)) OR (! FIREABLE(t54) OR (FIREABLE(t74) OR FIREABLE(t53))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(((! FIREABLE(t101) OR E(TRUE U FIREABLE(t19))) AND (!(A(TRUE U !(FIREABLE(t126)))) OR (! FIREABLE(t54) OR (FIREABLE(t74) OR FIREABLE(t53))))))))
lola: processed formula length: 157
lola: 80 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX (FIREABLE(t122)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(FIREABLE(t122)))
lola: processed formula length: 28
lola: 79 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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 3 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E(FIREABLE(t63) U FIREABLE(t92)) AND (EF (FIREABLE(t68)) AND (AF (FIREABLE(t34)) AND E((FIREABLE(t88) OR FIREABLE(t124)) U (FIREABLE(t94) AND FIREABLE(t128)))))) OR FIREABLE(t82))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(FIREABLE(t63) U FIREABLE(t92))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(t63) U FIREABLE(t92))
lola: processed formula length: 32
lola: 78 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: subprocess 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t68))
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 328 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 5 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (FIREABLE(t34))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t34))
lola: processed formula length: 23
lola: 78 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: subprocess 6 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((FIREABLE(t88) OR FIREABLE(t124)) U (FIREABLE(t94) AND FIREABLE(t128)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(t88) OR FIREABLE(t124)) U (FIREABLE(t94) AND FIREABLE(t128)))
lola: processed formula length: 73
lola: 78 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t82)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Planning-PT-none-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: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 4 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF (FIREABLE(t126)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U FIREABLE(t126)))
lola: processed formula length: 34
lola: 79 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: ========================================
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (EG (FIREABLE(t31))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(E(TRUE U !(!(A(TRUE U !(FIREABLE(t31))))))))
lola: processed formula length: 55
lola: 80 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A(! FIREABLE(t67) R ! FIREABLE(t38)) AND FIREABLE(t3)) OR (AG ((FIREABLE(t1) OR FIREABLE(t8))) OR ((EG (FIREABLE(t88)) AND EF (FIREABLE(t124))) OR A(! FIREABLE(t46) R ! FIREABLE(t38)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(! FIREABLE(t67) R ! FIREABLE(t38))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(! FIREABLE(t67)) U !(! FIREABLE(t38))))
lola: processed formula length: 45
lola: 78 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: subprocess 7 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(t1) OR FIREABLE(t8)))
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 328 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 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (FIREABLE(t88))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(FIREABLE(t88))))
lola: processed formula length: 29
lola: 78 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t124))
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 328 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 10 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(! FIREABLE(t46) R ! FIREABLE(t38))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(! FIREABLE(t46)) U !(! FIREABLE(t38))))
lola: processed formula length: 45
lola: 78 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AX ((! FIREABLE(t61) AND ! FIREABLE(t1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((! FIREABLE(t61) AND ! FIREABLE(t1))))
lola: processed formula length: 50
lola: 79 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((! FIREABLE(t61) AND ! FIREABLE(t23))) OR E(((FIREABLE(t100) OR FIREABLE(t5)) AND FIREABLE(t116)) U (FIREABLE(t100) OR (FIREABLE(t95) OR FIREABLE(t122)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t61) AND ! FIREABLE(t23)))
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 328 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 9 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(((FIREABLE(t100) OR FIREABLE(t5)) AND FIREABLE(t116)) U (FIREABLE(t100) OR (FIREABLE(t95) OR FIREABLE(t122))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((FIREABLE(t100) OR FIREABLE(t5)) AND FIREABLE(t116)) U (FIREABLE(t100) OR (FIREABLE(t95) OR FIREABLE(t122))))
lola: processed formula length: 112
lola: 78 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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 9 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((FIREABLE(t61) AND FIREABLE(t105))) AND EF ((! FIREABLE(t80) OR (! FIREABLE(t4) OR FIREABLE(t99)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t61) AND FIREABLE(t105)))
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 328 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 10 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(t80) OR (! FIREABLE(t4) OR FIREABLE(t99))))
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 328 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t4))
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 328 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 11 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((! FIREABLE(t23) AND ! FIREABLE(t98))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !((! FIREABLE(t23) AND ! FIREABLE(t98))))))
lola: processed formula length: 63
lola: 79 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: subprocess 12 will run for 613 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((EF (FIREABLE(t23)) OR FIREABLE(t86)) AND FIREABLE(t29)) OR ((FIREABLE(t97) AND (FIREABLE(t122) AND (! FIREABLE(t76) AND (! FIREABLE(t4) AND FIREABLE(t100))))) OR (EF (FIREABLE(t57)) AND EF (FIREABLE(t76)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 613 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t23))
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 328 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 13 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t29)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Planning-PT-none-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 1226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t97) AND (FIREABLE(t122) AND (! FIREABLE(t76) AND (! FIREABLE(t4) AND FIREABLE(t100)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t57))
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 328 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: 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 13 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EX ((FIREABLE(t90) OR FIREABLE(t115))) OR FIREABLE(t62)) AND (AG (! FIREABLE(t32)) AND EF (((! FIREABLE(t33) AND (FIREABLE(t60) OR FIREABLE(t85))) OR (FIREABLE(t31) OR (FIREABLE(t97) OR (FIREABLE(t19) OR FIREABLE(t7))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((FIREABLE(t90) OR FIREABLE(t115)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((FIREABLE(t90) OR FIREABLE(t115)))
lola: processed formula length: 37
lola: 78 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(t32))
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 328 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (E((FIREABLE(t99) OR FIREABLE(t25)) U ! FIREABLE(t100)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(E((FIREABLE(t99) OR FIREABLE(t25)) U ! FIREABLE(t100)))))
lola: processed formula length: 70
lola: 79 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: subprocess 15 will run for 2321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((! FIREABLE(t77) OR (FIREABLE(t84) OR FIREABLE(t59))) AND EF (FIREABLE(t5))) OR ((EF (FIREABLE(t8)) AND (FIREABLE(t109) OR ! FIREABLE(t65))) OR EG ((FIREABLE(t9) AND FIREABLE(t112))))) AND ! FIREABLE(t12))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (! FIREABLE(t77) OR (FIREABLE(t84) OR FIREABLE(t59)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given 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: (FIREABLE(t109) OR ! FIREABLE(t65))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((FIREABLE(t9) AND FIREABLE(t112)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((FIREABLE(t9) AND FIREABLE(t112)))))
lola: processed formula length: 49
lola: 78 rewrites
lola: formula mentions 0 of 126 places; total mentions: 0
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 328 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: subprocess 19 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(t12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Planning-PT-none-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: RESULT
lola: summary: unknown unknown unknown unknown unknown unknown unknown unknown no yes yes unknown unknown no unknown unknown
lola: ========================================

BK_STOP 1463717347484

--------------------
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="Planning-PT-none"
export BK_EXAMINATION="CTLFireability"
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/Planning-PT-none.tgz
mv Planning-PT-none 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 Planning-PT-none, 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 r086kn-ebro-146369088600490"
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 ;