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)
....................................................................................
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 37K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PermAdmissibility-COL-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472700451
=====================================================================

--------------------
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 PermAdmissibility-COL-10-CTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527141357185


BK_STOP 1527142711952

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PermAdmissibility-COL-10 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1411062, 'Memory': 15952.91, 'Tool': 'lola'}, {'Time': 1412455, 'Memory': 15945.46, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-COL-10...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PermAdmissibility-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-10: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-COL-10 @ 3540 seconds
----- Start make result stderr -----
----- 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: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-10-CTLCardinality.task
lola: ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + 1 <= p87) OR A (X (A (F ((1 <= p53)))))) : E (G ((p163 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187))) : ((E (F ((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p207))) OR (A (X ((2 <= p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171))) OR (p9 + 1 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))) AND E (F (((p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + 1 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= 0))))) : E (G ((E (F ((p207 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205))) AND ((p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 <= 1) OR (p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= 0))))) : E (F (((2 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND (p53 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78) AND (p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= p44) AND (1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34)))) : A (G ((p53 <= 2))) : A (G ((((1 <= p18) OR ((p87 <= p197) AND (2 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52))) AND A (G ((p138 <= p35)))))) : NOT(A (F ((1 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187)))) : (A (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + 1 <= p197))) AND A (F ((1 <= p35)))) : (NOT(NOT(E (F ((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p96))))) AND NOT(A (F ((2 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61))))) : E (G ((p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154))) : A (F ((E (G ((3 <= p9))) AND ((p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= p44) OR (1 <= p53) OR (3 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128) OR (p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61))))) : A (G ((p206 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154))) : E (F (A (G (((1 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154) OR (p207 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112)))))) : (((A (F ((3 <= p62))) AND (p163 <= 2)) OR ((p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99 + 1 <= p87) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))) OR NOT(((p137 <= 0) AND E (F ((2 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154)))))) : NOT((((p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154) AND E (F ((2 <= p138)))) OR E (G ((1 <= p8)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + 1 <= p87) OR A (X (A (F ((1 <= p53))))))
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: (p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + 1 <= p87)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + 1 <= p87)
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (1 <= p53)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1459558 markings, 1839504 edges, 2904814887706296320 markings/sec, 0 secs
lola: 2875568 markings, 3690645 edges, 283202 markings/sec, 5 secs
lola: 4258717 markings, 5522487 edges, 276630 markings/sec, 10 secs
lola: 5584838 markings, 7348468 edges, 265224 markings/sec, 15 secs
lola: 6944718 markings, 9144300 edges, 271976 markings/sec, 20 secs
lola: 8258021 markings, 10936075 edges, 262661 markings/sec, 25 secs
lola: 9648523 markings, 12746821 edges, 278100 markings/sec, 30 secs
lola: 10987994 markings, 14568869 edges, 267894 markings/sec, 35 secs
lola: 12340865 markings, 16367575 edges, 270574 markings/sec, 40 secs
lola: 13658079 markings, 18137148 edges, 263443 markings/sec, 45 secs
lola: 14952189 markings, 19925603 edges, 258822 markings/sec, 50 secs
lola: 16244223 markings, 21685476 edges, 258407 markings/sec, 55 secs
lola: 17555530 markings, 23468305 edges, 262261 markings/sec, 60 secs
lola: 18866731 markings, 25251773 edges, 262240 markings/sec, 65 secs
lola: 20202530 markings, 27028208 edges, 267160 markings/sec, 70 secs
lola: 21499320 markings, 28806360 edges, 259358 markings/sec, 75 secs
lola: 22792799 markings, 30582782 edges, 258696 markings/sec, 80 secs
lola: 24107047 markings, 32373228 edges, 262850 markings/sec, 85 secs
lola: 25384063 markings, 34140154 edges, 255403 markings/sec, 90 secs
lola: 26663717 markings, 35893164 edges, 255931 markings/sec, 95 secs
lola: 27895720 markings, 37639784 edges, 246401 markings/sec, 100 secs
lola: 29159198 markings, 39415245 edges, 252696 markings/sec, 105 secs
lola: 30456677 markings, 41125216 edges, 259496 markings/sec, 110 secs
lola: 31718603 markings, 42832501 edges, 252385 markings/sec, 115 secs
lola: 32919737 markings, 44491873 edges, 240227 markings/sec, 120 secs
lola: 34124301 markings, 46136722 edges, 240913 markings/sec, 125 secs
lola: 35368724 markings, 47843827 edges, 248885 markings/sec, 130 secs
lola: 36580819 markings, 49494925 edges, 242419 markings/sec, 135 secs
lola: 36615344 markings, 49541719 edges, 6905 markings/sec, 140 secs
lola: 36617066 markings, 49544098 edges, 344 markings/sec, 145 secs
lola: 36619647 markings, 49547656 edges, 516 markings/sec, 150 secs
lola: 36620300 markings, 49548503 edges, 131 markings/sec, 155 secs
lola: 36621832 markings, 49550634 edges, 306 markings/sec, 160 secs
lola: 36621838 markings, 49550648 edges, 1 markings/sec, 165 secs
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: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p163 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + 1 <= p163)))
lola: processed formula length: 82
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1365499 markings, 1918129 edges, 3689329903141912576 markings/sec, 0 secs
lola: 2747681 markings, 3873840 edges, 276436 markings/sec, 5 secs
lola: 4028915 markings, 5766078 edges, 256247 markings/sec, 10 secs
lola: 5302716 markings, 7666708 edges, 254760 markings/sec, 15 secs
lola: 6641139 markings, 9587156 edges, 267685 markings/sec, 20 secs
lola: 7987976 markings, 11526023 edges, 269367 markings/sec, 25 secs
lola: 9302367 markings, 13467568 edges, 262878 markings/sec, 30 secs
lola: 10594575 markings, 15393123 edges, 258442 markings/sec, 35 secs
lola: 11879243 markings, 17266937 edges, 256934 markings/sec, 40 secs
lola: 13186734 markings, 19095514 edges, 261498 markings/sec, 45 secs
lola: 14516182 markings, 21004627 edges, 265890 markings/sec, 50 secs
lola: 15858245 markings, 22953593 edges, 268413 markings/sec, 55 secs
lola: 17105936 markings, 24740705 edges, 249538 markings/sec, 60 secs
lola: 18216942 markings, 26486869 edges, 222201 markings/sec, 65 secs
lola: 19433315 markings, 28268725 edges, 243275 markings/sec, 70 secs
lola: 20603888 markings, 30034720 edges, 234115 markings/sec, 75 secs
lola: 21764053 markings, 31802909 edges, 232033 markings/sec, 80 secs
lola: 22997617 markings, 33583905 edges, 246713 markings/sec, 85 secs
lola: 24253438 markings, 35352960 edges, 251164 markings/sec, 90 secs
lola: 25434461 markings, 37039160 edges, 236205 markings/sec, 95 secs
lola: 26569352 markings, 38780544 edges, 226978 markings/sec, 100 secs
lola: 27777655 markings, 40536335 edges, 241661 markings/sec, 105 secs
lola: 28979270 markings, 42336304 edges, 240323 markings/sec, 110 secs
lola: 30155266 markings, 44123884 edges, 235199 markings/sec, 115 secs
lola: 31269566 markings, 45817345 edges, 222860 markings/sec, 120 secs
lola: 32396184 markings, 47525902 edges, 225324 markings/sec, 125 secs
lola: 33649944 markings, 49295521 edges, 250752 markings/sec, 130 secs
lola: 34897725 markings, 51114408 edges, 249556 markings/sec, 135 secs
lola: 36158732 markings, 52981962 edges, 252201 markings/sec, 140 secs
lola: 37374159 markings, 54750772 edges, 243085 markings/sec, 145 secs
lola: 38521166 markings, 56514670 edges, 229401 markings/sec, 150 secs
lola: 39715635 markings, 58303224 edges, 238894 markings/sec, 155 secs
lola: 40835700 markings, 60072291 edges, 224013 markings/sec, 160 secs
lola: 42095817 markings, 61895330 edges, 252023 markings/sec, 165 secs
lola: 43381101 markings, 63756510 edges, 257057 markings/sec, 170 secs
lola: 44617658 markings, 65563805 edges, 247311 markings/sec, 175 secs
lola: 45780261 markings, 67333149 edges, 232521 markings/sec, 180 secs
lola: 46927631 markings, 69050611 edges, 229474 markings/sec, 185 secs
lola: 48109785 markings, 70817961 edges, 236431 markings/sec, 190 secs
lola: 49268811 markings, 72633872 edges, 231805 markings/sec, 195 secs
lola: 50467213 markings, 74462042 edges, 239680 markings/sec, 200 secs
lola: 51678691 markings, 76230173 edges, 242296 markings/sec, 205 secs
lola: 52893082 markings, 77964214 edges, 242878 markings/sec, 210 secs
lola: 53982289 markings, 79596626 edges, 217841 markings/sec, 215 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 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p207))) OR (A (X ((2 <= p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171))) OR (p9 + 1 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))) AND E (F (((p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + 1 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p207)))
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 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + 1 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= 0))))
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 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: state equation: write sara problem file to PermAdmissibility-COL-10-CTLCardinality-3.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((p207 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205))) AND ((p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 <= 1) OR (p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (p207 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205))) OR ((2 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187) AND (1 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)))))
lola: processed formula length: 226
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 161 markings, 331 edges
lola: ========================================
lola: subprocess 4 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND (p53 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78) AND (p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= p44) AND (1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34))))
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 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-10-CTLCardinality-4.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 5 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p53 <= 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 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p18) OR ((p87 <= p197) AND (2 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52))) AND A (G ((p138 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p18) OR ((p87 <= p197) AND (2 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)))))
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 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-10-CTLCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((1 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187)))
lola: processed formula length: 75
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1346727 markings, 2228408 edges, 267235 markings/sec, 0 secs
lola: 2558170 markings, 4284102 edges, 242289 markings/sec, 5 secs
lola: 3681451 markings, 6363206 edges, 224656 markings/sec, 10 secs
lola: 4683744 markings, 8253610 edges, 200459 markings/sec, 15 secs
lola: 5778777 markings, 10220545 edges, 219007 markings/sec, 20 secs
lola: 6834820 markings, 12199482 edges, 211209 markings/sec, 25 secs
lola: 7825638 markings, 14193984 edges, 198164 markings/sec, 30 secs
lola: 8748465 markings, 16103815 edges, 184565 markings/sec, 35 secs
lola: 9831823 markings, 18046955 edges, 216672 markings/sec, 40 secs
lola: 10956611 markings, 20037341 edges, 224958 markings/sec, 45 secs
lola: 12019589 markings, 22068464 edges, 212596 markings/sec, 50 secs
lola: 12950943 markings, 23920681 edges, 186271 markings/sec, 55 secs
lola: 13842588 markings, 25786490 edges, 178329 markings/sec, 60 secs
lola: 14794539 markings, 27778206 edges, 190390 markings/sec, 65 secs
lola: 15729025 markings, 29746383 edges, 186897 markings/sec, 70 secs
lola: 16677507 markings, 31564062 edges, 189696 markings/sec, 75 secs
lola: 17550423 markings, 33324231 edges, 174583 markings/sec, 80 secs
lola: 18519737 markings, 35253321 edges, 193863 markings/sec, 85 secs
lola: 19531136 markings, 37175106 edges, 202280 markings/sec, 90 secs
lola: 20520238 markings, 39099068 edges, 197820 markings/sec, 95 secs
lola: 21434120 markings, 40966632 edges, 182776 markings/sec, 100 secs
lola: 22404134 markings, 42961139 edges, 194003 markings/sec, 105 secs
lola: 23287389 markings, 44794690 edges, 176651 markings/sec, 110 secs
lola: 24086277 markings, 46558477 edges, 159778 markings/sec, 115 secs
lola: 24955371 markings, 48423586 edges, 173819 markings/sec, 120 secs
lola: 25908579 markings, 50354802 edges, 190642 markings/sec, 125 secs
lola: 26947076 markings, 52335812 edges, 207699 markings/sec, 130 secs
lola: 27890084 markings, 54293965 edges, 188602 markings/sec, 135 secs
lola: 28916528 markings, 56294792 edges, 205289 markings/sec, 140 secs
lola: 29836516 markings, 58328736 edges, 183998 markings/sec, 145 secs
lola: 30771702 markings, 60288689 edges, 187037 markings/sec, 150 secs
lola: 31740532 markings, 62345186 edges, 193766 markings/sec, 155 secs
lola: 32589658 markings, 64261713 edges, 169825 markings/sec, 160 secs
lola: 33733932 markings, 66283862 edges, 228855 markings/sec, 165 secs
lola: 34781045 markings, 68272142 edges, 209423 markings/sec, 170 secs
lola: 35782119 markings, 70144295 edges, 200215 markings/sec, 175 secs
lola: 36732893 markings, 72137450 edges, 190155 markings/sec, 180 secs
lola: 37703146 markings, 74030091 edges, 194051 markings/sec, 185 secs
lola: 38721234 markings, 75993601 edges, 203618 markings/sec, 190 secs
lola: 39576122 markings, 77830505 edges, 170978 markings/sec, 195 secs
lola: 40455868 markings, 79775675 edges, 175949 markings/sec, 200 secs
lola: 41330074 markings, 81574945 edges, 174841 markings/sec, 205 secs
lola: 42203023 markings, 83412488 edges, 174590 markings/sec, 210 secs
lola: 43091402 markings, 85271104 edges, 177676 markings/sec, 215 secs
lola: 43913470 markings, 87133272 edges, 164414 markings/sec, 220 secs
lola: 44756232 markings, 88996180 edges, 168552 markings/sec, 225 secs
lola: 45696592 markings, 90895340 edges, 188072 markings/sec, 230 secs
lola: 46557103 markings, 92750247 edges, 172102 markings/sec, 235 secs
lola: 47353888 markings, 94553342 edges, 159357 markings/sec, 240 secs
lola: 48137445 markings, 96379500 edges, 156711 markings/sec, 245 secs
lola: 49079033 markings, 98267628 edges, 188318 markings/sec, 250 secs
lola: 50002362 markings, 100226887 edges, 184666 markings/sec, 255 secs
lola: 50839280 markings, 102214397 edges, 167384 markings/sec, 260 secs
lola: 51761597 markings, 104094246 edges, 184463 markings/sec, 265 secs
lola: 52532447 markings, 105869348 edges, 154170 markings/sec, 270 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + 1 <= p197))) AND A (F ((1 <= p35))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + 1 <= p197)))
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 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to PermAdmissibility-COL-10-CTLCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(E (F ((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p96))))) AND NOT(A (F ((2 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p96)))
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 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state equation: calling and running sara
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: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 468 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61)))
lola: processed formula length: 67
lola: 11 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file PermAdmissibility-COL-10-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: 1468238 markings, 2267540 edges, 293622 markings/sec, 0 secs
lola: 2758303 markings, 4441843 edges, 258013 markings/sec, 5 secs
lola: 4050203 markings, 6641026 edges, 258380 markings/sec, 10 secs
lola: 5319598 markings, 8776430 edges, 253879 markings/sec, 15 secs
lola: 6566168 markings, 10951085 edges, 249314 markings/sec, 20 secs
lola: 7761183 markings, 13035718 edges, 239003 markings/sec, 25 secs
lola: 8896511 markings, 15028343 edges, 227066 markings/sec, 30 secs
lola: 10114041 markings, 16954969 edges, 243506 markings/sec, 35 secs
lola: 11333893 markings, 18960040 edges, 243970 markings/sec, 40 secs
lola: 12553014 markings, 21077573 edges, 243824 markings/sec, 45 secs
lola: 13723953 markings, 23206887 edges, 234188 markings/sec, 50 secs
lola: 14871381 markings, 25126132 edges, 229486 markings/sec, 55 secs
lola: 16028605 markings, 27136841 edges, 231445 markings/sec, 60 secs
lola: 17195738 markings, 29306699 edges, 233427 markings/sec, 65 secs
lola: 18432282 markings, 31518480 edges, 247309 markings/sec, 70 secs
lola: 19748209 markings, 33797410 edges, 263185 markings/sec, 75 secs
lola: 20961451 markings, 35893439 edges, 242648 markings/sec, 80 secs
lola: 22174054 markings, 38141039 edges, 242521 markings/sec, 85 secs
lola: 23261589 markings, 40299217 edges, 217507 markings/sec, 90 secs
lola: 24324254 markings, 42375705 edges, 212533 markings/sec, 95 secs
lola: 25383859 markings, 44411977 edges, 211921 markings/sec, 100 secs
lola: 26443479 markings, 46391158 edges, 211924 markings/sec, 105 secs
lola: 27484915 markings, 48355528 edges, 208287 markings/sec, 110 secs
lola: 28465763 markings, 50147560 edges, 196170 markings/sec, 115 secs
lola: 29415696 markings, 52009177 edges, 189987 markings/sec, 120 secs
lola: 30336311 markings, 53723095 edges, 184123 markings/sec, 125 secs
lola: 31206926 markings, 55444141 edges, 174123 markings/sec, 130 secs
lola: 32079546 markings, 57185145 edges, 174524 markings/sec, 135 secs
lola: 33159441 markings, 59000239 edges, 215979 markings/sec, 140 secs
lola: 34258633 markings, 60829769 edges, 219838 markings/sec, 145 secs
lola: 35329512 markings, 62673642 edges, 214176 markings/sec, 150 secs
lola: 36302896 markings, 64477651 edges, 194677 markings/sec, 155 secs
lola: 37455839 markings, 66399208 edges, 230589 markings/sec, 160 secs
lola: 38531222 markings, 68377347 edges, 215077 markings/sec, 165 secs
lola: 39504716 markings, 70201395 edges, 194699 markings/sec, 170 secs
lola: 40472323 markings, 72164956 edges, 193521 markings/sec, 175 secs
lola: 41457101 markings, 74074042 edges, 196956 markings/sec, 180 secs
lola: 42531642 markings, 75905034 edges, 214908 markings/sec, 185 secs
lola: 43489486 markings, 77673185 edges, 191569 markings/sec, 190 secs
lola: 44467229 markings, 79478218 edges, 195549 markings/sec, 195 secs
lola: 45528007 markings, 81404792 edges, 212156 markings/sec, 200 secs
lola: 46543308 markings, 83331625 edges, 203060 markings/sec, 205 secs
lola: 47446716 markings, 85119777 edges, 180682 markings/sec, 210 secs
lola: 48285603 markings, 86901030 edges, 167777 markings/sec, 215 secs
lola: 49327760 markings, 88930682 edges, 208431 markings/sec, 220 secs
lola: 50526434 markings, 90969232 edges, 239735 markings/sec, 225 secs
lola: 51714271 markings, 93052324 edges, 237567 markings/sec, 230 secs
lola: 52753005 markings, 95071460 edges, 207747 markings/sec, 235 secs
lola: 53755811 markings, 97011208 edges, 200561 markings/sec, 240 secs
lola: 54652503 markings, 98717600 edges, 179338 markings/sec, 245 secs
lola: 55563602 markings, 100505023 edges, 182220 markings/sec, 250 secs
lola: 56411602 markings, 102289952 edges, 169600 markings/sec, 255 secs
lola: 57176684 markings, 104057457 edges, 153016 markings/sec, 260 secs
lola: 57916788 markings, 105822161 edges, 148021 markings/sec, 265 secs
lola: 58825909 markings, 107606829 edges, 181824 markings/sec, 270 secs
lola: 59776004 markings, 109432676 edges, 190019 markings/sec, 275 secs
lola: 60250915 markings, 110409370 edges, 94982 markings/sec, 280 secs
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: subprocess 10 will run for 419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + 1 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61)))
lola: processed formula length: 123
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1489974 markings, 2303641 edges, 3225752436249460736 markings/sec, 0 secs
lola: 2870856 markings, 4618333 edges, 276176 markings/sec, 5 secs
lola: 4186997 markings, 6886559 edges, 263228 markings/sec, 10 secs
lola: 5516634 markings, 9128502 edges, 265927 markings/sec, 15 secs
lola: 6745915 markings, 11264392 edges, 245856 markings/sec, 20 secs
lola: 7904801 markings, 13295461 edges, 231777 markings/sec, 25 secs
lola: 9042063 markings, 15247841 edges, 227452 markings/sec, 30 secs
lola: 10274395 markings, 17227452 edges, 246466 markings/sec, 35 secs
lola: 11472086 markings, 19196319 edges, 239538 markings/sec, 40 secs
lola: 12631740 markings, 21217857 edges, 231931 markings/sec, 45 secs
lola: 13799611 markings, 23322884 edges, 233574 markings/sec, 50 secs
lola: 14935042 markings, 25235479 edges, 227086 markings/sec, 55 secs
lola: 16051400 markings, 27178560 edges, 223272 markings/sec, 60 secs
lola: 17155564 markings, 29218763 edges, 220833 markings/sec, 65 secs
lola: 18282176 markings, 31271774 edges, 225322 markings/sec, 70 secs
lola: 19526500 markings, 33406508 edges, 248865 markings/sec, 75 secs
lola: 20739769 markings, 35504204 edges, 242654 markings/sec, 80 secs
lola: 21936588 markings, 37670351 edges, 239364 markings/sec, 85 secs
lola: 22966140 markings, 39700110 edges, 205910 markings/sec, 90 secs
lola: 23945084 markings, 41665984 edges, 195789 markings/sec, 95 secs
lola: 24980332 markings, 43622975 edges, 207050 markings/sec, 100 secs
lola: 25989260 markings, 45593662 edges, 201786 markings/sec, 105 secs
lola: 26984921 markings, 47401287 edges, 199132 markings/sec, 110 secs
lola: 27973426 markings, 49238418 edges, 197701 markings/sec, 115 secs
lola: 28940224 markings, 51101367 edges, 193360 markings/sec, 120 secs
lola: 29918160 markings, 52942346 edges, 195587 markings/sec, 125 secs
lola: 30794238 markings, 54647427 edges, 175216 markings/sec, 130 secs
lola: 31712573 markings, 56443297 edges, 183667 markings/sec, 135 secs
lola: 32698522 markings, 58266495 edges, 197190 markings/sec, 140 secs
lola: 33783471 markings, 60068662 edges, 216990 markings/sec, 145 secs
lola: 34901207 markings, 61878729 edges, 223547 markings/sec, 150 secs
lola: 35863429 markings, 63627479 edges, 192444 markings/sec, 155 secs
lola: 36904349 markings, 65459190 edges, 208184 markings/sec, 160 secs
lola: 38011930 markings, 67374196 edges, 221516 markings/sec, 165 secs
lola: 39029276 markings, 69288307 edges, 203469 markings/sec, 170 secs
lola: 39980653 markings, 71112656 edges, 190275 markings/sec, 175 secs
lola: 40854414 markings, 73048828 edges, 174752 markings/sec, 180 secs
lola: 41938712 markings, 74848100 edges, 216860 markings/sec, 185 secs
lola: 42909538 markings, 76571151 edges, 194165 markings/sec, 190 secs
lola: 43851360 markings, 78301439 edges, 188364 markings/sec, 195 secs
lola: 44768667 markings, 80059257 edges, 183461 markings/sec, 200 secs
lola: 45777635 markings, 81849591 edges, 201794 markings/sec, 205 secs
lola: 46729950 markings, 83708586 edges, 190463 markings/sec, 210 secs
lola: 47615526 markings, 85457607 edges, 177115 markings/sec, 215 secs
lola: 48444208 markings, 87273517 edges, 165736 markings/sec, 220 secs
lola: 49529750 markings, 89262781 edges, 217108 markings/sec, 225 secs
lola: 50678689 markings, 91232817 edges, 229788 markings/sec, 230 secs
lola: 51889686 markings, 93383328 edges, 242199 markings/sec, 235 secs
lola: 52920237 markings, 95414728 edges, 206110 markings/sec, 240 secs
lola: 53904030 markings, 97285303 edges, 196759 markings/sec, 245 secs
lola: 54812239 markings, 99044399 edges, 181642 markings/sec, 250 secs
lola: 55732364 markings, 100843511 edges, 184025 markings/sec, 255 secs
lola: 56554459 markings, 102634911 edges, 164419 markings/sec, 260 secs
lola: 57305299 markings, 104365542 edges, 150168 markings/sec, 265 secs
lola: 58057983 markings, 106124303 edges, 150537 markings/sec, 270 secs
lola: 59005566 markings, 107942014 edges, 189517 markings/sec, 275 secs
lola: 59957859 markings, 109771041 edges, 190459 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 446 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((3 <= p9))) AND ((p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= p44) OR (1 <= p53) OR (3 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128) OR (p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(A(TRUE U (p9 <= 2))) AND ((p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= p44) OR (1 <= p53) OR (3 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128) OR (p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61))))
lola: processed formula length: 294
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 161 markings, 321 edges
lola: subprocess 12 will run for 557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p206 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 44 markings, 43 edges
lola: ========================================
lola: subprocess 13 will run for 743 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154) OR (p207 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112))))))
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 ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= 0) AND (p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + 1 <= p207)))))
lola: processed formula length: 159
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 161 markings, 467 edges
lola: ========================================
lola: subprocess 14 will run for 1115 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (F ((3 <= p62))) AND (p163 <= 2)) OR ((p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99 + 1 <= p87) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))) OR NOT(((p137 <= 0) AND E (F ((2 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1115 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p62)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p62)))
lola: processed formula: A (F ((3 <= p62)))
lola: processed formula length: 18
lola: 6 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 218 markings, 218 edges
lola: ========================================
lola: subprocess 15 will run for 2230 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99 + 1 <= p87) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99 + 1 <= p87) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))
lola: processed formula length: 114
lola: 6 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= 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 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2230 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154) AND E (F ((2 <= p138)))) OR E (G ((1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2230 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + 1 <= p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + 1 <= p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195)
lola: processed formula length: 116
lola: 9 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p8 <= 0)))
lola: processed formula: A (F ((p8 <= 0)))
lola: processed formula length: 17
lola: 9 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown unknown yes yes no no no unknown no unknown unknown no no yes unknown unknown
FORMULA PermAdmissibility-COL-10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- 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="PermAdmissibility-COL-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
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/PermAdmissibility-COL-10.tgz
mv PermAdmissibility-COL-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is PermAdmissibility-COL-10, 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 r114-csrt-152666472700451"
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 ;