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

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

=== Now, execution of the tool begins

BK_START 1463763015774

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Railroad-PT-005
FORMULA Railroad-PT-005-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Railroad-PT-005-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: 124/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 68 places, 56 transitions, 27 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 42 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-005-CTLCardinality.task
lola: read: AG ((AF (2 <= pl_P25_1) OR !((3 <= pl_P29_3 OR 2 <= pl_P7_3)))) : !((!(!((2 <= pl_P36_1 AND pl_P9_1 <= pl_P20_1))) OR E(pl_P40_2 <= pl_P40_1 U 3 <= pl_P9_1))) : (E(!(2 <= pl_P15_1) U (3 <= pl_P41_1 OR 3 <= pl_P40_1)) AND (!(AX (1 <= pl_P34_4)) OR EX ((3 <= pl_P21_1 OR pl_P29_6 <= pl_P33_1)))) : (EX ((!(1 <= pl_P13_1) OR (pl_P26_1 <= pl_P7_3 OR 3 <= pl_P7_6))) AND (EF (3 <= pl_P40_3) OR AX (1 <= pl... (shortened)
lola: formula length: 1441
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 ((AF (-pl_P25_1 <= -2) OR (-pl_P29_3 > -3 AND -pl_P7_3 > -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((A(TRUE U -pl_P25_1 <= -2) OR (-pl_P29_3 > -3 AND -pl_P7_3 > -2)))))
lola: processed formula length: 81
lola: 295 rewrites
lola: formula mentions 3 of 68 places; total mentions: 3
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-pl_P36_1 > -2 OR -pl_P20_1 + pl_P9_1 > 0) AND A(-pl_P40_1 + pl_P40_2 > 0 R -pl_P9_1 > -3))
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: (-pl_P36_1 > -2 OR -pl_P20_1 + pl_P9_1 > 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-pl_P40_1 + pl_P40_2 > 0 R -pl_P9_1 > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(-pl_P40_1 + pl_P40_2 > 0) U !(-pl_P9_1 > -3)))
lola: processed formula length: 52
lola: 294 rewrites
lola: formula mentions 3 of 68 places; total mentions: 3
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(-pl_P15_1 > -2 U (-pl_P41_1 <= -3 OR -pl_P40_1 <= -3)) AND EX ((-pl_P34_4 > -1 OR (-pl_P21_1 <= -3 OR -pl_P33_1 + pl_P29_6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-pl_P15_1 > -2 U (-pl_P41_1 <= -3 OR -pl_P40_1 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-pl_P15_1 > -2 U (-pl_P41_1 <= -3 OR -pl_P40_1 <= -3))
lola: processed formula length: 56
lola: 294 rewrites
lola: formula mentions 3 of 68 places; total mentions: 3
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX ((-pl_P13_1 > -1 OR (pl_P26_1 + -pl_P7_3 <= 0 OR -pl_P7_6 <= -3))) AND (EF (-pl_P40_3 <= -3) OR AX (-pl_P4_1 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((-pl_P13_1 > -1 OR (pl_P26_1 + -pl_P7_3 <= 0 OR -pl_P7_6 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((-pl_P13_1 > -1 OR (pl_P26_1 + -pl_P7_3 <= 0 OR -pl_P7_6 <= -3)))
lola: processed formula length: 68
lola: 294 rewrites
lola: formula mentions 4 of 68 places; total mentions: 4
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-pl_P40_3 <= -3)
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 108 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: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-pl_P4_1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-pl_P4_1 <= -1)
lola: processed formula length: 18
lola: 294 rewrites
lola: formula mentions 1 of 68 places; total mentions: 1
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: SUBRESULT
========================================lola:
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EX (-pl_P0_5 <= -2) U EF (-pl_P7_3 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX(-pl_P0_5 <= -2) U E(TRUE U -pl_P7_3 <= -2))
lola: processed formula length: 48
lola: 296 rewrites
lola: formula mentions 2 of 68 places; total mentions: 2
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF (-pl_P37_1 <= -3) U -pl_P18_1 + pl_P29_2 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U -pl_P37_1 <= -3) U -pl_P18_1 + pl_P29_2 > 0)
lola: processed formula length: 55
lola: 295 rewrites
lola: formula mentions 3 of 68 places; total mentions: 3
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-pl_P13_1 > -2) AND (A(pl_P7_2 + -pl_P29_4 <= 0 U -pl_P26_1 + pl_P40_4 <= 0) AND (-pl_P29_5 > -2 AND AF (-pl_P15_1 > -2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-pl_P13_1 > -2)
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 108 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: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(pl_P7_2 + -pl_P29_4 <= 0 U -pl_P26_1 + pl_P40_4 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(pl_P7_2 + -pl_P29_4 <= 0 U -pl_P26_1 + pl_P40_4 <= 0)
lola: processed formula length: 55
lola: 294 rewrites
lola: formula mentions 4 of 68 places; total mentions: 4
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -pl_P29_5 > -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-pl_P15_1 > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -pl_P15_1 > -2)
lola: processed formula length: 24
lola: 294 rewrites
lola: formula mentions 1 of 68 places; total mentions: 1
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-pl_P31_1 > -2 AND -pl_P29_2 > -2))
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 108 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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-pl_P10_1 > -3 OR (-pl_P12_1 > -1 OR (-pl_P40_2 <= -3 OR (-pl_P7_3 <= -3 AND -pl_P13_1 <= -3)))))
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 108 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: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (pl_P0_3 + -pl_P29_6 <= 0) AND (pl_P31_1 + -pl_P13_1 <= 0 OR (-pl_P23_1 + pl_P34_4 > 0 OR pl_P34_1 + -pl_P6_1 > 0))) OR AX (EF (-pl_P7_6 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (pl_P0_3 + -pl_P29_6 <= 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 108 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 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EF (-pl_P7_6 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U -pl_P7_6 <= -3))
lola: processed formula length: 28
lola: 295 rewrites
lola: formula mentions 1 of 68 places; total mentions: 1
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((pl_P9_1 + -pl_P34_2 > 0 OR pl_P14_1 + -pl_P11_1 > 0) R -pl_P40_3 > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!((pl_P9_1 + -pl_P34_2 > 0 OR pl_P14_1 + -pl_P11_1 > 0)) U !(-pl_P40_3 > -2)))
lola: processed formula length: 82
lola: 294 rewrites
lola: formula mentions 5 of 68 places; total mentions: 5
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((AF (-pl_P30_1 <= -3) OR -pl_P0_2 + pl_P9_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((A(TRUE U -pl_P30_1 <= -3) OR -pl_P0_2 + pl_P9_1 <= 0))))
lola: processed formula length: 70
lola: 295 rewrites
lola: formula mentions 3 of 68 places; total mentions: 3
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-pl_P35_1 <= -2 AND (-pl_P24_1 <= -3 OR -pl_P40_2 <= -1))) OR AG ((-pl_P29_1 > -2 AND (-pl_P8_1 <= -3 OR pl_P3_1 + -pl_P22_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-pl_P35_1 <= -2 AND (-pl_P24_1 <= -3 OR -pl_P40_2 <= -1)))
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 108 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: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-pl_P29_1 > -2 AND (-pl_P8_1 <= -3 OR pl_P3_1 + -pl_P22_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 108 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((pl_P29_2 + -pl_P34_3 > 0 AND -pl_P3_1 + pl_P0_1 > 0) R (-pl_P34_1 + pl_P11_1 > 0 OR -pl_P0_2 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!((pl_P29_2 + -pl_P34_3 > 0 AND -pl_P3_1 + pl_P0_1 > 0)) U !((-pl_P34_1 + pl_P11_1 > 0 OR -pl_P0_2 > -3))))
lola: processed formula length: 111
lola: 294 rewrites
lola: formula mentions 7 of 68 places; total mentions: 7
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-pl_P0_6 <= -2 R (-pl_P7_1 > -3 AND -pl_P0_3 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(-pl_P0_6 <= -2) U !((-pl_P7_1 > -3 AND -pl_P0_3 > -3))))
lola: processed formula length: 62
lola: 294 rewrites
lola: formula mentions 3 of 68 places; total mentions: 3
lola: closed formula file Railroad-PT-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-pl_P7_4 > -2 AND (pl_P26_1 + -pl_P39_1 <= 0 OR -pl_P29_3 <= -1)) OR -pl_P7_5 > -3))
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 108 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: ========================================
lola: RESULT
lola: summary: yes yes no no no no yes yes yes no yes yes yes yes yes yes

BK_STOP 1463763016038

--------------------
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-005"
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-005.tgz
mv Railroad-PT-005 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-005, 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-146369140400219"
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 ;