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

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

=== Now, execution of the tool begins

BK_START 1463797943529

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ ResAllocation-PT-R020C002
FORMULA ResAllocation-PT-R020C002-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ResAllocation-PT-R020C002-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: 122/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 80 places, 42 transitions, 40 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 62 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R020C002-CTLCardinality.task
lola: read: AX (!(AF (3 <= p_1_19))) : EG (AX (!(1 <= p_1_9))) : ((EX (1 <= r_0_5) AND EF ((r_1_2 <= r_1_5 AND 3 <= r_0_18))) OR AX (((p_1_9 <= p_1_0 OR 3 <= p_0_16) AND 3 <= p_1_16))) : AF (AX ((3 <= r_1_5 AND 2 <= r_0_2))) : !(AF (AF (r_0_8 <= p_1_3))) : AF (!(1 <= r_0_17)) : !(AG ((!(1 <= p_0_15) AND (r_0_14 <= p_0_19 OR p_1_9 <= r_1_2)))) : EG (!(AG (r_1_6 <= p_0_3))) : AX ((AG (p_0_19 <= p_0_4) OR ((p_0_... (shortened)
lola: formula length: 897
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EG (-p_1_19 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(A(TRUE U !(-p_1_19 > -3))))
lola: processed formula length: 32
lola: 205 rewrites
lola: formula mentions 1 of 80 places; total mentions: 1
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AX (-p_1_9 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(AX(-p_1_9 > -1))))
lola: processed formula length: 31
lola: 205 rewrites
lola: formula mentions 1 of 80 places; total mentions: 1
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EX (-r_0_5 <= -1) AND EF ((-r_1_5 + r_1_2 <= 0 AND -r_0_18 <= -3))) OR AX (((p_1_9 + -p_1_0 <= 0 OR -p_0_16 <= -3) AND -p_1_16 <= -3)))
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: EX (-r_0_5 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-r_0_5 <= -1)
lola: processed formula length: 16
lola: 204 rewrites
lola: formula mentions 1 of 80 places; total mentions: 1
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-r_1_5 + r_1_2 <= 0 AND -r_0_18 <= -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 8 bytes per marking, with 24 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (((p_1_9 + -p_1_0 <= 0 OR -p_0_16 <= -3) AND -p_1_16 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((p_1_9 + -p_1_0 <= 0 OR -p_0_16 <= -3) AND -p_1_16 <= -3))
lola: processed formula length: 62
lola: 204 rewrites
lola: formula mentions 4 of 80 places; total mentions: 4
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AX ((-r_1_5 <= -3 AND -r_0_2 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((-r_1_5 <= -3 AND -r_0_2 <= -2)))
lola: processed formula length: 45
lola: 205 rewrites
lola: formula mentions 2 of 80 places; total mentions: 2
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 4 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (r_0_8 + -p_1_3 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(r_0_8 + -p_1_3 > 0)))
lola: processed formula length: 34
lola: 204 rewrites
lola: formula mentions 2 of 80 places; total mentions: 2
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-r_0_17 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -r_0_17 > -1)
lola: processed formula length: 22
lola: 204 rewrites
lola: formula mentions 1 of 80 places; total mentions: 1
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p_0_15 <= -1 OR (-p_0_19 + r_0_14 > 0 AND -r_1_2 + p_1_9 > 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 8 bytes per marking, with 24 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 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (r_1_6 + -p_0_3 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U r_1_6 + -p_0_3 > 0))))
lola: processed formula length: 44
lola: 205 rewrites
lola: formula mentions 2 of 80 places; total mentions: 2
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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: subprocess 8 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((AG (p_0_19 + -p_0_4 <= 0) OR ((-p_1_17 + p_0_5 <= 0 OR r_1_5 + -r_0_14 <= 0) AND (r_1_11 + -p_0_4 <= 0 OR r_0_6 + -p_0_17 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((!(E(TRUE U !(p_0_19 + -p_0_4 <= 0))) OR ((-p_1_17 + p_0_5 <= 0 OR r_1_5 + -r_0_14 <= 0) AND (r_1_11 + -p_0_4 <= 0 OR r_0_6 + -p_0_17 <= 0))))
lola: processed formula length: 145
lola: 205 rewrites
lola: formula mentions 9 of 80 places; total mentions: 10
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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: ========================================
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF ((-r_1_0 <= -2 AND -p_1_18 + p_1_7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U (-r_1_0 <= -2 AND -p_1_18 + p_1_7 <= 0)))))
lola: processed formula length: 65
lola: 205 rewrites
lola: formula mentions 3 of 80 places; total mentions: 3
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF ((-p_1_3 > -1 AND r_1_2 + -r_0_5 > 0)) OR (EF (-p_0_11 > -1) AND (r_1_0 + -p_1_10 <= 0 AND -p_0_18 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-p_1_3 > -1 AND r_1_2 + -r_0_5 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-p_1_3 > -1 AND r_1_2 + -r_0_5 > 0))
lola: processed formula length: 46
lola: 204 rewrites
lola: formula mentions 3 of 80 places; total mentions: 3
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 664 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-r_1_19 > -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 8 bytes per marking, with 24 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 12 will run for 830 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG (-r_0_8 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !(-r_0_8 > -2))))
lola: processed formula length: 37
lola: 205 rewrites
lola: formula mentions 1 of 80 places; total mentions: 1
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 1107 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EG (-r_0_14 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(!(A(TRUE U !(-r_0_14 > -2))))))
lola: processed formula length: 44
lola: 205 rewrites
lola: formula mentions 1 of 80 places; total mentions: 1
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 14 will run for 1623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((-r_0_5 + p_1_16 > 0 OR -r_1_16 <= -1) AND EX (p_1_12 + -p_1_5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((-r_0_5 + p_1_16 > 0 OR -r_1_16 <= -1) AND EX(p_1_12 + -p_1_5 <= 0)))))
lola: processed formula length: 85
lola: 205 rewrites
lola: formula mentions 5 of 80 places; total mentions: 5
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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 3190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((-r_1_15 > -2 AND -p_1_4 > -3) OR ((p_1_15 + -p_1_11 <= 0 OR r_1_10 + -p_1_9 <= 0) AND (-p_1_11 + p_0_5 <= 0 AND -p_0_18 + p_1_15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((-r_1_15 > -2 AND -p_1_4 > -3) OR ((p_1_15 + -p_1_11 <= 0 OR r_1_10 + -p_1_9 <= 0) AND (-p_1_11 + p_0_5 <= 0 AND -p_0_18 + p_1_15 <= 0))))))
lola: processed formula length: 154
lola: 204 rewrites
lola: formula mentions 8 of 80 places; total mentions: 10
lola: closed formula file ResAllocation-PT-R020C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 24 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: RESULT
lola: summary: yes yes no no no yes yes yes no no yes yes yes yes yes yes
lola: ========================================

BK_STOP 1463798293989

--------------------
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-R020C002"
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-R020C002.tgz
mv ResAllocation-PT-R020C002 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-R020C002, 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-146369140600372"
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 ;