About the Execution of Irma.struct for BridgeAndVehicles-COL-V80P50N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3315.570 | 1441017.00 | 2822766.00 | 655.00 | FTFTT?T?FTTF?TFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.......................
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K 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.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 45K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-COL-V80P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309300236
=====================================================================
--------------------
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 BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526823001756
BK_STOP 1526824442773
--------------------
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 BridgeAndVehicles-COL-V80P50N10 as instance name.
Using BridgeAndVehicles 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': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 807841, 'Memory': 4001.15, 'Tool': 'lola'}, {'Time': 823393, 'Memory': 477.71, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-COL-V80P50N10...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-COL-V80P50N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V80P50N10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ BridgeAndVehicles-COL-V80P50N10 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2296/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 188 places, 2108 transitions, 181 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2613 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.task
lola: A (G (((p87 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80) OR (p85 + 1 <= p90) OR (p81 + p82 + 1 <= p93 + p94)))) : A (G ((1 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186))) : A (G (((2 <= p90)))) : A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p99))) : E (F ((p90 <= p81 + p82))) : A (G (((p90 <= p83 + p84) OR (1 <= p85) OR (p87 <= p81 + p82) OR ((p85 <= p92) AND (3 <= p85) AND (p81 + p82 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186) AND (p93 + p94 <= p90))))) : E (F (((p90 <= p86) AND (((p85 <= p90) AND (1 <= p85)) OR ((p90 <= p92) AND (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p99 <= p83 + p84)))))) : A (G (((p83 + p84 + 1 <= p85) AND (p83 + p84 <= 2) AND (p187 + 1 <= p85)))) : E (F (((3 <= p93 + p94) AND ((p85 <= p90) OR (p83 + p84 <= p85) OR (p90 <= p92) OR (1 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186))))) : A (G (())) : E (F (((p92 + 1 <= p85) AND ((p87 <= p93 + p94) OR (p81 + p82 <= p93 + p94)) AND (2 <= p91) AND (p90 <= p88)))) : A (G (((p92 <= p87) OR (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + 1 <= p92)))) : A (G (((1 <= p92) OR (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + 1 <= p85)))) : A (G (((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 <= 1) OR (p81 + p82 + 1 <= p89) OR (3 <= p92)))) : A (G ((((p93 + p94 + 1 <= p90) AND (p93 + p94 <= 2)) OR (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 <= p89)))) : E (F ((p87 <= p89)))
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 (((p87 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p... (shortened)
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 724 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 BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p16... (shortened)
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 724 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: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p90))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 724 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 BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + 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 724 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 BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p90 <= p81 + p82)))
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 724 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 BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p90 <= p83 + p84) OR (1 <= p85) OR (p87 <= p81 + p82) OR ((p85 <= p92) AND (3 <= p85) AND (p81 + p82 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 ... (shortened)
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 724 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 BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 2)
lola: sara is running 0 secs || 7813 markings, 15498 edges, 1563 markings/sec, 0 secs
lola: sara is running 5 secs || 13560 markings, 28731 edges, 1149 markings/sec, 5 secs
lola: sara is running 10 secs || 19963 markings, 43650 edges, 1281 markings/sec, 10 secs
lola: sara is running 15 secs || 26373 markings, 58266 edges, 1282 markings/sec, 15 secs
lola: sara is running 20 secs || 32884 markings, 73661 edges, 1302 markings/sec, 20 secs
lola: sara is running 25 secs || 39212 markings, 88218 edges, 1266 markings/sec, 25 secs
lola: sara is running 30 secs || 45191 markings, 102323 edges, 1196 markings/sec, 30 secs
lola: sara is running 35 secs || 51453 markings, 117035 edges, 1252 markings/sec, 35 secs
lola: sara is running 40 secs || 57770 markings, 131757 edges, 1263 markings/sec, 40 secs
lola: sara is running 45 secs || 63790 markings, 146172 edges, 1204 markings/sec, 45 secs
lola: sara is running 50 secs || 69793 markings, 160708 edges, 1201 markings/sec, 50 secs
lola: sara is running 55 secs || 76064 markings, 175144 edges, 1254 markings/sec, 55 secs
lola: sara is running 60 secs || 82115 markings, 189493 edges, 1210 markings/sec, 60 secs
lola: sara is running 65 secs || 87924 markings, 203504 edges, 1162 markings/sec, 65 secs
lola: sara is running 70 secs || 93892 markings, 217688 edges, 1194 markings/sec, 70 secs
lola: sara is running 75 secs || 99882 markings, 232413 edges, 1198 markings/sec, 75 secs
lola: sara is running 80 secs || 106076 markings, 246488 edges, 1239 markings/sec, 80 secs
lola: sara is running 85 secs || 111600 markings, 259683 edges, 1105 markings/sec, 85 secs
lola: sara is running 90 secs || 117222 markings, 273442 edges, 1124 markings/sec, 90 secs
lola: sara is running 95 secs || 122851 markings, 287141 edges, 1126 markings/sec, 95 secs
lola: sara is running 100 secs || 128608 markings, 301171 edges, 1151 markings/sec, 100 secs
lola: sara is running 105 secs || 134636 markings, 315666 edges, 1206 markings/sec, 105 secs
lola: sara is running 110 secs || 140421 markings, 328820 edges, 1157 markings/sec, 110 secs
lola: sara is running 115 secs || 146241 markings, 342902 edges, 1164 markings/sec, 115 secs
lola: sara is running 120 secs || 151736 markings, 356194 edges, 1099 markings/sec, 120 secs
lola: sara is running 125 secs || 157372 markings, 369912 edges, 1127 markings/sec, 125 secs
lola: sara is running 130 secs || 163046 markings, 383787 edges, 1135 markings/sec, 130 secs
lola: sara is running 135 secs || 168813 markings, 397692 edges, 1153 markings/sec, 135 secs
lola: sara is running 140 secs || 174384 markings, 411578 edges, 1114 markings/sec, 140 secs
lola: sara is running 145 secs || 181117 markings, 426706 edges, 1347 markings/sec, 145 secs
lola: sara is running 150 secs || 187528 markings, 442314 edges, 1282 markings/sec, 150 secs
lola: sara is running 155 secs || 193811 markings, 457587 edges, 1257 markings/sec, 155 secs
lola: sara is running 160 secs || 199873 markings, 472269 edges, 1212 markings/sec, 160 secs
lola: sara is running 165 secs || 205785 markings, 486772 edges, 1182 markings/sec, 165 secs
lola: sara is running 170 secs || 211621 markings, 500963 edges, 1167 markings/sec, 170 secs
lola: sara is running 175 secs || 217783 markings, 515932 edges, 1232 markings/sec, 175 secs
lola: sara is running 180 secs || 223142 markings, 529242 edges, 1072 markings/sec, 180 secs
lola: sara is running 185 secs || 229389 markings, 544164 edges, 1249 markings/sec, 185 secs
lola: sara is running 190 secs || 234690 markings, 557505 edges, 1060 markings/sec, 190 secs
lola: sara is running 195 secs || 242042 markings, 572410 edges, 1470 markings/sec, 195 secs
lola: sara is running 200 secs || 248627 markings, 588707 edges, 1317 markings/sec, 200 secs
lola: sara is running 205 secs || 254807 markings, 603676 edges, 1236 markings/sec, 205 secs
lola: sara is running 210 secs || 260900 markings, 618461 edges, 1219 markings/sec, 210 secs
lola: sara is running 215 secs || 266991 markings, 633193 edges, 1218 markings/sec, 215 secs
lola: sara is running 220 secs || 272396 markings, 646152 edges, 1081 markings/sec, 220 secs
lola: sara is running 225 secs || 278542 markings, 661142 edges, 1229 markings/sec, 225 secs
lola: sara is running 230 secs || 284232 markings, 674999 edges, 1138 markings/sec, 230 secs
lola: sara is running 235 secs || 290094 markings, 688924 edges, 1172 markings/sec, 235 secs
lola: sara is running 240 secs || 295822 markings, 703142 edges, 1146 markings/sec, 240 secs
lola: sara is running 245 secs || 301775 markings, 717316 edges, 1191 markings/sec, 245 secs
lola: sara is running 250 secs || 307064 markings, 730829 edges, 1058 markings/sec, 250 secs
lola: sara is running 255 secs || 313411 markings, 744904 edges, 1269 markings/sec, 255 secs
lola: sara is running 260 secs || 319947 markings, 761290 edges, 1307 markings/sec, 260 secs
lola: sara is running 265 secs || 326314 markings, 776594 edges, 1273 markings/sec, 265 secs
lola: sara is running 270 secs || 332190 markings, 791060 edges, 1175 markings/sec, 270 secs
lola: sara is running 275 secs || 338035 markings, 804826 edges, 1169 markings/sec, 275 secs
lola: sara is running 280 secs || 344211 markings, 819792 edges, 1235 markings/sec, 280 secs
lola: sara is running 285 secs || 349932 markings, 833847 edges, 1144 markings/sec, 285 secs
lola: sara is running 290 secs || 355783 markings, 847579 edges, 1170 markings/sec, 290 secs
lola: sara is running 295 secs || 361548 markings, 861830 edges, 1153 markings/sec, 295 secs
lola: sara is running 300 secs || 367461 markings, 875805 edges, 1183 markings/sec, 300 secs
lola: sara is running 305 secs || 372843 markings, 888944 edges, 1076 markings/sec, 305 secs
lola: sara is running 310 secs || 379210 markings, 904330 edges, 1273 markings/sec, 310 secs
lola: sara is running 315 secs || 384558 markings, 917573 edges, 1070 markings/sec, 315 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: E (F (((p90 <= p86) AND (((p85 <= p90) AND (1 <= p85)) OR ((p90 <= p92) AND (p100 + p101 + p102 + p103 + p104 + p105 + p98 + p97 + p96 + p95 + p99 <= p83 + p84))))))
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 724 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 BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 141 markings, 140 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p83 + p84 + 1 <= p85) AND (p83 + p84 <= 2) AND (p187 + 1 <= p85))))
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 724 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 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 7836 markings, 15602 edges, 1567 markings/sec, 0 secs
lola: sara is running 5 secs || 15514 markings, 31827 edges, 1536 markings/sec, 5 secs
lola: sara is running 10 secs || 22910 markings, 48269 edges, 1479 markings/sec, 10 secs
lola: sara is running 15 secs || 30297 markings, 64287 edges, 1477 markings/sec, 15 secs
lola: sara is running 20 secs || 38891 markings, 82943 edges, 1719 markings/sec, 20 secs
lola: sara is running 25 secs || 46532 markings, 100317 edges, 1528 markings/sec, 25 secs
lola: sara is running 30 secs || 54187 markings, 118312 edges, 1531 markings/sec, 30 secs
lola: sara is running 35 secs || 61682 markings, 136079 edges, 1499 markings/sec, 35 secs
lola: sara is running 40 secs || 68951 markings, 153498 edges, 1454 markings/sec, 40 secs
lola: sara is running 45 secs || 76337 markings, 170759 edges, 1477 markings/sec, 45 secs
lola: sara is running 50 secs || 83654 markings, 188288 edges, 1463 markings/sec, 50 secs
lola: sara is running 55 secs || 91689 markings, 206915 edges, 1607 markings/sec, 55 secs
lola: sara is running 60 secs || 99500 markings, 225391 edges, 1562 markings/sec, 60 secs
lola: sara is running 65 secs || 107030 markings, 243558 edges, 1506 markings/sec, 65 secs
lola: sara is running 70 secs || 114970 markings, 262346 edges, 1588 markings/sec, 70 secs
lola: sara is running 75 secs || 122557 markings, 280766 edges, 1517 markings/sec, 75 secs
lola: sara is running 80 secs || 129971 markings, 298858 edges, 1483 markings/sec, 80 secs
lola: sara is running 85 secs || 137337 markings, 316997 edges, 1473 markings/sec, 85 secs
lola: sara is running 90 secs || 144571 markings, 334791 edges, 1447 markings/sec, 90 secs
lola: sara is running 95 secs || 151826 markings, 352567 edges, 1451 markings/sec, 95 secs
lola: sara is running 100 secs || 159106 markings, 370350 edges, 1456 markings/sec, 100 secs
lola: sara is running 105 secs || 166488 markings, 388180 edges, 1476 markings/sec, 105 secs
lola: sara is running 110 secs || 173931 markings, 406115 edges, 1489 markings/sec, 110 secs
lola: sara is running 115 secs || 182315 markings, 426403 edges, 1677 markings/sec, 115 secs
lola: sara is running 120 secs || 190131 markings, 444955 edges, 1563 markings/sec, 120 secs
lola: sara is running 125 secs || 197511 markings, 463588 edges, 1476 markings/sec, 125 secs
lola: sara is running 130 secs || 205108 markings, 481797 edges, 1519 markings/sec, 130 secs
lola: sara is running 135 secs || 213194 markings, 501192 edges, 1617 markings/sec, 135 secs
lola: sara is running 140 secs || 220817 markings, 520001 edges, 1525 markings/sec, 140 secs
lola: sara is running 145 secs || 228050 markings, 538025 edges, 1447 markings/sec, 145 secs
lola: sara is running 150 secs || 235453 markings, 556157 edges, 1481 markings/sec, 150 secs
lola: sara is running 155 secs || 242588 markings, 574227 edges, 1427 markings/sec, 155 secs
lola: sara is running 160 secs || 250096 markings, 592748 edges, 1502 markings/sec, 160 secs
lola: sara is running 165 secs || 257562 markings, 610976 edges, 1493 markings/sec, 165 secs
lola: sara is running 170 secs || 264760 markings, 629140 edges, 1440 markings/sec, 170 secs
lola: sara is running 175 secs || 271885 markings, 647101 edges, 1425 markings/sec, 175 secs
lola: sara is running 180 secs || 279633 markings, 665691 edges, 1550 markings/sec, 180 secs
lola: sara is running 185 secs || 287010 markings, 683617 edges, 1475 markings/sec, 185 secs
lola: sara is running 190 secs || 293844 markings, 701319 edges, 1367 markings/sec, 190 secs
lola: sara is running 195 secs || 302435 markings, 722036 edges, 1718 markings/sec, 195 secs
lola: sara is running 200 secs || 309995 markings, 740227 edges, 1512 markings/sec, 200 secs
lola: sara is running 205 secs || 317961 markings, 759900 edges, 1593 markings/sec, 205 secs
lola: sara is running 210 secs || 325255 markings, 778250 edges, 1459 markings/sec, 210 secs
lola: sara is running 215 secs || 332677 markings, 796627 edges, 1484 markings/sec, 215 secs
lola: sara is running 220 secs || 341152 markings, 816809 edges, 1695 markings/sec, 220 secs
lola: sara is running 225 secs || 348994 markings, 836347 edges, 1568 markings/sec, 225 secs
lola: sara is running 230 secs || 356403 markings, 855138 edges, 1482 markings/sec, 230 secs
lola: sara is running 235 secs || 363906 markings, 873600 edges, 1501 markings/sec, 235 secs
lola: sara is running 240 secs || 371411 markings, 892197 edges, 1501 markings/sec, 240 secs
lola: sara is running 245 secs || 378759 markings, 910894 edges, 1470 markings/sec, 245 secs
lola: sara is running 250 secs || 385997 markings, 929246 edges, 1448 markings/sec, 250 secs
lola: sara is running 255 secs || 393163 markings, 947453 edges, 1433 markings/sec, 255 secs
lola: sara is running 260 secs || 400744 markings, 965927 edges, 1516 markings/sec, 260 secs
lola: sara is running 265 secs || 407658 markings, 983814 edges, 1383 markings/sec, 265 secs
lola: sara is running 270 secs || 415535 markings, 1002925 edges, 1575 markings/sec, 270 secs
lola: sara is running 275 secs || 422426 markings, 1020475 edges, 1378 markings/sec, 275 secs
lola: sara is running 280 secs || 430133 markings, 1039586 edges, 1541 markings/sec, 280 secs
lola: sara is running 285 secs || 437254 markings, 1057473 edges, 1424 markings/sec, 285 secs
lola: sara is running 290 secs || 444810 markings, 1076268 edges, 1511 markings/sec, 290 secs
lola: sara is running 295 secs || 452337 markings, 1095064 edges, 1505 markings/sec, 295 secs
lola: sara is running 300 secs || 460684 markings, 1115678 edges, 1669 markings/sec, 300 secs
lola: sara is running 305 secs || 468295 markings, 1134075 edges, 1522 markings/sec, 305 secs
lola: sara is running 310 secs || 476521 markings, 1155037 edges, 1645 markings/sec, 310 secs
lola: sara is running 315 secs || 484074 markings, 1174042 edges, 1511 markings/sec, 315 secs
lola: sara is running 320 secs || 491370 markings, 1192090 edges, 1459 markings/sec, 320 secs
lola: sara is running 325 secs || 498795 markings, 1210851 edges, 1485 markings/sec, 325 secs
lola: sara is running 330 secs || 507806 markings, 1231980 edges, 1802 markings/sec, 330 secs
lola: sara is running 335 secs || 515648 markings, 1251931 edges, 1568 markings/sec, 335 secs
lola: sara is running 340 secs || 523332 markings, 1271161 edges, 1537 markings/sec, 340 secs
lola: sara is running 345 secs || 531202 markings, 1291067 edges, 1574 markings/sec, 345 secs
lola: sara is running 350 secs || 538924 markings, 1310442 edges, 1544 markings/sec, 350 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 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p93 + p94) AND ((p85 <= p90) OR (p83 + p84 <= p85) OR (p90 <= p92) OR (1 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + ... (shortened)
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 724 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 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.task
lola: processed formula with 0 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 10 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p92 + 1 <= p85) AND ((p87 <= p93 + p94) OR (p81 + p82 <= p93 + p94)) AND (2 <= p91) AND (p90 <= p88))))
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 724 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 BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 82 markings, 81 edges
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p92 <= p87) OR (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159... (shortened)
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 724 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: ========================================
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 347 markings, 346 edges
lola: ========================================
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p92) OR (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 +... (shortened)
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 724 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: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 7)
lola: sara is running 0 secs || 7496 markings, 14869 edges, 1499 markings/sec, 0 secs
lola: sara is running 5 secs || 14308 markings, 29858 edges, 1362 markings/sec, 5 secs
lola: sara is running 10 secs || 20703 markings, 44070 edges, 1279 markings/sec, 10 secs
lola: sara is running 15 secs || 27175 markings, 58891 edges, 1294 markings/sec, 15 secs
lola: sara is running 20 secs || 33369 markings, 72957 edges, 1239 markings/sec, 20 secs
lola: sara is running 25 secs || 39622 markings, 87480 edges, 1251 markings/sec, 25 secs
lola: sara is running 30 secs || 45520 markings, 101416 edges, 1180 markings/sec, 30 secs
lola: sara is running 35 secs || 51208 markings, 114538 edges, 1138 markings/sec, 35 secs
lola: sara is running 40 secs || 57430 markings, 129124 edges, 1244 markings/sec, 40 secs
lola: sara is running 45 secs || 63158 markings, 142759 edges, 1146 markings/sec, 45 secs
lola: sara is running 50 secs || 68686 markings, 155865 edges, 1106 markings/sec, 50 secs
lola: sara is running 55 secs || 74730 markings, 169850 edges, 1209 markings/sec, 55 secs
lola: sara is running 60 secs || 80607 markings, 183974 edges, 1175 markings/sec, 60 secs
lola: sara is running 65 secs || 86292 markings, 197668 edges, 1137 markings/sec, 65 secs
lola: sara is running 70 secs || 91960 markings, 211488 edges, 1134 markings/sec, 70 secs
lola: sara is running 75 secs || 97636 markings, 225339 edges, 1135 markings/sec, 75 secs
lola: sara is running 80 secs || 103561 markings, 238672 edges, 1185 markings/sec, 80 secs
lola: sara is running 85 secs || 109163 markings, 252287 edges, 1120 markings/sec, 85 secs
lola: sara is running 90 secs || 114543 markings, 265604 edges, 1076 markings/sec, 90 secs
lola: sara is running 95 secs || 119954 markings, 278848 edges, 1082 markings/sec, 95 secs
lola: sara is running 100 secs || 125429 markings, 292300 edges, 1095 markings/sec, 100 secs
lola: sara is running 105 secs || 130870 markings, 305657 edges, 1088 markings/sec, 105 secs
lola: sara is running 110 secs || 136758 markings, 318851 edges, 1178 markings/sec, 110 secs
lola: sara is running 115 secs || 142344 markings, 332594 edges, 1117 markings/sec, 115 secs
lola: sara is running 120 secs || 147732 markings, 345911 edges, 1078 markings/sec, 120 secs
lola: sara is running 125 secs || 153197 markings, 359344 edges, 1093 markings/sec, 125 secs
lola: sara is running 130 secs || 158473 markings, 372592 edges, 1055 markings/sec, 130 secs
lola: sara is running 135 secs || 163503 markings, 385061 edges, 1006 markings/sec, 135 secs
lola: sara is running 140 secs || 169173 markings, 398819 edges, 1134 markings/sec, 140 secs
lola: sara is running 145 secs || 174685 markings, 412743 edges, 1102 markings/sec, 145 secs
lola: sara is running 150 secs || 181000 markings, 426351 edges, 1263 markings/sec, 150 secs
lola: sara is running 155 secs || 186871 markings, 440009 edges, 1174 markings/sec, 155 secs
lola: sara is running 160 secs || 192875 markings, 454433 edges, 1201 markings/sec, 160 secs
lola: sara is running 165 secs || 198348 markings, 467612 edges, 1095 markings/sec, 165 secs
lola: sara is running 170 secs || 204184 markings, 481814 edges, 1167 markings/sec, 170 secs
lola: sara is running 175 secs || 210146 markings, 496131 edges, 1192 markings/sec, 175 secs
lola: sara is running 180 secs || 215793 markings, 509844 edges, 1129 markings/sec, 180 secs
lola: sara is running 185 secs || 221202 markings, 523109 edges, 1082 markings/sec, 185 secs
lola: sara is running 190 secs || 226975 markings, 537129 edges, 1155 markings/sec, 190 secs
lola: sara is running 195 secs || 232322 markings, 550341 edges, 1069 markings/sec, 195 secs
lola: sara is running 200 secs || 237663 markings, 562310 edges, 1068 markings/sec, 200 secs
lola: sara is running 205 secs || 244385 markings, 576816 edges, 1344 markings/sec, 205 secs
lola: sara is running 210 secs || 250230 markings, 590520 edges, 1169 markings/sec, 210 secs
lola: sara is running 215 secs || 256004 markings, 604091 edges, 1155 markings/sec, 215 secs
lola: sara is running 220 secs || 261725 markings, 617764 edges, 1144 markings/sec, 220 secs
lola: sara is running 225 secs || 267490 markings, 631474 edges, 1153 markings/sec, 225 secs
lola: sara is running 230 secs || 272833 markings, 644145 edges, 1069 markings/sec, 230 secs
lola: sara is running 235 secs || 278633 markings, 658116 edges, 1160 markings/sec, 235 secs
lola: sara is running 240 secs || 283800 markings, 670551 edges, 1033 markings/sec, 240 secs
lola: sara is running 245 secs || 289738 markings, 684812 edges, 1188 markings/sec, 245 secs
lola: sara is running 250 secs || 294769 markings, 697204 edges, 1006 markings/sec, 250 secs
lola: sara is running 255 secs || 300894 markings, 711859 edges, 1225 markings/sec, 255 secs
lola: sara is running 260 secs || 305922 markings, 724707 edges, 1006 markings/sec, 260 secs
lola: sara is running 265 secs || 310985 markings, 736541 edges, 1013 markings/sec, 265 secs
lola: sara is running 270 secs || 317363 markings, 750844 edges, 1276 markings/sec, 270 secs
lola: sara is running 275 secs || 323144 markings, 764267 edges, 1156 markings/sec, 275 secs
lola: sara is running 280 secs || 328937 markings, 777898 edges, 1159 markings/sec, 280 secs
lola: sara is running 285 secs || 334753 markings, 791670 edges, 1163 markings/sec, 285 secs
lola: sara is running 290 secs || 340077 markings, 804193 edges, 1065 markings/sec, 290 secs
lola: sara is running 295 secs || 345866 markings, 817840 edges, 1158 markings/sec, 295 secs
lola: sara is running 300 secs || 351596 markings, 831526 edges, 1146 markings/sec, 300 secs
lola: sara is running 305 secs || 356997 markings, 844400 edges, 1080 markings/sec, 305 secs
lola: sara is running 310 secs || 362621 markings, 857704 edges, 1125 markings/sec, 310 secs
lola: sara is running 315 secs || 368076 markings, 870862 edges, 1091 markings/sec, 315 secs
lola: sara is running 320 secs || 372966 markings, 883165 edges, 978 markings/sec, 320 secs
lola: sara is running 325 secs || 379242 markings, 897866 edges, 1255 markings/sec, 325 secs
lola: sara is running 330 secs || 384459 markings, 910474 edges, 1043 markings/sec, 330 secs
lola: sara is running 335 secs || 389278 markings, 922530 edges, 964 markings/sec, 335 secs
lola: sara is running 340 secs || 395216 markings, 935831 edges, 1188 markings/sec, 340 secs
lola: sara is running 345 secs || 401120 markings, 949402 edges, 1181 markings/sec, 345 secs
lola: sara is running 350 secs || 406867 markings, 962687 edges, 1149 markings/sec, 350 secs
lola: sara is running 355 secs || 412523 markings, 975998 edges, 1131 markings/sec, 355 secs
lola: sara is running 360 secs || 418254 markings, 989597 edges, 1146 markings/sec, 360 secs
lola: sara is running 365 secs || 423364 markings, 1001494 edges, 1022 markings/sec, 365 secs
lola: sara is running 370 secs || 429153 markings, 1015265 edges, 1158 markings/sec, 370 secs
lola: sara is running 375 secs || 434282 markings, 1027427 edges, 1026 markings/sec, 375 secs
lola: sara is running 380 secs || 440231 markings, 1041535 edges, 1190 markings/sec, 380 secs
lola: sara is running 385 secs || 445242 markings, 1053864 edges, 1002 markings/sec, 385 secs
lola: sara is running 390 secs || 451245 markings, 1067723 edges, 1201 markings/sec, 390 secs
lola: sara is running 395 secs || 456479 markings, 1079977 edges, 1047 markings/sec, 395 secs
lola: sara is running 400 secs || 461415 markings, 1092370 edges, 987 markings/sec, 400 secs
lola: sara is running 405 secs || 467629 markings, 1106829 edges, 1243 markings/sec, 405 secs
lola: sara is running 410 secs || 472908 markings, 1119270 edges, 1056 markings/sec, 410 secs
lola: sara is running 415 secs || 477632 markings, 1132029 edges, 945 markings/sec, 415 secs
lola: sara is running 420 secs || 483187 markings, 1144382 edges, 1111 markings/sec, 420 secs
lola: sara is running 425 secs || 489315 markings, 1158198 edges, 1226 markings/sec, 425 secs
lola: sara is running 430 secs || 495131 markings, 1171651 edges, 1163 markings/sec, 430 secs
lola: sara is running 435 secs || 500929 markings, 1185067 edges, 1160 markings/sec, 435 secs
lola: sara is running 440 secs || 506320 markings, 1197603 edges, 1078 markings/sec, 440 secs
lola: sara is running 445 secs || 512016 markings, 1211138 edges, 1139 markings/sec, 445 secs
lola: sara is running 450 secs || 517333 markings, 1223653 edges, 1063 markings/sec, 450 secs
lola: sara is running 455 secs || 523063 markings, 1237085 edges, 1146 markings/sec, 455 secs
lola: sara is running 460 secs || 528234 markings, 1249327 edges, 1034 markings/sec, 460 secs
lola: sara is running 465 secs || 534093 markings, 1263195 edges, 1172 markings/sec, 465 secs
lola: sara is running 470 secs || 539189 markings, 1275391 edges, 1019 markings/sec, 470 secs
lola: sara is running 475 secs || 544825 markings, 1288383 edges, 1127 markings/sec, 475 secs
lola: sara is running 480 secs || 550233 markings, 1301482 edges, 1082 markings/sec, 480 secs
lola: sara is running 485 secs || 555305 markings, 1314006 edges, 1014 markings/sec, 485 secs
lola: sara is running 490 secs || 560638 markings, 1326569 edges, 1067 markings/sec, 490 secs
lola: sara is running 495 secs || 566692 markings, 1340785 edges, 1211 markings/sec, 495 secs
lola: sara is running 500 secs || 571887 markings, 1352917 edges, 1039 markings/sec, 500 secs
lola: sara is running 505 secs || 576592 markings, 1365613 edges, 941 markings/sec, 505 secs
lola: sara is running 510 secs || 582046 markings, 1377881 edges, 1091 markings/sec, 510 secs
lola: sara is running 515 secs || 588172 markings, 1391518 edges, 1225 markings/sec, 515 secs
lola: sara is running 520 secs || 594011 markings, 1404960 edges, 1168 markings/sec, 520 secs
lola: sara is running 525 secs || 599455 markings, 1417763 edges, 1089 markings/sec, 525 secs
lola: sara is running 530 secs || 605202 markings, 1431116 edges, 1149 markings/sec, 530 secs
lola: sara is running 535 secs || 611012 markings, 1444518 edges, 1162 markings/sec, 535 secs
lola: sara is running 540 secs || 616399 markings, 1457239 edges, 1077 markings/sec, 540 secs
lola: sara is running 545 secs || 622173 markings, 1470631 edges, 1155 markings/sec, 545 secs
lola: sara is running 550 secs || 627476 markings, 1483337 edges, 1061 markings/sec, 550 secs
lola: sara is running 555 secs || 632608 markings, 1495705 edges, 1026 markings/sec, 555 secs
lola: sara is running 560 secs || 638595 markings, 1509576 edges, 1197 markings/sec, 560 secs
lola: sara is running 565 secs || 643820 markings, 1522143 edges, 1045 markings/sec, 565 secs
lola: sara is running 570 secs || 649051 markings, 1534400 edges, 1046 markings/sec, 570 secs
lola: sara is running 575 secs || 654796 markings, 1547974 edges, 1149 markings/sec, 575 secs
lola: sara is running 580 secs || 660069 markings, 1560490 edges, 1055 markings/sec, 580 secs
lola: sara is running 585 secs || 664773 markings, 1572484 edges, 941 markings/sec, 585 secs
lola: sara is running 590 secs || 671160 markings, 1586734 edges, 1277 markings/sec, 590 secs
lola: sara is running 595 secs || 676503 markings, 1599689 edges, 1069 markings/sec, 595 secs
lola: sara is running 600 secs || 681697 markings, 1612418 edges, 1039 markings/sec, 600 secs
lola: sara is running 605 secs || 686312 markings, 1624643 edges, 923 markings/sec, 605 secs
lola: sara is running 610 secs || 692059 markings, 1636965 edges, 1149 markings/sec, 610 secs
lola: sara is running 615 secs || 698176 markings, 1650924 edges, 1223 markings/sec, 615 secs
lola: sara is running 620 secs || 704057 markings, 1664420 edges, 1176 markings/sec, 620 secs
lola: sara is running 625 secs || 709559 markings, 1677189 edges, 1100 markings/sec, 625 secs
lola: sara is running 630 secs || 715271 markings, 1690588 edges, 1142 markings/sec, 630 secs
lola: sara is running 635 secs || 720790 markings, 1703413 edges, 1104 markings/sec, 635 secs
lola: sara is running 640 secs || 726225 markings, 1716239 edges, 1087 markings/sec, 640 secs
lola: sara is running 645 secs || 731485 markings, 1728669 edges, 1052 markings/sec, 645 secs
lola: sara is running 650 secs || 737279 markings, 1742070 edges, 1159 markings/sec, 650 secs
lola: sara is running 655 secs || 742586 markings, 1754857 edges, 1061 markings/sec, 655 secs
lola: sara is running 660 secs || 748437 markings, 1768116 edges, 1170 markings/sec, 660 secs
lola: sara is running 665 secs || 753675 markings, 1780783 edges, 1048 markings/sec, 665 secs
lola: sara is running 670 secs || 758915 markings, 1793687 edges, 1048 markings/sec, 670 secs
lola: sara is running 675 secs || 764604 markings, 1806404 edges, 1138 markings/sec, 675 secs
lola: sara is running 680 secs || 770110 markings, 1819695 edges, 1101 markings/sec, 680 secs
lola: sara is running 685 secs || 775395 markings, 1832150 edges, 1057 markings/sec, 685 secs
lola: sara is running 690 secs || 780061 markings, 1844550 edges, 933 markings/sec, 690 secs
lola: sara is running 695 secs || 786400 markings, 1858349 edges, 1268 markings/sec, 695 secs
lola: sara is running 700 secs || 791857 markings, 1871444 edges, 1091 markings/sec, 700 secs
lola: sara is running 705 secs || 797122 markings, 1884042 edges, 1053 markings/sec, 705 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + ... (shortened)
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 724 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 invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p93 + p94 + 1 <= p90) AND (p93 + p94 <= 2)) OR (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 +... (shortened)
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 724 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 80 edges
lola: ========================================
lola: subprocess 15 will run for 2144 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p87 <= p89)))
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 724 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 BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 81 markings, 80 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes unknown yes unknown no yes yes no unknown yes no yes
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-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 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="BridgeAndVehicles-COL-V80P50N10"
export BK_EXAMINATION="ReachabilityCardinality"
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/BridgeAndVehicles-COL-V80P50N10.tgz
mv BridgeAndVehicles-COL-V80P50N10 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 BridgeAndVehicles-COL-V80P50N10, 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 r031-ebro-152646309300236"
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 '
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 ;