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-full
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 r030-ebro-152646308200157
=====================================================================

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


BK_STOP 1526749650938

--------------------
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-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...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-COL-V20P20N20 @ 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: 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 ((p31 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) : (A ((((p21 <= p31) AND (1 <= p28)) U ((p24 + p25 <= p30) OR (p31 <= p26)))) AND (NOT(A (F ((1 <= p33 + p34)))) OR ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p32) AND (p33 + p34 <= p77)))) : ((p29 <= p27) OR E (G (E (F ((2 <= p21)))))) : A (((p30 <= p33 + p34) U A (F ((3 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76))))) : A (F ((2 <= p24 + p25))) : E (F ((p26 <= p77))) : E ((E (X ((1 <= p26))) U (((3 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76) OR (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) AND (p27 + 1 <= p26)))) : A (G (((((p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 <= p28) OR (2 <= p29)) AND (p22 + p23 + 1 <= p26)) AND E (X ((3 <= p29)))))) : E ((E (F ((p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 <= p32))) U E (G ((1 <= p31))))) : E (G ((p27 <= 2))) : ((E (G (((p33 + p34 <= p32)))) AND E (F (((p28 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))))) AND E (G (E (F ((2 <= p32)))))) : A (F (E (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p30))))) : A (G ((E (G ((2 <= p29))) OR (3 <= p28)))) : A ((TRUE U E (X ((1 <= p24 + p25))))) : E (F ((E (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) AND A (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))))) : (((p30 <= p29) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (p33 + p34 <= p28) AND ((p33 + p34 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55) OR (p28 <= p31) OR ((p24 + p25 <= p32) AND (p33 + p34 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) AND ((p22 + p23 + 1 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76) OR (p26 <= 1) OR (3 <= p30))) OR E (F (E (G ((p21 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76))))))
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 ((p31 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))
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.sara
lola: state equation: calling and running sara
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 ((((p21 <= p31) AND (1 <= p28)) U ((p24 + p25 <= p30) OR (p31 <= p26)))) AND (NOT(A (F ((1 <= p33 + p34)))) OR ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p32) AND (p33 + p34 <= p77))))
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 ((((p21 <= p31) AND (1 <= p28)) U ((p24 + p25 <= p30) OR (p31 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p21 <= p31) AND (1 <= p28)) U ((p24 + p25 <= p30) OR (p31 <= p26))))
lola: processed formula: A ((((p21 <= p31) AND (1 <= p28)) U ((p24 + p25 <= p30) OR (p31 <= p26))))
lola: processed formula length: 75
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 ((p33 + p34 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p33 + p34)))
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: ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p32) AND (p33 + p34 <= p77))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + 1 <= p32) AND (p33 + p34 <= p77))
lola: processed formula length: 151
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: ((p29 <= p27) OR E (G (E (F ((2 <= p21))))))
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: (p29 <= p27)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p29 <= p27)
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 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (2 <= p21)))))
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: 413061 markings, 1684772 edges, 2822844921466060800 markings/sec, 0 secs
lola: 795140 markings, 3349496 edges, 76416 markings/sec, 5 secs
lola: 1166235 markings, 4922448 edges, 74219 markings/sec, 10 secs
lola: 1521615 markings, 6510121 edges, 71076 markings/sec, 15 secs
lola: 1872881 markings, 8065832 edges, 70253 markings/sec, 20 secs
lola: 2233329 markings, 9651124 edges, 72090 markings/sec, 25 secs
lola: 2594572 markings, 11221802 edges, 72249 markings/sec, 30 secs
lola: 2948290 markings, 12832960 edges, 70744 markings/sec, 35 secs
lola: 3279014 markings, 14361798 edges, 66145 markings/sec, 40 secs
lola: 3636408 markings, 15922890 edges, 71479 markings/sec, 45 secs
lola: 3972333 markings, 17454611 edges, 67185 markings/sec, 50 secs
lola: 4304266 markings, 18936845 edges, 66387 markings/sec, 55 secs
lola: 4620839 markings, 20392527 edges, 63315 markings/sec, 60 secs
lola: 4938972 markings, 21814594 edges, 63627 markings/sec, 65 secs
lola: 5254866 markings, 23273883 edges, 63179 markings/sec, 70 secs
lola: 5577234 markings, 24671725 edges, 64474 markings/sec, 75 secs
lola: 5859190 markings, 26041785 edges, 56391 markings/sec, 80 secs
lola: 6174142 markings, 27581593 edges, 62990 markings/sec, 85 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6414116 markings, 28590700 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p30 <= p33 + p34) U A (F ((3 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p30 <= p33 + p34) U A(TRUE U (3 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76)))
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, 299 edges
lola: ========================================
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p24 + p25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p24 + p25)))
lola: processed formula: A (F ((2 <= p24 + p25)))
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 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p26 <= p77)))
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: 61 markings, 60 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-CTLCardinality-5.sara
lola: lola: ========================================
state equation: calling and running sara
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((1 <= p26))) U (((3 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76) OR (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) AND (p27 + 1 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX((1 <= p26)) U (((3 <= p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76) OR (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) AND (p27 + 1 <= p26)))
lola: processed formula length: 300
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
sara: try reading problem file BridgeAndVehicles-COL-V20P20N20-CTLCardinality-5.sara.
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).
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 75)
lola: 314404 markings, 1002080 edges, 2976872481744224256 markings/sec, 0 secs
lola: 616156 markings, 2018731 edges, 60350 markings/sec, 5 secs
lola: 912398 markings, 3013429 edges, 59248 markings/sec, 10 secs
lola: 1204349 markings, 4007189 edges, 58390 markings/sec, 15 secs
lola: 1486886 markings, 4994834 edges, 56507 markings/sec, 20 secs
lola: 1765085 markings, 5957844 edges, 55640 markings/sec, 25 secs
lola: 2057867 markings, 6960422 edges, 58556 markings/sec, 30 secs
lola: 2322352 markings, 7858530 edges, 52897 markings/sec, 35 secs
lola: 2615583 markings, 8905249 edges, 58646 markings/sec, 40 secs
lola: 2886092 markings, 9831960 edges, 54102 markings/sec, 45 secs
lola: 3174786 markings, 10862190 edges, 57739 markings/sec, 50 secs
lola: 3445212 markings, 11781541 edges, 54085 markings/sec, 55 secs
lola: 3745429 markings, 12858437 edges, 60043 markings/sec, 60 secs
lola: 4001855 markings, 13740809 edges, 51285 markings/sec, 65 secs
lola: 4296799 markings, 14801173 edges, 58989 markings/sec, 70 secs
lola: 4569179 markings, 15768810 edges, 54476 markings/sec, 75 secs
lola: 4841241 markings, 16689199 edges, 54412 markings/sec, 80 secs
lola: 5141391 markings, 17784178 edges, 60030 markings/sec, 85 secs
lola: 5396154 markings, 18692558 edges, 50953 markings/sec, 90 secs
lola: 5670202 markings, 19637595 edges, 54810 markings/sec, 95 secs
lola: 5941253 markings, 20593368 edges, 54210 markings/sec, 100 secs
lola: 6192919 markings, 21494151 edges, 50333 markings/sec, 105 secs
lola: 6443274 markings, 22385280 edges, 50071 markings/sec, 110 secs
lola: 6722912 markings, 23366946 edges, 55928 markings/sec, 115 secs
lola: 6988934 markings, 24311372 edges, 53204 markings/sec, 120 secs
lola: 7252585 markings, 25260931 edges, 52730 markings/sec, 125 secs
lola: 7509099 markings, 26170756 edges, 51303 markings/sec, 130 secs
lola: 7791001 markings, 27165296 edges, 56380 markings/sec, 135 secs
lola: 8063453 markings, 28142384 edges, 54490 markings/sec, 140 secs
lola: 8305609 markings, 29010347 edges, 48431 markings/sec, 145 secs
lola: 8561096 markings, 29926486 edges, 51097 markings/sec, 150 secs
lola: 8836526 markings, 30890965 edges, 55086 markings/sec, 155 secs
lola: 9117729 markings, 31942484 edges, 56241 markings/sec, 160 secs
lola: 9428381 markings, 33044416 edges, 62130 markings/sec, 165 secs
lola: 9662628 markings, 33899380 edges, 46849 markings/sec, 170 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 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 <= p28) OR (2 <= p29)) AND (p22 + p23 + 1 <= p26)) AND E (X ((3 <= p29))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 <= p28) OR (2 <= p29)) AND (p22 + p23 + 1 <= p26))))
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
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 <= p32))) U E (G ((1 <= p31)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (p75 + p74 + p73 + p72 + p71 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p76 <= p32)) U NOT(A(TRUE U (p31 <= 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: 472187 markings, 1301486 edges, 3689348869717491712 markings/sec, 0 secs
lola: 978623 markings, 2778164 edges, 101287 markings/sec, 5 secs
lola: 1465678 markings, 4205641 edges, 97411 markings/sec, 10 secs
lola: 1940031 markings, 5657026 edges, 94871 markings/sec, 15 secs
lola: 2404433 markings, 7034120 edges, 92880 markings/sec, 20 secs
lola: 2855972 markings, 8449720 edges, 90308 markings/sec, 25 secs
lola: 3290591 markings, 9809058 edges, 86924 markings/sec, 30 secs
lola: 3750366 markings, 11129261 edges, 91955 markings/sec, 35 secs
lola: 4179434 markings, 12449792 edges, 85814 markings/sec, 40 secs
lola: 4596492 markings, 13794253 edges, 83412 markings/sec, 45 secs
lola: 5021523 markings, 15100211 edges, 85006 markings/sec, 50 secs
lola: 5427279 markings, 16413932 edges, 81151 markings/sec, 55 secs
lola: 5802114 markings, 17642965 edges, 74967 markings/sec, 60 secs
lola: 6222377 markings, 19041372 edges, 84053 markings/sec, 65 secs
lola: 6335748 markings, 20783170 edges, 22674 markings/sec, 70 secs
lola: 6342535 markings, 22668270 edges, 1357 markings/sec, 75 secs
lola: 6346997 markings, 24548185 edges, 892 markings/sec, 80 secs
lola: 6353229 markings, 26309220 edges, 1246 markings/sec, 85 secs
lola: 6357735 markings, 28052672 edges, 901 markings/sec, 90 secs
lola: 6362760 markings, 29842104 edges, 1005 markings/sec, 95 secs
lola: 6364817 markings, 31654686 edges, 411 markings/sec, 100 secs
lola: 6369585 markings, 33342135 edges, 954 markings/sec, 105 secs
lola: 6374872 markings, 35077848 edges, 1057 markings/sec, 110 secs
lola: 6376657 markings, 36792274 edges, 357 markings/sec, 115 secs
lola: 6385609 markings, 38443863 edges, 1790 markings/sec, 120 secs
lola: 6387581 markings, 40172259 edges, 394 markings/sec, 125 secs
lola: 6393425 markings, 41862993 edges, 1169 markings/sec, 130 secs
lola: 6395099 markings, 43570125 edges, 335 markings/sec, 135 secs
lola: 6401124 markings, 45193318 edges, 1205 markings/sec, 140 secs
lola: 6402359 markings, 46337050 edges, 247 markings/sec, 145 secs
lola: 6403328 markings, 47240364 edges, 194 markings/sec, 150 secs
lola: 6404069 markings, 48129866 edges, 148 markings/sec, 155 secs
lola: 6405889 markings, 49642409 edges, 364 markings/sec, 160 secs
lola: 6406346 markings, 50415671 edges, 91 markings/sec, 165 secs
lola: 6408110 markings, 51840923 edges, 353 markings/sec, 170 secs
lola: 6409791 markings, 52911787 edges, 336 markings/sec, 175 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6414116 markings, 53369210 edges
lola: ========================================
lola: subprocess 9 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p27 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p27)))
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: 546056 markings, 1576458 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1031714 markings, 3057309 edges, 97132 markings/sec, 5 secs
lola: 1481364 markings, 4435928 edges, 89930 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1889173 markings, 5755204 edges
lola: ========================================
lola: subprocess 10 will run for 511 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G (((p33 + p34 <= p32)))) AND E (F (((p28 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))))) AND E (G (E (F ((2 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 511 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p33 + p34 <= p32))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p32 + 1 <= p33 + p34))))
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 613 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p30)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p30)))
lola: processed formula length: 136
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 765 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((2 <= p29))) OR (3 <= p28))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (A(TRUE U (p29 <= 1)) AND (p28 <= 2))))
lola: processed formula length: 52
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: 530832 markings, 1388397 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1003449 markings, 2804685 edges, 94523 markings/sec, 5 secs
lola: 1469981 markings, 4187480 edges, 93306 markings/sec, 10 secs
lola: 1904990 markings, 5561872 edges, 87002 markings/sec, 15 secs
lola: 2319916 markings, 6854881 edges, 82985 markings/sec, 20 secs
lola: 2734478 markings, 8126104 edges, 82912 markings/sec, 25 secs
lola: 3115541 markings, 9442757 edges, 76213 markings/sec, 30 secs
lola: 3562599 markings, 10848167 edges, 89412 markings/sec, 35 secs
lola: 3975651 markings, 12108377 edges, 82610 markings/sec, 40 secs
lola: 4366306 markings, 13467199 edges, 78131 markings/sec, 45 secs
lola: 4769289 markings, 14759714 edges, 80597 markings/sec, 50 secs
lola: 5142594 markings, 15985926 edges, 74661 markings/sec, 55 secs
lola: 5522985 markings, 17216126 edges, 76078 markings/sec, 60 secs
lola: 5897304 markings, 18441466 edges, 74864 markings/sec, 65 secs
lola: 6249107 markings, 19597361 edges, 70361 markings/sec, 70 secs
lola: 6631291 markings, 20833870 edges, 76437 markings/sec, 75 secs
lola: 6981076 markings, 21998953 edges, 69957 markings/sec, 80 secs
lola: 7392091 markings, 23227111 edges, 82203 markings/sec, 85 secs
lola: 7798999 markings, 24672198 edges, 81382 markings/sec, 90 secs
lola: 8123841 markings, 25799802 edges, 64968 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: 8143397 markings, 25864705 edges
lola: ========================================
lola: subprocess 13 will run for 987 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((TRUE U E (X ((1 <= p24 + p25)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((1 <= p24 + p25)))
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 1480 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))) AND A (F ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0))) AND A(TRUE U (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20))))
lola: processed formula length: 282
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: 264442 markings, 1819117 edges, 2976872481744224256 markings/sec, 0 secs
lola: 517559 markings, 3589778 edges, 50623 markings/sec, 5 secs
lola: 772617 markings, 5415149 edges, 51012 markings/sec, 10 secs
lola: 1018832 markings, 7177094 edges, 49243 markings/sec, 15 secs
lola: 1258147 markings, 8890114 edges, 47863 markings/sec, 20 secs
lola: 1491152 markings, 10546213 edges, 46601 markings/sec, 25 secs
lola: 1726113 markings, 12197251 edges, 46992 markings/sec, 30 secs
lola: 1977625 markings, 14083292 edges, 50302 markings/sec, 35 secs
lola: 2198020 markings, 15650619 edges, 44079 markings/sec, 40 secs
lola: 2433225 markings, 17365867 edges, 47041 markings/sec, 45 secs
lola: 2661072 markings, 19024255 edges, 45569 markings/sec, 50 secs
lola: 2903033 markings, 20814320 edges, 48392 markings/sec, 55 secs
lola: 3113725 markings, 22306898 edges, 42138 markings/sec, 60 secs
lola: 3351173 markings, 24118441 edges, 47490 markings/sec, 65 secs
lola: 3560672 markings, 25573187 edges, 41900 markings/sec, 70 secs
lola: 3781906 markings, 27192824 edges, 44247 markings/sec, 75 secs
lola: 4002997 markings, 28816431 edges, 44218 markings/sec, 80 secs
lola: 4219846 markings, 30396543 edges, 43370 markings/sec, 85 secs
lola: 4443998 markings, 32055296 edges, 44830 markings/sec, 90 secs
lola: 4663501 markings, 33678127 edges, 43901 markings/sec, 95 secs
lola: 4877365 markings, 35228043 edges, 42773 markings/sec, 100 secs
lola: 5099899 markings, 36884007 edges, 44507 markings/sec, 105 secs
lola: 5314256 markings, 38470976 edges, 42871 markings/sec, 110 secs
lola: 5526030 markings, 40014481 edges, 42355 markings/sec, 115 secs
lola: 5740226 markings, 41616016 edges, 42839 markings/sec, 120 secs
lola: 5957489 markings, 43293066 edges, 43453 markings/sec, 125 secs
lola: 6197317 markings, 45123951 edges, 47966 markings/sec, 130 secs
lola: 6398612 markings, 46515010 edges, 40259 markings/sec, 135 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6414116 markings, 46623525 edges
lola: ========================================
lola: subprocess 15 will run for 2821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p30 <= p29) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (p33 + p34 <= p28) AND ((p33 + p34 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55) OR (p28 <= p31) OR ((p24 + p25 <= p32) AND (p33 + p34 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p30 <= p29) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (p33 + p34 <= p28) AND ((p33 + p34 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55) OR (p28 <= p31) OR ((p24 + p25 <= p32) AND (p33 + p34 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p30 <= p29) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20) AND (p33 + p34 <= p28) AND ((p33 + p34 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55) OR (p28 <= p31) OR ((p24 + p25 <= p32) AND (p33 + p34 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + ... (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 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-V20P20N20"
export BK_EXAMINATION="CTLCardinality"
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-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-full"
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 r030-ebro-152646308200157"
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 ;