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 224K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 8.8K 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 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 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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-full
Input is PermAdmissibility-COL-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472700446
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527141287914


BK_STOP 1527141724223

--------------------
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-05 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 550, 'Memory': 111.87, 'Tool': 'lola'}, {'Time': 563, 'Memory': 112.12, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola PermAdmissibility-COL-05...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-05: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-05: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ PermAdmissibility-COL-05 @ 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-05-ReachabilityCardinality.task
lola: E (F ((3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))) : A (G ((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p153))) : E (F ((3 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132))) : E (F (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + 1 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132) AND (3 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124) AND (p173 <= 0)))) : E (F ((((p198 <= p0) OR (3 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)) AND (1 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161) AND (p100 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)))) : E (F ((2 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161))) : E (F ((((2 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (p173 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)) AND ((2 <= p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (3 <= p198) OR (3 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) OR (2 <= p163))))) : A (G (((1 <= p0) OR (p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR ((3 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124) AND (p153 <= p0)) OR (2 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))) : E (F ((1 <= p162))) : E (F ((((2 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189) OR (p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p133)) AND ((p162 <= p163) OR (p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p67)) AND (p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + 1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42) AND (p100 <= 2)))) : E (F (((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91) AND (p173 <= 0) AND ((p163 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181) OR (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p199 + 1 <= p143))))) : A (G (((2 <= p164) OR (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))) : E (F ((3 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152))) : A (G ((((p153 <= 1) OR (p162 <= 0)) AND (p144 <= p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))) : A (G (((3 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132) OR (p100 <= p173) OR (p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p0) OR (1 <= p163)))) : E (F (((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= 1) AND (p133 + 1 <= p67) AND ((p0 <= 1) OR (p199 + 1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + 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: 40 markings, 39 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p153)))
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-05-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132)))
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: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + 1 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132) AND (3 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124) AND (p173 <= 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p198 <= p0) OR (3 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)) AND (1 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161) AND (p100 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161)))
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: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (p173 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)) AND ((2 <= p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) OR (3 <= p198) OR (3 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) OR (2 <= p163)))))
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 16 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p0) OR (p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR ((3 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124) AND (p153 <= p0)) OR (2 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189))))
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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 152201 markings, 342865 edges, 30440 markings/sec, 0 secs
lola: sara is running 5 secs || 303901 markings, 680980 edges, 30340 markings/sec, 5 secs
lola: sara is running 10 secs || 453335 markings, 993938 edges, 29887 markings/sec, 10 secs
lola: sara is running 15 secs || 597778 markings, 1322111 edges, 28889 markings/sec, 15 secs
lola: sara is running 20 secs || 741230 markings, 1638768 edges, 28690 markings/sec, 20 secs
lola: sara is running 25 secs || 880064 markings, 1945525 edges, 27767 markings/sec, 25 secs
lola: sara is running 30 secs || 1020908 markings, 2256323 edges, 28169 markings/sec, 30 secs
lola: sara is running 35 secs || 1152149 markings, 2547840 edges, 26248 markings/sec, 35 secs
lola: sara is running 40 secs || 1279408 markings, 2834133 edges, 25452 markings/sec, 40 secs
lola: sara is running 45 secs || 1415132 markings, 3143766 edges, 27145 markings/sec, 45 secs
lola: sara is running 50 secs || 1550587 markings, 3451259 edges, 27091 markings/sec, 50 secs
lola: sara is running 55 secs || 1687376 markings, 3760485 edges, 27358 markings/sec, 55 secs
lola: sara is running 60 secs || 1832346 markings, 4086012 edges, 28994 markings/sec, 60 secs
lola: sara is running 65 secs || 1978062 markings, 4402342 edges, 29143 markings/sec, 65 secs
lola: sara is running 70 secs || 2119700 markings, 4726204 edges, 28328 markings/sec, 70 secs
lola: sara is running 75 secs || 2256721 markings, 5051101 edges, 27404 markings/sec, 75 secs
lola: sara is running 80 secs || 2391361 markings, 5364759 edges, 26928 markings/sec, 80 secs
lola: sara is running 85 secs || 2528076 markings, 5702278 edges, 27343 markings/sec, 85 secs
lola: sara is running 90 secs || 2664008 markings, 6028802 edges, 27186 markings/sec, 90 secs
lola: sara is running 95 secs || 2806553 markings, 6363246 edges, 28509 markings/sec, 95 secs
lola: sara is running 100 secs || 2950387 markings, 6683335 edges, 28767 markings/sec, 100 secs
lola: sara is running 105 secs || 3093193 markings, 6991228 edges, 28561 markings/sec, 105 secs
lola: sara is running 110 secs || 3230981 markings, 7321858 edges, 27558 markings/sec, 110 secs
lola: sara is running 115 secs || 3359390 markings, 7625918 edges, 25682 markings/sec, 115 secs
lola: sara is running 120 secs || 3489894 markings, 7937021 edges, 26101 markings/sec, 120 secs
lola: sara is running 125 secs || 3621650 markings, 8262255 edges, 26351 markings/sec, 125 secs
lola: sara is running 130 secs || 3754436 markings, 8576771 edges, 26557 markings/sec, 130 secs
lola: sara is running 135 secs || 3898489 markings, 8895416 edges, 28811 markings/sec, 135 secs
lola: sara is running 140 secs || 4036450 markings, 9221695 edges, 27592 markings/sec, 140 secs
lola: sara is running 145 secs || 4163477 markings, 9557830 edges, 25405 markings/sec, 145 secs
lola: sara is running 150 secs || 4294336 markings, 9931545 edges, 26172 markings/sec, 150 secs
lola: sara is running 155 secs || 4425607 markings, 10319699 edges, 26254 markings/sec, 155 secs
lola: sara is running 160 secs || 4559492 markings, 10668345 edges, 26777 markings/sec, 160 secs
lola: sara is running 165 secs || 4685629 markings, 11005048 edges, 25227 markings/sec, 165 secs
lola: sara is running 170 secs || 4808647 markings, 11447876 edges, 24604 markings/sec, 170 secs
lola: sara is running 175 secs || 4935722 markings, 11833894 edges, 25415 markings/sec, 175 secs
lola: sara is running 180 secs || 5066552 markings, 12275346 edges, 26166 markings/sec, 180 secs
lola: sara is running 185 secs || 5196234 markings, 12720907 edges, 25936 markings/sec, 185 secs
lola: sara is running 190 secs || 5323842 markings, 13163843 edges, 25522 markings/sec, 190 secs
lola: sara is running 195 secs || 5456759 markings, 13531656 edges, 26583 markings/sec, 195 secs
lola: sara is running 200 secs || 5586580 markings, 13917368 edges, 25964 markings/sec, 200 secs
lola: sara is running 205 secs || 5715313 markings, 14385518 edges, 25747 markings/sec, 205 secs
lola: sara is running 210 secs || 5842808 markings, 14794025 edges, 25499 markings/sec, 210 secs
lola: sara is running 215 secs || 6020345 markings, 15210500 edges, 35507 markings/sec, 215 secs
lola: sara is running 220 secs || 6211818 markings, 15597899 edges, 38295 markings/sec, 220 secs
lola: sara is running 225 secs || 6369721 markings, 15938151 edges, 31581 markings/sec, 225 secs
lola: sara is running 230 secs || 6510670 markings, 16248090 edges, 28190 markings/sec, 230 secs
lola: sara is running 235 secs || 6648130 markings, 16549098 edges, 27492 markings/sec, 235 secs
lola: sara is running 240 secs || 6787055 markings, 16860263 edges, 27785 markings/sec, 240 secs
lola: sara is running 245 secs || 6922987 markings, 17172683 edges, 27186 markings/sec, 245 secs
lola: sara is running 250 secs || 7054224 markings, 17489266 edges, 26247 markings/sec, 250 secs
lola: sara is running 255 secs || 7193547 markings, 17806202 edges, 27865 markings/sec, 255 secs
lola: sara is running 260 secs || 7329477 markings, 18125639 edges, 27186 markings/sec, 260 secs
lola: sara is running 265 secs || 7463944 markings, 18457412 edges, 26893 markings/sec, 265 secs
lola: sara is running 270 secs || 7595943 markings, 18812005 edges, 26400 markings/sec, 270 secs
lola: sara is running 275 secs || 7726433 markings, 19219483 edges, 26098 markings/sec, 275 secs
lola: sara is running 280 secs || 7866623 markings, 19616586 edges, 28038 markings/sec, 280 secs
lola: sara is running 285 secs || 8017509 markings, 19947903 edges, 30177 markings/sec, 285 secs
lola: sara is running 290 secs || 8162046 markings, 20264185 edges, 28907 markings/sec, 290 secs
lola: sara is running 295 secs || 8305211 markings, 20595904 edges, 28633 markings/sec, 295 secs
lola: sara is running 300 secs || 8438306 markings, 20891071 edges, 26619 markings/sec, 300 secs
lola: sara is running 305 secs || 8570500 markings, 21199426 edges, 26439 markings/sec, 305 secs
lola: sara is running 310 secs || 8703970 markings, 21503457 edges, 26694 markings/sec, 310 secs
lola: sara is running 315 secs || 8834700 markings, 21800558 edges, 26146 markings/sec, 315 secs
lola: sara is running 320 secs || 8974905 markings, 22115561 edges, 28041 markings/sec, 320 secs
lola: sara is running 325 secs || 9112185 markings, 22448370 edges, 27456 markings/sec, 325 secs
lola: sara is running 330 secs || 9246912 markings, 22794799 edges, 26945 markings/sec, 330 secs
lola: sara is running 335 secs || 9387228 markings, 23142212 edges, 28063 markings/sec, 335 secs
lola: sara is running 340 secs || 9533927 markings, 23472587 edges, 29340 markings/sec, 340 secs
lola: sara is running 345 secs || 9675652 markings, 23814068 edges, 28345 markings/sec, 345 secs
lola: sara is running 350 secs || 9817003 markings, 24146209 edges, 28270 markings/sec, 350 secs
lola: sara is running 355 secs || 9954973 markings, 24475446 edges, 27594 markings/sec, 355 secs
lola: sara is running 360 secs || 10087307 markings, 24851755 edges, 26467 markings/sec, 360 secs
lola: sara is running 365 secs || 10215142 markings, 25216111 edges, 25567 markings/sec, 365 secs
lola: sara is running 370 secs || 10345981 markings, 25631786 edges, 26168 markings/sec, 370 secs
lola: sara is running 375 secs || 10469881 markings, 26073541 edges, 24780 markings/sec, 375 secs
lola: sara is running 380 secs || 10597093 markings, 26514652 edges, 25442 markings/sec, 380 secs
lola: sara is running 385 secs || 10724059 markings, 26892666 edges, 25393 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p162)))
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: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189) OR (p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p133)) AND ((p162 <= p163) OR (p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p67)) AND (p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + 1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42) AND (p100 <= 2))))
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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91) AND (p173 <= 0) AND ((p163 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181) OR (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p199 + 1 <= p143)))))
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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p164) OR (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189))))
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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-10.sara.
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)))
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: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-05-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 13 will run for 1049 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p153 <= 1) OR (p162 <= 0)) AND (p144 <= p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))
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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132) OR (p100 <= p173) OR (p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p0) OR (1 <= p163))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 15 will run for 3147 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= 1) AND (p133 + 1 <= p67) AND ((p0 <= 1) OR (p199 + 1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes yes unknown yes yes yes no yes no no yes
sara: place or transition ordering is non-deterministic
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-15 TRUE 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-05"
export BK_EXAMINATION="ReachabilityCardinality"
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-05.tgz
mv PermAdmissibility-COL-05 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-05, examination is ReachabilityCardinality"
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-152666472700446"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;