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 216K
-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.8K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:26 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 mcc4mcc-structural
Input is BridgeAndVehicles-COL-V20P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-ebro-152732380800043
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527796830908


BK_STOP 1527797345838

--------------------
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': 'LTLCardinality', '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': 11300, 'Memory': 343.45, 'Tool': 'lola'}, {'Time': 14450, 'Memory': 335.77, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality 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 LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ BridgeAndVehicles-COL-V20P20N10 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-LTLCardinality.task
lola: A (X (G (F (F ((p4 + p5 <= p0)))))) : A (X ((X ((1 <= p66 + p67)) U X ((1 <= p52))))) : A ((G (G ((p52 <= p0))) U ((p66 + p67 <= p4 + p5) U (2 <= p0)))) : A ((G ((p0 <= p53)) U ((p0 <= p52) U (3 <= p52)))) : A (X (X ((3 <= p52)))) : A (X (X (G (X ((2 <= p1)))))) : A (X (F (((3 <= p66 + p67) U (2 <= p4 + p5))))) : A (F (G (X (F ((2 <= p27)))))) : A (((3 <= p52) U ((p1 <= p0) U (1 <= p1)))) : A ((p2 <= p28 + p29)) : A (F (X (G (G ((1 <= p28 + p29)))))) : A ((F (F ((2 <= p63 + p62 + p61 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p64))) U G (X ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))) : A ((3 <= p51)) : A ((3 <= p2)) : A (G ((p0 <= p2))) : A (G ((F ((p66 + p67 <= p28 + p29)) U X ((p27 <= p2)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (F ((p4 + p5 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((p4 + p5 <= p0)))))
lola: processed formula: A (X (G (F ((p4 + p5 <= p0)))))
lola: processed formula length: 31
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 487384 markings, 1591724 edges, 97477 markings/sec, 0 secs
lola: 944243 markings, 3156725 edges, 91372 markings/sec, 5 secs
lola: 1393364 markings, 4700618 edges, 89824 markings/sec, 10 secs
lola: 1838776 markings, 6245959 edges, 89082 markings/sec, 15 secs
lola: 2286745 markings, 7792443 edges, 89594 markings/sec, 20 secs
lola: 2725979 markings, 9321062 edges, 87847 markings/sec, 25 secs
lola: 3150444 markings, 10803673 edges, 84893 markings/sec, 30 secs
lola: 3576487 markings, 12303410 edges, 85209 markings/sec, 35 secs
lola: 4019642 markings, 13861851 edges, 88631 markings/sec, 40 secs
lola: 4452496 markings, 15387265 edges, 86571 markings/sec, 45 secs
lola: 4877523 markings, 16888049 edges, 85005 markings/sec, 50 secs
lola: 5281715 markings, 18332526 edges, 80838 markings/sec, 55 secs
lola: 5728494 markings, 19911665 edges, 89356 markings/sec, 60 secs
lola: 6167528 markings, 21470473 edges, 87807 markings/sec, 65 secs
lola: 6581204 markings, 22958855 edges, 82735 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6732570 markings, 23489236 edges
lola: ========================================
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((1 <= p66 + p67)) U X ((1 <= p52)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((1 <= p66 + p67) U (1 <= p52)))))
lola: processed formula: A (X (X (((1 <= p66 + p67) U (1 <= p52)))))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p52 <= p0))) U ((p66 + p67 <= p4 + p5) U (2 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p52 <= p0))) U ((p66 + p67 <= p4 + p5) U (2 <= p0))))
lola: processed formula: A ((G (G ((p52 <= p0))) U ((p66 + p67 <= p4 + p5) U (2 <= p0))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((p0 <= p53)) U ((p0 <= p52) U (3 <= p52))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((p0 <= p53)) U ((p0 <= p52) U (3 <= p52))))
lola: processed formula: A ((G ((p0 <= p53)) U ((p0 <= p52) U (3 <= p52))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((3 <= p52))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((3 <= p52))))
lola: processed formula: A (X (X ((3 <= p52))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (X ((2 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (G (X ((2 <= p1))))))
lola: processed formula: A (X (X (G (X ((2 <= p1))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 6 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((3 <= p66 + p67) U (2 <= p4 + p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (((3 <= p66 + p67) U (2 <= p4 + p5)))))
lola: processed formula: A (X (F (((3 <= p66 + p67) U (2 <= p4 + p5)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (F ((2 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (F ((2 <= p27))))))
lola: processed formula: A (F (G (X (F ((2 <= p27))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 171 markings, 172 edges
lola: ========================================
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p52) U ((p1 <= p0) U (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= p52) U ((p1 <= p0) U (1 <= p1))))
lola: processed formula: A (((3 <= p52) U ((p1 <= p0) U (1 <= p1))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 43447 markings, 156126 edges, 8689 markings/sec, 0 secs
lola: 84671 markings, 296036 edges, 8245 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 100326 markings, 340569 edges
lola: ========================================
lola: subprocess 9 will run for 493 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p2 <= p28 + p29))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 <= p28 + p29)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 575 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (G ((1 <= p28 + p29))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G (G ((1 <= p28 + p29))))))
lola: processed formula: A (F (X (G (G ((1 <= p28 + p29))))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 443643 markings, 2155545 edges, 88729 markings/sec, 0 secs
lola: 834315 markings, 4254925 edges, 78134 markings/sec, 5 secs
lola: 1211383 markings, 6266131 edges, 75414 markings/sec, 10 secs
lola: 1596430 markings, 8320293 edges, 77009 markings/sec, 15 secs
lola: 1968169 markings, 10319827 edges, 74348 markings/sec, 20 secs
lola: 2338809 markings, 12323554 edges, 74128 markings/sec, 25 secs
lola: 2720395 markings, 14358848 edges, 76317 markings/sec, 30 secs
lola: 3090353 markings, 16330922 edges, 73992 markings/sec, 35 secs
lola: 3440882 markings, 18244899 edges, 70106 markings/sec, 40 secs
lola: 3837679 markings, 20383748 edges, 79359 markings/sec, 45 secs
lola: 4199831 markings, 22355058 edges, 72430 markings/sec, 50 secs
lola: 4568022 markings, 24352055 edges, 73638 markings/sec, 55 secs
lola: 4937828 markings, 26371644 edges, 73961 markings/sec, 60 secs
lola: 5302035 markings, 28365952 edges, 72841 markings/sec, 65 secs
lola: 5680619 markings, 30432407 edges, 75717 markings/sec, 70 secs
lola: 6029198 markings, 32359403 edges, 69716 markings/sec, 75 secs
lola: 6406537 markings, 34407761 edges, 75468 markings/sec, 80 secs
lola: 6772536 markings, 36426865 edges, 73200 markings/sec, 85 secs
lola: 7107997 markings, 38294668 edges, 67092 markings/sec, 90 secs
lola: 7497441 markings, 40405453 edges, 77889 markings/sec, 95 secs
lola: 7856546 markings, 42388620 edges, 71821 markings/sec, 100 secs
lola: 8197216 markings, 44293532 edges, 68134 markings/sec, 105 secs
lola: 8587688 markings, 46415180 edges, 78094 markings/sec, 110 secs
lola: 8945467 markings, 48404911 edges, 71556 markings/sec, 115 secs
lola: 9287019 markings, 50307360 edges, 68310 markings/sec, 120 secs
lola: 9672614 markings, 52415148 edges, 77119 markings/sec, 125 secs
lola: 10038039 markings, 54443930 edges, 73085 markings/sec, 130 secs
lola: 10388029 markings, 56390539 edges, 69998 markings/sec, 135 secs
lola: 10758564 markings, 58435003 edges, 74107 markings/sec, 140 secs
lola: 11140037 markings, 60541124 edges, 76295 markings/sec, 145 secs
lola: 11488662 markings, 62485429 edges, 69725 markings/sec, 150 secs
lola: 11821957 markings, 64358519 edges, 66659 markings/sec, 155 secs
lola: 12216142 markings, 66514242 edges, 78837 markings/sec, 160 secs
lola: 12583140 markings, 68547488 edges, 73400 markings/sec, 165 secs
lola: 12933237 markings, 70500647 edges, 70019 markings/sec, 170 secs
lola: 13287455 markings, 72473374 edges, 70844 markings/sec, 175 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 13458515 markings, 73422277 edges
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= p63 + p62 + p61 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p64))) U G (X ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= p63 + p62 + p61 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p64)) U G (X ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)))))
lola: processed formula: A ((F ((2 <= p63 + p62 + p61 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p64)) U G (X ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)))))
lola: processed formula length: 221
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 12 will run for 817 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p51))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p51)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.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 13 will run for 1089 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p2)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.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 14 will run for 1634 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((p66 + p67 <= p28 + p29)) U X ((p27 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((p66 + p67 <= p28 + p29)) U X ((p27 <= p2)))))
lola: processed formula: A (G ((F ((p66 + p67 <= p28 + p29)) U X ((p27 <= p2)))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 577226 markings, 1578891 edges, 115445 markings/sec, 0 secs
lola: 1097112 markings, 3201317 edges, 103977 markings/sec, 5 secs
lola: 1601615 markings, 4799785 edges, 100901 markings/sec, 10 secs
lola: 2103793 markings, 6429067 edges, 100436 markings/sec, 15 secs
lola: 2597202 markings, 8025494 edges, 98682 markings/sec, 20 secs
lola: 3087702 markings, 9625075 edges, 98100 markings/sec, 25 secs
lola: 3576768 markings, 11219691 edges, 97813 markings/sec, 30 secs
lola: 4060264 markings, 12804805 edges, 96699 markings/sec, 35 secs
lola: 4530243 markings, 14355325 edges, 93996 markings/sec, 40 secs
lola: 5005405 markings, 15926626 edges, 95032 markings/sec, 45 secs
lola: 5467165 markings, 17466925 edges, 92352 markings/sec, 50 secs
lola: 5932640 markings, 19030324 edges, 93095 markings/sec, 55 secs
lola: 6403835 markings, 20599722 edges, 94239 markings/sec, 60 secs
lola: 6866549 markings, 22137663 edges, 92543 markings/sec, 65 secs
lola: 7263128 markings, 24003931 edges, 79316 markings/sec, 70 secs
lola: 7582435 markings, 25927448 edges, 63861 markings/sec, 75 secs
lola: 7889594 markings, 27849376 edges, 61432 markings/sec, 80 secs
lola: 8183458 markings, 29717885 edges, 58773 markings/sec, 85 secs
lola: 8476101 markings, 31576093 edges, 58529 markings/sec, 90 secs
lola: 8773660 markings, 33435736 edges, 59512 markings/sec, 95 secs
lola: 9082711 markings, 35328364 edges, 61810 markings/sec, 100 secs
lola: 9381636 markings, 37149357 edges, 59785 markings/sec, 105 secs
lola: 9702557 markings, 39030463 edges, 64184 markings/sec, 110 secs
lola: 10005181 markings, 40825337 edges, 60525 markings/sec, 115 secs
lola: 10309165 markings, 42656847 edges, 60797 markings/sec, 120 secs
lola: 10607526 markings, 44440011 edges, 59672 markings/sec, 125 secs
lola: 10904581 markings, 46272694 edges, 59411 markings/sec, 130 secs
lola: 11203519 markings, 48072063 edges, 59788 markings/sec, 135 secs
lola: 11501365 markings, 49948533 edges, 59569 markings/sec, 140 secs
lola: 11801058 markings, 51790022 edges, 59939 markings/sec, 145 secs
lola: 12115050 markings, 53738362 edges, 62798 markings/sec, 150 secs
lola: 12403850 markings, 55602886 edges, 57760 markings/sec, 155 secs
lola: 12734472 markings, 57622579 edges, 66124 markings/sec, 160 secs
lola: 13026440 markings, 59524148 edges, 58394 markings/sec, 165 secs
lola: 13353621 markings, 61537127 edges, 65436 markings/sec, 170 secs
lola: 13651237 markings, 63509370 edges, 59523 markings/sec, 175 secs
lola: 13963037 markings, 65459159 edges, 62360 markings/sec, 180 secs
lola: 14273606 markings, 67475994 edges, 62114 markings/sec, 185 secs
lola: 14558696 markings, 69385021 edges, 57018 markings/sec, 190 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 14900228 markings, 71099771 edges
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no no no yes yes yes no no no no yes
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V20P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-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 mcc4mcc-structural"
echo " Input is BridgeAndVehicles-COL-V20P20N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-ebro-152732380800043"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;