About the Execution of LoLA for S_DES-PT-20a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2423.000 | 524746.00 | 545873.00 | 127.80 | FFTTFFT?FTTFT?TF | 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-3253
Executing tool lola
Input is S_DES-PT-20a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455700264
=====================================================================
--------------------
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 DES-PT-20a-CTLCardinality-0
FORMULA_NAME DES-PT-20a-CTLCardinality-1
FORMULA_NAME DES-PT-20a-CTLCardinality-10
FORMULA_NAME DES-PT-20a-CTLCardinality-11
FORMULA_NAME DES-PT-20a-CTLCardinality-12
FORMULA_NAME DES-PT-20a-CTLCardinality-13
FORMULA_NAME DES-PT-20a-CTLCardinality-14
FORMULA_NAME DES-PT-20a-CTLCardinality-15
FORMULA_NAME DES-PT-20a-CTLCardinality-2
FORMULA_NAME DES-PT-20a-CTLCardinality-3
FORMULA_NAME DES-PT-20a-CTLCardinality-4
FORMULA_NAME DES-PT-20a-CTLCardinality-5
FORMULA_NAME DES-PT-20a-CTLCardinality-6
FORMULA_NAME DES-PT-20a-CTLCardinality-7
FORMULA_NAME DES-PT-20a-CTLCardinality-8
FORMULA_NAME DES-PT-20a-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496452047788
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DES-PT-20a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_DES-PT-20a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_DES-PT-20a @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 347/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 195 places, 152 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 177 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20a-CTLCardinality.task
lola: A (G ((((p64 <= p163) OR (p144 <= p63) OR (1 <= p59) OR (p115 <= p31)) AND E (F ((3 <= p121)))))) : A (G ((((1 <= p133) AND (p150 <= p133)) OR (p140 <= p130) OR ((3 <= p128) AND (p65 <= p184) AND (p106 <= p67) AND (1 <= p149))))) : NOT(E (G (E (F ((p97 <= p84)))))) : NOT(((((p118 <= 1) AND ((p87 <= p47) OR (p121 <= p119))) OR (2 <= p55)) AND E (G ((p182 <= p153))))) : E (G ((((p101 + 1 <= p167) OR (p32 <= 1)) AND ((p74 <= p108) OR (p63 <= p17))))) : NOT(NOT(A (((p133 <= p151) U (1 <= p31))))) : ((A (((1 <= p136) U (p66 <= p192))) AND E (((3 <= p44) U (p86 <= p183)))) AND E (F (E (F ((1 <= p72)))))) : E (F ((E (G ((3 <= p28))) OR ((p20 <= 2) AND (p123 + 1 <= p33))))) : (((p100 <= 2) AND NOT(A (F ((2 <= p152))))) AND (E (G (((p171 <= p52) OR (1 <= p10)))) OR (A (X ((1 <= p80))) OR (p111 <= p60)))) : NOT(E (G ((p8 <= p58)))) : ((E (((p35 <= p64) U (1 <= p167))) AND A (X ((p57 + 1 <= p150)))) OR ((p70 <= p164) AND (E (G ((p12 <= p186))) AND E (G ((3 <= p170)))))) : (E (G ((p43 <= p130))) OR (E (F (((2 <= p24) OR (2 <= p110)))) AND E (F (((2 <= p62) AND (p77 <= p83)))))) : A (F (E (X ((p19 + 1 <= p179))))) : E (G ((((p156 <= 0) AND (p126 + 1 <= p106)) OR ((p192 <= p41) AND (p127 <= p33) AND (p191 <= 0))))) : A (X (E (F ((1 <= p70))))) : ((2 <= p37) OR E (X (A (F ((3 <= p168))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p64 <= p163) OR (p144 <= p63) OR (1 <= p59) OR (p115 <= p31)) AND E (F ((3 <= p121))))))
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: A (G (((p64 <= p163) OR (p144 <= p63) OR (1 <= p59) OR (p115 <= p31))))
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 20 bytes per marking, with 24 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20a-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20a-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 743762 markings, 2178078 edges, 148752 markings/sec, 0 secs
lola: sara is running 5 secs || 1427217 markings, 4217290 edges, 136691 markings/sec, 5 secs
lola: sara is running 10 secs || 2077875 markings, 6160737 edges, 130132 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p133) AND (p150 <= p133)) OR (p140 <= p130) OR ((3 <= p128) AND (p65 <= p184) AND (p106 <= p67) AND (1 <= p149)))))
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 20 bytes per marking, with 24 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 24 literals and 8 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 DES-PT-20a-CTLCardinality.sara
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (E (F ((p97 <= p84))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (p97 <= p84))))
lola: processed formula length: 37
lola: 8 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((p118 <= 1) AND ((p87 <= p47) OR (p121 <= p119))) OR (2 <= p55)) AND E (G ((p182 <= p153)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p118) OR ((p47 + 1 <= p87) AND (p119 + 1 <= p121))) AND (p55 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= p118) OR ((p47 + 1 <= p87) AND (p119 + 1 <= p121))) AND (p55 <= 1))
lola: processed formula length: 76
lola: 5 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: processed formula with 4 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 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p153 + 1 <= p182)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p153 + 1 <= p182))
lola: processed formula length: 28
lola: 6 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p101 + 1 <= p167) OR (p32 <= 1)) AND ((p74 <= p108) OR (p63 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p167 <= p101) AND (2 <= p32)) OR ((p108 + 1 <= p74) AND (p17 + 1 <= p63)))))
lola: processed formula length: 93
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (((p133 <= p151) U (1 <= p31)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p133 <= p151) U (1 <= p31))
lola: processed formula length: 30
lola: 9 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((1 <= p136) U (p66 <= p192))) AND E (((3 <= p44) U (p86 <= p183)))) AND E (F (E (F ((1 <= p72))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p136) U (p66 <= p192)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((1 <= p136) U (p66 <= p192))
lola: processed formula length: 30
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((3 <= p44) U (p86 <= p183)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((3 <= p44) U (p86 <= p183))
lola: processed formula length: 29
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p72)))
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 20 bytes per marking, with 24 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 DES-PT-20a-CTLCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((3 <= p28))) OR ((p20 <= 2) AND (p123 + 1 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((3 <= p28)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p28 <= 2))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 471480 markings, 2941047 edges, 2693137733760581632 markings/sec, 0 secs
lola: 1001992 markings, 6058849 edges, 106102 markings/sec, 5 secs
lola: 1336130 markings, 8960303 edges, 66828 markings/sec, 10 secs
lola: 1654428 markings, 11889698 edges, 63660 markings/sec, 15 secs
lola: 1946264 markings, 14783072 edges, 58367 markings/sec, 20 secs
lola: 2215138 markings, 17637020 edges, 53775 markings/sec, 25 secs
lola: 2452785 markings, 20465495 edges, 47529 markings/sec, 30 secs
lola: 2707390 markings, 23345519 edges, 50921 markings/sec, 35 secs
lola: 3001734 markings, 26258918 edges, 58869 markings/sec, 40 secs
lola: 3265359 markings, 29136511 edges, 52725 markings/sec, 45 secs
lola: 3489329 markings, 31986609 edges, 44794 markings/sec, 50 secs
lola: 3820232 markings, 34828664 edges, 66181 markings/sec, 55 secs
lola: 4123801 markings, 37617986 edges, 60714 markings/sec, 60 secs
lola: 4448164 markings, 40465696 edges, 64873 markings/sec, 65 secs
lola: 4755349 markings, 43283749 edges, 61437 markings/sec, 70 secs
lola: 5060198 markings, 46112889 edges, 60970 markings/sec, 75 secs
lola: 5336095 markings, 48880893 edges, 55179 markings/sec, 80 secs
lola: 5609014 markings, 51660092 edges, 54584 markings/sec, 85 secs
lola: 5854561 markings, 54406971 edges, 49109 markings/sec, 90 secs
lola: 6082772 markings, 57169829 edges, 45642 markings/sec, 95 secs
lola: 6295554 markings, 59894972 edges, 42556 markings/sec, 100 secs
lola: 6538467 markings, 62673915 edges, 48583 markings/sec, 105 secs
lola: 6840871 markings, 65498223 edges, 60481 markings/sec, 110 secs
lola: 7115639 markings, 68276514 edges, 54954 markings/sec, 115 secs
lola: 7382800 markings, 71047071 edges, 53432 markings/sec, 120 secs
lola: 7611070 markings, 73802390 edges, 45654 markings/sec, 125 secs
lola: 7831693 markings, 76535022 edges, 44125 markings/sec, 130 secs
lola: 8031112 markings, 79271646 edges, 39884 markings/sec, 135 secs
lola: 8347374 markings, 82200946 edges, 63252 markings/sec, 140 secs
lola: 8619252 markings, 85039911 edges, 54376 markings/sec, 145 secs
lola: 8894409 markings, 87785807 edges, 55031 markings/sec, 150 secs
lola: 9131746 markings, 90506735 edges, 47467 markings/sec, 155 secs
lola: 9446136 markings, 93323894 edges, 62878 markings/sec, 160 secs
lola: 9708978 markings, 96090918 edges, 52568 markings/sec, 165 secs
lola: 9958554 markings, 98764408 edges, 49915 markings/sec, 170 secs
lola: 10231335 markings, 101400479 edges, 54556 markings/sec, 175 secs
lola: 10499683 markings, 104012945 edges, 53670 markings/sec, 180 secs
lola: 10774163 markings, 106593882 edges, 54896 markings/sec, 185 secs
lola: 11022521 markings, 109123522 edges, 49672 markings/sec, 190 secs
lola: 11290288 markings, 111700540 edges, 53553 markings/sec, 195 secs
lola: 11619967 markings, 114403717 edges, 65936 markings/sec, 200 secs
lola: 11896973 markings, 117201898 edges, 55401 markings/sec, 205 secs
lola: 12151085 markings, 119921563 edges, 50822 markings/sec, 210 secs
lola: 12408596 markings, 122576975 edges, 51502 markings/sec, 215 secs
lola: 12647378 markings, 125203322 edges, 47756 markings/sec, 220 secs
lola: 12858880 markings, 127791530 edges, 42300 markings/sec, 225 secs
lola: 13092179 markings, 130344580 edges, 46660 markings/sec, 230 secs
lola: 13352897 markings, 132945615 edges, 52144 markings/sec, 235 secs
lola: 13587330 markings, 135472130 edges, 46887 markings/sec, 240 secs
lola: 13805385 markings, 137944041 edges, 43611 markings/sec, 245 secs
lola: 14079031 markings, 140608824 edges, 54729 markings/sec, 250 secs
lola: 14420504 markings, 143332767 edges, 68295 markings/sec, 255 secs
lola: 14739881 markings, 145875657 edges, 63875 markings/sec, 260 secs
lola: 15023666 markings, 148408175 edges, 56757 markings/sec, 265 secs
lola: 15316023 markings, 150866188 edges, 58471 markings/sec, 270 secs
lola: 15581637 markings, 153298708 edges, 53123 markings/sec, 275 secs
lola: 15829825 markings, 155784224 edges, 49638 markings/sec, 280 secs
lola: 16095425 markings, 158306231 edges, 53120 markings/sec, 285 secs
lola: 16350369 markings, 160997540 edges, 50989 markings/sec, 290 secs
lola: 16663953 markings, 163681034 edges, 62717 markings/sec, 295 secs
lola: 16946356 markings, 166415803 edges, 56481 markings/sec, 300 secs
lola: 17180523 markings, 169009677 edges, 46833 markings/sec, 305 secs
lola: 17473334 markings, 171609585 edges, 58562 markings/sec, 310 secs
lola: 17819757 markings, 174507716 edges, 69285 markings/sec, 315 secs
lola: 18090507 markings, 177338911 edges, 54150 markings/sec, 320 secs
lola: 18360901 markings, 180178356 edges, 54079 markings/sec, 325 secs
lola: 18597804 markings, 182949504 edges, 47381 markings/sec, 330 secs
lola: 18852687 markings, 185661791 edges, 50977 markings/sec, 335 secs
lola: 19090213 markings, 188304276 edges, 47505 markings/sec, 340 secs
lola: 19375324 markings, 191015196 edges, 57022 markings/sec, 345 secs
lola: 19659285 markings, 193861845 edges, 56792 markings/sec, 350 secs
lola: 19952387 markings, 196596299 edges, 58620 markings/sec, 355 secs
lola: 20233047 markings, 199343104 edges, 56132 markings/sec, 360 secs
lola: 20474090 markings, 201984796 edges, 48209 markings/sec, 365 secs
lola: 20736168 markings, 204491058 edges, 52416 markings/sec, 370 secs
lola: 20960630 markings, 207184162 edges, 44892 markings/sec, 375 secs
lola: 21209708 markings, 209725212 edges, 49816 markings/sec, 380 secs
lola: 21472940 markings, 212263519 edges, 52646 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p100 <= 2) AND NOT(A (F ((2 <= p152))))) AND (E (G (((p171 <= p52) OR (1 <= p10)))) OR (A (X ((1 <= p80))) OR (p111 <= p60))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p100 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p100 <= 2)
lola: processed formula length: 11
lola: 4 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-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 9 will run for 446 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p152 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p152)))
lola: processed formula length: 26
lola: 6 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 521 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p171 <= p52) OR (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p52 + 1 <= p171) AND (p10 <= 0))))
lola: processed formula length: 49
lola: 6 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 731199 markings, 2971639 edges, 146240 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: ========================================
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p80)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((1 <= p80))
lola: processed formula length: 14
lola: 5 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 12 will run for 780 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p111 <= p60)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p111 <= p60)
lola: processed formula length: 13
lola: 4 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((p8 <= p58))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p58 + 1 <= p8))
lola: processed formula length: 25
lola: 4 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 10 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (((p35 <= p64) U (1 <= p167))) AND A (X ((p57 + 1 <= p150)))) OR ((p70 <= p164) AND (E (G ((p12 <= p186))) AND E (G ((3 <= p170))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p35 <= p64) U (1 <= p167)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p35 <= p64) U (1 <= p167))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 11 will run for 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p57 + 1 <= p150)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((p57 + 1 <= p150))
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 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 11 will run for 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p43 <= p130))) OR (E (F (((2 <= p24) OR (2 <= p110)))) AND E (F (((2 <= p62) AND (p77 <= p83))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p43 <= p130)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p130 + 1 <= p43)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 780 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p19 + 1 <= p179)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((p19 + 1 <= p179)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 1041 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p156 <= 0) AND (p126 + 1 <= p106)) OR ((p192 <= p41) AND (p127 <= p33) AND (p191 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((1 <= p156) OR (p106 <= p126)) AND ((p41 + 1 <= p192) OR (p33 + 1 <= p127) OR (1 <= p191)))))
lola: processed formula length: 111
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 14 will run for 1561 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((1 <= p70)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (1 <= p70)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 433590 markings, 3142880 edges, 3689348869717491712 markings/sec, 0 secs
lola: 767646 markings, 5964443 edges, 66811 markings/sec, 5 secs
lola: 1158630 markings, 9021135 edges, 78197 markings/sec, 10 secs
lola: 1509624 markings, 11853188 edges, 70199 markings/sec, 15 secs
lola: 1909211 markings, 14635880 edges, 79917 markings/sec, 20 secs
lola: 2339538 markings, 17753252 edges, 86065 markings/sec, 25 secs
lola: 2684811 markings, 20671606 edges, 69055 markings/sec, 30 secs
lola: 3058769 markings, 23575424 edges, 74792 markings/sec, 35 secs
lola: 3393979 markings, 26343440 edges, 67042 markings/sec, 40 secs
lola: 3809294 markings, 29374610 edges, 83063 markings/sec, 45 secs
lola: 4145353 markings, 32212710 edges, 67212 markings/sec, 50 secs
lola: 4507705 markings, 35020614 edges, 72470 markings/sec, 55 secs
lola: 4825980 markings, 37711417 edges, 63655 markings/sec, 60 secs
lola: 5235182 markings, 40663603 edges, 81840 markings/sec, 65 secs
lola: 5572547 markings, 43458029 edges, 67473 markings/sec, 70 secs
lola: 5926154 markings, 46207340 edges, 70721 markings/sec, 75 secs
lola: 6235235 markings, 48851270 edges, 61816 markings/sec, 80 secs
lola: 6620752 markings, 51709698 edges, 77103 markings/sec, 85 secs
lola: 6970845 markings, 54474409 edges, 70019 markings/sec, 90 secs
lola: 7314477 markings, 57178434 edges, 68726 markings/sec, 95 secs
lola: 7612303 markings, 59763094 edges, 59565 markings/sec, 100 secs
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 3015 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p37) OR E (X (A (F ((3 <= p168))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3015 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p37)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p37)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-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: ========================================
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: lola: ========================================RESULT
lola:
SUMMARY: no no no yes yes no yes unknown yes no yes yes no no yes unknown
FORMULA DES-PT-20a-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496452572534
--------------------
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="S_DES-PT-20a"
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/S_DES-PT-20a.tgz
mv S_DES-PT-20a execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_DES-PT-20a, 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 r098-ebro-149488455700264"
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 '
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 ;