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 Railroad-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140400228
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463763159041

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Railroad-PT-010
FORMULA Railroad-PT-010-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-010-CTLCardinality-13 CANNOT_COMPUTE
FORMULA Railroad-PT-010-CTLCardinality-14 CANNOT_COMPUTE
FORMULA Railroad-PT-010-CTLCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 274/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 118 places, 156 transitions, 47 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 72 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-010-CTLCardinality.task
lola: read: AG (EF ((pl_P37_7 <= pl_P37_6 OR pl_P20_7 <= pl_P47_1))) : !(!(EG (!(1 <= pl_P37_6)))) : A(!((3 <= pl_P14_11 AND 1 <= pl_P19_1)) U pl_P58_1 <= pl_P37_9) : AG (AG ((pl_P14_11 <= pl_P14_6 AND pl_P20_5 <= pl_P34_1))) : !(E((pl_P42_1 <= pl_P15_3 AND pl_P15_4 <= pl_P16_6) U (2 <= pl_P20_1 OR 2 <= pl_P9_1))) : EG ((((1 <= pl_P21_1 OR 3 <= pl_P15_4) OR (pl_P20_4 <= pl_P14_1 OR pl_P3_1 <= pl_P16_9)) OR AF... (shortened)
lola: formula length: 1325
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF ((-pl_P37_6 + pl_P37_7 <= 0 OR -pl_P47_1 + pl_P20_7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U (-pl_P37_6 + pl_P37_7 <= 0 OR -pl_P47_1 + pl_P20_7 <= 0)))))
lola: processed formula length: 82
lola: 253 rewrites
lola: formula mentions 4 of 118 places; total mentions: 4
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-pl_P37_6 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-pl_P37_6 > -1)))
lola: processed formula length: 30
lola: 252 rewrites
lola: formula mentions 1 of 118 places; total mentions: 1
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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 2 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-pl_P14_11 > -3 OR -pl_P19_1 > -1) U pl_P58_1 + -pl_P37_9 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-pl_P14_11 > -3 OR -pl_P19_1 > -1) U pl_P58_1 + -pl_P37_9 <= 0)
lola: processed formula length: 66
lola: 252 rewrites
lola: formula mentions 4 of 118 places; total mentions: 4
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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 3 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((pl_P14_11 + -pl_P14_6 <= 0 AND -pl_P34_1 + pl_P20_5 <= 0))
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 188 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 4 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((pl_P42_1 + -pl_P15_3 > 0 OR pl_P15_4 + -pl_P16_6 > 0) R (-pl_P20_1 > -2 AND -pl_P9_1 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!((pl_P42_1 + -pl_P15_3 > 0 OR pl_P15_4 + -pl_P16_6 > 0)) U !((-pl_P20_1 > -2 AND -pl_P9_1 > -2))))
lola: processed formula length: 103
lola: 252 rewrites
lola: formula mentions 6 of 118 places; total mentions: 6
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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 5 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-pl_P21_1 <= -1 OR (-pl_P15_4 <= -3 OR (pl_P20_4 + -pl_P14_1 <= 0 OR (-pl_P16_9 + pl_P3_1 <= 0 OR AF (-pl_P16_10 <= -2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-pl_P21_1 <= -1 OR (-pl_P15_4 <= -3 OR (pl_P20_4 + -pl_P14_1 <= 0 OR (-pl_P16_9 + pl_P3_1 <= 0 OR A(TRUE U -pl_P16_10 <= -2))))))))
lola: processed formula length: 145
lola: 253 rewrites
lola: formula mentions 7 of 118 places; total mentions: 7
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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: subprocess 6 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((-pl_P53_1 <= -2 AND -pl_P20_1 <= -3)))
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 !((-pl_P53_1 <= -2 AND -pl_P20_1 <= -3)))))
lola: processed formula length: 63
lola: 253 rewrites
lola: formula mentions 2 of 118 places; total mentions: 2
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-pl_P3_1 <= -2) OR (AX (-pl_P44_1 <= -1) OR EG (EG (pl_P14_3 + -pl_P15_9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-pl_P3_1 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -pl_P3_1 <= -2)
lola: processed formula length: 24
lola: 252 rewrites
lola: formula mentions 1 of 118 places; total mentions: 1
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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 8 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-pl_P44_1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-pl_P44_1 <= -1)
lola: processed formula length: 19
lola: 252 rewrites
lola: formula mentions 1 of 118 places; total mentions: 1
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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 9 will run for 449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EG (pl_P14_3 + -pl_P15_9 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(A(TRUE U !(pl_P14_3 + -pl_P15_9 <= 0))))))
lola: processed formula length: 57
lola: 253 rewrites
lola: formula mentions 2 of 118 places; total mentions: 2
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (pl_P37_5 + -pl_P14_1 <= 0) OR ((AF (-pl_P62_1 <= -2) AND EF (-pl_P16_9 <= -1)) OR EG (-pl_P20_8 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (pl_P37_5 + -pl_P14_1 <= 0)
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 188 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 invariant.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX (EF (-pl_P15_3 <= -3)) OR (-pl_P13_1 > -2 AND -pl_P15_3 + pl_P5_1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EF (-pl_P15_3 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U -pl_P15_3 <= -3))
lola: processed formula length: 29
lola: 253 rewrites
lola: formula mentions 1 of 118 places; total mentions: 1
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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 10 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-pl_P13_1 > -2 AND -pl_P15_3 + pl_P5_1 > 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file Railroad-PT-010-CTLCardinality.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 10 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX (EG (pl_P59_1 + -pl_P53_1 <= 0)) OR (EF (pl_P19_1 + -pl_P15_11 > 0) AND -pl_P61_1 + pl_P11_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EG (pl_P59_1 + -pl_P53_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(A(TRUE U !(pl_P59_1 + -pl_P53_1 <= 0))))
lola: processed formula length: 45
lola: 253 rewrites
lola: formula mentions 2 of 118 places; total mentions: 2
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((EG (-pl_P45_1 + pl_P51_1 <= 0) AND (-pl_P16_3 > -3 OR (pl_P26_1 + -pl_P3_1 <= 0 AND -pl_P37_10 <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((!(A(TRUE U !(-pl_P45_1 + pl_P51_1 <= 0))) AND (-pl_P16_3 > -3 OR (pl_P26_1 + -pl_P3_1 <= 0 AND -pl_P37_10 <= -1))))
lola: processed formula length: 119
lola: 253 rewrites
lola: formula mentions 6 of 118 places; total mentions: 6
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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 12 will run for 716 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF (-pl_P11_1 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U -pl_P11_1 <= -3))
lola: processed formula length: 35
lola: 253 rewrites
lola: formula mentions 1 of 118 places; total mentions: 1
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 910 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((-pl_P37_5 + pl_P16_5 <= 0 AND (-pl_P37_7 <= -2 AND -pl_P59_1 + pl_P54_1 <= 0))) OR (E(pl_P2_1 + -pl_P14_3 <= 0 U -pl_P29_1 + pl_P24_1 <= 0) AND (EG (-pl_P15_6 + pl_P15_8 <= 0) AND -pl_P54_1 > -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 910 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-pl_P37_5 + pl_P16_5 <= 0 AND (-pl_P37_7 <= -2 AND -pl_P59_1 + pl_P54_1 <= 0)))
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 188 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 14 will run for 1365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(pl_P2_1 + -pl_P14_3 <= 0 U -pl_P29_1 + pl_P24_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(pl_P2_1 + -pl_P14_3 <= 0 U -pl_P29_1 + pl_P24_1 <= 0)
lola: processed formula length: 55
lola: 252 rewrites
lola: formula mentions 4 of 118 places; total mentions: 4
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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 15 will run for 2730 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-pl_P15_6 + pl_P15_8 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-pl_P15_6 + pl_P15_8 <= 0)))
lola: processed formula length: 41
lola: 252 rewrites
lola: formula mentions 2 of 118 places; total mentions: 2
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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: 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 14 will run for 1325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((-pl_P16_3 <= -3 OR -pl_P45_1 <= -2) AND (-pl_P53_1 <= -2 OR -pl_P32_1 <= -1)) OR (EF ((-pl_P54_1 <= -2 AND -pl_P16_8 <= -2)) OR (-pl_P0_1 <= -2 OR -pl_P48_1 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-pl_P16_3 <= -3 OR -pl_P45_1 <= -2) AND (-pl_P53_1 <= -2 OR -pl_P32_1 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 4 atomic propositions
lola: closed formula file Railroad-PT-010-CTLCardinality.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 2650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-pl_P54_1 <= -2 AND -pl_P16_8 <= -2))
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 188 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 unreachable.
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 15 will run for 2619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-pl_P14_4 > -3))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -pl_P14_4 > -3))))
lola: processed formula length: 40
lola: 253 rewrites
lola: formula mentions 1 of 118 places; total mentions: 1
lola: closed formula file Railroad-PT-010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 188 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: RESULT
lola: summary: yes yes no no yes yes no yes yes no yes yes no unknown unknown yes
lola: ========================================

BK_STOP 1463764115751

--------------------
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="Railroad-PT-010"
export BK_EXAMINATION="CTLCardinality"
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/Railroad-PT-010.tgz
mv Railroad-PT-010 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 Railroad-PT-010, examination is CTLCardinality"
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-146369140400228"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;