Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.....................
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 39K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-COL-V20P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309200150
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526813301441


BK_STOP 1526813542180

--------------------
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-V20P20N10 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': 297195, 'Memory': 1145.86, 'Tool': 'lola'}, {'Time': 303712, 'Memory': 1177.64, 'Tool': 'lola'}, {'Time': 1769501, 'Memory': 1743.46, 'Tool': 'gspn'}, {'Time': 1788558, 'Memory': 1713.3, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-COL-V20P20N10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-COL-V20P20N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V20P20N10: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-COL-V20P20N10 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: ((2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) OR A (F (((p63 + 1 <= p29) AND (3 <= p63))))) : ((A (G (((p67 <= p29) OR (2 <= p28)))) OR (E (F ((p26 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40))) OR (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40))) AND (NOT(A (G ((p24 + p25 <= p63)))) OR (p64 <= 2))) : NOT(E (G ((((p29 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p65 + p66 <= p62)) OR (p0 <= 2))))) : A (G ((1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40))) : (A (G ((p27 <= p28))) AND (E (((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p22 + p23) U (3 <= p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61))) AND ((p0 <= 0) AND ((p64 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) OR (3 <= p26)) AND (p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 <= 1)))) : E ((E (X ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p22 + p23))) U E (G ((p65 + p66 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40))))) : A (G (((1 <= p26) OR ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61) AND (p27 <= 0))))) : (E (((p63 <= p27) U (p26 <= p63))) AND ((E (G ((1 <= p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61))) AND A (F ((p27 <= p0)))) OR (p62 <= p0))) : E (G ((1 <= p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61))) : (A (G (A (F ((p65 + p66 <= p62))))) OR (E (((3 <= p64) U (2 <= p65 + p66))) OR (1 <= p63))) : A ((A (F ((2 <= p62))) U ((3 <= p27) AND (2 <= p28) AND (3 <= p67)))) : E (X (E (F (((3 <= p63) AND (p28 <= p62)))))) : A (F (((p65 + p66 <= p26) AND (p64 <= p27) AND ((p29 <= p28) OR (2 <= p26)) AND ((p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 <= p0) OR (2 <= p63) OR (2 <= p0))))) : (E (F (((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40) OR (p24 + p25 <= p0) OR (p67 <= 1)))) AND E (X (E (G ((p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 <= p22 + p23)))))) : A (G (NOT(E (F ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)))))) : A ((A (F ((2 <= p22 + p23))) U (2 <= p63)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) OR A (F (((p63 + 1 <= p29) AND (3 <= p63)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)
lola: processed formula length: 121
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p63 + 1 <= p29) AND (3 <= p63))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p63 + 1 <= p29) AND (3 <= p63))))
lola: processed formula: A (F (((p63 + 1 <= p29) AND (3 <= p63))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 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: 176 markings, 176 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((p67 <= p29) OR (2 <= p28)))) OR (E (F ((p26 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40))) OR (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40))) AND (NOT(A (G ((p24 + p25 <= p63)))) OR (p64 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p67 <= p29) OR (2 <= p28))))
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 244 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p26 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40)))
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 244 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-V20P20N10-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 1)
lola: sara is running 0 secs || 74724 markings, 184093 edges, 14945 markings/sec, 0 secs
lola: sara is running 5 secs || 146291 markings, 371621 edges, 14313 markings/sec, 5 secs
lola: sara is running 10 secs || 218123 markings, 563524 edges, 14366 markings/sec, 10 secs
lola: sara is running 15 secs || 289144 markings, 754695 edges, 14204 markings/sec, 15 secs
lola: sara is running 20 secs || 357471 markings, 940238 edges, 13665 markings/sec, 20 secs
lola: sara is running 25 secs || 427058 markings, 1127305 edges, 13917 markings/sec, 25 secs
lola: sara is running 30 secs || 495848 markings, 1314535 edges, 13758 markings/sec, 30 secs
lola: sara is running 35 secs || 563724 markings, 1503650 edges, 13575 markings/sec, 35 secs
lola: sara is running 40 secs || 632626 markings, 1688468 edges, 13780 markings/sec, 40 secs
lola: sara is running 45 secs || 701177 markings, 1873730 edges, 13710 markings/sec, 45 secs
lola: sara is running 50 secs || 767898 markings, 2058601 edges, 13344 markings/sec, 50 secs
lola: sara is running 55 secs || 836670 markings, 2243517 edges, 13754 markings/sec, 55 secs
lola: sara is running 60 secs || 903509 markings, 2430858 edges, 13368 markings/sec, 60 secs
lola: sara is running 65 secs || 971999 markings, 2612612 edges, 13698 markings/sec, 65 secs
lola: sara is running 70 secs || 1038555 markings, 2800003 edges, 13311 markings/sec, 70 secs
lola: sara is running 75 secs || 1106768 markings, 2981760 edges, 13643 markings/sec, 75 secs
lola: sara is running 80 secs || 1172645 markings, 3165836 edges, 13175 markings/sec, 80 secs
lola: sara is running 85 secs || 1240724 markings, 3349522 edges, 13616 markings/sec, 85 secs
lola: sara is running 90 secs || 1311177 markings, 3544951 edges, 14091 markings/sec, 90 secs
lola: sara is running 95 secs || 1380355 markings, 3739008 edges, 13836 markings/sec, 95 secs
lola: sara is running 100 secs || 1448050 markings, 3931668 edges, 13539 markings/sec, 100 secs
lola: sara is running 105 secs || 1517026 markings, 4124174 edges, 13795 markings/sec, 105 secs
lola: sara is running 110 secs || 1590680 markings, 4318932 edges, 14731 markings/sec, 110 secs
lola: sara is running 115 secs || 1660503 markings, 4517538 edges, 13965 markings/sec, 115 secs
lola: sara is running 120 secs || 1729925 markings, 4713050 edges, 13884 markings/sec, 120 secs
lola: sara is running 125 secs || 1797799 markings, 4907174 edges, 13575 markings/sec, 125 secs
lola: sara is running 130 secs || 1867965 markings, 5100492 edges, 14033 markings/sec, 130 secs
lola: sara is running 135 secs || 1941376 markings, 5297485 edges, 14682 markings/sec, 135 secs
lola: sara is running 140 secs || 2011665 markings, 5497221 edges, 14058 markings/sec, 140 secs
lola: sara is running 145 secs || 2081050 markings, 5694359 edges, 13877 markings/sec, 145 secs
lola: sara is running 150 secs || 2149807 markings, 5887297 edges, 13751 markings/sec, 150 secs
lola: sara is running 155 secs || 2218274 markings, 6086746 edges, 13693 markings/sec, 155 secs
lola: sara is running 160 secs || 2290545 markings, 6279754 edges, 14454 markings/sec, 160 secs
lola: sara is running 165 secs || 2364129 markings, 6483033 edges, 14717 markings/sec, 165 secs
lola: sara is running 170 secs || 2434636 markings, 6683315 edges, 14101 markings/sec, 170 secs
lola: sara is running 175 secs || 2503146 markings, 6880791 edges, 13702 markings/sec, 175 secs
lola: sara is running 180 secs || 2573623 markings, 7078033 edges, 14095 markings/sec, 180 secs
lola: sara is running 185 secs || 2642088 markings, 7277965 edges, 13693 markings/sec, 185 secs
lola: sara is running 190 secs || 2714492 markings, 7471491 edges, 14481 markings/sec, 190 secs
lola: sara is running 195 secs || 2788055 markings, 7674379 edges, 14713 markings/sec, 195 secs
lola: sara is running 200 secs || 2858806 markings, 7876400 edges, 14150 markings/sec, 200 secs
lola: sara is running 205 secs || 2928962 markings, 8075143 edges, 14031 markings/sec, 205 secs
lola: sara is running 210 secs || 2997709 markings, 8274563 edges, 13749 markings/sec, 210 secs
lola: sara is running 215 secs || 3068422 markings, 8475398 edges, 14143 markings/sec, 215 secs
lola: sara is running 220 secs || 3138184 markings, 8673098 edges, 13952 markings/sec, 220 secs
lola: sara is running 225 secs || 3210346 markings, 8867019 edges, 14432 markings/sec, 225 secs
lola: sara is running 230 secs || 3284317 markings, 9074047 edges, 14794 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
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-V20P20N10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-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-V20P20N10"
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-V20P20N10.tgz
mv BridgeAndVehicles-COL-V20P20N10 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-V20P20N10, 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-152646309200150"
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 ;