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 212K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.2K 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 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 mcc4mcc-full
Input is PermAdmissibility-COL-50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478500465
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527295642812


BK_STOP 1527296550099

--------------------
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-50 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': 1722293, 'Memory': 15950.7, 'Tool': 'lola'}, {'Time': 2107935, 'Memory': 15950.71, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-COL-50...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-50: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-50: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-COL-50 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- 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-50-CTLCardinality.task
lola: (((p89 + p88 + p87 + p90 + p91 + p92 + p93 + p94 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172) AND E (G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + 1 <= p181)))) OR E (F (((2 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172) AND (2 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75) AND (3 <= p50))))) : (E (((p113 <= 1) U (p132 + 1 <= p76))) AND E (F (E (F ((p86 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))))) : E (((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= 1) U (p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))) : (NOT(A (F (((p95 <= p77) AND (p198 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))))) OR E (F (A (X ((1 <= p131)))))) : A (F ((A (F ((1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))) AND ((p8 <= 1) AND (p181 <= 2))))) : (E (((p181 <= p113) U ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) AND (3 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))) AND A ((((3 <= p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (1 <= p132)) U ((3 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) OR (3 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16))))) : (NOT((E (G ((p8 <= p132))) AND (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75))) OR NOT(((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85) OR A (G ((1 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59)))))) : A (F (A (G ((p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + 1 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))))) : NOT(A (F ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + 1 <= p132)))) : NOT(A (F ((((2 <= p50) OR (p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112)) AND ((p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 <= p86) OR (2 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))))) : A (F (A (((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p51) U (2 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))) : A (X (A (F (((3 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85) AND (p25 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))))) : A ((((2 <= p131) OR ((p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) AND (p77 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164))) U E (F ((2 <= p25))))) : E (G (A (F (((1 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) OR (p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)))))) : E ((((p50 <= p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (3 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) AND (p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p51)) U A (G ((1 <= p86))))) : E (G (E (G ((p181 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p89 + p88 + p87 + p90 + p91 + p92 + p93 + p94 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172) AND E (G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + 1 <= p181)))) OR E (F (((2 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172) AND (2 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75) AND (3 <= p50)))))
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: (p89 + p88 + p87 + p90 + p91 + p92 + p93 + p94 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p89 + p88 + p87 + p90 + p91 + p92 + p93 + p94 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172)
lola: processed formula length: 104
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + 1 <= p181)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p181 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))
lola: processed formula length: 70
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172) AND (2 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75) AND (3 <= p50))))
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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p113 <= 1) U (p132 + 1 <= p76))) AND E (F (E (F ((p86 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p113 <= 1) U (p132 + 1 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p113 <= 1) U (p132 + 1 <= p76))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p86 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))
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: state equation: write sara problem file to PermAdmissibility-COL-50-CTLCardinality-2.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= 1) U (p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= 1) U (p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))
lola: processed formula length: 158
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: 1404120 markings, 1520896 edges, 3225752436249460736 markings/sec, 0 secs
lola: 2721077 markings, 2990765 edges, 263391 markings/sec, 5 secs
lola: 4025689 markings, 4424765 edges, 260922 markings/sec, 10 secs
lola: 5244332 markings, 5813301 edges, 243729 markings/sec, 15 secs
lola: 6532568 markings, 7253642 edges, 257647 markings/sec, 20 secs
lola: 7825410 markings, 8698143 edges, 258568 markings/sec, 25 secs
lola: 9101193 markings, 10168963 edges, 255157 markings/sec, 30 secs
lola: 10322920 markings, 11602397 edges, 244345 markings/sec, 35 secs
lola: 11496851 markings, 12977291 edges, 234786 markings/sec, 40 secs
lola: 12595532 markings, 14269307 edges, 219736 markings/sec, 45 secs
lola: 13912916 markings, 15751445 edges, 263477 markings/sec, 50 secs
lola: 15257831 markings, 17279654 edges, 268983 markings/sec, 55 secs
lola: 16553885 markings, 18736857 edges, 259211 markings/sec, 60 secs
lola: 17798969 markings, 20144233 edges, 249017 markings/sec, 65 secs
lola: 19007885 markings, 21486843 edges, 241783 markings/sec, 70 secs
lola: 20159155 markings, 22794828 edges, 230254 markings/sec, 75 secs
lola: 21361721 markings, 24160195 edges, 240513 markings/sec, 80 secs
lola: 22551082 markings, 25488702 edges, 237872 markings/sec, 85 secs
lola: 23704758 markings, 26779522 edges, 230735 markings/sec, 90 secs
lola: 24869193 markings, 28095341 edges, 232887 markings/sec, 95 secs
lola: 25993969 markings, 29384799 edges, 224955 markings/sec, 100 secs
lola: 27188609 markings, 30732794 edges, 238928 markings/sec, 105 secs
lola: 28372898 markings, 32039336 edges, 236858 markings/sec, 110 secs
lola: 29546487 markings, 33351826 edges, 234718 markings/sec, 115 secs
lola: 30721190 markings, 34683268 edges, 234941 markings/sec, 120 secs
lola: 31836294 markings, 35940262 edges, 223021 markings/sec, 125 secs
lola: 32996162 markings, 37253735 edges, 231974 markings/sec, 130 secs
lola: 34095462 markings, 38474189 edges, 219860 markings/sec, 135 secs
lola: 35271379 markings, 39793127 edges, 235183 markings/sec, 140 secs
lola: 36487221 markings, 41173446 edges, 243168 markings/sec, 145 secs
lola: 37691265 markings, 42505255 edges, 240809 markings/sec, 150 secs
lola: 38839450 markings, 43808402 edges, 229637 markings/sec, 155 secs
lola: 39963429 markings, 45048348 edges, 224796 markings/sec, 160 secs
lola: 41058463 markings, 46268817 edges, 219007 markings/sec, 165 secs
lola: 42200036 markings, 47548922 edges, 228315 markings/sec, 170 secs
lola: 43277310 markings, 48741756 edges, 215455 markings/sec, 175 secs
lola: 44387480 markings, 49973908 edges, 222034 markings/sec, 180 secs
lola: 45554783 markings, 51306917 edges, 233461 markings/sec, 185 secs
lola: 46632302 markings, 52516347 edges, 215504 markings/sec, 190 secs
lola: 47380073 markings, 53371435 edges, 149554 markings/sec, 195 secs
lola: 47383255 markings, 53375033 edges, 636 markings/sec, 200 secs
lola: 47385954 markings, 53378063 edges, 540 markings/sec, 205 secs
lola: 47387031 markings, 53379277 edges, 215 markings/sec, 210 secs
lola: 47387082 markings, 53379338 edges, 10 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (((p95 <= p77) AND (p198 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))))) OR E (F (A (X ((1 <= p131))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p77 + 1 <= p95) OR (p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + 1 <= p198))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p95 <= p77) AND (p198 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))))
lola: processed formula length: 89
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= p131)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((1 <= p131)))
lola: processed formula length: 25
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 801 markings, 800 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))) AND ((p8 <= 1) AND (p181 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: lola: checking CTL
========================================
lola: ========================================
lola: processed formula: A(TRUE U (A(TRUE U (1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)) AND ((p8 <= 1) AND (p181 <= 2))))
lola: processed formula length: 106
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: 1349207 markings, 2200962 edges, 3225752436249460736 markings/sec, 0 secs
lola: 2640519 markings, 4353850 edges, 258262 markings/sec, 5 secs
lola: 3919320 markings, 6496718 edges, 255760 markings/sec, 10 secs
lola: 5187809 markings, 8626176 edges, 253698 markings/sec, 15 secs
lola: 6442862 markings, 10734923 edges, 251011 markings/sec, 20 secs
lola: 7695395 markings, 12844231 edges, 250507 markings/sec, 25 secs
lola: 8929000 markings, 14939008 edges, 246721 markings/sec, 30 secs
lola: 10196831 markings, 17085183 edges, 253566 markings/sec, 35 secs
lola: 11427097 markings, 19159487 edges, 246053 markings/sec, 40 secs
lola: 12654068 markings, 21258254 edges, 245394 markings/sec, 45 secs
lola: 13848353 markings, 23271512 edges, 238857 markings/sec, 50 secs
lola: 15032482 markings, 25302557 edges, 236826 markings/sec, 55 secs
lola: 16248733 markings, 27356982 edges, 243250 markings/sec, 60 secs
lola: 17468922 markings, 29454528 edges, 244038 markings/sec, 65 secs
lola: 18705655 markings, 31544764 edges, 247347 markings/sec, 70 secs
lola: 19975700 markings, 33732446 edges, 254009 markings/sec, 75 secs
lola: 21191578 markings, 35796112 edges, 243176 markings/sec, 80 secs
lola: 22424419 markings, 37906882 edges, 246568 markings/sec, 85 secs
lola: 23592194 markings, 39916552 edges, 233555 markings/sec, 90 secs
lola: 24853695 markings, 42055871 edges, 252300 markings/sec, 95 secs
lola: 26095335 markings, 44200463 edges, 248328 markings/sec, 100 secs
lola: 27272136 markings, 46224511 edges, 235360 markings/sec, 105 secs
lola: 28524275 markings, 48348570 edges, 250428 markings/sec, 110 secs
lola: 29783041 markings, 50529795 edges, 251753 markings/sec, 115 secs
lola: 30964808 markings, 52562800 edges, 236353 markings/sec, 120 secs
lola: 32253182 markings, 54751311 edges, 257675 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p181 <= p113) U ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) AND (3 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))) AND A ((((3 <= p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) AND (1 <= p132)) U ((3 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) OR (3 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p181 <= p113) U ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) AND (3 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p181 <= p113) U ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) AND (3 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))
lola: processed formula length: 191
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: 1389911 markings, 1992442 edges, 3225752436249460736 markings/sec, 0 secs
lola: 2719000 markings, 3929631 edges, 265818 markings/sec, 5 secs
lola: 4018916 markings, 5818169 edges, 259983 markings/sec, 10 secs
lola: 5278692 markings, 7654520 edges, 251955 markings/sec, 15 secs
lola: 6562096 markings, 9529168 edges, 256681 markings/sec, 20 secs
lola: 7712676 markings, 11188766 edges, 230116 markings/sec, 25 secs
lola: 8896666 markings, 12918634 edges, 236798 markings/sec, 30 secs
lola: 10031199 markings, 14574074 edges, 226907 markings/sec, 35 secs
lola: 11210340 markings, 16296679 edges, 235828 markings/sec, 40 secs
lola: 12360906 markings, 17945471 edges, 230113 markings/sec, 45 secs
lola: 13531060 markings, 19666475 edges, 234031 markings/sec, 50 secs
lola: 14692076 markings, 21366951 edges, 232203 markings/sec, 55 secs
lola: 15883295 markings, 23104945 edges, 238244 markings/sec, 60 secs
lola: 17047952 markings, 24783416 edges, 232931 markings/sec, 65 secs
lola: 18242011 markings, 26533351 edges, 238812 markings/sec, 70 secs
lola: 19413947 markings, 28243144 edges, 234387 markings/sec, 75 secs
lola: 20605971 markings, 29995399 edges, 238405 markings/sec, 80 secs
lola: 21753771 markings, 31648142 edges, 229560 markings/sec, 85 secs
lola: 22870427 markings, 33266714 edges, 223331 markings/sec, 90 secs
lola: 23966197 markings, 34870301 edges, 219154 markings/sec, 95 secs
lola: 25104996 markings, 36524829 edges, 227760 markings/sec, 100 secs
lola: 26278545 markings, 38224512 edges, 234710 markings/sec, 105 secs
lola: 27423298 markings, 39880463 edges, 228951 markings/sec, 110 secs
lola: 28568362 markings, 41562884 edges, 229013 markings/sec, 115 secs
lola: 29778549 markings, 43331060 edges, 242037 markings/sec, 120 secs
lola: 30963785 markings, 45051020 edges, 237047 markings/sec, 125 secs
lola: 32166106 markings, 46806678 edges, 240464 markings/sec, 130 secs
lola: 33340378 markings, 48525343 edges, 234854 markings/sec, 135 secs
lola: 34521186 markings, 50245355 edges, 236162 markings/sec, 140 secs
lola: 35686650 markings, 51955942 edges, 233093 markings/sec, 145 secs
lola: 36770443 markings, 53507431 edges, 216759 markings/sec, 150 secs
lola: 37855410 markings, 55094921 edges, 216993 markings/sec, 155 secs
lola: 39004716 markings, 56771306 edges, 229861 markings/sec, 160 secs
lola: 40171113 markings, 58488354 edges, 233279 markings/sec, 165 secs
lola: 41227442 markings, 59990293 edges, 211266 markings/sec, 170 secs
lola: 42308071 markings, 61571851 edges, 216126 markings/sec, 175 secs
lola: 43414340 markings, 63207085 edges, 221254 markings/sec, 180 secs
lola: 44554321 markings, 64857867 edges, 227996 markings/sec, 185 secs
lola: 45690276 markings, 66496474 edges, 227191 markings/sec, 190 secs
lola: 46852033 markings, 68200561 edges, 232351 markings/sec, 195 secs
lola: 47115502 markings, 68587633 edges, 52694 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (G ((p8 <= p132))) AND (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75))) OR NOT(((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85) OR A (G ((1 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p132 + 1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p132 + 1 <= p8)))
lola: processed formula: A (F ((p132 + 1 <= p8)))
lola: processed formula length: 24
lola: 11 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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: 37853 markings, 93865 edges, 7571 markings/sec, 0 secs
lola: 75742 markings, 196396 edges, 7578 markings/sec, 5 secs
lola: 111241 markings, 302870 edges, 7100 markings/sec, 10 secs
lola: 147054 markings, 408598 edges, 7163 markings/sec, 15 secs
lola: 183779 markings, 517667 edges, 7345 markings/sec, 20 secs
lola: 221398 markings, 625730 edges, 7524 markings/sec, 25 secs
lola: 259630 markings, 732316 edges, 7646 markings/sec, 30 secs
lola: 294980 markings, 852982 edges, 7070 markings/sec, 35 secs
lola: 332937 markings, 960668 edges, 7591 markings/sec, 40 secs
lola: 368545 markings, 1075573 edges, 7122 markings/sec, 45 secs
lola: 402015 markings, 1196700 edges, 6694 markings/sec, 50 secs
lola: 435824 markings, 1310628 edges, 6762 markings/sec, 55 secs
lola: 470635 markings, 1415668 edges, 6962 markings/sec, 60 secs
lola: 501884 markings, 1527375 edges, 6250 markings/sec, 65 secs
lola: 532677 markings, 1633894 edges, 6159 markings/sec, 70 secs
lola: 563136 markings, 1740315 edges, 6092 markings/sec, 75 secs
lola: 594771 markings, 1846863 edges, 6327 markings/sec, 80 secs
lola: 630373 markings, 1941616 edges, 7120 markings/sec, 85 secs
lola: 664244 markings, 2046641 edges, 6774 markings/sec, 90 secs
lola: 696619 markings, 2152603 edges, 6475 markings/sec, 95 secs
lola: 730772 markings, 2250620 edges, 6831 markings/sec, 100 secs
lola: 762262 markings, 2359819 edges, 6298 markings/sec, 105 secs
lola: 793284 markings, 2466890 edges, 6204 markings/sec, 110 secs
lola: 823548 markings, 2570067 edges, 6053 markings/sec, 115 secs
lola: 856166 markings, 2670266 edges, 6524 markings/sec, 120 secs
lola: 887508 markings, 2779791 edges, 6268 markings/sec, 125 secs
lola: 917876 markings, 2885286 edges, 6074 markings/sec, 130 secs
lola: 948555 markings, 2991904 edges, 6136 markings/sec, 135 secs
lola: 979874 markings, 3101139 edges, 6264 markings/sec, 140 secs
lola: 1009241 markings, 3213306 edges, 5873 markings/sec, 145 secs
lola: 1040419 markings, 3324002 edges, 6236 markings/sec, 150 secs
lola: 1069844 markings, 3436248 edges, 5885 markings/sec, 155 secs
lola: 1102930 markings, 3549237 edges, 6617 markings/sec, 160 secs
lola: 1137971 markings, 3655878 edges, 7008 markings/sec, 165 secs
lola: 1171504 markings, 3757613 edges, 6707 markings/sec, 170 secs
lola: 1204179 markings, 3861497 edges, 6535 markings/sec, 175 secs
lola: 1237190 markings, 3964971 edges, 6602 markings/sec, 180 secs
lola: 1271835 markings, 4064807 edges, 6929 markings/sec, 185 secs
lola: 1305134 markings, 4166937 edges, 6660 markings/sec, 190 secs
lola: 1336106 markings, 4281353 edges, 6194 markings/sec, 195 secs
lola: 1367310 markings, 4392668 edges, 6241 markings/sec, 200 secs
lola: 1397384 markings, 4501195 edges, 6015 markings/sec, 205 secs
lola: 1427753 markings, 4611490 edges, 6074 markings/sec, 210 secs
lola: 1457805 markings, 4719776 edges, 6010 markings/sec, 215 secs
lola: 1490706 markings, 4818555 edges, 6580 markings/sec, 220 secs
lola: 1522620 markings, 4916218 edges, 6383 markings/sec, 225 secs
lola: 1553006 markings, 5026128 edges, 6077 markings/sec, 230 secs
lola: 1585130 markings, 5139455 edges, 6425 markings/sec, 235 secs
lola: 1614764 markings, 5249381 edges, 5927 markings/sec, 240 secs
lola: 1646362 markings, 5360013 edges, 6320 markings/sec, 245 secs
lola: 1677278 markings, 5472880 edges, 6183 markings/sec, 250 secs
lola: 1707541 markings, 5587655 edges, 6053 markings/sec, 255 secs
lola: 1736931 markings, 5702382 edges, 5878 markings/sec, 260 secs
lola: 1768155 markings, 5816513 edges, 6245 markings/sec, 265 secs
lola: 1797553 markings, 5916921 edges, 5880 markings/sec, 270 secs
lola: 1825606 markings, 6023569 edges, 5611 markings/sec, 275 secs
lola: 1853135 markings, 6129572 edges, 5506 markings/sec, 280 secs
lola: 1881293 markings, 6236666 edges, 5632 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: 'p'
Aborted (core dumped)
----- Kill lola and sara stderr -----
FORMULA PermAdmissibility-COL-50-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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-50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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-50.tgz
mv PermAdmissibility-COL-50 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 mcc4mcc-full"
echo " Input is PermAdmissibility-COL-50, 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 r118-csrt-152666478500465"
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 ;