Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 40K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-COL-V20P20N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309200157
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526814206498


BK_STOP 1526815206537

--------------------
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-V20P20N20 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': 184774, 'Memory': 1751.99, 'Tool': 'lola'}, {'Time': 300774, 'Memory': 1990.94, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-COL-V20P20N20...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-COL-V20P20N20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V20P20N20: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ BridgeAndVehicles-COL-V20P20N20 @ 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: 1046/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 78 places, 968 transitions, 71 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1133 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: E (F ((p49 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))) : (A ((((p53 <= p49) AND (1 <= p0)) U ((p26 + p27 <= p55) OR (p49 <= p77)))) AND (NOT(A (F ((1 <= p22 + p23)))) OR ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p50) AND (p22 + p23 <= p52)))) : ((p54 <= p51) OR E (G (E (F ((2 <= p53)))))) : A (((p55 <= p22 + p23) U A (F ((3 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48))))) : A (F ((2 <= p26 + p27))) : E (F ((p77 <= p52))) : E ((E (X ((1 <= p77))) U (((3 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48) OR (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)) AND (p51 + 1 <= p77)))) : A (G (((((p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= p0) OR (2 <= p54)) AND (p24 + p25 + 1 <= p77)) AND E (X ((3 <= p54)))))) : E ((E (F ((p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= p50))) U E (G ((1 <= p49))))) : E (G ((p51 <= 2))) : ((E (G (((p22 + p23 <= p50)))) AND E (F (((p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))))) AND E (G (E (F ((2 <= p50)))))) : A (F (E (X ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p55))))) : A (G ((E (G ((2 <= p54))) OR (3 <= p0)))) : A ((TRUE U E (X ((1 <= p26 + p27))))) : E (F ((E (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))) AND A (F ((3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)))))) : (((p55 <= p54) AND (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p22 + p23 <= p0) AND ((p22 + p23 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76) OR (p0 <= p49) OR ((p26 + p27 <= p50) AND (p22 + p23 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))) AND ((p24 + p25 + 1 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48) OR (p77 <= 1) OR (3 <= p55))) OR E (F (E (G ((p53 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p49 <= 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 reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((p53 <= p49) AND (1 <= p0)) U ((p26 + p27 <= p55) OR (p49 <= p77)))) AND (NOT(A (F ((1 <= p22 + p23)))) OR ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p50) AND (p22 + p23 <= p52))))
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 ((((p53 <= p49) AND (1 <= p0)) U ((p26 + p27 <= p55) OR (p49 <= p77))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p53 <= p49) AND (1 <= p0)) U ((p26 + p27 <= p55) OR (p49 <= p77))))
lola: processed formula: A ((((p53 <= p49) AND (1 <= p0)) U ((p26 + p27 <= p55) OR (p49 <= p77))))
lola: processed formula length: 74
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 288 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p22 + p23 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p22 + p23)))
lola: processed formula length: 31
lola: 5 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 882 markings, 1281 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p50) AND (p22 + p23 <= p52))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p50) AND (p22 + p23 <= p52))
lola: processed formula length: 152
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p54 <= p51) OR E (G (E (F ((2 <= p53))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p54 <= p51)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p54 <= p51)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (2 <= p53)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 386503 markings, 1655323 edges, 77286 markings/sec, 0 secs
lola: 747130 markings, 3314504 edges, 72125 markings/sec, 5 secs
lola: 1099856 markings, 4954768 edges, 70545 markings/sec, 10 secs
lola: 1444242 markings, 6541562 edges, 68877 markings/sec, 15 secs
lola: 1783790 markings, 8112709 edges, 67910 markings/sec, 20 secs
lola: 2116425 markings, 9648654 edges, 66527 markings/sec, 25 secs
lola: 2443678 markings, 11153679 edges, 65451 markings/sec, 30 secs
lola: 2774173 markings, 12656234 edges, 66099 markings/sec, 35 secs
lola: 3094894 markings, 14181628 edges, 64144 markings/sec, 40 secs
lola: 3430683 markings, 15666917 edges, 67158 markings/sec, 45 secs
lola: 3748038 markings, 17208393 edges, 63471 markings/sec, 50 secs
lola: 4080843 markings, 18752034 edges, 66561 markings/sec, 55 secs
lola: 4400468 markings, 20192302 edges, 63925 markings/sec, 60 secs
lola: 4690245 markings, 21586353 edges, 57955 markings/sec, 65 secs
lola: 5009170 markings, 23066879 edges, 63785 markings/sec, 70 secs
lola: 5298783 markings, 24413412 edges, 57923 markings/sec, 75 secs
lola: 5616404 markings, 25910585 edges, 63524 markings/sec, 80 secs
lola: 5915763 markings, 27258898 edges, 59872 markings/sec, 85 secs
lola: 6218553 markings, 28724271 edges, 60558 markings/sec, 90 secs
lola: 6528431 markings, 30157895 edges, 61976 markings/sec, 95 secs
lola: 6818569 markings, 31495690 edges, 58028 markings/sec, 100 secs
lola: 7113337 markings, 32912302 edges, 58954 markings/sec, 105 secs
lola: 7410727 markings, 34289495 edges, 59478 markings/sec, 110 secs
lola: 7697972 markings, 35605927 edges, 57449 markings/sec, 115 secs
lola: 7988299 markings, 37016959 edges, 58065 markings/sec, 120 secs
lola: 8290072 markings, 38427734 edges, 60355 markings/sec, 125 secs
lola: 8587889 markings, 39755594 edges, 59563 markings/sec, 130 secs
lola: 8864183 markings, 41114846 edges, 55259 markings/sec, 135 secs
lola: 9164181 markings, 42550360 edges, 60000 markings/sec, 140 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9406642 markings, 43671782 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p55 <= p22 + p23) U A (F ((3 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p55 <= p22 + p23) U A(TRUE U (3 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48)))
lola: processed formula length: 164
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 169 markings, 215 edges
lola: ========================================
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p26 + p27)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p26 + p27)))
lola: processed formula: A (F ((2 <= p26 + p27)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 288 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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p77 <= p52)))
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 284 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-V20P20N20-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 6 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((1 <= p77))) U (((3 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48) OR (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)) AND (p51 + 1 <= p77))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX((1 <= p77)) U (((3 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48) OR (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)) AND (p51 + 1 <= p77)))
lola: processed formula length: 301
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 331697 markings, 1049841 edges, 2073447895104749568 markings/sec, 0 secs
lola: 661235 markings, 2171365 edges, 65908 markings/sec, 5 secs
lola: 982904 markings, 3256855 edges, 64334 markings/sec, 10 secs
lola: 1298204 markings, 4336065 edges, 63060 markings/sec, 15 secs
lola: 1610617 markings, 5413896 edges, 62483 markings/sec, 20 secs
lola: 1922606 markings, 6483157 edges, 62398 markings/sec, 25 secs
lola: 2232464 markings, 7582514 edges, 61972 markings/sec, 30 secs
lola: 2536662 markings, 8623749 edges, 60840 markings/sec, 35 secs
lola: 2841009 markings, 9666252 edges, 60869 markings/sec, 40 secs
lola: 3134596 markings, 10717453 edges, 58717 markings/sec, 45 secs
lola: 3442148 markings, 11731311 edges, 61510 markings/sec, 50 secs
lola: 3735917 markings, 12824473 edges, 58754 markings/sec, 55 secs
lola: 4036981 markings, 13903967 edges, 60213 markings/sec, 60 secs
lola: 4343710 markings, 14970610 edges, 61346 markings/sec, 65 secs
lola: 4627829 markings, 15935606 edges, 56824 markings/sec, 70 secs
lola: 4911219 markings, 16961176 edges, 56678 markings/sec, 75 secs
lola: 5200380 markings, 17976466 edges, 57832 markings/sec, 80 secs
lola: 5461474 markings, 18896082 edges, 52219 markings/sec, 85 secs
lola: 5744310 markings, 19909188 edges, 56567 markings/sec, 90 secs
lola: 6025409 markings, 20852497 edges, 56220 markings/sec, 95 secs
lola: 6285436 markings, 21818034 edges, 52005 markings/sec, 100 secs
lola: 6574168 markings, 22854243 edges, 57746 markings/sec, 105 secs
lola: 6858346 markings, 23803509 edges, 56836 markings/sec, 110 secs
lola: 7117580 markings, 24772789 edges, 51847 markings/sec, 115 secs
lola: 7396757 markings, 25778836 edges, 55835 markings/sec, 120 secs
lola: 7676194 markings, 26767017 edges, 55887 markings/sec, 125 secs
lola: 7947858 markings, 27714859 edges, 54333 markings/sec, 130 secs
lola: 8211706 markings, 28690704 edges, 52770 markings/sec, 135 secs
lola: 8494264 markings, 29707219 edges, 56512 markings/sec, 140 secs
lola: 8772037 markings, 30653939 edges, 55555 markings/sec, 145 secs
lola: 9036806 markings, 31617630 edges, 52954 markings/sec, 150 secs
lola: 9297799 markings, 32585876 edges, 52199 markings/sec, 155 secs
lola: 9581734 markings, 33607932 edges, 56787 markings/sec, 160 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9783606 markings, 34320762 edges
lola: ========================================
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= p0) OR (2 <= p54)) AND (p24 + p25 + 1 <= p77)) AND E (X ((3 <= p54))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= p0) OR (2 <= p54)) AND (p24 + p25 + 1 <= p77))))
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 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N20-CTLCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= p50))) U E (G ((1 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= p50)) U NOT(A(TRUE U (p49 <= 0))))
lola: processed formula length: 173
lola: 4 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 472634 markings, 1364640 edges, 3689348869717491712 markings/sec, 0 secs
lola: 916460 markings, 2715614 edges, 88765 markings/sec, 5 secs
lola: 1349714 markings, 4056118 edges, 86651 markings/sec, 10 secs
lola: 1776784 markings, 5367426 edges, 85414 markings/sec, 15 secs
lola: 2192428 markings, 6660112 edges, 83129 markings/sec, 20 secs
lola: 2596376 markings, 7934720 edges, 80790 markings/sec, 25 secs
lola: 2989888 markings, 9173309 edges, 78702 markings/sec, 30 secs
lola: 3408876 markings, 10475198 edges, 83798 markings/sec, 35 secs
lola: 3806165 markings, 11799627 edges, 79458 markings/sec, 40 secs
lola: 4208129 markings, 13063956 edges, 80393 markings/sec, 45 secs
lola: 4586137 markings, 14259100 edges, 75602 markings/sec, 50 secs
lola: 4986830 markings, 15485295 edges, 80139 markings/sec, 55 secs
lola: 5353983 markings, 16705549 edges, 73431 markings/sec, 60 secs
lola: 5743526 markings, 17905244 edges, 77909 markings/sec, 65 secs
lola: 6111911 markings, 19128202 edges, 73677 markings/sec, 70 secs
lola: 6504624 markings, 20326534 edges, 78543 markings/sec, 75 secs
lola: 6849835 markings, 21500471 edges, 69042 markings/sec, 80 secs
lola: 7229534 markings, 22703870 edges, 75940 markings/sec, 85 secs
lola: 7590477 markings, 23867507 edges, 72189 markings/sec, 90 secs
lola: 7956496 markings, 25075134 edges, 73204 markings/sec, 95 secs
lola: 8347424 markings, 26266985 edges, 78186 markings/sec, 100 secs
lola: 8693505 markings, 27456773 edges, 69216 markings/sec, 105 secs
lola: 9070037 markings, 28691339 edges, 75306 markings/sec, 110 secs
lola: 9278035 markings, 30106285 edges, 41600 markings/sec, 115 secs
lola: 9283224 markings, 31791845 edges, 1038 markings/sec, 120 secs
lola: 9287808 markings, 33441368 edges, 917 markings/sec, 125 secs
lola: 9292693 markings, 35035806 edges, 977 markings/sec, 130 secs
lola: 9297000 markings, 36553267 edges, 861 markings/sec, 135 secs
lola: 9301366 markings, 38093286 edges, 873 markings/sec, 140 secs
lola: 9306249 markings, 39577417 edges, 977 markings/sec, 145 secs
lola: 9310153 markings, 41087993 edges, 781 markings/sec, 150 secs
lola: 9313684 markings, 42596034 edges, 706 markings/sec, 155 secs
lola: 9319356 markings, 44073596 edges, 1134 markings/sec, 160 secs
lola: 9321300 markings, 45569639 edges, 389 markings/sec, 165 secs
lola: 9327301 markings, 47012526 edges, 1200 markings/sec, 170 secs
lola: 9328800 markings, 48618758 edges, 300 markings/sec, 175 secs
lola: 9330715 markings, 50260893 edges, 383 markings/sec, 180 secs
lola: 9333054 markings, 51874338 edges, 468 markings/sec, 185 secs
lola: 9338687 markings, 53342269 edges, 1127 markings/sec, 190 secs
lola: 9340678 markings, 54809430 edges, 398 markings/sec, 195 secs
lola: 9344906 markings, 56297827 edges, 846 markings/sec, 200 secs
lola: 9348875 markings, 57737164 edges, 794 markings/sec, 205 secs
lola: 9351473 markings, 59259939 edges, 520 markings/sec, 210 secs
lola: 9358004 markings, 60727652 edges, 1306 markings/sec, 215 secs
lola: 9359534 markings, 62164693 edges, 306 markings/sec, 220 secs
lola: 9362068 markings, 63683362 edges, 507 markings/sec, 225 secs
lola: 9368851 markings, 65145508 edges, 1357 markings/sec, 230 secs
lola: 9370273 markings, 66610470 edges, 284 markings/sec, 235 secs
lola: 9372514 markings, 68150928 edges, 448 markings/sec, 240 secs
lola: 9377104 markings, 69603918 edges, 918 markings/sec, 245 secs
lola: 9381396 markings, 71088819 edges, 858 markings/sec, 250 secs
lola: 9383143 markings, 72532169 edges, 349 markings/sec, 255 secs
lola: 9386050 markings, 74069291 edges, 581 markings/sec, 260 secs
lola: 9393107 markings, 75491571 edges, 1411 markings/sec, 265 secs
lola: 9394453 markings, 76989411 edges, 269 markings/sec, 270 secs
lola: 9396200 markings, 78488906 edges, 349 markings/sec, 275 secs
lola: 9399085 markings, 79979389 edges, 577 markings/sec, 280 secs
lola: 9406091 markings, 81342720 edges, 1401 markings/sec, 285 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9406642 markings, 81396341 edges
lola: ========================================
lola: subprocess 9 will run for 418 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p51 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p51)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 489428 markings, 1398908 edges, 3689348869717491712 markings/sec, 0 secs
lola: 920240 markings, 2736984 edges, 86162 markings/sec, 5 secs
lola: 1333452 markings, 3998571 edges, 82642 markings/sec, 10 secs
lola: 1722035 markings, 5236449 edges, 77717 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1891675 markings, 5762410 edges
lola: ========================================
lola: subprocess 10 will run for 485 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G (((p22 + p23 <= p50)))) AND E (F (((p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))))) AND E (G (E (F ((2 <= p50))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 485 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p22 + p23 <= p50))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p50 + 1 <= p22 + p23))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 74025 markings, 255954 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 581 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p55)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= p55)))
lola: processed formula length: 137
lola: 2 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 123244 markings, 399423 edges
lola: ========================================
lola: subprocess 12 will run for 726 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((2 <= p54))) OR (3 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U (p54 <= 1)) AND (p0 <= 2))))
lola: processed formula length: 51
lola: 6 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 540265 markings, 1416602 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1022685 markings, 2865738 edges, 96484 markings/sec, 5 secs
lola: 1488808 markings, 4256641 edges, 93225 markings/sec, 10 secs
lola: 1912975 markings, 5588977 edges, 84833 markings/sec, 15 secs
lola: 2336537 markings, 6915937 edges, 84712 markings/sec, 20 secs
lola: 2808672 markings, 8259422 edges, 94427 markings/sec, 25 secs
lola: 3189712 markings, 9617993 edges, 76208 markings/sec, 30 secs
lola: 3605719 markings, 11004716 edges, 83201 markings/sec, 35 secs
lola: 4010625 markings, 12286680 edges, 80981 markings/sec, 40 secs
lola: 4413696 markings, 13541593 edges, 80614 markings/sec, 45 secs
lola: 4807801 markings, 14889583 edges, 78821 markings/sec, 50 secs
lola: 5198655 markings, 16117684 edges, 78171 markings/sec, 55 secs
lola: 5580127 markings, 17387547 edges, 76294 markings/sec, 60 secs
lola: 5937776 markings, 18527274 edges, 71530 markings/sec, 65 secs
lola: 6301388 markings, 19773190 edges, 72722 markings/sec, 70 secs
lola: 6664875 markings, 20881133 edges, 72697 markings/sec, 75 secs
lola: 7026335 markings, 22152155 edges, 72292 markings/sec, 80 secs
lola: 7426021 markings, 23325652 edges, 79937 markings/sec, 85 secs
lola: 7754515 markings, 24523897 edges, 65699 markings/sec, 90 secs
lola: 8108264 markings, 25748037 edges, 70750 markings/sec, 95 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8144596 markings, 25867454 edges
lola: ========================================
lola: subprocess 13 will run for 935 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((TRUE U E (X ((1 <= p26 + p27)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((1 <= p26 + p27)))
lola: processed formula length: 30
lola: 4 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 73920 markings, 255620 edges
lola: ========================================
lola: subprocess 14 will run for 1402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))) AND A (F ((3 <= 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 CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= 0))) AND A(TRUE U (3 <= 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: 284
lola: 4 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 284 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 260850 markings, 1848072 edges, 2073447895104749568 markings/sec, 0 secs
lola: 519581 markings, 3736958 edges, 51746 markings/sec, 5 secs
lola: 771388 markings, 5592044 edges, 50361 markings/sec, 10 secs
lola: 1017147 markings, 7403029 edges, 49152 markings/sec, 15 secs
lola: 1254223 markings, 9144490 edges, 47415 markings/sec, 20 secs
lola: 1492981 markings, 10907472 edges, 47752 markings/sec, 25 secs
lola: 1729992 markings, 12683582 edges, 47402 markings/sec, 30 secs
lola: 1956614 markings, 14353067 edges, 45324 markings/sec, 35 secs
lola: 2192174 markings, 16111996 edges, 47112 markings/sec, 40 secs
lola: 2412892 markings, 17745599 edges, 44144 markings/sec, 45 secs
lola: 2642502 markings, 19467100 edges, 45922 markings/sec, 50 secs
lola: 2856848 markings, 21049678 edges, 42869 markings/sec, 55 secs
lola: 3082819 markings, 22745821 edges, 45194 markings/sec, 60 secs
lola: 3310181 markings, 24381038 edges, 45472 markings/sec, 65 secs
lola: 3526032 markings, 26035332 edges, 43170 markings/sec, 70 secs
lola: 3746417 markings, 27714409 edges, 44077 markings/sec, 75 secs
lola: 3973453 markings, 29407081 edges, 45407 markings/sec, 80 secs
lola: 4197841 markings, 31083969 edges, 44878 markings/sec, 85 secs
lola: 4409835 markings, 32622220 edges, 42399 markings/sec, 90 secs
lola: 4603511 markings, 34103603 edges, 38735 markings/sec, 95 secs
lola: 4820731 markings, 35738732 edges, 43444 markings/sec, 100 secs
lola: 5029670 markings, 37279713 edges, 41788 markings/sec, 105 secs
lola: 5221319 markings, 38720422 edges, 38330 markings/sec, 110 secs
lola: 5433082 markings, 40320590 edges, 42353 markings/sec, 115 secs
lola: 5642076 markings, 41892083 edges, 41799 markings/sec, 120 secs
lola: 5842492 markings, 43352624 edges, 40083 markings/sec, 125 secs
lola: 6031807 markings, 44807286 edges, 37863 markings/sec, 130 secs
lola: 6242403 markings, 46395496 edges, 42119 markings/sec, 135 secs
lola: 6449990 markings, 47955801 edges, 41517 markings/sec, 140 secs
lola: 6650699 markings, 49419351 edges, 40142 markings/sec, 145 secs
lola: 6838557 markings, 50866347 edges, 37572 markings/sec, 150 secs
lola: 7046011 markings, 52432388 edges, 41491 markings/sec, 155 secs
lola: 7251063 markings, 53986759 edges, 41010 markings/sec, 160 secs
lola: 7451220 markings, 55455755 edges, 40031 markings/sec, 165 secs
lola: 7645659 markings, 56924507 edges, 38888 markings/sec, 170 secs
lola: 7837115 markings, 58395098 edges, 38291 markings/sec, 175 secs
lola: 8046519 markings, 59973747 edges, 41881 markings/sec, 180 secs
lola: 8245157 markings, 61478084 edges, 39728 markings/sec, 185 secs
lola: 8441531 markings, 62911630 edges, 39275 markings/sec, 190 secs
lola: 8636302 markings, 64390848 edges, 38954 markings/sec, 195 secs
lola: 8827424 markings, 65863407 edges, 38224 markings/sec, 200 secs
lola: 9036668 markings, 67444201 edges, 41849 markings/sec, 205 secs
lola: 9233004 markings, 68938735 edges, 39267 markings/sec, 210 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9406642 markings, 70229945 edges
lola: ========================================
lola: subprocess 15 will run for 2585 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p55 <= p54) AND (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p22 + p23 <= p0) AND ((p22 + p23 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76) OR (p0 <= p49) OR ((p26 + p27 <= p50) AND (p22 + p23 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2585 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p55 <= p54) AND (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p22 + p23 <= p0) AND ((p22 + p23 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76) OR (p0 <= p49) OR ((p26 + p27 <= p50) AND (p22 + p23 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p55 <= p54) AND (3 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) AND (p22 + p23 <= p0) AND ((p22 + p23 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76) OR (p0 <= p49) OR ((p26 + p27 <= p50) AND (p22 + p23 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p... (shortened)
lola: processed formula length: 661
lola: 0 rewrites
lola: formula mentions 0 of 78 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: processed formula with 10 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no no no yes no yes no unknown
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-V20P20N20"
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-V20P20N20.tgz
mv BridgeAndVehicles-COL-V20P20N20 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-V20P20N20, 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-152646309200157"
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 ;