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

About the Execution of Irma.full for BridgeAndVehicles-COL-V50P50N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
630.050 441381.00 804335.00 237.20 TFTTFFT?TTTFTFTF 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 208K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18: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.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 42K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is BridgeAndVehicles-COL-V50P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-ebro-152646308300194
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526752974581


BK_STOP 1526753415962

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-COL-V50P50N10 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': 1063004, 'Memory': 2643.64, 'Tool': 'lola'}, {'Time': 1063432, 'Memory': 2138.99, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-COL-V50P50N10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-COL-V50P50N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V50P50N10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ BridgeAndVehicles-COL-V50P50N10 @ 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: 1456/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality.task
lola: E (F (((p70 <= p127) AND ((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 + 1 <= p72 + p73) OR (p55 + p56 + 1 <= p70))))) : E (F ((2 <= p72 + p73))) : E (F ((p70 <= p127))) : A (G ((((2 <= p0 + p1) AND (3 <= p55 + p56) AND (p70 <= p126)) OR (p55 + p56 <= 1)))) : E (F (((1 <= p72 + p73) AND (1 <= p127) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p98 + p97 + p96 + p95 + p94 + p93 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= 0)))) : A (G (((p68 <= p72 + p73) OR (p71 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p98 + p97 + p96 + p95 + p94 + p93 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))) : E (F ((((p70 <= p127) AND (p55 + p56 <= 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)) OR (p53 + 1 <= p126) OR (3 <= p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67)))) : E (F (((p74 + 1 <= p70) AND (p70 + 1 <= p127) AND (p71 <= p55 + p56)))) : A (G (TRUE)) : E (F ((((1 <= p53) OR (2 <= p126)) AND (p70 <= p126)))) : A (G ((((1 <= p127) AND (3 <= p71)) OR (p72 + p73 <= 2) OR ((p74 + 1 <= p69) AND (p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 0))))) : E (F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p98 + p97 + p96 + p95 + p94 + p93 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p0 + p1))) : E (F ((p74 <= p68))) : E (F ((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 <= 0))) : A (G ((((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p98 + p97 + p96 + p95 + p94 + p93 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= 1) AND (p71 <= 1)) OR (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p98 + p97 + p96 + p95 + p94 + p93 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))) : A (G (((p0 + p1 <= 0) OR (p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p53) OR (p68 <= p72 + p73))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p70 <= p127) AND ((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 + 1 <= p72 + p73) OR (p55 + p56 + 1 <= p70)))))
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 484 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-V50P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p72 + p73)))
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 484 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-V50P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p70 <= p127)))
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 484 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-V50P50N10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p0 + p1) AND (3 <= p55 + p56) AND (p70 <= p126)) OR (p55 + p56 <= 1))))
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 484 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 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3.sara.
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: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p72 + p73) AND (1 <= p127) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p98 + p97 + p96 + p95 + p94 + p93 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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-V50P50N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-4.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p68 <= p72 + p73) OR (p71 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p98 + p97 + p96 + p95 + p94 + p93 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + 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 484 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-V50P50N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 231 markings, 230 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p70 <= p127) AND (p55 + p56 <= 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)) OR (p53 + 1 <= p126) OR (3 <= p57 + p58 + p59 + p60 + p61 + ... (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 484 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 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p74 + 1 <= p70) AND (p70 + 1 <= p127) AND (p71 <= p55 + p56))))
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 484 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-V50P50N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 22370 markings, 51445 edges, 4474 markings/sec, 0 secs
lola: sara is running 5 secs || 43670 markings, 102371 edges, 4260 markings/sec, 5 secs
lola: sara is running 10 secs || 65182 markings, 153778 edges, 4302 markings/sec, 10 secs
lola: sara is running 15 secs || 89810 markings, 215037 edges, 4926 markings/sec, 15 secs
lola: sara is running 20 secs || 113872 markings, 274553 edges, 4812 markings/sec, 20 secs
lola: sara is running 25 secs || 137011 markings, 331413 edges, 4628 markings/sec, 25 secs
lola: sara is running 30 secs || 152206 markings, 370692 edges, 3039 markings/sec, 30 secs
lola: sara is running 35 secs || 165900 markings, 407498 edges, 2739 markings/sec, 35 secs
lola: sara is running 40 secs || 185168 markings, 454518 edges, 3854 markings/sec, 40 secs
lola: sara is running 45 secs || 196642 markings, 483753 edges, 2295 markings/sec, 45 secs
lola: sara is running 50 secs || 212385 markings, 527568 edges, 3149 markings/sec, 50 secs
lola: sara is running 55 secs || 223703 markings, 556873 edges, 2264 markings/sec, 55 secs
lola: sara is running 60 secs || 240000 markings, 600938 edges, 3259 markings/sec, 60 secs
lola: sara is running 65 secs || 249556 markings, 627990 edges, 1911 markings/sec, 65 secs
lola: sara is running 70 secs || 265804 markings, 671535 edges, 3250 markings/sec, 70 secs
lola: sara is running 75 secs || 276931 markings, 702274 edges, 2225 markings/sec, 75 secs
lola: sara is running 80 secs || 292083 markings, 742256 edges, 3030 markings/sec, 80 secs
lola: sara is running 85 secs || 307403 markings, 783763 edges, 3064 markings/sec, 85 secs
lola: sara is running 90 secs || 318775 markings, 816080 edges, 2274 markings/sec, 90 secs
lola: sara is running 95 secs || 332301 markings, 851688 edges, 2705 markings/sec, 95 secs
lola: sara is running 100 secs || 346634 markings, 891177 edges, 2867 markings/sec, 100 secs
lola: sara is running 105 secs || 361830 markings, 931189 edges, 3039 markings/sec, 105 secs
lola: sara is running 110 secs || 374862 markings, 968210 edges, 2606 markings/sec, 110 secs
lola: sara is running 115 secs || 387291 markings, 1000494 edges, 2486 markings/sec, 115 secs
lola: sara is running 120 secs || 400908 markings, 1034920 edges, 2723 markings/sec, 120 secs
lola: sara is running 125 secs || 420595 markings, 1085374 edges, 3937 markings/sec, 125 secs
lola: sara is running 130 secs || 437661 markings, 1126415 edges, 3413 markings/sec, 130 secs
lola: sara is running 135 secs || 446146 markings, 1149954 edges, 1697 markings/sec, 135 secs
lola: sara is running 140 secs || 457571 markings, 1183172 edges, 2285 markings/sec, 140 secs
lola: sara is running 145 secs || 470393 markings, 1218871 edges, 2564 markings/sec, 145 secs
lola: sara is running 150 secs || 489399 markings, 1271279 edges, 3801 markings/sec, 150 secs
lola: sara is running 155 secs || 500085 markings, 1302558 edges, 2137 markings/sec, 155 secs
lola: sara is running 160 secs || 517443 markings, 1350882 edges, 3472 markings/sec, 160 secs
lola: sara is running 165 secs || 529340 markings, 1384760 edges, 2379 markings/sec, 165 secs
lola: sara is running 170 secs || 544424 markings, 1428610 edges, 3017 markings/sec, 170 secs
lola: sara is running 175 secs || 557466 markings, 1464862 edges, 2608 markings/sec, 175 secs
lola: sara is running 180 secs || 569468 markings, 1498777 edges, 2400 markings/sec, 180 secs
lola: sara is running 185 secs || 586684 markings, 1547008 edges, 3443 markings/sec, 185 secs
lola: sara is running 190 secs || 598276 markings, 1580111 edges, 2318 markings/sec, 190 secs
lola: sara is running 195 secs || 615075 markings, 1627259 edges, 3360 markings/sec, 195 secs
lola: sara is running 200 secs || 630238 markings, 1670628 edges, 3033 markings/sec, 200 secs
lola: sara is running 205 secs || 643010 markings, 1705797 edges, 2554 markings/sec, 205 secs
lola: sara is running 210 secs || 659093 markings, 1750750 edges, 3217 markings/sec, 210 secs
lola: sara is running 215 secs || 671374 markings, 1785609 edges, 2456 markings/sec, 215 secs
lola: sara is running 220 secs || 687713 markings, 1831166 edges, 3268 markings/sec, 220 secs
lola: sara is running 225 secs || 698960 markings, 1864242 edges, 2249 markings/sec, 225 secs
lola: sara is running 230 secs || 713582 markings, 1901793 edges, 2924 markings/sec, 230 secs
lola: sara is running 235 secs || 725489 markings, 1933791 edges, 2381 markings/sec, 235 secs
lola: sara is running 240 secs || 736563 markings, 1961302 edges, 2215 markings/sec, 240 secs
lola: sara is running 245 secs || 748636 markings, 1992592 edges, 2415 markings/sec, 245 secs
lola: sara is running 250 secs || 767264 markings, 2040819 edges, 3726 markings/sec, 250 secs
lola: sara is running 255 secs || 782865 markings, 2081008 edges, 3120 markings/sec, 255 secs
lola: sara is running 260 secs || 789271 markings, 2101642 edges, 1281 markings/sec, 260 secs
lola: sara is running 265 secs || 799412 markings, 2130774 edges, 2028 markings/sec, 265 secs
lola: sara is running 270 secs || 808261 markings, 2156891 edges, 1770 markings/sec, 270 secs
lola: sara is running 275 secs || 826550 markings, 2205009 edges, 3658 markings/sec, 275 secs
lola: sara is running 280 secs || 839515 markings, 2239738 edges, 2593 markings/sec, 280 secs
lola: sara is running 285 secs || 847019 markings, 2262714 edges, 1501 markings/sec, 285 secs
lola: sara is running 290 secs || 856298 markings, 2289997 edges, 1856 markings/sec, 290 secs
lola: sara is running 295 secs || 869163 markings, 2327275 edges, 2573 markings/sec, 295 secs
lola: sara is running 300 secs || 886528 markings, 2370366 edges, 3473 markings/sec, 300 secs
lola: sara is running 305 secs || 895060 markings, 2395414 edges, 1706 markings/sec, 305 secs
lola: sara is running 310 secs || 905314 markings, 2425243 edges, 2051 markings/sec, 310 secs
lola: sara is running 315 secs || 913605 markings, 2450205 edges, 1658 markings/sec, 315 secs
lola: sara is running 320 secs || 931629 markings, 2496998 edges, 3605 markings/sec, 320 secs
lola: sara is running 325 secs || 943423 markings, 2529645 edges, 2359 markings/sec, 325 secs
lola: sara is running 330 secs || 952558 markings, 2556419 edges, 1827 markings/sec, 330 secs
lola: sara is running 335 secs || 961306 markings, 2582407 edges, 1750 markings/sec, 335 secs
lola: sara is running 340 secs || 977492 markings, 2625047 edges, 3237 markings/sec, 340 secs
lola: sara is running 345 secs || 990521 markings, 2660341 edges, 2606 markings/sec, 345 secs
lola: sara is running 350 secs || 999237 markings, 2686234 edges, 1743 markings/sec, 350 secs
lola: sara is running 355 secs || 1008183 markings, 2712701 edges, 1789 markings/sec, 355 secs
lola: sara is running 360 secs || 1024630 markings, 2755901 edges, 3289 markings/sec, 360 secs
lola: sara is running 365 secs || 1036495 markings, 2788501 edges, 2373 markings/sec, 365 secs
lola: sara is running 370 secs || 1046374 markings, 2817130 edges, 1976 markings/sec, 370 secs
lola: sara is running 375 secs || 1054204 markings, 2841180 edges, 1566 markings/sec, 375 secs
lola: sara is running 380 secs || 1073631 markings, 2890657 edges, 3885 markings/sec, 380 secs
lola: sara is running 385 secs || 1082013 markings, 2915734 edges, 1676 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P50N10-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 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p53) OR (2 <= p126)) AND (p70 <= p126))))
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 484 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-V50P50N10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p127) AND (3 <= p71)) OR (p72 + p73 <= 2) OR ((p74 + 1 <= p69) AND (p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 0)))))
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 484 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10.sara.
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: ========================================
lola: subprocess 11 will run for 628 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p98 + p97 + p96 + p95 + p94 + p93 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p0 + p1)))
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 484 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-V50P50N10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-11.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 12 will run for 785 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p74 <= p68)))
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 484 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-V50P50N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 326 markings, 325 edges
lola: ========================================
lola: subprocess 13 will run for 1047 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((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 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 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: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13.sara
lola: ========================================
lola: subprocess 14 will run for 1571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p98 + p97 + p96 + p95 + p94 + p93 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 <= 1) AND (p71 <= 1)) OR (1 <= p100 + p101 + p102 + p103 + 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 484 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-V50P50N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14.sara.
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: ========================================
lola: subprocess 15 will run for 3142 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 + p1 <= 0) OR (p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p53) OR (p68 <= p72 + p73))))
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 484 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-V50P50N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 84 markings, 83 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no yes unknown yes yes yes no yes no yes no
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P50N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P50N10.tgz
mv BridgeAndVehicles-COL-V50P50N10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is BridgeAndVehicles-COL-V50P50N10, 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 r030-ebro-152646308300194"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;