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 IBMB2S565S3960-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358896700057
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463590427294

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ IBMB2S565S3960-PT-none
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-1 CANNOT_COMPUTE
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBMB2S565S3960-PT-none-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: 452/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 273 places, 179 transitions, 172 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 171 transition conflict sets
lola: TASK
lola: reading formula from IBMB2S565S3960-PT-none-CTLCardinality.task
lola: read: A(EF (1 <= callToTask.s00003973.output.s00001054) U 2 <= fork.s00001403.input.s00001052) : ((2 <= callToTask.s00003965.output.s00001054 AND EF ((3 <= callToTask.s00003975.output.s00001080 OR 2 <= callToTask.s00003981.input.s00001052))) OR E(!(3 <= join.s00001163.activated.s00001062) U 3 <= callToTask.s00003975.input.s00001052)) : AF ((EF (1 <= callToTask.s00003908.input.s00001052) OR AG (3 <= merg... (shortened)
lola: formula length: 2811
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EF (-callToTask.s00003973.output.s00001054 <= -1) U -fork.s00001403.input.s00001052 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U -callToTask.s00003973.output.s00001054 <= -1) U -fork.s00001403.input.s00001052 <= -2)
lola: processed formula length: 97
lola: 174 rewrites
lola: formula mentions 2 of 273 places; total mentions: 2
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-callToTask.s00003965.output.s00001054 <= -2 AND EF ((-callToTask.s00003975.output.s00001080 <= -3 OR -callToTask.s00003981.input.s00001052 <= -2))) OR E(-join.s00001163.activated.s00001062 > -3 U -callToTask.s00003975.input.s00001052 <= -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: -callToTask.s00003965.output.s00001054 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-join.s00001163.activated.s00001062 > -3 U -callToTask.s00003975.input.s00001052 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-join.s00001163.activated.s00001062 > -3 U -callToTask.s00003975.input.s00001052 <= -3)
lola: processed formula length: 89
lola: 173 rewrites
lola: formula mentions 2 of 273 places; total mentions: 2
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((EF (-callToTask.s00003908.input.s00001052 <= -1) OR AG (-merge.s00001162.input.s00001129 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (E(TRUE U -callToTask.s00003908.input.s00001052 <= -1) OR !(E(TRUE U !(-merge.s00001162.input.s00001129 <= -3)))))
lola: processed formula length: 123
lola: 175 rewrites
lola: formula mentions 2 of 273 places; total mentions: 2
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-callToTask.s00003961.output.s00001080 > -1 AND (-callToProcess.s00003876.input.s00001066 <= -1 OR callToTask.s00003974.output.s00001054 + -decision.s00001123.activated <= 0)) OR AG (-merge.s00001161.input.s00001068 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(((-callToTask.s00003961.output.s00001080 > -1 AND (-callToProcess.s00003876.input.s00001066 <= -1 OR callToTask.s00003974.output.s00001054 + -decision.s00001123.activated <= 0)) OR !(E(TRUE U !(-merge.s00001161.input.s00001068 <= -1)))))))
lola: processed formula length: 252
lola: 174 rewrites
lola: formula mentions 5 of 273 places; total mentions: 5
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EG (-fork.s00001403.input.s00001052 <= -2) AND (-callToTask.s00003975.output.s00001077 <= -3 OR (-callToTask.s00003970.input.s00001052 <= -3 OR (-callToTask.s00003968.inputCriterion.s00001053.used + merge.s00001061.input.s00001068 <= 0 AND -join.s00002243.input.s00001166 <= -2)))) OR ((EF (-callToTask.s00003908.inputCriterion.s00001053.used <= -3) AND ((-callToProcess.s00003904.input.s00001066 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-fork.s00001403.input.s00001052 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-fork.s00001403.input.s00001052 <= -2)))
lola: processed formula length: 53
lola: 173 rewrites
lola: formula mentions 1 of 273 places; total mentions: 1
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-callToTask.s00003908.inputCriterion.s00001053.used <= -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 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-callToProcess.s00003904.input.s00001066 + callToProcess.s00003904.input.s00001052 <= 0 OR -callToTask.s00001360.inputCriterion.s00001053.used <= -2) AND (-callToTask.s00003980.inputCriterion.s00001053.used <= -1 OR callToTask.s00003972.input.s00001066 + -join.s00002243.input.s00001166 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 4 atomic propositions
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AX ((-callToTask.s00003965.inputCriterion.s00001053.used <= -1 OR callToTask.s00003973.input.s00001066 + -merge.s00001162.input.s00001129 <= 0)) AND EF (-merge.s00001161.input.s00001127 <= -1)) OR EG (-join.s00001164.activated.s00001064 + callToTask.s00003961.inputCriterion.s00001053.used > 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-callToTask.s00003965.inputCriterion.s00001053.used <= -1 OR callToTask.s00003973.input.s00001066 + -merge.s00001162.input.s00001129 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((-callToTask.s00003965.inputCriterion.s00001053.used <= -1 OR callToTask.s00003973.input.s00001066 + -merge.s00001162.input.s00001129 <= 0))
lola: processed formula length: 143
lola: 173 rewrites
lola: formula mentions 3 of 273 places; total mentions: 3
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-merge.s00001161.input.s00001127 <= -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 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-callToTask.s00003970.input.s00001068 + decision.s00002055.activated <= 0 U AF (-callToProcess.s00003872.output.s00001054 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-callToTask.s00003970.input.s00001068 + decision.s00002055.activated <= 0 U A(TRUE U -callToProcess.s00003872.output.s00001054 <= -2))
lola: processed formula length: 136
lola: 174 rewrites
lola: formula mentions 3 of 273 places; total mentions: 3
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (callToTask.s00003913.output.s00001077 + -merge.s00001161.input.s00001129 > 0))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U callToTask.s00003913.output.s00001077 + -merge.s00001161.input.s00001129 > 0))))
lola: processed formula length: 102
lola: 174 rewrites
lola: formula mentions 2 of 273 places; total mentions: 2
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((-callToTask.s00003964.input.s00001066 > -1 OR -join.s00002243.input.s00001052 <= -1)) OR EG (EF (-callToTask.s00003966.input.s00001068 + callToProcess.s00003957.input.s00001066 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-callToTask.s00003964.input.s00001066 > -1 OR -join.s00002243.input.s00001052 <= -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 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-callToTask.s00003966.input.s00001068 + callToProcess.s00003957.input.s00001066 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -callToTask.s00003966.input.s00001068 + callToProcess.s00003957.input.s00001066 <= 0))))
lola: processed formula length: 110
lola: 174 rewrites
lola: formula mentions 2 of 273 places; total mentions: 2
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG ((-decision.s00001157.activated + callToTask.s00003962.output.s00001054 <= 0 OR -decision.s00002760.activated + merge.s00002239.input.s00001066 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !((-decision.s00001157.activated + callToTask.s00003962.output.s00001054 <= 0 OR -decision.s00002760.activated + merge.s00002239.input.s00001066 <= 0)))))
lola: processed formula length: 174
lola: 174 rewrites
lola: formula mentions 4 of 273 places; total mentions: 4
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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 10 will run for 550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (A(-callToTask.s00003973.input.s00001068 + callToTask.s00003975.output.s00001054 <= 0 U -fork.s00002500.input.s00001052 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(-callToTask.s00003973.input.s00001068 + callToTask.s00003975.output.s00001054 <= 0 U -fork.s00002500.input.s00001052 <= -2))
lola: processed formula length: 129
lola: 174 rewrites
lola: formula mentions 3 of 273 places; total mentions: 3
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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 11 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((merge.s00001160.input.s00001068 + -decision.s00001126.activated > 0 OR (-merge.s00001160.input.s00001068 <= -3 OR -fork.s00002500.input.s00001066 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (merge.s00001160.input.s00001068 + -decision.s00001126.activated > 0 OR (-merge.s00001160.input.s00001068 <= -3 OR -fork.s00002500.input.s00001066 <= -1)))
lola: processed formula length: 164
lola: 173 rewrites
lola: formula mentions 3 of 273 places; total mentions: 4
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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 12 will run for 825 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AF (callToProcess.s00003957.input.s00001068 + -join.s00002243.activated.s00001064 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(A(TRUE U callToProcess.s00003957.input.s00001068 + -join.s00002243.activated.s00001064 <= 0))))
lola: processed formula length: 108
lola: 174 rewrites
lola: formula mentions 2 of 273 places; total mentions: 2
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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 13 will run for 1101 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AF (callToTask.s00003966.inputCriterion.s00001053.used + -decision.s00002761.activated > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U callToTask.s00003966.inputCriterion.s00001053.used + -decision.s00002761.activated > 0))
lola: processed formula length: 100
lola: 174 rewrites
lola: formula mentions 2 of 273 places; total mentions: 2
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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 14 will run for 1651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-join.s00001164.input.s00001127 <= -3 OR -callToTask.s00003980.output.s00001054 <= -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 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-callToTask.s00003971.input.s00001052 <= -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 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: no unknown yes no yes yes yes no yes no no no yes no yes yes
lola: ========================================

BK_STOP 1463590664696

--------------------
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="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/hulinhub/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/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is IBMB2S565S3960-PT-none, 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 r062kn-blw3-146358896700057"
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 ;