fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r031-ebro-152646309200185
Last Updated
June 26, 2018

About the Execution of Irma.struct for BridgeAndVehicles-COL-V50P20N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3352.770 895319.00 921519.00 396.00 ???????????????? 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 220K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.7K 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.3K 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.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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.3K 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 44K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-COL-V50P20N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309200185
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526816739842


BK_STOP 1526817635161

--------------------
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-V50P20N50 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1870535, 'Memory': 6501.96, 'Tool': 'lola'}, {'Time': 1882350, 'Memory': 6901.56, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-COL-V50P20N50...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-COL-V50P20N50: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V50P20N50: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-COL-V50P20N50 @ 3537 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3537 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 5576/65536 symbol table entries, 1422 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 5408 transitions, 161 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5813 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P20N50-CTLCardinality.task
lola: E (G (A (F (((1 <= p56) AND (3 <= p159)))))) : A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p98 + p97 + p96 + p95 + p94 + p93 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p56) OR (p1 <= p56) OR (p161 + p162 <= 1) OR (p159 + 1 <= p0) OR ((2 <= p1))))) : A (F ((3 <= 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))) : NOT(A (F (A (G ((p160 <= p1)))))) : E (X ((E (G ((3 <= p2))) AND (((p55 <= p159) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p98 + p97 + p96 + p95 + p94 + p93 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p1)) AND (p1 + 1 <= p161 + p162))))) : A (G ((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 + 1 <= p3))) : ((E ((TRUE U (3 <= p159))) AND E (G (((1 <= p161 + p162) AND (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 <= 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))))) AND (A (F (((p0 <= p3) AND (p163 + p164 <= p160)))) AND (3 <= p3))) : A (F (A (G ((p165 + 1 <= 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))))) : NOT(NOT(A (((1 <= p2) U (2 <= 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))))) : A (G ((E (X ((3 <= p2))) OR ((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 + 1 <= p56) OR (p55 + 1 <= p1))))) : A (F (E (X (((1 <= p165) AND (2 <= 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)))))) : NOT(E ((((p160 <= p0) OR (p163 + p164 <= p165)) U (p3 <= p1)))) : (E (G (((2 <= p165) OR (p163 + p164 <= p165) OR (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 <= 0)))) AND (p56 <= p55)) : A (G (E (F (((p55 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p98 + p97 + p96 + p95 + p94 + p93 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) OR (3 <= 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)))))) : NOT(E (F (A (F ((2 <= p161 + p162)))))) : NOT(A (((p56 <= 1) U (1 <= p56))))
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 (G (A (F (((1 <= p56) AND (3 <= p159))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((1 <= p56) AND (3 <= p159))))))
lola: processed formula length: 58
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 418 markings, 418 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p98 + p97 + p96 + p95 + p94 + p93 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p56) OR (p1 <= p56) OR (p161 + p162 <= 1) OR (p159 + 1 <= p0) OR ((2 <= 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 644 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N50-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-CTLCardinality.sara.
lola: sara is running 0 secs || 820 markings, 820 edges, 164 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= 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)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= 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)))
lola: processed formula: A (F ((3 <= 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)))
lola: processed formula length: 369
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 648 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 409 markings, 409 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((p160 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p1 + 1 <= p160)))))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 129859 markings, 390155 edges, 3228173285975916544 markings/sec, 0 secs
lola: 254979 markings, 741155 edges, 25024 markings/sec, 5 secs
lola: 375472 markings, 1079277 edges, 24099 markings/sec, 10 secs
lola: 492609 markings, 1409126 edges, 23427 markings/sec, 15 secs
lola: 607784 markings, 1734277 edges, 23035 markings/sec, 20 secs
lola: 726119 markings, 2107877 edges, 23667 markings/sec, 25 secs
lola: 850874 markings, 2516243 edges, 24951 markings/sec, 30 secs
lola: 971491 markings, 2909966 edges, 24123 markings/sec, 35 secs
lola: 1088869 markings, 3296314 edges, 23476 markings/sec, 40 secs
lola: 1204083 markings, 3677266 edges, 23043 markings/sec, 45 secs
lola: 1317079 markings, 4050802 edges, 22599 markings/sec, 50 secs
lola: 1429208 markings, 4424089 edges, 22426 markings/sec, 55 secs
lola: 1539963 markings, 4792877 edges, 22151 markings/sec, 60 secs
lola: 1648826 markings, 5155413 edges, 21773 markings/sec, 65 secs
lola: 1757708 markings, 5517638 edges, 21776 markings/sec, 70 secs
lola: 1866452 markings, 5883932 edges, 21749 markings/sec, 75 secs
lola: 1988000 markings, 6313159 edges, 24310 markings/sec, 80 secs
lola: 2110966 markings, 6731456 edges, 24593 markings/sec, 85 secs
lola: 2230933 markings, 7139456 edges, 23993 markings/sec, 90 secs
lola: 2346850 markings, 7539894 edges, 23183 markings/sec, 95 secs
lola: 2461936 markings, 7935884 edges, 23017 markings/sec, 100 secs
lola: 2573990 markings, 8325261 edges, 22411 markings/sec, 105 secs
lola: 2685380 markings, 8711556 edges, 22278 markings/sec, 110 secs
lola: 2796337 markings, 9096335 edges, 22191 markings/sec, 115 secs
lola: 2904195 markings, 9475882 edges, 21572 markings/sec, 120 secs
lola: 3013837 markings, 9855683 edges, 21928 markings/sec, 125 secs
lola: 3120294 markings, 10229715 edges, 21291 markings/sec, 130 secs
lola: 3226998 markings, 10605028 edges, 21341 markings/sec, 135 secs
lola: 3333800 markings, 10980379 edges, 21360 markings/sec, 140 secs
lola: 3438197 markings, 11347027 edges, 20879 markings/sec, 145 secs
lola: 3534449 markings, 11685457 edges, 19250 markings/sec, 150 secs
lola: 3628710 markings, 12025772 edges, 18852 markings/sec, 155 secs
lola: 3740483 markings, 12438497 edges, 22355 markings/sec, 160 secs
lola: 3860337 markings, 12861632 edges, 23971 markings/sec, 165 secs
lola: 3978210 markings, 13272642 edges, 23575 markings/sec, 170 secs
lola: 4094845 markings, 13677972 edges, 23327 markings/sec, 175 secs
lola: 4208633 markings, 14079947 edges, 22758 markings/sec, 180 secs
lola: 4320445 markings, 14472395 edges, 22362 markings/sec, 185 secs
lola: 4431043 markings, 14862791 edges, 22120 markings/sec, 190 secs
lola: 4536192 markings, 15240520 edges, 21030 markings/sec, 195 secs
lola: 4645924 markings, 15626762 edges, 21946 markings/sec, 200 secs
lola: 4752445 markings, 16009263 edges, 21304 markings/sec, 205 secs
lola: 4857080 markings, 16384115 edges, 20927 markings/sec, 210 secs
lola: 4964743 markings, 16762183 edges, 21533 markings/sec, 215 secs
lola: 5069565 markings, 17136853 edges, 20964 markings/sec, 220 secs
lola: 5172469 markings, 17505329 edges, 20581 markings/sec, 225 secs
lola: 5275204 markings, 17872533 edges, 20547 markings/sec, 230 secs
lola: 5379291 markings, 18246851 edges, 20817 markings/sec, 235 secs
lola: 5477591 markings, 18605005 edges, 19660 markings/sec, 240 secs
lola: 5575448 markings, 18954528 edges, 19571 markings/sec, 245 secs
lola: 5674416 markings, 19308595 edges, 19794 markings/sec, 250 secs
lola: 5774152 markings, 19667630 edges, 19947 markings/sec, 255 secs
lola: 5868910 markings, 20029086 edges, 18952 markings/sec, 260 secs
lola: 5962724 markings, 20382290 edges, 18763 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((E (G ((3 <= p2))) AND (((p55 <= p159) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p98 + p97 + p96 + p95 + p94 + p93 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p1)) AND (p1 + 1 <= p161 + p162))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((NOT(A(TRUE U (p2 <= 2))) AND (((p55 <= p159) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p98 + p97 + p96 + p95 + p94 + p93 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= p1)) AND (p1 + 1 <= p161 + p162... (shortened)
lola: processed formula length: 404
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 140955 markings, 395861 edges, 2073447895104749568 markings/sec, 0 secs
lola: 278203 markings, 821207 edges, 27450 markings/sec, 5 secs
lola: 414663 markings, 1200862 edges, 27292 markings/sec, 10 secs
lola: 546604 markings, 1567263 edges, 26388 markings/sec, 15 secs
lola: 675880 markings, 1925688 edges, 25855 markings/sec, 20 secs
lola: 808812 markings, 2328451 edges, 26586 markings/sec, 25 secs
lola: 947041 markings, 2768351 edges, 27646 markings/sec, 30 secs
lola: 1082070 markings, 3186609 edges, 27006 markings/sec, 35 secs
lola: 1208628 markings, 3586742 edges, 25312 markings/sec, 40 secs
lola: 1332980 markings, 3979963 edges, 24870 markings/sec, 45 secs
lola: 1449066 markings, 4351336 edges, 23217 markings/sec, 50 secs
lola: 1570661 markings, 4735527 edges, 24319 markings/sec, 55 secs
lola: 1687136 markings, 5110158 edges, 23295 markings/sec, 60 secs
lola: 1799940 markings, 5483694 edges, 22561 markings/sec, 65 secs
lola: 1926558 markings, 5886382 edges, 25324 markings/sec, 70 secs
lola: 2065121 markings, 6341893 edges, 27713 markings/sec, 75 secs
lola: 2200523 markings, 6777158 edges, 27080 markings/sec, 80 secs
lola: 2330212 markings, 7197725 edges, 25938 markings/sec, 85 secs
lola: 2451083 markings, 7592691 edges, 24174 markings/sec, 90 secs
lola: 2576395 markings, 7999798 edges, 25062 markings/sec, 95 secs
lola: 2698018 markings, 8405274 edges, 24325 markings/sec, 100 secs
lola: 2819229 markings, 8807508 edges, 24242 markings/sec, 105 secs
lola: 2940615 markings, 9208819 edges, 24277 markings/sec, 110 secs
lola: 3056906 markings, 9607929 edges, 23258 markings/sec, 115 secs
lola: 3175753 markings, 9997831 edges, 23769 markings/sec, 120 secs
lola: 3292277 markings, 10397065 edges, 23305 markings/sec, 125 secs
lola: 3409695 markings, 10798747 edges, 23484 markings/sec, 130 secs
lola: 3534060 markings, 11201199 edges, 24873 markings/sec, 135 secs
lola: 3671387 markings, 11667330 edges, 27465 markings/sec, 140 secs
lola: 3814320 markings, 12129446 edges, 28587 markings/sec, 145 secs
lola: 3948368 markings, 12570701 edges, 26810 markings/sec, 150 secs
lola: 4071163 markings, 12975284 edges, 24559 markings/sec, 155 secs
lola: 4192566 markings, 13369991 edges, 24281 markings/sec, 160 secs
lola: 4309201 markings, 13759609 edges, 23327 markings/sec, 165 secs
lola: 4429381 markings, 14160963 edges, 24036 markings/sec, 170 secs
lola: 4542332 markings, 14553555 edges, 22590 markings/sec, 175 secs
lola: 4660385 markings, 14943350 edges, 23611 markings/sec, 180 secs
lola: 4770805 markings, 15325346 edges, 22084 markings/sec, 185 secs
lola: 4881385 markings, 15707696 edges, 22116 markings/sec, 190 secs
lola: 4994979 markings, 16097664 edges, 22719 markings/sec, 195 secs
lola: 5117681 markings, 16501871 edges, 24540 markings/sec, 200 secs
lola: 5234454 markings, 16904090 edges, 23355 markings/sec, 205 secs
lola: 5351308 markings, 17307057 edges, 23371 markings/sec, 210 secs
lola: 5468143 markings, 17709560 edges, 23367 markings/sec, 215 secs
lola: 5584600 markings, 18112530 edges, 23291 markings/sec, 220 secs
lola: 5693147 markings, 18507723 edges, 21709 markings/sec, 225 secs
lola: 5833779 markings, 18967515 edges, 28126 markings/sec, 230 secs
lola: 5975304 markings, 19435984 edges, 28305 markings/sec, 235 secs
lola: 6114146 markings, 19891535 edges, 27768 markings/sec, 240 secs
lola: 6252846 markings, 20339558 edges, 27740 markings/sec, 245 secs
lola: 6381385 markings, 20776377 edges, 25708 markings/sec, 250 secs
lola: 6511008 markings, 21212576 edges, 25925 markings/sec, 255 secs
lola: 6630867 markings, 21613661 edges, 23972 markings/sec, 260 secs
lola: 6752618 markings, 22016364 edges, 24350 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((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 + 1 <= p3)))
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 644 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-V50P20N50-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 6 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E ((TRUE U (3 <= p159))) AND E (G (((1 <= p161 + p162) AND (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 <= p108 + p109 + p110 + p111 + p112 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p159)))
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 644 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-V50P20N50-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-CTLCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p161 + p162) AND (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 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p161 + p162 <= 0) OR (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 + 1 <= ... (shortened)
lola: processed formula length: 701
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5202 markings, 7701 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p165 + 1 <= 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)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((p165 + 1 <= 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)))))
lola: processed formula: A (F (A (G ((p165 + 1 <= 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)))))
lola: processed formula length: 327
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 648 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3740 markings, 13270 edges, 748 markings/sec, 0 secs
lola: 5388 markings, 21645 edges, 330 markings/sec, 5 secs
lola: 8316 markings, 37559 edges, 586 markings/sec, 10 secs
lola: 11824 markings, 56909 edges, 702 markings/sec, 15 secs
lola: 17249 markings, 87652 edges, 1085 markings/sec, 20 secs
lola: 20501 markings, 105151 edges, 650 markings/sec, 25 secs
lola: 26486 markings, 138341 edges, 1197 markings/sec, 30 secs
lola: 29501 markings, 154408 edges, 603 markings/sec, 35 secs
lola: 34997 markings, 184714 edges, 1099 markings/sec, 40 secs
lola: 37772 markings, 199345 edges, 555 markings/sec, 45 secs
lola: 42776 markings, 226763 edges, 1001 markings/sec, 50 secs
lola: 46075 markings, 243837 edges, 660 markings/sec, 55 secs
lola: 49844 markings, 264516 edges, 754 markings/sec, 60 secs
lola: 54047 markings, 287146 edges, 841 markings/sec, 65 secs
lola: 57920 markings, 307848 edges, 775 markings/sec, 70 secs
lola: 61472 markings, 326634 edges, 710 markings/sec, 75 secs
lola: 64715 markings, 343520 edges, 649 markings/sec, 80 secs
lola: 67637 markings, 358490 edges, 584 markings/sec, 85 secs
lola: 70244 markings, 371552 edges, 521 markings/sec, 90 secs
lola: 73361 markings, 387301 edges, 623 markings/sec, 95 secs
lola: 75189 markings, 395699 edges, 366 markings/sec, 100 secs
lola: 77224 markings, 405060 edges, 407 markings/sec, 105 secs
lola: 78749 markings, 411437 edges, 305 markings/sec, 110 secs
lola: 79863 markings, 415466 edges, 223 markings/sec, 115 secs
lola: 80695 markings, 417823 edges, 166 markings/sec, 120 secs
lola: 81398 markings, 419312 edges, 141 markings/sec, 125 secs
lola: 81704 markings, 419804 edges, 61 markings/sec, 130 secs
lola: 88648 markings, 452544 edges, 1389 markings/sec, 135 secs
lola: 89913 markings, 458480 edges, 253 markings/sec, 140 secs
lola: 92769 markings, 475504 edges, 571 markings/sec, 145 secs
lola: 93523 markings, 481444 edges, 151 markings/sec, 150 secs
lola: 95622 markings, 498006 edges, 420 markings/sec, 155 secs
lola: 99229 markings, 517523 edges, 721 markings/sec, 160 secs
lola: 99931 markings, 522394 edges, 140 markings/sec, 165 secs
lola: 101101 markings, 531610 edges, 234 markings/sec, 170 secs
lola: 102916 markings, 543535 edges, 363 markings/sec, 175 secs
lola: 106608 markings, 565279 edges, 738 markings/sec, 180 secs
lola: 107735 markings, 574112 edges, 225 markings/sec, 185 secs
lola: 109429 markings, 586501 edges, 339 markings/sec, 190 secs
lola: 113648 markings, 610669 edges, 844 markings/sec, 195 secs
lola: 115463 markings, 625174 edges, 363 markings/sec, 200 secs
lola: 119834 markings, 649197 edges, 874 markings/sec, 205 secs
lola: 121008 markings, 658433 edges, 235 markings/sec, 210 secs
lola: 122755 markings, 671665 edges, 349 markings/sec, 215 secs
lola: 127208 markings, 696515 edges, 891 markings/sec, 220 secs
lola: 129340 markings, 713336 edges, 426 markings/sec, 225 secs
lola: 133571 markings, 735358 edges, 846 markings/sec, 230 secs
lola: 135082 markings, 747289 edges, 302 markings/sec, 235 secs
lola: 140077 markings, 775065 edges, 999 markings/sec, 240 secs
lola: 141425 markings, 785366 edges, 270 markings/sec, 245 secs
lola: 144118 markings, 800962 edges, 539 markings/sec, 250 secs
lola: 148104 markings, 825377 edges, 797 markings/sec, 255 secs
lola: 149876 markings, 837848 edges, 354 markings/sec, 260 secs
lola: 155033 markings, 866620 edges, 1031 markings/sec, 265 secs
lola: 156729 markings, 879315 edges, 339 markings/sec, 270 secs
lola: 162283 markings, 909356 edges, 1111 markings/sec, 275 secs
lola: 164039 markings, 921669 edges, 351 markings/sec, 280 secs
lola: 169842 markings, 953415 edges, 1161 markings/sec, 285 secs
lola: 172595 markings, 969648 edges, 551 markings/sec, 290 secs
lola: 177910 markings, 1000419 edges, 1063 markings/sec, 295 secs
lola: 182863 markings, 1025995 edges, 991 markings/sec, 300 secs
lola: 186973 markings, 1053951 edges, 822 markings/sec, 305 secs
lola: 193468 markings, 1085459 edges, 1299 markings/sec, 310 secs
lola: 195538 markings, 1101440 edges, 414 markings/sec, 315 secs
lola: 202940 markings, 1138851 edges, 1480 markings/sec, 320 secs
lola: 204708 markings, 1151253 edges, 354 markings/sec, 325 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N50-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P20N50"
export BK_EXAMINATION="CTLCardinality"
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-V50P20N50.tgz
mv BridgeAndVehicles-COL-V50P20N50 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-V50P20N50, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r031-ebro-152646309200185"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;