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 irma4mcc-full
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 r222-ebro-152732364000043
=====================================================================

--------------------
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 1527500174667


BK_STOP 1527500593324

--------------------
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-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 stderr -----
----- Start make result stdout -----
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 ((p28 + p29 <= p41)))))) : A (X ((X ((1 <= p64 + p65)) U X ((1 <= p63))))) : A ((G (G ((p63 <= p41))) U ((p64 + p65 <= p28 + p29) U (2 <= p41)))) : A ((G ((p41 <= p1)) U ((p41 <= p63) U (3 <= p63)))) : A (X (X ((3 <= p63)))) : A (X (X (G (X ((2 <= p2)))))) : A (X (F (((3 <= p64 + p65) U (2 <= p28 + p29))))) : A (F (G (X (F ((2 <= p67)))))) : A (((3 <= p63) U ((p2 <= p41) U (1 <= p2)))) : A ((p3 <= p5 + p6)) : A (F (X (G (G ((1 <= p5 + p6)))))) : A ((F (F ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40))) U G (X ((2 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62))))) : A ((3 <= p0)) : A ((3 <= p3)) : A (G ((p41 <= p3))) : A (G ((F ((p64 + p65 <= p5 + p6)) U X ((p67 <= p3)))))
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 ((p28 + p29 <= p41))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((p28 + p29 <= p41)))))
lola: processed formula: A (X (G (F ((p28 + p29 <= p41)))))
lola: processed formula length: 34
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: 634753 markings, 2081128 edges, 126951 markings/sec, 0 secs
lola: 1228608 markings, 4103063 edges, 118771 markings/sec, 5 secs
lola: 1823883 markings, 6153221 edges, 119055 markings/sec, 10 secs
lola: 2408100 markings, 8189684 edges, 116843 markings/sec, 15 secs
lola: 2964642 markings, 10145397 edges, 111308 markings/sec, 20 secs
lola: 3521256 markings, 12107388 edges, 111323 markings/sec, 25 secs
lola: 4065402 markings, 14025615 edges, 108829 markings/sec, 30 secs
lola: 4632545 markings, 16029519 edges, 113429 markings/sec, 35 secs
lola: 5198102 markings, 18029655 edges, 113111 markings/sec, 40 secs
lola: 5761902 markings, 20022833 edges, 112760 markings/sec, 45 secs
lola: 6322616 markings, 22013460 edges, 112143 markings/sec, 50 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 232 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: A (X ((X ((1 <= p64 + p65)) U X ((1 <= p63)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((1 <= p64 + p65) U (1 <= p63)))))
lola: processed formula: A (X (X (((1 <= p64 + p65) U (1 <= p63)))))
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 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p63 <= p41))) U ((p64 + p65 <= p28 + p29) U (2 <= p41))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p63 <= p41))) U ((p64 + p65 <= p28 + p29) U (2 <= p41))))
lola: processed formula: A ((G (G ((p63 <= p41))) U ((p64 + p65 <= p28 + p29) U (2 <= p41))))
lola: processed formula length: 68
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 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((p41 <= p1)) U ((p41 <= p63) U (3 <= p63))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((p41 <= p1)) U ((p41 <= p63) U (3 <= p63))))
lola: processed formula: A ((G ((p41 <= p1)) U ((p41 <= p63) U (3 <= p63))))
lola: processed formula length: 51
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 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((3 <= p63))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((3 <= p63))))
lola: processed formula: A (X (X ((3 <= p63))))
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 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (X ((2 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (G (X ((2 <= p2))))))
lola: processed formula: A (X (X (G (X ((2 <= p2))))))
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 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((3 <= p64 + p65) U (2 <= p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (((3 <= p64 + p65) U (2 <= p28 + p29)))))
lola: processed formula: A (X (F (((3 <= p64 + p65) U (2 <= p28 + p29)))))
lola: processed formula length: 49
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 386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (F ((2 <= p67))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (F ((2 <= p67))))))
lola: processed formula: A (F (G (X (F ((2 <= p67))))))
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 435 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p63) U ((p2 <= p41) U (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= p63) U ((p2 <= p41) U (1 <= p2))))
lola: processed formula: A (((3 <= p63) U ((p2 <= p41) U (1 <= p2))))
lola: processed formula length: 44
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: 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, 348057 edges
lola: ========================================
lola: subprocess 9 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p3 <= p5 + p6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 <= p5 + p6)
lola: processed formula length: 15
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 579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (G ((1 <= p5 + p6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G (G ((1 <= p5 + p6))))))
lola: processed formula: A (F (X (G (G ((1 <= p5 + p6))))))
lola: processed formula length: 34
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: 526870 markings, 2628236 edges, 105374 markings/sec, 0 secs
lola: 1006083 markings, 5144043 edges, 95843 markings/sec, 5 secs
lola: 1454068 markings, 7499220 edges, 89597 markings/sec, 10 secs
lola: 1912785 markings, 9928424 edges, 91743 markings/sec, 15 secs
lola: 2368608 markings, 12343470 edges, 91165 markings/sec, 20 secs
lola: 2811748 markings, 14713562 edges, 88628 markings/sec, 25 secs
lola: 3287260 markings, 17262887 edges, 95102 markings/sec, 30 secs
lola: 3756469 markings, 19790148 edges, 93842 markings/sec, 35 secs
lola: 4194736 markings, 22198354 edges, 87653 markings/sec, 40 secs
lola: 4642144 markings, 24616039 edges, 89482 markings/sec, 45 secs
lola: 5061594 markings, 26933505 edges, 83890 markings/sec, 50 secs
lola: 5503973 markings, 29331626 edges, 88476 markings/sec, 55 secs
lola: 5931430 markings, 31703849 edges, 85491 markings/sec, 60 secs
lola: 6391281 markings, 34198928 edges, 91970 markings/sec, 65 secs
lola: 6824877 markings, 36605154 edges, 86719 markings/sec, 70 secs
lola: 7270092 markings, 39048311 edges, 89043 markings/sec, 75 secs
lola: 7710569 markings, 41482639 edges, 88095 markings/sec, 80 secs
lola: 8122226 markings, 43781047 edges, 82331 markings/sec, 85 secs
lola: 8578905 markings, 46266855 edges, 91336 markings/sec, 90 secs
lola: 9003388 markings, 48638417 edges, 84897 markings/sec, 95 secs
lola: 9429020 markings, 50998310 edges, 85126 markings/sec, 100 secs
lola: 9881097 markings, 53481359 edges, 90415 markings/sec, 105 secs
lola: 10302332 markings, 55839043 edges, 84247 markings/sec, 110 secs
lola: 10724252 markings, 58181245 edges, 84384 markings/sec, 115 secs
lola: 11173784 markings, 60657401 edges, 89906 markings/sec, 120 secs
lola: 11593150 markings, 63006000 edges, 83873 markings/sec, 125 secs
lola: 12001063 markings, 65308830 edges, 81583 markings/sec, 130 secs
lola: 12464867 markings, 67839289 edges, 92761 markings/sec, 135 secs
lola: 12891986 markings, 70222694 edges, 85424 markings/sec, 140 secs
lola: 13297619 markings, 72513089 edges, 81127 markings/sec, 145 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 665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40))) U G (X ((2 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40)) U G (X ((2 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62)))))
lola: processed formula: A ((F ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40)) U G (X ((2 <= p61 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p62)))))
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 831 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p0)
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 13 will run for 1108 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p3)
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 1662 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p41 <= p3)))
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 3325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((p64 + p65 <= p5 + p6)) U X ((p67 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((p64 + p65 <= p5 + p6)) U X ((p67 <= p3)))))
lola: processed formula: A (G ((F ((p64 + p65 <= p5 + p6)) U X ((p67 <= p3)))))
lola: processed formula length: 54
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: 686594 markings, 2075324 edges, 137319 markings/sec, 0 secs
lola: 1328822 markings, 4059231 edges, 128446 markings/sec, 5 secs
lola: 1979795 markings, 6125765 edges, 130195 markings/sec, 10 secs
lola: 2599947 markings, 8130108 edges, 124030 markings/sec, 15 secs
lola: 3218502 markings, 10134502 edges, 123711 markings/sec, 20 secs
lola: 3827839 markings, 12124780 edges, 121867 markings/sec, 25 secs
lola: 4433215 markings, 14106847 edges, 121075 markings/sec, 30 secs
lola: 5034894 markings, 16079266 edges, 120336 markings/sec, 35 secs
lola: 5630615 markings, 18040169 edges, 119144 markings/sec, 40 secs
lola: 6175892 markings, 19937133 edges, 109055 markings/sec, 45 secs
lola: 6613740 markings, 22380176 edges, 87570 markings/sec, 50 secs
lola: 7040195 markings, 24769081 edges, 85291 markings/sec, 55 secs
lola: 7453645 markings, 27104594 edges, 82690 markings/sec, 60 secs
lola: 7857889 markings, 29460500 edges, 80849 markings/sec, 65 secs
lola: 8254879 markings, 31866626 edges, 79398 markings/sec, 70 secs
lola: 8645379 markings, 34207875 edges, 78100 markings/sec, 75 secs
lola: 9030177 markings, 36553661 edges, 76960 markings/sec, 80 secs
lola: 9405391 markings, 38862603 edges, 75043 markings/sec, 85 secs
lola: 9765937 markings, 41139404 edges, 72109 markings/sec, 90 secs
lola: 10146006 markings, 43436819 edges, 76014 markings/sec, 95 secs
lola: 10500633 markings, 45622653 edges, 70925 markings/sec, 100 secs
lola: 10871225 markings, 47948209 edges, 74118 markings/sec, 105 secs
lola: 11254380 markings, 50340374 edges, 76631 markings/sec, 110 secs
lola: 11634708 markings, 52745967 edges, 76066 markings/sec, 115 secs
lola: 12028748 markings, 55190315 edges, 78808 markings/sec, 120 secs
lola: 12401813 markings, 57563672 edges, 74613 markings/sec, 125 secs
lola: 12798382 markings, 60025311 edges, 79314 markings/sec, 130 secs
lola: 13173233 markings, 62418479 edges, 74970 markings/sec, 135 secs
lola: 13698564 markings, 64537822 edges, 105066 markings/sec, 140 secs
lola: 14209114 markings, 66651698 edges, 102110 markings/sec, 145 secs
lola: 14600742 markings, 69127699 edges, 78326 markings/sec, 150 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: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no no no yes yes yes no no no no yes
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="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-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-full"
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 r222-ebro-152732364000043"
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 ;