fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r038-blw7-149440484600093
Last Updated
June 27, 2017

About the Execution of LoLA for IBMB2S565S3960-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15944.850 1187495.00 1191438.00 639.30 ?TFTTFT?FFTTFTTT normal

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-3254
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 r038-blw7-149440484600093
=====================================================================


--------------------
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 1494618792618


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ IBMB2S565S3960-PT-none @ 3540 seconds
----- Start make result stdout -----
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: NOT(E (F (A (F ((3 <= callToTask.s00003980.input.s00001066)))))) : NOT(((((callToTask.s00003977.input.s00001066 <= 0) AND (join.s00001163.activated.s00001062 <= 1)) AND A (G ((merge.s00002238.input.s00001052 <= fork.s00002500.input.s00001052)))) OR A (((callToTask.s00003977.input.s00001066 <= callToTask.s00003981.output.s00001077) U (3 <= callToTask.s00003980.input.s00001068))))) : ((A (G (((endNode.s00001402.input.default <= callToProcess.s00001108.output.s00001077) OR (callToTask.s00003967.output.s00001054 <= callToTask.s00003964.output.s00001077)))) OR E (G ((callToProcess.s00003957.input.s00001052 + 1 <= merge.s00002240.input.s00001052)))) OR A (G ((callToTask.s00003976.inputCriterion.s00001053.used + 1 <= process.s00000565__s00003960.output.s00001249)))) : A (F (((2 <= callToTask.s00003980.inputCriterion.s00001053.used) OR E (G ((3 <= callToTask.s00003971.input.s00001066)))))) : E (G (((decision.s00002055.activated <= callToTask.s00003981.output.s00001054) OR (3 <= join.s00002243.input.s00001167)))) : E (G ((((callToProcess.s00003880.output.s00001077 <= merge.s00001160.input.s00001165) AND ((process.s00000565__s00003960.outputCriterion.s00001055_omega <= fork.s00002500.input.s00001052) OR (3 <= callToProcess.s00003957.input.s00001066))) OR (2 <= fork.s00001298.input.s00001068)))) : (A ((((fork.s00001298.input.s00001068 <= merge.s00001162.input.s00001128) OR (2 <= callToProcess.s00003872.inputCriterion.s00001053.used)) U (merge.s00002238.input.s00001066 + 1 <= join.s00002243.activated.s00001065))) AND E ((((3 <= fork.s00001403.activated.s00001075) OR (2 <= callToTask.s00003970.inputCriterion.s00001053.used)) U ((callToTask.s00003972.output.s00001077 <= fork.s00002500.activated.s00001075) OR (callToTask.s00003979.inputCriterion.s00001053.used <= decision.s00001157.activated))))) : NOT(A (F ((1 <= join.s00002243.input.s00001167)))) : NOT(E (X (A (G ((callToTask.s00003965.output.s00001077 <= callToProcess.s00003859.output.s00001083)))))) : E (G (((callToTask.s00003976.input.s00001052 + 1 <= callToProcess.s00003859.inputCriterion.s00001053.used) OR (callToTask.s00003964.inputCriterion.s00001053.used + 1 <= callToTask.s00003975.input.s00001068) OR ((callToProcess.s00003872.inputCriterion.s00001053.used <= callToTask.s00003962.output.s00001080) AND (callToTask.s00003974.inputCriterion.s00001053.used <= join.s00001163.input.s00001066))))) : A (F (((join.s00002243.input.s00001052 <= 2) AND (merge.s00002240.input.s00001127 + 1 <= alpha) AND (3 <= callToTask.s00003976.input.s00001066)))) : E (F ((2 <= merge.s00002240.input.s00001068))) : E (((callToProcess.s00003904.input.s00001066 <= callToTask.s00003963.inputCriterion.s00001053.used) U (2 <= callToTask.s00003976.inputCriterion.s00001053.used))) : (NOT(((3 <= merge.s00001161.input.s00001128) OR A (F ((callToProcess.s00003904.input.s00001066 <= fork.s00001298.input.s00001066))))) OR A (G ((merge.s00001161.activated <= 0)))) : A (F (E (G (((callToProcess.s00003880.output.s00001077 <= join.s00001163.input.s00001259) OR (callToProcess.s00003880.input.s00001052 <= callToTask.s00003970.input.s00001052)))))) : A ((E (F ((2 <= callToTask.s00003963.output.s00001054))) U (callToProcess.s00003957.input.s00001066 + 1 <= callToTask.s00003964.inputCriterion.s00001053.used)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (F ((3 <= callToTask.s00003980.input.s00001066))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (3 <= callToTask.s00003980.input.s00001066))))
lola: processed formula length: 68
lola: 9 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 675674 markings, 3695286 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1245317 markings, 6677333 edges, 113929 markings/sec, 5 secs
lola: 1775879 markings, 9744159 edges, 106112 markings/sec, 10 secs
lola: 2277796 markings, 12955324 edges, 100383 markings/sec, 15 secs
lola: 2783766 markings, 15948171 edges, 101194 markings/sec, 20 secs
lola: 3292993 markings, 19041922 edges, 101845 markings/sec, 25 secs
lola: 3763455 markings, 21975584 edges, 94092 markings/sec, 30 secs
lola: 4229398 markings, 24916101 edges, 93189 markings/sec, 35 secs
lola: 4714526 markings, 27788741 edges, 97026 markings/sec, 40 secs
lola: 5184505 markings, 30469991 edges, 93996 markings/sec, 45 secs
lola: 5681345 markings, 33237860 edges, 99368 markings/sec, 50 secs
lola: 6182778 markings, 36262088 edges, 100287 markings/sec, 55 secs
lola: 6593330 markings, 39044479 edges, 82110 markings/sec, 60 secs
lola: 6998860 markings, 42122574 edges, 81106 markings/sec, 65 secs
lola: 7399803 markings, 45008164 edges, 80189 markings/sec, 70 secs
lola: 7803086 markings, 47889399 edges, 80657 markings/sec, 75 secs
lola: 8198141 markings, 50636796 edges, 79011 markings/sec, 80 secs
lola: 8633075 markings, 53634945 edges, 86987 markings/sec, 85 secs
lola: 8999248 markings, 56311576 edges, 73235 markings/sec, 90 secs
lola: 9348138 markings, 58901773 edges, 69778 markings/sec, 95 secs
lola: 9786979 markings, 62096225 edges, 87768 markings/sec, 100 secs
lola: 10142628 markings, 64762501 edges, 71130 markings/sec, 105 secs
lola: 10543126 markings, 67548555 edges, 80100 markings/sec, 110 secs
lola: 10985179 markings, 70336157 edges, 88411 markings/sec, 115 secs
lola: 11384704 markings, 73015675 edges, 79905 markings/sec, 120 secs
lola: 11838407 markings, 75619007 edges, 90741 markings/sec, 125 secs
lola: 12321549 markings, 78363597 edges, 96628 markings/sec, 130 secs
lola: 12765358 markings, 81232590 edges, 88762 markings/sec, 135 secs
lola: 13164899 markings, 83977526 edges, 79908 markings/sec, 140 secs
lola: 13596720 markings, 86696970 edges, 86364 markings/sec, 145 secs
lola: 14020960 markings, 89288499 edges, 84848 markings/sec, 150 secs
lola: 14459654 markings, 92081548 edges, 87739 markings/sec, 155 secs
lola: 14837270 markings, 94623267 edges, 75523 markings/sec, 160 secs
lola: 15256105 markings, 97357205 edges, 83767 markings/sec, 165 secs
lola: 15666948 markings, 100113056 edges, 82169 markings/sec, 170 secs
lola: 16049917 markings, 102818495 edges, 76594 markings/sec, 175 secs
lola: 16419914 markings, 105407213 edges, 73999 markings/sec, 180 secs
lola: 16816163 markings, 107908510 edges, 79250 markings/sec, 185 secs
lola: 17167252 markings, 110187543 edges, 70218 markings/sec, 190 secs
lola: 17570350 markings, 112924276 edges, 80620 markings/sec, 195 secs
lola: 17933268 markings, 115421209 edges, 72584 markings/sec, 200 secs
lola: 18240662 markings, 117666559 edges, 61479 markings/sec, 205 secs
lola: 18600275 markings, 120171836 edges, 71923 markings/sec, 210 secs
lola: 19039683 markings, 122614407 edges, 87882 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((callToTask.s00003977.input.s00001066 <= 0) AND (join.s00001163.activated.s00001062 <= 1)) AND A (G ((merge.s00002238.input.s00001052 <= fork.s00002500.input.s00001052)))) OR A (((callToTask.s00003977.input.s00001066 <= callToTask.s00003981.output.s00001077) U (3 <= callToTask.s00003980.input.s00001068)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= callToTask.s00003977.input.s00001066) OR (2 <= join.s00001163.activated.s00001062))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= callToTask.s00003977.input.s00001066) OR (2 <= join.s00001163.activated.s00001062))
lola: processed formula length: 91
lola: 10 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((fork.s00002500.input.s00001052 + 1 <= merge.s00002238.input.s00001052)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((callToTask.s00003981.output.s00001077 + 1 <= callToTask.s00003977.input.s00001066) R (callToTask.s00003980.input.s00001068 <= 2)))
lola: ========================================
lola: lola: SUBTASK
========================================
lola: checking CTL
lola: processed formula: NOT(A((callToTask.s00003977.input.s00001066 <= callToTask.s00003981.output.s00001077) U (3 <= callToTask.s00003980.input.s00001068)))
lola: processed formula length: 133
lola: 13 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((endNode.s00001402.input.default <= callToProcess.s00001108.output.s00001077) OR (callToTask.s00003967.output.s00001054 <= callToTask.s00003964.output.s00001077)))) OR E (G ((callToProcess.s00003957.input.s00001052 + 1 <= merge.s00002240.input.s00001052)))) OR A (G ((callToTask.s00003976.inputCriterion.s00001053.used + 1 <= process.s00000565__s00003960.output.s00001249))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((endNode.s00001402.input.default <= callToProcess.s00001108.output.s00001077) OR (callToTask.s00003967.output.s00001054 <= callToTask.s00003964.output.s00001077))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((callToProcess.s00003957.input.s00001052 + 1 <= merge.s00002240.input.s00001052)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (merge.s00002240.input.s00001052 <= callToProcess.s00003957.input.s00001052)))
lola: processed formula length: 91
lola: 3 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((callToTask.s00003976.inputCriterion.s00001053.used + 1 <= process.s00000565__s00003960.output.s00001249)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: lola: ========================================subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: A (F (((2 <= callToTask.s00003980.inputCriterion.s00001053.used) OR E (G ((3 <= callToTask.s00003971.input.s00001066))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= callToTask.s00003980.inputCriterion.s00001053.used) OR NOT(A(TRUE U (callToTask.s00003971.input.s00001066 <= 2)))))
lola: processed formula length: 131
lola: 3 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((decision.s00002055.activated <= callToTask.s00003981.output.s00001054) OR (3 <= join.s00002243.input.s00001167))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((callToTask.s00003981.output.s00001054 + 1 <= decision.s00002055.activated) AND (join.s00002243.input.s00001167 <= 2))))
lola: processed formula length: 134
lola: 2 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((callToProcess.s00003880.output.s00001077 <= merge.s00001160.input.s00001165) AND ((process.s00000565__s00003960.outputCriterion.s00001055_omega <= fork.s00002500.input.s00001052) OR (3 <= callToProcess.s00003957.input.s00001066))) OR (2 <= fork.s00001298.input.s00001068))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((merge.s00001160.input.s00001165 + 1 <= callToProcess.s00003880.output.s00001077) OR ((fork.s00002500.input.s00001052 + 1 <= process.s00000565__s00003960.outputCriterion.s00001055_omega) AND (callToProcess.s00003957.input.s00001066 <= 2))) AND (fork.s00001298.input.s00001068 <= 1))))
lola: processed formula length: 300
lola: 2 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((fork.s00001298.input.s00001068 <= merge.s00001162.input.s00001128) OR (2 <= callToProcess.s00003872.inputCriterion.s00001053.used)) U (merge.s00002238.input.s00001066 + 1 <= join.s00002243.activated.s00001065))) AND E ((((3 <= fork.s00001403.activated.s00001075) OR (2 <= callToTask.s00003970.inputCriterion.s00001053.used)) U ((callToTask.s00003972.output.s00001077 <= fork.s00002500.activa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((fork.s00001298.input.s00001068 <= merge.s00001162.input.s00001128) OR (2 <= callToProcess.s00003872.inputCriterion.s00001053.used)) U (merge.s00002238.input.s00001066 + 1 <= join.s00002243.activated.s00001065)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((fork.s00001298.input.s00001068 <= merge.s00001162.input.s00001128) OR (2 <= callToProcess.s00003872.inputCriterion.s00001053.used)) U (merge.s00002238.input.s00001066 + 1 <= join.s00002243.activated.s00001065))
lola: processed formula length: 215
lola: 1 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((1 <= join.s00002243.input.s00001167))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= join.s00002243.input.s00001167)))
lola: processed formula length: 52
lola: 5 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (G ((callToTask.s00003965.output.s00001077 <= callToProcess.s00003859.output.s00001083))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (callToProcess.s00003859.output.s00001083 + 1 <= callToTask.s00003965.output.s00001077)))
lola: processed formula length: 101
lola: 7 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((callToTask.s00003976.input.s00001052 + 1 <= callToProcess.s00003859.inputCriterion.s00001053.used) OR (callToTask.s00003964.inputCriterion.s00001053.used + 1 <= callToTask.s00003975.input.s00001068) OR ((callToProcess.s00003872.inputCriterion.s00001053.used <= callToTask.s00003962.output.s00001080) AND (callToTask.s00003974.inputCriterion.s00001053.used <= join.s00001163.input.s00001066)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((callToProcess.s00003859.inputCriterion.s00001053.used <= callToTask.s00003976.input.s00001052) AND (callToTask.s00003975.input.s00001068 <= callToTask.s00003964.inputCriterion.s00001053.used) AND ((callToTask.s00003962.output.s00001080 + 1 <= callToProcess.s00003872.inputCriterion.s00001053.used) OR (join.s00001163.input.s00001066 + 1 <= callToTask.s00003974.inputCriterion.s0000105... (shortened)
lola: processed formula length: 411
lola: 2 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((join.s00002243.input.s00001052 <= 2) AND (merge.s00002240.input.s00001127 + 1 <= alpha) AND (3 <= callToTask.s00003976.input.s00001066))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((join.s00002243.input.s00001052 <= 2) AND (merge.s00002240.input.s00001127 + 1 <= alpha) AND (3 <= callToTask.s00003976.input.s00001066)))
lola: processed formula length: 148
lola: 1 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= merge.s00002240.input.s00001068)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 829 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((callToProcess.s00003904.input.s00001066 <= callToTask.s00003963.inputCriterion.s00001053.used) U (2 <= callToTask.s00003976.inputCriterion.s00001053.used)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((callToProcess.s00003904.input.s00001066 <= callToTask.s00003963.inputCriterion.s00001053.used) U (2 <= callToTask.s00003976.inputCriterion.s00001053.used))
lola: processed formula length: 158
lola: 1 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(((3 <= merge.s00001161.input.s00001128) OR A (F ((callToProcess.s00003904.input.s00001066 <= fork.s00001298.input.s00001066))))) OR A (G ((merge.s00001161.activated <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (merge.s00001161.input.s00001128 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (merge.s00001161.input.s00001128 <= 2)
lola: processed formula length: 38
lola: 5 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
lola: closed formula file IBMB2S565S3960-PT-none-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((fork.s00001298.input.s00001066 + 1 <= callToProcess.s00003904.input.s00001066)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (callToProcess.s00003904.input.s00001066 <= fork.s00001298.input.s00001066)))
lola: processed formula length: 90
lola: 7 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((merge.s00001161.activated <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-CTLCardinality-15.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((callToProcess.s00003880.output.s00001077 <= join.s00001163.input.s00001259) OR (callToProcess.s00003880.input.s00001052 <= callToTask.s00003970.input.s00001052))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((join.s00001163.input.s00001259 + 1 <= callToProcess.s00003880.output.s00001077) AND (callToTask.s00003970.input.s00001052 + 1 <= callToProcess.s00003880.input.s00001052)))))
lola: processed formula length: 197
lola: 3 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 3319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= callToTask.s00003963.output.s00001054))) U (callToProcess.s00003957.input.s00001066 + 1 <= callToTask.s00003964.inputCriterion.s00001053.used)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (2 <= callToTask.s00003963.output.s00001054)) U (callToProcess.s00003957.input.s00001066 + 1 <= callToTask.s00003964.inputCriterion.s00001053.used))
lola: processed formula length: 159
lola: 2 rewrites
lola: formula mentions 0 of 273 places; total mentions: 0
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1045855 markings, 3546394 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1890765 markings, 6617890 edges, 168982 markings/sec, 5 secs
lola: 2630792 markings, 9715830 edges, 148005 markings/sec, 10 secs
lola: 3404223 markings, 12723673 edges, 154686 markings/sec, 15 secs
lola: 4075998 markings, 15672151 edges, 134355 markings/sec, 20 secs
lola: 4743456 markings, 18437460 edges, 133492 markings/sec, 25 secs
lola: 5442060 markings, 20956517 edges, 139721 markings/sec, 30 secs
lola: 6133266 markings, 23559797 edges, 138241 markings/sec, 35 secs
lola: 6850235 markings, 26560172 edges, 143394 markings/sec, 40 secs
lola: 7327756 markings, 29351437 edges, 95504 markings/sec, 45 secs
lola: 7795182 markings, 31930048 edges, 93485 markings/sec, 50 secs
lola: 8300589 markings, 34640815 edges, 101081 markings/sec, 55 secs
lola: 8830306 markings, 37210599 edges, 105943 markings/sec, 60 secs
lola: 9400884 markings, 40041079 edges, 114116 markings/sec, 65 secs
lola: 9864427 markings, 42501282 edges, 92709 markings/sec, 70 secs
lola: 10388213 markings, 45260508 edges, 104757 markings/sec, 75 secs
lola: 10818226 markings, 47631959 edges, 86003 markings/sec, 80 secs
lola: 11410769 markings, 50169340 edges, 118509 markings/sec, 85 secs
lola: 12145114 markings, 52673437 edges, 146869 markings/sec, 90 secs
lola: 12853438 markings, 55268406 edges, 141665 markings/sec, 95 secs
lola: 13424302 markings, 58004218 edges, 114173 markings/sec, 100 secs
lola: 14045679 markings, 60581301 edges, 124275 markings/sec, 105 secs
lola: 14627691 markings, 63134376 edges, 116402 markings/sec, 110 secs
lola: 15148217 markings, 65576217 edges, 104105 markings/sec, 115 secs
lola: 15744131 markings, 68176604 edges, 119183 markings/sec, 120 secs
lola: 16257413 markings, 70924752 edges, 102656 markings/sec, 125 secs
lola: 16747904 markings, 73302328 edges, 98098 markings/sec, 130 secs
lola: 17194192 markings, 75528636 edges, 89258 markings/sec, 135 secs
lola: 17695270 markings, 78129767 edges, 100216 markings/sec, 140 secs
lola: 18113694 markings, 80421959 edges, 83685 markings/sec, 145 secs
lola: 18615262 markings, 82612177 edges, 100314 markings/sec, 150 secs
lola: 19281167 markings, 84806456 edges, 133181 markings/sec, 155 secs
lola: 19863478 markings, 86896384 edges, 116462 markings/sec, 160 secs
lola: 20448553 markings, 89365559 edges, 117015 markings/sec, 165 secs
lola: 21120434 markings, 91522792 edges, 134376 markings/sec, 170 secs
lola: 21737350 markings, 93782936 edges, 123383 markings/sec, 175 secs
lola: 22280349 markings, 95965441 edges, 108600 markings/sec, 180 secs
lola: 22851774 markings, 98214679 edges, 114285 markings/sec, 185 secs
lola: 23446793 markings, 100320628 edges, 119004 markings/sec, 190 secs
lola: 24018889 markings, 102412571 edges, 114419 markings/sec, 195 secs
lola: 24547551 markings, 104472115 edges, 105732 markings/sec, 200 secs
lola: 25263799 markings, 106907928 edges, 143250 markings/sec, 205 secs
lola: 25782018 markings, 109285440 edges, 103644 markings/sec, 210 secs
lola: 26307708 markings, 111664362 edges, 105138 markings/sec, 215 secs
lola: 26810792 markings, 114002997 edges, 100617 markings/sec, 220 secs
lola: 27385020 markings, 116533932 edges, 114846 markings/sec, 225 secs
lola: 27993546 markings, 118780829 edges, 121705 markings/sec, 230 secs
lola: 28581235 markings, 121293594 edges, 117538 markings/sec, 235 secs
lola: 29136200 markings, 123717475 edges, 110993 markings/sec, 240 secs
lola: 29779671 markings, 126455617 edges, 128694 markings/sec, 245 secs
lola: 30389016 markings, 129008674 edges, 121869 markings/sec, 250 secs
lola: 30896085 markings, 131422397 edges, 101414 markings/sec, 255 secs
lola: 31448271 markings, 133887143 edges, 110437 markings/sec, 260 secs
lola: 31997644 markings, 136045164 edges, 109875 markings/sec, 265 secs
lola: 32464582 markings, 138133214 edges, 93388 markings/sec, 270 secs
lola: 33069700 markings, 140798968 edges, 121024 markings/sec, 275 secs
lola: 33430298 markings, 142925645 edges, 72120 markings/sec, 280 secs
lola: 33867428 markings, 145291677 edges, 87426 markings/sec, 285 secs
lola: 34339217 markings, 147322796 edges, 94358 markings/sec, 290 secs
lola: 34753894 markings, 149625405 edges, 82935 markings/sec, 295 secs
lola: 35140005 markings, 151729707 edges, 77222 markings/sec, 300 secs
lola: 35562767 markings, 153848638 edges, 84552 markings/sec, 305 secs
lola: 36128551 markings, 156487687 edges, 113157 markings/sec, 310 secs
lola: 36668389 markings, 159244106 edges, 107968 markings/sec, 315 secs
lola: 37135209 markings, 161917606 edges, 93364 markings/sec, 320 secs
lola: 37584783 markings, 164385711 edges, 89915 markings/sec, 325 secs
lola: 38039849 markings, 166960070 edges, 91013 markings/sec, 330 secs
lola: 38426242 markings, 169039691 edges, 77279 markings/sec, 335 secs
lola: 38974413 markings, 171007279 edges, 109634 markings/sec, 340 secs
lola: 39441332 markings, 173005053 edges, 93384 markings/sec, 345 secs
lola: 39886510 markings, 174960064 edges, 89036 markings/sec, 350 secs
lola: 40474879 markings, 177558735 edges, 117674 markings/sec, 355 secs
lola: 41134326 markings, 180220789 edges, 131889 markings/sec, 360 secs
lola: 41493399 markings, 182295036 edges, 71815 markings/sec, 365 secs
lola: 41822953 markings, 184332038 edges, 65911 markings/sec, 370 secs
lola: 42120413 markings, 186302547 edges, 59492 markings/sec, 375 secs
lola: 42507025 markings, 188650685 edges, 77322 markings/sec, 380 secs
lola: 42939837 markings, 191328584 edges, 86562 markings/sec, 385 secs
lola: 43339819 markings, 193299737 edges, 79996 markings/sec, 390 secs
lola: 43818212 markings, 195141619 edges, 95679 markings/sec, 395 secs
lola: 44335030 markings, 197193453 edges, 103364 markings/sec, 400 secs
lola: 44760356 markings, 199238087 edges, 85065 markings/sec, 405 secs
lola: 45203883 markings, 201456187 edges, 88705 markings/sec, 410 secs
lola: 45699368 markings, 203806975 edges, 99097 markings/sec, 415 secs
lola: 46133494 markings, 206202493 edges, 86825 markings/sec, 420 secs
lola: 46513131 markings, 208165462 edges, 75927 markings/sec, 425 secs
lola: 46913335 markings, 210298887 edges, 80041 markings/sec, 430 secs
lola: 47320630 markings, 212360950 edges, 81459 markings/sec, 435 secs
lola: 47655457 markings, 214247299 edges, 66965 markings/sec, 440 secs
lola: 48058500 markings, 216499171 edges, 80609 markings/sec, 445 secs
lola: 48509488 markings, 218973750 edges, 90198 markings/sec, 450 secs
lola: 48903011 markings, 221433606 edges, 78705 markings/sec, 455 secs
lola: 49250457 markings, 223475018 edges, 69489 markings/sec, 460 secs
lola: 49590005 markings, 225548607 edges, 67910 markings/sec, 465 secs
lola: 49969687 markings, 227557933 edges, 75936 markings/sec, 470 secs
lola: 50437563 markings, 229486720 edges, 93575 markings/sec, 475 secs
lola: 50808955 markings, 231305976 edges, 74278 markings/sec, 480 secs
lola: 51078960 markings, 232969077 edges, 54001 markings/sec, 485 secs
lola: 51592706 markings, 235141505 edges, 102749 markings/sec, 490 secs
lola: 52076614 markings, 237226738 edges, 96782 markings/sec, 495 secs
lola: 52714489 markings, 239991874 edges, 127575 markings/sec, 500 secs
lola: 53206615 markings, 242329080 edges, 98425 markings/sec, 505 secs
lola: 53719289 markings, 244581610 edges, 102535 markings/sec, 510 secs
lola: 54178718 markings, 246919598 edges, 91886 markings/sec, 515 secs
lola: 54608106 markings, 248958236 edges, 85878 markings/sec, 520 secs
lola: 54970500 markings, 250962370 edges, 72479 markings/sec, 525 secs
lola: 55373874 markings, 252995010 edges, 80675 markings/sec, 530 secs
lola: 55808164 markings, 255191022 edges, 86858 markings/sec, 535 secs
lola: 56313178 markings, 257824517 edges, 101003 markings/sec, 540 secs
lola: 57007107 markings, 260881019 edges, 138786 markings/sec, 545 secs
lola: 57498645 markings, 263500913 edges, 98308 markings/sec, 550 secs
lola: 57943038 markings, 265938549 edges, 88879 markings/sec, 555 secs
lola: 58357481 markings, 268222196 edges, 82889 markings/sec, 560 secs
lola: 58690519 markings, 270377871 edges, 66608 markings/sec, 565 secs
lola: 59013401 markings, 272471190 edges, 64576 markings/sec, 570 secs
lola: 59392711 markings, 274910978 edges, 75862 markings/sec, 575 secs
lola: 59745777 markings, 277188778 edges, 70613 markings/sec, 580 secs
lola: 60051315 markings, 279386268 edges, 61108 markings/sec, 585 secs
lola: 60395086 markings, 281765171 edges, 68754 markings/sec, 590 secs
lola: 60716293 markings, 283909301 edges, 64241 markings/sec, 595 secs
lola: 61040138 markings, 286011908 edges, 64769 markings/sec, 600 secs
lola: 61300657 markings, 287829799 edges, 52104 markings/sec, 605 secs
lola: 61652789 markings, 289925093 edges, 70426 markings/sec, 610 secs
lola: 62018735 markings, 291978509 edges, 73189 markings/sec, 615 secs
lola: 62380676 markings, 293995171 edges, 72388 markings/sec, 620 secs
lola: 62754789 markings, 295995175 edges, 74823 markings/sec, 625 secs
lola: 63112749 markings, 297926907 edges, 71592 markings/sec, 630 secs
lola: 63485562 markings, 300037690 edges, 74563 markings/sec, 635 secs
lola: 63809844 markings, 302055361 edges, 64856 markings/sec, 640 secs
lola: 64161810 markings, 304086827 edges, 70393 markings/sec, 645 secs
lola: 64469495 markings, 306049923 edges, 61537 markings/sec, 650 secs
lola: 64749751 markings, 307901351 edges, 56051 markings/sec, 655 secs
lola: 65090916 markings, 309959966 edges, 68233 markings/sec, 660 secs
lola: 65432889 markings, 311948516 edges, 68395 markings/sec, 665 secs
lola: 65779968 markings, 313863568 edges, 69416 markings/sec, 670 secs
lola: 66195023 markings, 316224613 edges, 83011 markings/sec, 675 secs
lola: 66556208 markings, 318523629 edges, 72237 markings/sec, 680 secs
lola: 66935177 markings, 320908492 edges, 75794 markings/sec, 685 secs
lola: 67240045 markings, 322752435 edges, 60974 markings/sec, 690 secs
lola: 67553682 markings, 324817090 edges, 62727 markings/sec, 695 secs
lola: 67900175 markings, 326931038 edges, 69299 markings/sec, 700 secs
lola: 68253716 markings, 329288613 edges, 70708 markings/sec, 705 secs
lola: 68594376 markings, 331752891 edges, 68132 markings/sec, 710 secs
lola: 68952157 markings, 334227965 edges, 71556 markings/sec, 715 secs
lola: 69218901 markings, 336107228 edges, 53349 markings/sec, 720 secs
lola: 69503293 markings, 338220482 edges, 56878 markings/sec, 725 secs
lola: 69798469 markings, 340281615 edges, 59035 markings/sec, 730 secs
lola: 70155357 markings, 342354531 edges, 71378 markings/sec, 735 secs
lola: 70487270 markings, 344367890 edges, 66383 markings/sec, 740 secs
lola: 70827194 markings, 346428455 edges, 67985 markings/sec, 745 secs
lola: 71220394 markings, 348387148 edges, 78640 markings/sec, 750 secs
lola: 71609449 markings, 350389982 edges, 77811 markings/sec, 755 secs
lola: 72024215 markings, 352537924 edges, 82953 markings/sec, 760 secs
lola: 72363787 markings, 354275267 edges, 67914 markings/sec, 765 secs
lola: 72684470 markings, 356083451 edges, 64137 markings/sec, 770 secs
lola: 73007144 markings, 357999919 edges, 64535 markings/sec, 775 secs
lola: 73368022 markings, 359885988 edges, 72176 markings/sec, 780 secs
lola: 73707069 markings, 361766888 edges, 67809 markings/sec, 785 secs
lola: 73992166 markings, 363425694 edges, 57019 markings/sec, 790 secs
lola: 74266339 markings, 365153795 edges, 54835 markings/sec, 795 secs
lola: 74624056 markings, 367028572 edges, 71543 markings/sec, 800 secs
lola: 75029861 markings, 369220834 edges, 81161 markings/sec, 805 secs
lola: 75395014 markings, 371068289 edges, 73031 markings/sec, 810 secs
lola: 75794842 markings, 373114385 edges, 79966 markings/sec, 815 secs
lola: 76267557 markings, 375278600 edges, 94543 markings/sec, 820 secs
lola: 76762604 markings, 377132751 edges, 99009 markings/sec, 825 secs
lola: 77346501 markings, 379044872 edges, 116779 markings/sec, 830 secs
lola: 77890891 markings, 381163824 edges, 108878 markings/sec, 835 secs
lola: 78361149 markings, 383414540 edges, 94052 markings/sec, 840 secs
lola: 78882307 markings, 385603161 edges, 104232 markings/sec, 845 secs
lola: 79341634 markings, 387571366 edges, 91865 markings/sec, 850 secs
lola: 79830892 markings, 389767232 edges, 97852 markings/sec, 855 secs
lola: 80274657 markings, 391850804 edges, 88753 markings/sec, 860 secs
lola: 80752178 markings, 393916508 edges, 95504 markings/sec, 865 secs
lola: 81162048 markings, 396162665 edges, 81974 markings/sec, 870 secs
lola: 81540901 markings, 398040236 edges, 75771 markings/sec, 875 secs
lola: 81930438 markings, 399901446 edges, 77907 markings/sec, 880 secs
lola: 82321702 markings, 401899277 edges, 78253 markings/sec, 885 secs
lola: 82710213 markings, 403969257 edges, 77702 markings/sec, 890 secs
lola: 83086280 markings, 406028786 edges, 75213 markings/sec, 895 secs
lola: 83513402 markings, 407816702 edges, 85424 markings/sec, 900 secs
lola: 84119861 markings, 409888680 edges, 121292 markings/sec, 905 secs
lola: 84649398 markings, 412482032 edges, 105907 markings/sec, 910 secs
lola: 85107820 markings, 414773478 edges, 91684 markings/sec, 915 secs
lola: 85546113 markings, 416937440 edges, 87659 markings/sec, 920 secs
lola: 85982362 markings, 419146838 edges, 87250 markings/sec, 925 secs
lola: 86374850 markings, 421245972 edges, 78498 markings/sec, 930 secs
lola: 86769206 markings, 423378068 edges, 78871 markings/sec, 935 secs
lola: 87209051 markings, 425205153 edges, 87969 markings/sec, 940 secs
lola: 87882198 markings, 427798203 edges, 134629 markings/sec, 945 secs
lola: 88332334 markings, 429955237 edges, 90027 markings/sec, 950 secs
lola: 88792168 markings, 432236299 edges, 91967 markings/sec, 955 secs
lola: 89016195 markings, 433172341 edges, 44805 markings/sec, 960 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown yes no no yes yes no yes yes yes no yes yes no yes unknown
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494619980113

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="/tmp/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-3254"
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 r038-blw7-149440484600093"
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 ;