fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r068-csrt-149440963000021
Last Updated
June 27, 2017

About the Execution of LoLA for Raft-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15937.150 1799063.00 1805450.00 417.20 F??FFF??F?TF??TT 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 Raft-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r068-csrt-149440963000021
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494799775757


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ Raft-PT-09 @ 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: 1123/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 413 places, 710 transitions, 332 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-09-CTLCardinality.task
lola: (E (X ((1 <= p81))) OR ((p280 <= 2) AND E (F (((3 <= p381) AND (2 <= p395)))))) : E (G (NOT(E (F ((2 <= p151)))))) : NOT(NOT((E (F ((3 <= p281))) AND (p77 <= 1)))) : A (G (E (X ((p294 <= p102))))) : ((NOT(E (F ((2 <= p102)))) OR E (X ((p116 + 1 <= p333)))) OR E (F (((p90 <= p43) AND (3 <= p21) AND (p363 + 1 <= p310))))) : E (F (((2 <= p35) AND (2 <= p383)))) : NOT(E (F (A (G ((3 <= p32)))))) : A (((1 <= p141) U E (F ((2 <= p299))))) : ((3 <= p268) OR NOT(E (F (((p394 <= p302) AND (3 <= p345)))))) : E (F ((((1 <= p218) AND (p32 <= p103) AND (2 <= p63)) OR A (X ((1 <= p99)))))) : A (X (E (F ((2 <= p14))))) : A (G (A (((p231 <= p297) U (p18 <= p62))))) : E (F ((2 <= p404))) : E (F (((p362 <= p158) AND (3 <= p99) AND (2 <= p211) AND (p274 <= p328) AND (1 <= p295) AND (2 <= p261) AND (1 <= p217)))) : E (F (A (G (((p93 <= p275) AND (3 <= p105)))))) : NOT((E (X ((p122 <= p67))) AND NOT(A (F ((1 <= p163))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((1 <= p81))) OR ((p280 <= 2) AND E (F (((3 <= p381) AND (2 <= p395))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= p81)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((1 <= p81))
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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 0 significant temporal operators and needs 0 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p280 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p280 <= 2)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p381) AND (2 <= p395))))
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 44 bytes per marking, with 20 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 Raft-PT-09-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (F ((2 <= p151))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (2 <= p151))))
lola: processed formula length: 36
lola: 7 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 1425049 markings, 2571169 edges, 285010 markings/sec, 0 secs
lola: 2778433 markings, 5013815 edges, 270677 markings/sec, 5 secs
lola: 4033987 markings, 7282922 edges, 251111 markings/sec, 10 secs
lola: 5201261 markings, 9390662 edges, 233455 markings/sec, 15 secs
lola: 6409691 markings, 11582783 edges, 241686 markings/sec, 20 secs
lola: 7572462 markings, 13695581 edges, 232554 markings/sec, 25 secs
lola: 8774915 markings, 15874192 edges, 240491 markings/sec, 30 secs
lola: 9919029 markings, 17936062 edges, 228823 markings/sec, 35 secs
lola: 11133560 markings, 20141193 edges, 242906 markings/sec, 40 secs
lola: 12452449 markings, 22521264 edges, 263778 markings/sec, 45 secs
lola: 13754491 markings, 24873982 edges, 260408 markings/sec, 50 secs
lola: 15099068 markings, 27298535 edges, 268915 markings/sec, 55 secs
lola: 16338026 markings, 29535280 edges, 247792 markings/sec, 60 secs
lola: 17683376 markings, 31964581 edges, 269070 markings/sec, 65 secs
lola: 18942854 markings, 34245498 edges, 251896 markings/sec, 70 secs
lola: 20164267 markings, 36450330 edges, 244283 markings/sec, 75 secs
lola: 21380491 markings, 38655629 edges, 243245 markings/sec, 80 secs
lola: 22577908 markings, 40828719 edges, 239483 markings/sec, 85 secs
lola: 23854409 markings, 43136290 edges, 255300 markings/sec, 90 secs
lola: 25140010 markings, 45456197 edges, 257120 markings/sec, 95 secs
lola: 26350110 markings, 47640644 edges, 242020 markings/sec, 100 secs
lola: 27536073 markings, 49779679 edges, 237193 markings/sec, 105 secs
lola: 28723168 markings, 51925733 edges, 237419 markings/sec, 110 secs
lola: 29890231 markings, 54038896 edges, 233413 markings/sec, 115 secs
lola: 31060076 markings, 56165560 edges, 233969 markings/sec, 120 secs
lola: 32212701 markings, 58263146 edges, 230525 markings/sec, 125 secs
lola: 33328832 markings, 60291363 edges, 223226 markings/sec, 130 secs
lola: 34448890 markings, 62334292 edges, 224012 markings/sec, 135 secs
lola: 35674965 markings, 64550321 edges, 245215 markings/sec, 140 secs
lola: 36945467 markings, 66848203 edges, 254100 markings/sec, 145 secs
lola: 38091497 markings, 68915936 edges, 229206 markings/sec, 150 secs
lola: 39184094 markings, 70891463 edges, 218519 markings/sec, 155 secs
lola: 40287753 markings, 72896789 edges, 220732 markings/sec, 160 secs
lola: 41453934 markings, 75010857 edges, 233236 markings/sec, 165 secs
lola: 42714723 markings, 77283657 edges, 252158 markings/sec, 170 secs
lola: 43941622 markings, 79502316 edges, 245380 markings/sec, 175 secs
lola: 45131255 markings, 81660002 edges, 237927 markings/sec, 180 secs
lola: 46293396 markings, 83774611 edges, 232428 markings/sec, 185 secs
lola: 47441095 markings, 85864246 edges, 229540 markings/sec, 190 secs
lola: 48574089 markings, 87916830 edges, 226599 markings/sec, 195 secs
lola: 49726251 markings, 90013874 edges, 230432 markings/sec, 200 secs
lola: 51024470 markings, 92355026 edges, 259644 markings/sec, 205 secs
lola: 52267791 markings, 94604376 edges, 248664 markings/sec, 210 secs
lola: 53462516 markings, 96770749 edges, 238945 markings/sec, 215 secs
lola: 54680259 markings, 98971968 edges, 243549 markings/sec, 220 secs
lola: 55831776 markings, 101056806 edges, 230303 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (F ((3 <= p281))) AND (p77 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p281)))
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 44 bytes per marking, with 20 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: state equation: write sara problem file to Raft-PT-09-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p294 <= p102)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p294 <= p102)))))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 1057464 markings, 1907863 edges, 2966513982698946560 markings/sec, 0 secs
lola: 2051893 markings, 3704283 edges, 198886 markings/sec, 5 secs
lola: 3037087 markings, 5480686 edges, 197039 markings/sec, 10 secs
lola: 3994720 markings, 7212274 edges, 191527 markings/sec, 15 secs
lola: 4917613 markings, 8878255 edges, 184579 markings/sec, 20 secs
lola: 5848585 markings, 10564091 edges, 186194 markings/sec, 25 secs
lola: 6754352 markings, 12208917 edges, 181153 markings/sec, 30 secs
lola: 7676115 markings, 13883503 edges, 184353 markings/sec, 35 secs
lola: 8558400 markings, 15483126 edges, 176457 markings/sec, 40 secs
lola: 9481878 markings, 17148174 edges, 184696 markings/sec, 45 secs
lola: 10358264 markings, 18731590 edges, 175277 markings/sec, 50 secs
lola: 11317667 markings, 20472964 edges, 191881 markings/sec, 55 secs
lola: 12300447 markings, 22247358 edges, 196556 markings/sec, 60 secs
lola: 13248227 markings, 23959111 edges, 189556 markings/sec, 65 secs
lola: 14279008 markings, 25818765 edges, 206156 markings/sec, 70 secs
lola: 15262078 markings, 27592188 edges, 196614 markings/sec, 75 secs
lola: 16217032 markings, 29316431 edges, 190991 markings/sec, 80 secs
lola: 17205877 markings, 31100331 edges, 197769 markings/sec, 85 secs
lola: 18183997 markings, 32868805 edges, 195624 markings/sec, 90 secs
lola: 19122246 markings, 34568361 edges, 187650 markings/sec, 95 secs
lola: 20044648 markings, 36234288 edges, 184480 markings/sec, 100 secs
lola: 20973236 markings, 37916540 edges, 185718 markings/sec, 105 secs
lola: 21888842 markings, 39577245 edges, 183121 markings/sec, 110 secs
lola: 22798343 markings, 41229697 edges, 181900 markings/sec, 115 secs
lola: 23780732 markings, 43003641 edges, 196478 markings/sec, 120 secs
lola: 24757378 markings, 44765375 edges, 195329 markings/sec, 125 secs
lola: 25709573 markings, 46486966 edges, 190439 markings/sec, 130 secs
lola: 26623319 markings, 48132654 edges, 182749 markings/sec, 135 secs
lola: 27531575 markings, 49771372 edges, 181651 markings/sec, 140 secs
lola: 28447211 markings, 51426401 edges, 183127 markings/sec, 145 secs
lola: 29346409 markings, 53053437 edges, 179840 markings/sec, 150 secs
lola: 30264422 markings, 54716975 edges, 183603 markings/sec, 155 secs
lola: 31146070 markings, 56321685 edges, 176330 markings/sec, 160 secs
lola: 32038197 markings, 57946285 edges, 178425 markings/sec, 165 secs
lola: 32909637 markings, 59528881 edges, 174288 markings/sec, 170 secs
lola: 33782849 markings, 61117409 edges, 174642 markings/sec, 175 secs
lola: 34648714 markings, 62697377 edges, 173173 markings/sec, 180 secs
lola: 35600421 markings, 64415749 edges, 190341 markings/sec, 185 secs
lola: 36573424 markings, 66174730 edges, 194601 markings/sec, 190 secs
lola: 37500107 markings, 67848594 edges, 185337 markings/sec, 195 secs
lola: 38354940 markings, 69391674 edges, 170967 markings/sec, 200 secs
lola: 39202253 markings, 70924357 edges, 169463 markings/sec, 205 secs
lola: 40059728 markings, 72483785 edges, 171495 markings/sec, 210 secs
lola: 40961505 markings, 74118129 edges, 180355 markings/sec, 215 secs
lola: 41878611 markings, 75776716 edges, 183421 markings/sec, 220 secs
lola: 42805165 markings, 77447032 edges, 185311 markings/sec, 225 secs
lola: 43720920 markings, 79101748 edges, 183151 markings/sec, 230 secs
lola: 44626984 markings, 80745446 edges, 181213 markings/sec, 235 secs
lola: 45521435 markings, 82368771 edges, 178890 markings/sec, 240 secs
lola: 46410034 markings, 83985877 edges, 177720 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (F ((2 <= p102)))) OR E (X ((p116 + 1 <= p333)))) OR E (F (((p90 <= p43) AND (3 <= p21) AND (p363 + 1 <= p310)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p102 <= 1)))
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 44 bytes per marking, with 20 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: state equation: write sara problem file to Raft-PT-09-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-CTLCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p35) AND (2 <= p383))))
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 44 bytes per marking, with 20 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 Raft-PT-09-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (G ((3 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (p32 <= 2)))))
lola: processed formula length: 40
lola: 7 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 1012316 markings, 2838143 edges, 202463 markings/sec, 0 secs
lola: 1985581 markings, 5570296 edges, 194653 markings/sec, 5 secs
lola: 2984669 markings, 8371140 edges, 199818 markings/sec, 10 secs
lola: 3943897 markings, 11063773 edges, 191846 markings/sec, 15 secs
lola: 4868711 markings, 13658362 edges, 184963 markings/sec, 20 secs
lola: 5804192 markings, 16288241 edges, 187096 markings/sec, 25 secs
lola: 6712162 markings, 18844396 edges, 181594 markings/sec, 30 secs
lola: 7626411 markings, 21419446 edges, 182850 markings/sec, 35 secs
lola: 8510734 markings, 23907549 edges, 176865 markings/sec, 40 secs
lola: 9434791 markings, 26498425 edges, 184811 markings/sec, 45 secs
lola: 10311775 markings, 28958833 edges, 175397 markings/sec, 50 secs
lola: 11273828 markings, 31667624 edges, 192411 markings/sec, 55 secs
lola: 12265680 markings, 34450330 edges, 198370 markings/sec, 60 secs
lola: 13221742 markings, 37133232 edges, 191212 markings/sec, 65 secs
lola: 14263545 markings, 40054460 edges, 208361 markings/sec, 70 secs
lola: 15253323 markings, 42829667 edges, 197956 markings/sec, 75 secs
lola: 16201614 markings, 45489865 edges, 189658 markings/sec, 80 secs
lola: 17182859 markings, 48241197 edges, 196249 markings/sec, 85 secs
lola: 18160246 markings, 50986087 edges, 195477 markings/sec, 90 secs
lola: 19099551 markings, 53627007 edges, 187861 markings/sec, 95 secs
lola: 20030592 markings, 56239459 edges, 186208 markings/sec, 100 secs
lola: 20964856 markings, 58866417 edges, 186853 markings/sec, 105 secs
lola: 21886723 markings, 61460051 edges, 184373 markings/sec, 110 secs
lola: 22802098 markings, 64038634 edges, 183075 markings/sec, 115 secs
lola: 23790361 markings, 66811299 edges, 197653 markings/sec, 120 secs
lola: 24772489 markings, 69565202 edges, 196426 markings/sec, 125 secs
lola: 25728285 markings, 72248848 edges, 191159 markings/sec, 130 secs
lola: 26646629 markings, 74821330 edges, 183669 markings/sec, 135 secs
lola: 27559401 markings, 77381464 edges, 182554 markings/sec, 140 secs
lola: 28478930 markings, 79962352 edges, 183906 markings/sec, 145 secs
lola: 29382119 markings, 82500127 edges, 180638 markings/sec, 150 secs
lola: 30300927 markings, 85084440 edges, 183762 markings/sec, 155 secs
lola: 31184062 markings, 87575094 edges, 176627 markings/sec, 160 secs
lola: 32079283 markings, 90100108 edges, 179044 markings/sec, 165 secs
lola: 32947099 markings, 92544826 edges, 173563 markings/sec, 170 secs
lola: 33820772 markings, 95007954 edges, 174735 markings/sec, 175 secs
lola: 34685868 markings, 97451290 edges, 173019 markings/sec, 180 secs
lola: 35650727 markings, 100157168 edges, 192972 markings/sec, 185 secs
lola: 36634289 markings, 102919240 edges, 196712 markings/sec, 190 secs
lola: 37559698 markings, 105516338 edges, 185082 markings/sec, 195 secs
lola: 38408506 markings, 107896641 edges, 169762 markings/sec, 200 secs
lola: 39248891 markings, 110257393 edges, 168077 markings/sec, 205 secs
lola: 40105131 markings, 112671396 edges, 171248 markings/sec, 210 secs
lola: 41001939 markings, 115193533 edges, 179362 markings/sec, 215 secs
lola: 41919015 markings, 117768519 edges, 183415 markings/sec, 220 secs
lola: 42859599 markings, 120405294 edges, 188117 markings/sec, 225 secs
lola: 43793359 markings, 123026594 edges, 186752 markings/sec, 230 secs
lola: 44709488 markings, 125604787 edges, 183226 markings/sec, 235 secs
lola: 45605381 markings, 128127227 edges, 179179 markings/sec, 240 secs
lola: 46491531 markings, 130626533 edges, 177230 markings/sec, 245 secs
lola: 47373480 markings, 133113962 edges, 176390 markings/sec, 250 secs
lola: 48248563 markings, 135576518 edges, 175017 markings/sec, 255 secs
lola: 49116819 markings, 138018787 edges, 173651 markings/sec, 260 secs
lola: 50046908 markings, 140638436 edges, 186018 markings/sec, 265 secs
lola: 51010415 markings, 143340176 edges, 192701 markings/sec, 270 secs
lola: 51951355 markings, 145982206 edges, 188188 markings/sec, 275 secs
lola: 52879054 markings, 148591059 edges, 185540 markings/sec, 280 secs
lola: 53784477 markings, 151139477 edges, 181085 markings/sec, 285 secs
lola: 54704014 markings, 153718868 edges, 183907 markings/sec, 290 secs
lola: 55583714 markings, 156189684 edges, 175940 markings/sec, 295 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p141) U E (F ((2 <= p299)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((1 <= p141) U E(TRUE U (2 <= p299)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 1378721 markings, 2487572 edges, 3108142075472773120 markings/sec, 0 secs
lola: 2711482 markings, 4893198 edges, 266552 markings/sec, 5 secs
lola: 4012882 markings, 7245047 edges, 260280 markings/sec, 10 secs
lola: 5236272 markings, 9454978 edges, 244678 markings/sec, 15 secs
lola: 6463249 markings, 11679788 edges, 245395 markings/sec, 20 secs
lola: 7667453 markings, 13867626 edges, 240841 markings/sec, 25 secs
lola: 8872521 markings, 16050203 edges, 241014 markings/sec, 30 secs
lola: 10007488 markings, 18096282 edges, 226993 markings/sec, 35 secs
lola: 11250183 markings, 20351280 edges, 248539 markings/sec, 40 secs
lola: 12571875 markings, 22737209 edges, 264338 markings/sec, 45 secs
lola: 13881255 markings, 25102664 edges, 261876 markings/sec, 50 secs
lola: 15222635 markings, 27521110 edges, 268276 markings/sec, 55 secs
lola: 16473412 markings, 29779901 edges, 250155 markings/sec, 60 secs
lola: 17786494 markings, 32150077 edges, 262616 markings/sec, 65 secs
lola: 19031611 markings, 34404941 edges, 249023 markings/sec, 70 secs
lola: 20258012 markings, 36620522 edges, 245280 markings/sec, 75 secs
lola: 21479498 markings, 38833999 edges, 244297 markings/sec, 80 secs
lola: 22677605 markings, 41009943 edges, 239621 markings/sec, 85 secs
lola: 23980640 markings, 43364450 edges, 260607 markings/sec, 90 secs
lola: 25280995 markings, 45711515 edges, 260071 markings/sec, 95 secs
lola: 26494795 markings, 47901171 edges, 242760 markings/sec, 100 secs
lola: 27690008 markings, 50057539 edges, 239043 markings/sec, 105 secs
lola: 28882489 markings, 52213418 edges, 238496 markings/sec, 110 secs
lola: 30060763 markings, 54349914 edges, 235655 markings/sec, 115 secs
lola: 31226952 markings, 56468753 edges, 233238 markings/sec, 120 secs
lola: 32380198 markings, 58566735 edges, 230649 markings/sec, 125 secs
lola: 33508261 markings, 60617408 edges, 225613 markings/sec, 130 secs
lola: 34643815 markings, 62688535 edges, 227111 markings/sec, 135 secs
lola: 35900280 markings, 64956691 edges, 251293 markings/sec, 140 secs
lola: 37166611 markings, 67248080 edges, 253266 markings/sec, 145 secs
lola: 38290383 markings, 69274752 edges, 224754 markings/sec, 150 secs
lola: 39389894 markings, 71263704 edges, 219902 markings/sec, 155 secs
lola: 40548649 markings, 73367000 edges, 231751 markings/sec, 160 secs
lola: 41721339 markings, 75493072 edges, 234538 markings/sec, 165 secs
lola: 42997891 markings, 77795384 edges, 255310 markings/sec, 170 secs
lola: 44227680 markings, 80021429 edges, 245958 markings/sec, 175 secs
lola: 45412997 markings, 82171622 edges, 237063 markings/sec, 180 secs
lola: 46578692 markings, 84294415 edges, 233139 markings/sec, 185 secs
lola: 47744201 markings, 86416289 edges, 233102 markings/sec, 190 secs
lola: 48831801 markings, 88384186 edges, 217520 markings/sec, 195 secs
lola: 50049257 markings, 90595795 edges, 243491 markings/sec, 200 secs
lola: 51336229 markings, 92918291 edges, 257394 markings/sec, 205 secs
lola: 52575369 markings, 95161070 edges, 247828 markings/sec, 210 secs
lola: 53756412 markings, 97304164 edges, 236209 markings/sec, 215 secs
lola: 54926827 markings, 99416269 edges, 234083 markings/sec, 220 secs
lola: 56051898 markings, 101455486 edges, 225014 markings/sec, 225 secs
lola: 57167753 markings, 103481324 edges, 223171 markings/sec, 230 secs
lola: 58238782 markings, 105425227 edges, 214206 markings/sec, 235 secs
lola: 59352049 markings, 107453180 edges, 222653 markings/sec, 240 secs
lola: 60479147 markings, 109509434 edges, 225420 markings/sec, 245 secs
lola: 61588625 markings, 111539765 edges, 221896 markings/sec, 250 secs
lola: 62707356 markings, 113568991 edges, 223746 markings/sec, 255 secs
lola: 63801136 markings, 115563716 edges, 218756 markings/sec, 260 secs
lola: 64859260 markings, 117493230 edges, 211625 markings/sec, 265 secs
lola: 66176048 markings, 119870837 edges, 263358 markings/sec, 270 secs
lola: 67441936 markings, 122165306 edges, 253178 markings/sec, 275 secs
lola: 68688796 markings, 124417009 edges, 249372 markings/sec, 280 secs
lola: 69918255 markings, 126642254 edges, 245892 markings/sec, 285 secs
lola: 71229452 markings, 129007787 edges, 262239 markings/sec, 290 secs
lola: 72462313 markings, 131235355 edges, 246572 markings/sec, 295 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p268) OR NOT(E (F (((p394 <= p302) AND (3 <= p345))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p268)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p268)
lola: processed formula length: 11
lola: 3 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: processed formula with 1 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: subprocess 9 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ========================================
...considering subproblem: A (G (((p302 + 1 <= p394) OR (p345 <= 2))))
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 44 bytes per marking, with 20 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 Raft-PT-09-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p218) AND (p32 <= p103) AND (2 <= p63)) OR A (X ((1 <= p99))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p218) AND (p32 <= p103) AND (2 <= p63))))
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 44 bytes per marking, with 20 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((1 <= p99)))
lola: processed formula length: 24
lola: 3 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((2 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (2 <= p14)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 1383454 markings, 2496027 edges, 2948049334177890304 markings/sec, 0 secs
lola: 2716873 markings, 4903010 edges, 266684 markings/sec, 5 secs
lola: 4047047 markings, 7306539 edges, 266035 markings/sec, 10 secs
lola: 5257890 markings, 9494458 edges, 242169 markings/sec, 15 secs
lola: 6490711 markings, 11729420 edges, 246564 markings/sec, 20 secs
lola: 7701178 markings, 13929127 edges, 242093 markings/sec, 25 secs
lola: 8912005 markings, 16121737 edges, 242165 markings/sec, 30 secs
lola: 10054280 markings, 18180778 edges, 228455 markings/sec, 35 secs
lola: 11312799 markings, 20464197 edges, 251704 markings/sec, 40 secs
lola: 12628607 markings, 22840216 edges, 263162 markings/sec, 45 secs
lola: 13960442 markings, 25244736 edges, 266367 markings/sec, 50 secs
lola: 15317479 markings, 27691783 edges, 271407 markings/sec, 55 secs
lola: 16589622 markings, 29989275 edges, 254429 markings/sec, 60 secs
lola: 17904266 markings, 32362595 edges, 262929 markings/sec, 65 secs
lola: 19143736 markings, 34607367 edges, 247894 markings/sec, 70 secs
lola: 20370088 markings, 36822490 edges, 245270 markings/sec, 75 secs
lola: 21590176 markings, 39034115 edges, 244018 markings/sec, 80 secs
lola: 22789771 markings, 41213938 edges, 239919 markings/sec, 85 secs
lola: 24118331 markings, 43612804 edges, 265712 markings/sec, 90 secs
lola: 25414383 markings, 45953190 edges, 259210 markings/sec, 95 secs
lola: 26639567 markings, 48161732 edges, 245037 markings/sec, 100 secs
lola: 27825350 markings, 50302568 edges, 237157 markings/sec, 105 secs
lola: 29008226 markings, 52441940 edges, 236575 markings/sec, 110 secs
lola: 30197818 markings, 54597038 edges, 237918 markings/sec, 115 secs
lola: 31328811 markings, 56653363 edges, 226199 markings/sec, 120 secs
lola: 32460808 markings, 58713023 edges, 226399 markings/sec, 125 secs
lola: 33542184 markings, 60679034 edges, 216275 markings/sec, 130 secs
lola: 34607459 markings, 62622954 edges, 213055 markings/sec, 135 secs
lola: 35825733 markings, 64822158 edges, 243655 markings/sec, 140 secs
lola: 37072339 markings, 67077656 edges, 249321 markings/sec, 145 secs
lola: 38203871 markings, 69118542 edges, 226306 markings/sec, 150 secs
lola: 39299457 markings, 71099412 edges, 219117 markings/sec, 155 secs
lola: 40447847 markings, 73185455 edges, 229678 markings/sec, 160 secs
lola: 41640974 markings, 75348045 edges, 238625 markings/sec, 165 secs
lola: 42958620 markings, 77724694 edges, 263529 markings/sec, 170 secs
lola: 44260529 markings, 80080479 edges, 260382 markings/sec, 175 secs
lola: 45482684 markings, 82298223 edges, 244431 markings/sec, 180 secs
lola: 46669573 markings, 84459799 edges, 237378 markings/sec, 185 secs
lola: 47864250 markings, 86633293 edges, 238935 markings/sec, 190 secs
lola: 49050286 markings, 88781662 edges, 237207 markings/sec, 195 secs
lola: 50337552 markings, 91115993 edges, 257453 markings/sec, 200 secs
lola: 51636434 markings, 93460817 edges, 259776 markings/sec, 205 secs
lola: 52902582 markings, 95754763 edges, 253230 markings/sec, 210 secs
lola: 54142801 markings, 98001575 edges, 248044 markings/sec, 215 secs
lola: 55374110 markings, 100225145 edges, 246262 markings/sec, 220 secs
lola: 56585286 markings, 102426127 edges, 242235 markings/sec, 225 secs
lola: 57762964 markings, 104560605 edges, 235536 markings/sec, 230 secs
lola: 58949442 markings, 106717794 edges, 237296 markings/sec, 235 secs
lola: 60135641 markings, 108883487 edges, 237240 markings/sec, 240 secs
lola: 61298670 markings, 111009642 edges, 232606 markings/sec, 245 secs
lola: 62447121 markings, 113095948 edges, 229690 markings/sec, 250 secs
lola: 63566936 markings, 115136009 edges, 223963 markings/sec, 255 secs
lola: 64676016 markings, 117160234 edges, 221816 markings/sec, 260 secs
lola: 65958475 markings, 119478639 edges, 256492 markings/sec, 265 secs
lola: 67252132 markings, 121819085 edges, 258731 markings/sec, 270 secs
lola: 68497445 markings, 124070386 edges, 249063 markings/sec, 275 secs
lola: 69698099 markings, 126244593 edges, 240131 markings/sec, 280 secs
lola: 71012938 markings, 128616210 edges, 262968 markings/sec, 285 secs
lola: 72231681 markings, 130816896 edges, 243749 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((p231 <= p297) U (p18 <= p62)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((p231 <= p297) U (p18 <= p62)))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 1072293 markings, 3006984 edges, 3095594998532407296 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 12 will run for 533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p404)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: state equation: write sara problem file to Raft-PT-09-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 710 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p362 <= p158) AND (3 <= p99) AND (2 <= p211) AND (p274 <= p328) AND (1 <= p295) AND (2 <= p261) AND (1 <= p217))))
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 44 bytes per marking, with 20 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 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-CTLCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1066 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p93 <= p275) AND (3 <= p105))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((p275 + 1 <= p93) OR (p105 <= 2)))))
lola: processed formula length: 60
lola: 3 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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: 1083125 markings, 3037177 edges, 2948049334177890304 markings/sec, 0 secs
lola: 2117895 markings, 5940961 edges, 206954 markings/sec, 5 secs
lola: 3141144 markings, 8808627 edges, 204650 markings/sec, 10 secs
lola: 4127329 markings, 11578864 edges, 197237 markings/sec, 15 secs
lola: 5100633 markings, 14309412 edges, 194661 markings/sec, 20 secs
lola: 6078570 markings, 17061671 edges, 195587 markings/sec, 25 secs
lola: 7051540 markings, 19800408 edges, 194594 markings/sec, 30 secs
lola: 7980356 markings, 22415579 edges, 185763 markings/sec, 35 secs
lola: 8955286 markings, 25154852 edges, 194986 markings/sec, 40 secs
lola: 9859863 markings, 27688905 edges, 180915 markings/sec, 45 secs
lola: 10756873 markings, 30218407 edges, 179402 markings/sec, 50 secs
lola: 11786303 markings, 33104976 edges, 205886 markings/sec, 55 secs
lola: 12776161 markings, 35883090 edges, 197972 markings/sec, 60 secs
lola: 13818415 markings, 38807407 edges, 208451 markings/sec, 65 secs
lola: 14892359 markings, 41817137 edges, 214789 markings/sec, 70 secs
lola: 15888892 markings, 44610755 edges, 199307 markings/sec, 75 secs
lola: 16898992 markings, 47444768 edges, 202020 markings/sec, 80 secs
lola: 17908545 markings, 50278831 edges, 201911 markings/sec, 85 secs
lola: 18857484 markings, 52949005 edges, 189788 markings/sec, 90 secs
lola: 19799517 markings, 55590387 edges, 188407 markings/sec, 95 secs
lola: 20756490 markings, 58280480 edges, 191395 markings/sec, 100 secs
lola: 21712717 markings, 60969792 edges, 191245 markings/sec, 105 secs
lola: 22644965 markings, 63595607 edges, 186450 markings/sec, 110 secs
lola: 23631418 markings, 66365841 edges, 197291 markings/sec, 115 secs
lola: 24631903 markings, 69170154 edges, 200097 markings/sec, 120 secs
lola: 25598907 markings, 71885264 edges, 193401 markings/sec, 125 secs
lola: 26525193 markings, 74480903 edges, 185257 markings/sec, 130 secs
lola: 27443426 markings, 77054700 edges, 183647 markings/sec, 135 secs
lola: 28365105 markings, 79643006 edges, 184336 markings/sec, 140 secs
lola: 29291569 markings, 82245351 edges, 185293 markings/sec, 145 secs
lola: 30237702 markings, 84906598 edges, 189227 markings/sec, 150 secs
lola: 31141918 markings, 87456047 edges, 180843 markings/sec, 155 secs
lola: 32034639 markings, 89974375 edges, 178544 markings/sec, 160 secs
lola: 32906583 markings, 92430039 edges, 174389 markings/sec, 165 secs
lola: 33780889 markings, 94894672 edges, 174861 markings/sec, 170 secs
lola: 34658339 markings, 97373284 edges, 175490 markings/sec, 175 secs
lola: 35623498 markings, 100080850 edges, 193032 markings/sec, 180 secs
lola: 36606296 markings, 102840752 edges, 196560 markings/sec, 185 secs
lola: 37536957 markings, 105452286 edges, 186132 markings/sec, 190 secs
lola: 38392447 markings, 107851445 edges, 171098 markings/sec, 195 secs
lola: 39241224 markings, 110235975 edges, 169755 markings/sec, 200 secs
lola: 40111464 markings, 112689241 edges, 174048 markings/sec, 205 secs
lola: 41023456 markings, 115254295 edges, 182398 markings/sec, 210 secs
lola: 41945034 markings, 117841420 edges, 184316 markings/sec, 215 secs
lola: 42886388 markings, 120480237 edges, 188271 markings/sec, 220 secs
lola: 43819508 markings, 123099953 edges, 186624 markings/sec, 225 secs
lola: 44728398 markings, 125658057 edges, 181778 markings/sec, 230 secs
lola: 45624423 markings, 128181498 edges, 179205 markings/sec, 235 secs
lola: 46522648 markings, 130714251 edges, 179645 markings/sec, 240 secs
lola: 47418951 markings, 133242866 edges, 179261 markings/sec, 245 secs
lola: 48308244 markings, 135744537 edges, 177859 markings/sec, 250 secs
lola: 49184484 markings, 138210481 edges, 175248 markings/sec, 255 secs
lola: 50132324 markings, 140877517 edges, 189568 markings/sec, 260 secs
lola: 51103393 markings, 143601535 edges, 194214 markings/sec, 265 secs
lola: 52055652 markings, 146276213 edges, 190452 markings/sec, 270 secs
lola: 52990337 markings, 148905017 edges, 186937 markings/sec, 275 secs
lola: 53901869 markings, 151468767 edges, 182306 markings/sec, 280 secs
lola: 54828940 markings, 154069065 edges, 185414 markings/sec, 285 secs
lola: 55706591 markings, 156536049 edges, 175530 markings/sec, 290 secs
lola: 56586618 markings, 159015115 edges, 176005 markings/sec, 295 secs
lola: 57448404 markings, 161438143 edges, 172357 markings/sec, 300 secs
lola: 58293495 markings, 163817997 edges, 169018 markings/sec, 305 secs
lola: 59163279 markings, 166272398 edges, 173957 markings/sec, 310 secs
lola: 60031915 markings, 168725240 edges, 173727 markings/sec, 315 secs
lola: 60908265 markings, 171200296 edges, 175270 markings/sec, 320 secs
lola: 61759766 markings, 173611880 edges, 170300 markings/sec, 325 secs
lola: 62634511 markings, 176071324 edges, 174949 markings/sec, 330 secs
lola: 63486231 markings, 178475763 edges, 170344 markings/sec, 335 secs
lola: 64336447 markings, 180875769 edges, 170043 markings/sec, 340 secs
lola: 65208480 markings, 183333839 edges, 174407 markings/sec, 345 secs
lola: 66180757 markings, 186060005 edges, 194455 markings/sec, 350 secs
lola: 67125043 markings, 188713490 edges, 188857 markings/sec, 355 secs
lola: 68068999 markings, 191365777 edges, 188791 markings/sec, 360 secs
lola: 69002912 markings, 193988800 edges, 186783 markings/sec, 365 secs
lola: 69939390 markings, 196619853 edges, 187296 markings/sec, 370 secs
lola: 70909778 markings, 199338918 edges, 194078 markings/sec, 375 secs
lola: 71848958 markings, 201976859 edges, 187836 markings/sec, 380 secs
lola: 72741335 markings, 204483690 edges, 178475 markings/sec, 385 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1741 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (X ((p122 <= p67))) AND NOT(A (F ((1 <= p163))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1741 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p67 + 1 <= p122)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((p67 + 1 <= p122))
lola: processed formula length: 21
lola: 11 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 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 0 significant temporal operators and needs 0 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: RESULT
lola:
SUMMARY: no unknown no unknown yes no unknown unknown yes yes unknown no no no unknown unknown
lola: ========================================
FORMULA Raft-PT-09-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494801574820

--------------------
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="Raft-PT-09"
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/Raft-PT-09.tgz
mv Raft-PT-09 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 Raft-PT-09, 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 r068-csrt-149440963000021"
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 ;