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 220K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PermAdmissibility-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r259-csrt-152732584700125
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527462844592


BK_STOP 1527463214243

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PermAdmissibility-COL-02 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 728600, 'Memory': 15925.49, 'Tool': 'lola'}, {'Time': 766351, 'Memory': 15930.29, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PermAdmissibility-COL-02...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-02: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-02: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PermAdmissibility-COL-02 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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-02-LTLCardinality.task
lola: A (G (X (X ((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16))))) : A (F (G (((1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) U (1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134))))) : A ((F (F ((2 <= p69))) U G ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198)))) : A ((p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177)) : A ((G (G ((p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= p161))) U G (F ((2 <= p199))))) : A (X (F ((2 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)))) : A (((2 <= p70) U X ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110)))) : A ((X (G ((1 <= p68))) U F (X ((1 <= p67))))) : A (F (G (F (X ((2 <= p190)))))) : A (F (X (((p144 <= p70) U (p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p70))))) : A ((2 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198)) : A (G (X (G ((3 <= p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94))))) : A ((p66 <= p179)) : A ((X (F ((p66 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177))) U (p179 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126))) : A ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p66)) : A (G (F (X (F ((3 <= p161))))))
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 (X (X ((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (X ((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)))))
lola: processed formula: A (G (X (X ((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)))))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) U (1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) U (1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134)))))
lola: processed formula: A (F (G (((1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) U (1 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134)))))
lola: processed formula length: 137
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 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: 34 markings, 35 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= p69))) U G ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= p69)) U G ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198))))
lola: processed formula: A ((F ((2 <= p69)) U G ((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198))))
lola: processed formula length: 139
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177)
lola: processed formula length: 104
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= p161))) U G (F ((2 <= p199)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= p161))) U G (F ((2 <= p199)))))
lola: processed formula: A ((G (G ((p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 <= p161))) U G (F ((2 <= p199)))))
lola: processed formula length: 91
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((2 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16))))
lola: processed formula: A (X (F ((2 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1110255 markings, 1470488 edges, 222051 markings/sec, 0 secs
lola: 2230473 markings, 2957086 edges, 224044 markings/sec, 5 secs
lola: 3333673 markings, 4410094 edges, 220640 markings/sec, 10 secs
lola: 4366748 markings, 5780835 edges, 206615 markings/sec, 15 secs
lola: 5413230 markings, 7150314 edges, 209296 markings/sec, 20 secs
lola: 6493531 markings, 8561447 edges, 216060 markings/sec, 25 secs
lola: 7586818 markings, 10007623 edges, 218657 markings/sec, 30 secs
lola: 8638343 markings, 11432185 edges, 210305 markings/sec, 35 secs
lola: 9620537 markings, 12765417 edges, 196439 markings/sec, 40 secs
lola: 10570877 markings, 14046930 edges, 190068 markings/sec, 45 secs
lola: 11499447 markings, 15455036 edges, 185714 markings/sec, 50 secs
lola: 12558896 markings, 16860410 edges, 211890 markings/sec, 55 secs
lola: 13523554 markings, 18147900 edges, 192932 markings/sec, 60 secs
lola: 14478857 markings, 19409710 edges, 191061 markings/sec, 65 secs
lola: 15394476 markings, 20694585 edges, 183124 markings/sec, 70 secs
lola: 16385476 markings, 22062357 edges, 198200 markings/sec, 75 secs
lola: 17388316 markings, 23540732 edges, 200568 markings/sec, 80 secs
lola: 18400742 markings, 24910343 edges, 202485 markings/sec, 85 secs
lola: 19383574 markings, 26253898 edges, 196566 markings/sec, 90 secs
lola: 20353460 markings, 27558849 edges, 193977 markings/sec, 95 secs
lola: 21311588 markings, 28868021 edges, 191626 markings/sec, 100 secs
lola: 22266759 markings, 30244193 edges, 191034 markings/sec, 105 secs
lola: 23255757 markings, 31603507 edges, 197800 markings/sec, 110 secs
lola: 24196353 markings, 32906116 edges, 188119 markings/sec, 115 secs
lola: 25134396 markings, 34335401 edges, 187609 markings/sec, 120 secs
lola: 26128546 markings, 35787233 edges, 198830 markings/sec, 125 secs
lola: 27150543 markings, 37179260 edges, 204399 markings/sec, 130 secs
lola: 28130850 markings, 38515106 edges, 196061 markings/sec, 135 secs
lola: 29128927 markings, 39835884 edges, 199615 markings/sec, 140 secs
lola: 30115671 markings, 41174801 edges, 197349 markings/sec, 145 secs
lola: 31063732 markings, 42541204 edges, 189612 markings/sec, 150 secs
lola: 32027301 markings, 43878541 edges, 192714 markings/sec, 155 secs
lola: 32985431 markings, 45185286 edges, 191626 markings/sec, 160 secs
lola: 33938153 markings, 46577125 edges, 190544 markings/sec, 165 secs
lola: 34863811 markings, 47846773 edges, 185132 markings/sec, 170 secs
lola: 35761567 markings, 49055006 edges, 179551 markings/sec, 175 secs
lola: 36663764 markings, 50364667 edges, 180439 markings/sec, 180 secs
lola: 37546196 markings, 51594585 edges, 176486 markings/sec, 185 secs
lola: 38413405 markings, 52772905 edges, 173442 markings/sec, 190 secs
lola: 39294106 markings, 54055012 edges, 176140 markings/sec, 195 secs
lola: 40119559 markings, 55210099 edges, 165091 markings/sec, 200 secs
lola: 40917949 markings, 56312503 edges, 159678 markings/sec, 205 secs
lola: 41709203 markings, 57481779 edges, 158251 markings/sec, 210 secs
lola: 42683323 markings, 58902492 edges, 194824 markings/sec, 215 secs
lola: 43662092 markings, 60249748 edges, 195754 markings/sec, 220 secs
lola: 44638180 markings, 61558665 edges, 195218 markings/sec, 225 secs
lola: 45554785 markings, 62801047 edges, 183321 markings/sec, 230 secs
lola: 46442209 markings, 64019463 edges, 177485 markings/sec, 235 secs
lola: 47321297 markings, 65227018 edges, 175818 markings/sec, 240 secs
lola: 48248055 markings, 66450527 edges, 185352 markings/sec, 245 secs
lola: 49138046 markings, 67642059 edges, 177998 markings/sec, 250 secs
lola: 50003479 markings, 68818159 edges, 173087 markings/sec, 255 secs
lola: 50836874 markings, 69987571 edges, 166679 markings/sec, 260 secs
lola: 51679502 markings, 71120534 edges, 168526 markings/sec, 265 secs
lola: 52493429 markings, 72430949 edges, 162785 markings/sec, 270 secs
lola: 53308004 markings, 73587439 edges, 162915 markings/sec, 275 secs
lola: 54196381 markings, 74803446 edges, 177675 markings/sec, 280 secs
lola: 55007440 markings, 75942298 edges, 162212 markings/sec, 285 secs
lola: 55791449 markings, 77043657 edges, 156802 markings/sec, 290 secs
lola: 56208860 markings, 77598155 edges, 83482 markings/sec, 295 secs
lola: 56211039 markings, 77600969 edges, 436 markings/sec, 300 secs
lola: 56213458 markings, 77604162 edges, 484 markings/sec, 305 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p70) U X ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p70) U X ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110))))
lola: processed formula: A (((2 <= p70) U X ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110))))
lola: processed formula length: 135
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((1 <= p68))) U F (X ((1 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((1 <= p68))) U F (X ((1 <= p67)))))
lola: processed formula: A ((X (G ((1 <= p68))) U F (X ((1 <= p67)))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 27041 markings, 37280 edges
lola: ========================================
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (X ((2 <= p190))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X ((2 <= p190)))))
lola: processed formula: A (G (F (X ((2 <= p190)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((p144 <= p70) U (p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p70)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((p144 <= p70) U (p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p70)))))
lola: processed formula: A (F (X (((p144 <= p70) U (p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p70)))))
lola: processed formula length: 84
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198)
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.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 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G ((3 <= p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G ((3 <= p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94)))))
lola: processed formula: A (G (X (G ((3 <= p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94)))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 12 will run for 803 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p66 <= p179))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p66 <= p179)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1071 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p66 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177))) U (p179 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (F ((p66 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177))) U (p179 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126)))
lola: processed formula: A ((X (F ((p66 <= p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177))) U (p179 <= p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126)))
lola: processed formula length: 142
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: subprocess 14 will run for 1607 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p66))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p66)
lola: processed formula length: 54
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.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 15 will run for 3214 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (F ((3 <= p161))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X (F ((3 <= p161))))))
lola: processed formula: A (G (F (X (F ((3 <= p161))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 33 markings, 33 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no unknown yes yes no yes no no yes yes no no
FORMULA PermAdmissibility-COL-02-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-structural"
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-02.tgz
mv PermAdmissibility-COL-02 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-structural"
echo " Input is PermAdmissibility-COL-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r259-csrt-152732584700125"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;