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

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

=== Now, execution of the tool begins

BK_START 1463797791708

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ ResAllocation-PT-R015C002
FORMULA ResAllocation-PT-R015C002-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R015C002-CTLCardinality-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: 92/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 60 places, 32 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 47 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R015C002-CTLCardinality.task
lola: read: !(((EF (r_1_2 <= r_0_10) OR AF (3 <= p_0_10)) AND AF (!(p_1_5 <= r_1_11)))) : (E((r_0_6 <= p_0_5 OR 2 <= r_0_12) U 3 <= r_1_12) OR E(!(r_1_8 <= p_0_2) U !(p_1_11 <= r_1_6))) : (r_1_3 <= p_1_13 OR EG (AF (r_1_8 <= p_0_11))) : EG (!(EF (2 <= p_1_12))) : (2 <= r_1_10 OR (!(EF (3 <= r_0_4)) AND (((p_1_11 <= p_1_13 OR 3 <= p_1_12) OR (3 <= r_1_9 OR r_0_10 <= r_1_3)) AND p_1_12 <= r_1_10))) : EG (!((!(3... (shortened)
lola: formula length: 1271
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 (r_1_2 + -r_0_10 > 0) AND EG (-p_0_10 > -3)) OR EG (-r_1_11 + p_1_5 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (r_1_2 + -r_0_10 > 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 4 bytes per marking, with 2 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-r_1_11 + p_1_5 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-r_1_11 + p_1_5 <= 0)))
lola: processed formula length: 36
lola: 308 rewrites
lola: formula mentions 2 of 60 places; total mentions: 2
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E((r_0_6 + -p_0_5 <= 0 OR -r_0_12 <= -2) U -r_1_12 <= -3) OR E(r_1_8 + -p_0_2 > 0 U -r_1_6 + p_1_11 > 0))
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: E((r_0_6 + -p_0_5 <= 0 OR -r_0_12 <= -2) U -r_1_12 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((r_0_6 + -p_0_5 <= 0 OR -r_0_12 <= -2) U -r_1_12 <= -3)
lola: processed formula length: 57
lola: 308 rewrites
lola: formula mentions 4 of 60 places; total mentions: 4
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(r_1_8 + -p_0_2 > 0 U -r_1_6 + p_1_11 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(r_1_8 + -p_0_2 > 0 U -r_1_6 + p_1_11 > 0)
lola: processed formula length: 43
lola: 308 rewrites
lola: formula mentions 4 of 60 places; total mentions: 4
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (r_1_3 + -p_1_13 <= 0 OR EG (AF (r_1_8 + -p_0_11 <= 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: r_1_3 + -p_1_13 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AF (r_1_8 + -p_0_11 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(TRUE U r_1_8 + -p_0_11 <= 0))))
lola: processed formula length: 46
lola: 309 rewrites
lola: formula mentions 2 of 60 places; total mentions: 2
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: 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: EG (AG (-p_1_12 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !(-p_1_12 > -2))))))
lola: processed formula length: 44
lola: 309 rewrites
lola: formula mentions 1 of 60 places; total mentions: 1
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-r_1_10 <= -2 OR (AG (-r_0_4 > -3) AND ((-p_1_13 + p_1_11 <= 0 OR (-p_1_12 <= -3 OR (-r_1_9 <= -3 OR -r_1_3 + r_0_10 <= 0))) AND p_1_12 + -r_1_10 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -r_1_10 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-r_0_4 > -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 4 bytes per marking, with 2 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 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-p_1_13 + p_1_11 <= 0 OR (-p_1_12 <= -3 OR (-r_1_9 <= -3 OR -r_1_3 + r_0_10 <= 0))) AND p_1_12 + -r_1_10 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 5 atomic propositions
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-p_1_0 <= -3 OR r_0_14 + -r_1_11 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-p_1_0 <= -3 OR r_0_14 + -r_1_11 <= 0))))
lola: processed formula length: 55
lola: 308 rewrites
lola: formula mentions 3 of 60 places; total mentions: 3
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((r_0_9 + -r_0_3 <= 0 OR p_0_8 + -p_0_7 > 0)) AND EG (((-p_0_9 <= -1 AND r_1_1 + -r_0_12 <= 0) OR (r_0_4 + -p_0_1 <= 0 OR r_0_8 + -r_0_6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((r_0_9 + -r_0_3 <= 0 OR p_0_8 + -p_0_7 > 0))
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 4 bytes per marking, with 2 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 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((-p_0_9 <= -1 AND r_1_1 + -r_0_12 <= 0) OR (r_0_4 + -p_0_1 <= 0 OR r_0_8 + -r_0_6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((-p_0_9 <= -1 AND r_1_1 + -r_0_12 <= 0) OR (r_0_4 + -p_0_1 <= 0 OR r_0_8 + -r_0_6 <= 0)))))
lola: processed formula length: 105
lola: 308 rewrites
lola: formula mentions 7 of 60 places; total mentions: 7
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: EG ((-r_1_2 <= -1 OR -p_1_11 + p_0_3 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-r_1_2 <= -1 OR -p_1_11 + p_0_3 <= 0))))
lola: processed formula length: 54
lola: 308 rewrites
lola: formula mentions 3 of 60 places; total mentions: 3
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: E((-r_1_9 + r_0_13 <= 0 OR (-p_0_4 <= -3 OR (-p_1_13 <= -1 AND -r_1_3 <= -1))) U EF (-r_0_13 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-r_1_9 + r_0_13 <= 0 OR (-p_0_4 <= -3 OR (-p_1_13 <= -1 AND -r_1_3 <= -1))) U E(TRUE U -r_0_13 <= -3))
lola: processed formula length: 105
lola: 309 rewrites
lola: formula mentions 5 of 60 places; total mentions: 6
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (E(r_1_5 + -p_0_3 <= 0 U -r_0_6 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(r_1_5 + -p_0_3 <= 0 U -r_0_6 <= -3))
lola: processed formula length: 47
lola: 309 rewrites
lola: formula mentions 3 of 60 places; total mentions: 3
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-p_1_11 <= -2 OR (((-p_1_10 + r_0_14 <= 0 OR r_1_12 + -p_0_6 <= 0) AND -r_0_7 + p_1_1 <= 0) OR (-r_1_3 <= -3 OR -r_1_13 + p_0_7 <= 0))) AND AF ((-r_1_2 + r_0_4 > 0 OR -p_1_14 + p_0_2 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-p_1_11 <= -2 OR (((-p_1_10 + r_0_14 <= 0 OR r_1_12 + -p_0_6 <= 0) AND -r_0_7 + p_1_1 <= 0) OR (-r_1_3 <= -3 OR -r_1_13 + p_0_7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 6 atomic propositions
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-r_1_2 + r_0_4 > 0 OR -p_1_14 + p_0_2 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-r_1_2 + r_0_4 > 0 OR -p_1_14 + p_0_2 > 0))
lola: processed formula length: 53
lola: 308 rewrites
lola: formula mentions 4 of 60 places; total mentions: 4
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A(-r_1_9 + r_0_7 > 0 R -p_1_1 > -1) OR (-r_1_10 <= -2 AND (p_0_13 + -p_1_10 <= 0 AND -r_1_1 + r_1_0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-r_1_9 + r_0_7 > 0 R -p_1_1 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(-r_1_9 + r_0_7 > 0) U !(-p_1_1 > -1)))
lola: processed formula length: 44
lola: 308 rewrites
lola: formula mentions 3 of 60 places; total mentions: 3
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((p_0_10 + -p_0_3 > 0 AND p_0_11 + -p_1_1 > 0) U EG (r_0_12 + -r_1_14 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p_0_10 + -p_0_3 > 0 AND p_0_11 + -p_1_1 > 0) U !(A(TRUE U !(r_0_12 + -r_1_14 <= 0))))
lola: processed formula length: 88
lola: 309 rewrites
lola: formula mentions 6 of 60 places; total mentions: 6
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AX (-p_1_6 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(AX(-p_1_6 > -2))))
lola: processed formula length: 31
lola: 309 rewrites
lola: formula mentions 1 of 60 places; total mentions: 1
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 1768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((p_1_11 + -r_1_12 > 0 AND r_0_8 + -p_1_13 > 0) U EG (p_1_11 + -r_0_13 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p_1_11 + -r_1_12 > 0 AND r_0_8 + -p_1_13 > 0) U !(A(TRUE U !(p_1_11 + -r_0_13 <= 0))))
lola: processed formula length: 89
lola: 309 rewrites
lola: formula mentions 5 of 60 places; total mentions: 6
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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 15 will run for 3537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AF (-p_0_8 > -3) AND EG (-p_1_7 > -1)) OR AG (-p_0_4 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-p_0_8 > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -p_0_8 > -3)
lola: processed formula length: 21
lola: 308 rewrites
lola: formula mentions 1 of 60 places; total mentions: 1
lola: closed formula file ResAllocation-PT-R015C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p_0_4 <= -1)
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 4 bytes per marking, with 2 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: unknown
lola: The Boolean predicate may be true or false.
lola: RESULT
lola: summary: yes no no yes yes yes yes yes no no no yes yes yes yes unknown
lola: ========================================

BK_STOP 1463797794628

--------------------
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="ResAllocation-PT-R015C002"
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/ResAllocation-PT-R015C002.tgz
mv ResAllocation-PT-R015C002 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 ResAllocation-PT-R015C002, 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-146369140600363"
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 ;