About the Execution of LoLA for BridgeAndVehicles-COL-V20P20N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 645.340 | 1365286.00 | 1397148.00 | 262.10 | TFFFFTFFFFFTFTFT | normal |
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 lola
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 r028-ebro-152646306100157
=====================================================================
--------------------
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 1526526279933
info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P20N20 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P20N20 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ BridgeAndVehicles-COL-V20P20N20 @ 3569 seconds
lola: LoLA will run for 3569 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: Size of bit vector: 2496
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: place invariant simplifies atomic proposition
lola: before: (p77 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)
lola: after: (p77 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p49 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)
lola: after: (p49 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)
lola: after: (2 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (2 <= p75 + p76)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p74)
lola: after: (1 <= p74)
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p49)
lola: after: (1 <= p49)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p74 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)
lola: after: (p74 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 <= p72)
lola: after: (1 <= p72)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p46 + p47)
lola: after: (1 <= p46 + p47)
lola: place invariant simplifies atomic proposition
lola: before: (p44 + p45 <= p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43)
lola: after: (p44 + p45 <= 1)
lola: LP says that atomic proposition is always true: (p44 + p45 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p44 + p45 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)
lola: after: (p44 + p45 <= 1)
lola: LP says that atomic proposition is always true: (p44 + p45 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p71 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)
lola: after: (p71 <= 1)
lola: E (F ((p77 <= 1))) : (A ((((p71 <= p77) AND (1 <= p74)) U ((p75 + p76 <= p72) OR (p77 <= p73)))) AND (NOT(A (F ((1 <= p44 + p45)))) OR ((2 <= p49) AND (p44 + p45 <= p21)))) : ((p22 <= p48) OR E (G (E (F ((2 <= p71)))))) : A (((p72 <= p44 + p45) U A (F (FALSE)))) : A (F (FALSE)) : E (F ((p73 <= p21))) : E ((E (X ((1 <= p73))) U ())) : A (G (((((1 <= p74) OR (2 <= p22)) AND (p46 + p47 + 1 <= p73)) AND E (X ((3 <= p22)))))) : E ((E (F ((1 <= p49))) U E (G ((1 <= p77))))) : E (G ((p48 <= 2))) : ((E (G (((p44 + p45 <= p49)))) AND E (F (((p74 <= 1))))) AND E (G (E (F ((2 <= p49)))))) : A (F (E (X ((1 <= p72))))) : A (G ((E (G ((2 <= p22))) OR (3 <= p74)))) : A ((TRUE U E (X ((1 <= p75 + p76))))) : E (F ((E (G (TRUE)) AND A (F (FALSE))))) : (() OR E (F (E (G ((p71 <= 1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: processed formula with 0 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: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U EX((1 <= p72)))
lola: processed formula length: 24
lola: 31 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 123244 markings, 399423 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((1 <= p75 + p76)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U EX((1 <= p75 + p76)))
lola: processed formula length: 30
lola: 31 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 73920 markings, 255620 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((1 <= p74) OR (2 <= p22)) AND (p46 + p47 + 1 <= p73)))) AND A (G (E (X ((3 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p74) OR (2 <= p22)) AND (p46 + p47 + 1 <= p73))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((1 <= p74) OR (2 <= p22)) AND (p46 + p47 + 1 <= p73))))
lola: processed formula length: 64
lola: 31 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p74 <= 0) AND (p22 <= 1)) OR (p73 <= p46 + p47))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-CTLCardinality-6-0.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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p77 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((p77 <= 1)))
lola: processed formula length: 18
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (p77 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-CTLCardinality-7-0.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: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p73 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((p73 <= p21)))
lola: processed formula length: 20
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (p73 <= p21)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p48 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p48 <= 2)))
lola: processed formula length: 18
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 11352 markings, 24125 edges, 2270 markings/sec, 0 secs
lola: 20830 markings, 45319 edges, 1896 markings/sec, 5 secs
lola: 28427 markings, 62950 edges, 1519 markings/sec, 10 secs
lola: 34071 markings, 77928 edges, 1129 markings/sec, 15 secs
lola: 39991 markings, 94102 edges, 1184 markings/sec, 20 secs
lola: 46016 markings, 110629 edges, 1205 markings/sec, 25 secs
lola: 51988 markings, 126586 edges, 1194 markings/sec, 30 secs
lola: 57845 markings, 141944 edges, 1171 markings/sec, 35 secs
lola: 63724 markings, 157866 edges, 1176 markings/sec, 40 secs
lola: 69763 markings, 174261 edges, 1208 markings/sec, 45 secs
lola: 75781 markings, 190898 edges, 1204 markings/sec, 50 secs
lola: 81831 markings, 206264 edges, 1210 markings/sec, 55 secs
lola: 87816 markings, 222457 edges, 1197 markings/sec, 60 secs
lola: 93931 markings, 239030 edges, 1223 markings/sec, 65 secs
lola: 100078 markings, 255988 edges, 1229 markings/sec, 70 secs
lola: 106269 markings, 271775 edges, 1238 markings/sec, 75 secs
lola: 112448 markings, 288375 edges, 1236 markings/sec, 80 secs
lola: 118730 markings, 305546 edges, 1256 markings/sec, 85 secs
lola: 125049 markings, 322154 edges, 1264 markings/sec, 90 secs
lola: 131313 markings, 338655 edges, 1253 markings/sec, 95 secs
lola: 137707 markings, 355978 edges, 1279 markings/sec, 100 secs
lola: 144100 markings, 373434 edges, 1279 markings/sec, 105 secs
lola: 150603 markings, 390095 edges, 1301 markings/sec, 110 secs
lola: 156997 markings, 407246 edges, 1279 markings/sec, 115 secs
lola: 163503 markings, 424865 edges, 1301 markings/sec, 120 secs
lola: 169872 markings, 441576 edges, 1274 markings/sec, 125 secs
lola: 176342 markings, 458620 edges, 1294 markings/sec, 130 secs
lola: 183037 markings, 476613 edges, 1339 markings/sec, 135 secs
lola: 189584 markings, 494453 edges, 1309 markings/sec, 140 secs
lola: 196325 markings, 511578 edges, 1348 markings/sec, 145 secs
lola: 203090 markings, 529746 edges, 1353 markings/sec, 150 secs
lola: 210014 markings, 548471 edges, 1385 markings/sec, 155 secs
lola: 217028 markings, 566254 edges, 1403 markings/sec, 160 secs
lola: 224264 markings, 585675 edges, 1447 markings/sec, 165 secs
lola: 231548 markings, 604753 edges, 1457 markings/sec, 170 secs
lola: 238920 markings, 623971 edges, 1474 markings/sec, 175 secs
lola: 246480 markings, 644270 edges, 1512 markings/sec, 180 secs
lola: 254108 markings, 663873 edges, 1526 markings/sec, 185 secs
lola: 261791 markings, 684188 edges, 1537 markings/sec, 190 secs
lola: 269661 markings, 704709 edges, 1574 markings/sec, 195 secs
lola: 277730 markings, 725799 edges, 1614 markings/sec, 200 secs
lola: 285885 markings, 747625 edges, 1631 markings/sec, 205 secs
lola: 294378 markings, 769153 edges, 1699 markings/sec, 210 secs
lola: 302964 markings, 791989 edges, 1717 markings/sec, 215 secs
lola: 311796 markings, 814306 edges, 1766 markings/sec, 220 secs
lola: 320927 markings, 838047 edges, 1826 markings/sec, 225 secs
lola: 330624 markings, 863075 edges, 1939 markings/sec, 230 secs
lola: 340821 markings, 889043 edges, 2039 markings/sec, 235 secs
lola: 351467 markings, 916530 edges, 2129 markings/sec, 240 secs
lola: 362939 markings, 945870 edges, 2294 markings/sec, 245 secs
lola: 371166 markings, 963884 edges, 1645 markings/sec, 250 secs
lola: 378412 markings, 979847 edges, 1449 markings/sec, 255 secs
lola: 385813 markings, 996026 edges, 1480 markings/sec, 260 secs
lola: 393420 markings, 1012986 edges, 1521 markings/sec, 265 secs
lola: 400348 markings, 1028371 edges, 1386 markings/sec, 270 secs
lola: 407194 markings, 1043663 edges, 1369 markings/sec, 275 secs
lola: 414374 markings, 1060156 edges, 1436 markings/sec, 280 secs
lola: 422425 markings, 1077570 edges, 1610 markings/sec, 285 secs
lola: 429465 markings, 1092949 edges, 1408 markings/sec, 290 secs
lola: 436478 markings, 1109272 edges, 1403 markings/sec, 295 secs
lola: 445031 markings, 1127322 edges, 1711 markings/sec, 300 secs
lola: 451243 markings, 1141424 edges, 1242 markings/sec, 305 secs
lola: 459927 markings, 1160170 edges, 1737 markings/sec, 310 secs
lola: 466220 markings, 1174228 edges, 1259 markings/sec, 315 secs
lola: 475079 markings, 1193432 edges, 1772 markings/sec, 320 secs
lola: 481276 markings, 1207582 edges, 1239 markings/sec, 325 secs
lola: 490171 markings, 1226459 edges, 1779 markings/sec, 330 secs
lola: 496556 markings, 1241718 edges, 1277 markings/sec, 335 secs
lola: 504686 markings, 1258210 edges, 1626 markings/sec, 340 secs
lola: 512467 markings, 1275894 edges, 1556 markings/sec, 345 secs
lola: 519337 markings, 1290613 edges, 1374 markings/sec, 350 secs
lola: 528153 markings, 1309471 edges, 1763 markings/sec, 355 secs
lola: 534452 markings, 1324495 edges, 1260 markings/sec, 360 secs
lola: 541503 markings, 1339841 edges, 1410 markings/sec, 365 secs
lola: 548643 markings, 1356211 edges, 1428 markings/sec, 370 secs
lola: 555313 markings, 1372139 edges, 1334 markings/sec, 375 secs
lola: 562214 markings, 1388539 edges, 1380 markings/sec, 380 secs
lola: 568630 markings, 1404015 edges, 1283 markings/sec, 385 secs
lola: 574821 markings, 1419701 edges, 1238 markings/sec, 390 secs
lola: 582090 markings, 1436508 edges, 1454 markings/sec, 395 secs
lola: 588545 markings, 1452125 edges, 1291 markings/sec, 400 secs
lola: 595328 markings, 1468788 edges, 1357 markings/sec, 405 secs
lola: 602421 markings, 1485172 edges, 1419 markings/sec, 410 secs
lola: 608669 markings, 1500877 edges, 1250 markings/sec, 415 secs
lola: 615221 markings, 1516205 edges, 1310 markings/sec, 420 secs
lola: 622355 markings, 1533384 edges, 1427 markings/sec, 425 secs
lola: 628224 markings, 1548495 edges, 1174 markings/sec, 430 secs
lola: 636560 markings, 1566717 edges, 1667 markings/sec, 435 secs
lola: 642122 markings, 1581616 edges, 1112 markings/sec, 440 secs
lola: 649603 markings, 1598112 edges, 1496 markings/sec, 445 secs
lola: 656709 markings, 1615410 edges, 1421 markings/sec, 450 secs
lola: 662454 markings, 1630833 edges, 1149 markings/sec, 455 secs
lola: 670878 markings, 1648365 edges, 1685 markings/sec, 460 secs
lola: 677391 markings, 1664878 edges, 1303 markings/sec, 465 secs
lola: 683167 markings, 1680435 edges, 1155 markings/sec, 470 secs
lola: 691635 markings, 1697680 edges, 1694 markings/sec, 475 secs
lola: 698471 markings, 1714764 edges, 1367 markings/sec, 480 secs
lola: 704282 markings, 1730417 edges, 1162 markings/sec, 485 secs
lola: 712182 markings, 1746926 edges, 1580 markings/sec, 490 secs
lola: 720053 markings, 1765253 edges, 1574 markings/sec, 495 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown no no yes no no unknown unknown unknown yes unknown yes no unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown unknown no no yes no no unknown unknown unknown yes unknown yes no unknown
lola: memory consumption: 54332 KB
lola: time consumption: 535 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p71 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (p71 <= 1)
lola: processed formula length: 10
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 166 markings, 165 edges
lola:
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((2 <= p22))) OR (3 <= p74))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (A(TRUE U (p22 <= 1)) AND (p74 <= 2))))
lola: processed formula length: 52
lola: 35 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 537284 markings, 1097734 edges, 107457 markings/sec, 0 secs
lola: 1035070 markings, 2177655 edges, 99557 markings/sec, 5 secs
lola: 1509778 markings, 3217827 edges, 94942 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: 1899427 markings, 4077785 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 753 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((1 <= p49))) U E (G ((1 <= p77)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(E(TRUE U (1 <= p49)) U NOT(A(TRUE U (p77 <= 0))))
lola: processed formula length: 51
lola: 33 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 515581 markings, 1085019 edges, 103116 markings/sec, 0 secs
lola: 1011823 markings, 2156049 edges, 99248 markings/sec, 5 secs
lola: 1494102 markings, 3204187 edges, 96456 markings/sec, 10 secs
lola: 1969767 markings, 4233664 edges, 95133 markings/sec, 15 secs
lola: 2242400 markings, 5435986 edges, 54527 markings/sec, 20 secs
lola: 2382931 markings, 6887790 edges, 28106 markings/sec, 25 secs
lola: 2514463 markings, 8325474 edges, 26306 markings/sec, 30 secs
lola: 2644576 markings, 9762447 edges, 26023 markings/sec, 35 secs
lola: 2768342 markings, 11201558 edges, 24753 markings/sec, 40 secs
lola: 2893014 markings, 12664268 edges, 24934 markings/sec, 45 secs
lola: 3019504 markings, 14138773 edges, 25298 markings/sec, 50 secs
lola: 3146037 markings, 15613971 edges, 25307 markings/sec, 55 secs
lola: 3271739 markings, 17086256 edges, 25140 markings/sec, 60 secs
lola: 3395060 markings, 18549280 edges, 24664 markings/sec, 65 secs
lola: 3522303 markings, 20007237 edges, 25449 markings/sec, 70 secs
lola: 3650950 markings, 21436310 edges, 25729 markings/sec, 75 secs
lola: 3766306 markings, 22842280 edges, 23071 markings/sec, 80 secs
lola: 3902837 markings, 24280824 edges, 27306 markings/sec, 85 secs
lola: 4017226 markings, 25685729 edges, 22878 markings/sec, 90 secs
lola: 4153269 markings, 27102099 edges, 27209 markings/sec, 95 secs
lola: 4272736 markings, 28507741 edges, 23893 markings/sec, 100 secs
lola: 4400072 markings, 29907271 edges, 25467 markings/sec, 105 secs
lola: 4534571 markings, 31302284 edges, 26900 markings/sec, 110 secs
lola: 4642021 markings, 32673309 edges, 21490 markings/sec, 115 secs
lola: 4777747 markings, 34068100 edges, 27145 markings/sec, 120 secs
lola: 4911133 markings, 35447979 edges, 26677 markings/sec, 125 secs
lola: 5014655 markings, 36807262 edges, 20704 markings/sec, 130 secs
lola: 5149882 markings, 38181653 edges, 27045 markings/sec, 135 secs
lola: 5282726 markings, 39547590 edges, 26569 markings/sec, 140 secs
lola: 5414208 markings, 40909605 edges, 26296 markings/sec, 145 secs
lola: 5516370 markings, 42256347 edges, 20432 markings/sec, 150 secs
lola: 5651499 markings, 43628478 edges, 27026 markings/sec, 155 secs
lola: 5782862 markings, 44975783 edges, 26273 markings/sec, 160 secs
lola: 5915052 markings, 46337499 edges, 26438 markings/sec, 165 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6008436 markings, 47668268 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 946 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p22 <= p48) OR E (G (E (F ((2 <= p71))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 946 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p22 <= p48)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 <= p48)
lola: processed formula length: 12
lola: 29 rewrites
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 14 will run for 1420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= p71)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (2 <= p71)
lola: processed formula length: 10
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 511225 markings, 1123134 edges, 102245 markings/sec, 0 secs
lola: 1000917 markings, 2229622 edges, 97938 markings/sec, 5 secs
lola: 1471875 markings, 3296548 edges, 94192 markings/sec, 10 secs
lola: 1938360 markings, 4355872 edges, 93297 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: Reachability of the predicate is not possibly preserved.
lola: 2233266 markings, 5027762 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((p71 <= p77) AND (1 <= p74)) U ((p75 + p76 <= p72) OR (p77 <= p73)))) AND (E (G ((p44 + p45 <= 0))) OR ((2 <= p49) AND (p44 + p45 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p49) AND (p44 + p45 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p49) AND (p44 + p45 <= p21))
lola: processed formula length: 35
lola: 29 rewrites
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: ========================================
subprocess 15 will run for 2816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p44 + p45 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p44 + p45 <= 0)))
lola: processed formula length: 24
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 441 markings, 840 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola:
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 2816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p44 + p45 <= p49)))) AND (E (F (((p74 <= 1)))) AND E (G (E (F ((2 <= p49)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p74 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p74 <= 1))))
lola: processed formula length: 20
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p74 <= 1))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (2 <= p49)
lola: processed formula length: 10
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes no no no no yes no no no unknown unknown yes no yes no yes
lola: memory consumption: 31196 KB
lola: time consumption: 754 seconds
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: ========================================
lola: ...considering subproblem: E (G ((p48 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p48 <= 2)))
lola: processed formula length: 18
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 11464 markings, 24366 edges, 2293 markings/sec, 0 secs
lola: 20852 markings, 45375 edges, 1878 markings/sec, 5 secs
lola: 28440 markings, 62997 edges, 1518 markings/sec, 10 secs
lola: 33949 markings, 77717 edges, 1102 markings/sec, 15 secs
lola: 39667 markings, 93186 edges, 1144 markings/sec, 20 secs
lola: 45576 markings, 109390 edges, 1182 markings/sec, 25 secs
lola: 51474 markings, 125319 edges, 1180 markings/sec, 30 secs
lola: 57286 markings, 140378 edges, 1162 markings/sec, 35 secs
lola: 63095 markings, 156113 edges, 1162 markings/sec, 40 secs
lola: 69028 markings, 172345 edges, 1187 markings/sec, 45 secs
lola: 75039 markings, 188815 edges, 1202 markings/sec, 50 secs
lola: 80984 markings, 204028 edges, 1189 markings/sec, 55 secs
lola: 86876 markings, 219820 edges, 1178 markings/sec, 60 secs
lola: 92983 markings, 236541 edges, 1221 markings/sec, 65 secs
lola: 99082 markings, 253225 edges, 1220 markings/sec, 70 secs
lola: 105145 markings, 268771 edges, 1213 markings/sec, 75 secs
lola: 111232 markings, 285112 edges, 1217 markings/sec, 80 secs
lola: 117398 markings, 301817 edges, 1233 markings/sec, 85 secs
lola: 123662 markings, 318871 edges, 1253 markings/sec, 90 secs
lola: 129876 markings, 334784 edges, 1243 markings/sec, 95 secs
lola: 136149 markings, 351754 edges, 1255 markings/sec, 100 secs
lola: 142487 markings, 368937 edges, 1268 markings/sec, 105 secs
lola: 148928 markings, 385711 edges, 1288 markings/sec, 110 secs
lola: 155278 markings, 402584 edges, 1270 markings/sec, 115 secs
lola: 161799 markings, 420240 edges, 1304 markings/sec, 120 secs
lola: 168291 markings, 437895 edges, 1298 markings/sec, 125 secs
lola: 174868 markings, 454667 edges, 1315 markings/sec, 130 secs
lola: 181540 markings, 472572 edges, 1334 markings/sec, 135 secs
lola: 188201 markings, 490602 edges, 1332 markings/sec, 140 secs
lola: 194981 markings, 508001 edges, 1356 markings/sec, 145 secs
lola: 201738 markings, 525976 edges, 1351 markings/sec, 150 secs
lola: 208637 markings, 544665 edges, 1380 markings/sec, 155 secs
lola: 215698 markings, 562809 edges, 1412 markings/sec, 160 secs
lola: 222820 markings, 581787 edges, 1424 markings/sec, 165 secs
lola: 230038 markings, 601301 edges, 1444 markings/sec, 170 secs
lola: 237339 markings, 619856 edges, 1460 markings/sec, 175 secs
lola: 244794 markings, 639723 edges, 1491 markings/sec, 180 secs
lola: 252363 markings, 659311 edges, 1514 markings/sec, 185 secs
lola: 260064 markings, 679662 edges, 1540 markings/sec, 190 secs
lola: 267884 markings, 700631 edges, 1564 markings/sec, 195 secs
lola: 275923 markings, 721068 edges, 1608 markings/sec, 200 secs
lola: 284118 markings, 742886 edges, 1639 markings/sec, 205 secs
lola: 292524 markings, 764329 edges, 1681 markings/sec, 210 secs
lola: 301183 markings, 787223 edges, 1732 markings/sec, 215 secs
lola: 310142 markings, 810024 edges, 1792 markings/sec, 220 secs
lola: 319343 markings, 834351 edges, 1840 markings/sec, 225 secs
lola: 329087 markings, 858995 edges, 1949 markings/sec, 230 secs
lola: 339309 markings, 885167 edges, 2044 markings/sec, 235 secs
lola: 350025 markings, 913123 edges, 2143 markings/sec, 240 secs
lola: 361865 markings, 943077 edges, 2368 markings/sec, 245 secs
lola: 370885 markings, 963244 edges, 1804 markings/sec, 250 secs
lola: 378272 markings, 979506 edges, 1477 markings/sec, 255 secs
lola: 385647 markings, 995673 edges, 1475 markings/sec, 260 secs
lola: 393322 markings, 1012762 edges, 1535 markings/sec, 265 secs
lola: 400661 markings, 1029075 edges, 1468 markings/sec, 270 secs
lola: 407689 markings, 1044745 edges, 1406 markings/sec, 275 secs
lola: 414716 markings, 1060991 edges, 1405 markings/sec, 280 secs
lola: 422788 markings, 1078450 edges, 1614 markings/sec, 285 secs
lola: 430109 markings, 1094350 edges, 1464 markings/sec, 290 secs
lola: 436926 markings, 1110378 edges, 1363 markings/sec, 295 secs
lola: 445645 markings, 1128684 edges, 1744 markings/sec, 300 secs
lola: 451950 markings, 1142789 edges, 1261 markings/sec, 305 secs
lola: 460436 markings, 1161404 edges, 1697 markings/sec, 310 secs
lola: 467060 markings, 1175999 edges, 1325 markings/sec, 315 secs
lola: 475654 markings, 1194839 edges, 1719 markings/sec, 320 secs
lola: 482025 markings, 1208978 edges, 1274 markings/sec, 325 secs
lola: 491027 markings, 1228356 edges, 1800 markings/sec, 330 secs
lola: 497067 markings, 1242985 edges, 1208 markings/sec, 335 secs
lola: 505499 markings, 1259953 edges, 1686 markings/sec, 340 secs
lola: 512964 markings, 1277114 edges, 1493 markings/sec, 345 secs
lola: 520038 markings, 1292077 edges, 1415 markings/sec, 350 secs
lola: 529063 markings, 1311509 edges, 1805 markings/sec, 355 secs
lola: 535112 markings, 1326116 edges, 1210 markings/sec, 360 secs
lola: 542157 markings, 1341429 edges, 1409 markings/sec, 365 secs
lola: 549237 markings, 1357703 edges, 1416 markings/sec, 370 secs
lola: 555837 markings, 1373518 edges, 1320 markings/sec, 375 secs
lola: 562699 markings, 1389807 edges, 1372 markings/sec, 380 secs
lola: 569582 markings, 1406111 edges, 1377 markings/sec, 385 secs
lola: 575342 markings, 1421052 edges, 1152 markings/sec, 390 secs
lola: 582687 markings, 1438090 edges, 1469 markings/sec, 395 secs
lola: 589475 markings, 1454163 edges, 1358 markings/sec, 400 secs
lola: 595869 markings, 1470200 edges, 1279 markings/sec, 405 secs
lola: 603338 markings, 1487225 edges, 1494 markings/sec, 410 secs
lola: 609163 markings, 1502187 edges, 1165 markings/sec, 415 secs
lola: 616063 markings, 1517994 edges, 1380 markings/sec, 420 secs
lola: 622870 markings, 1534770 edges, 1361 markings/sec, 425 secs
lola: 628897 markings, 1549548 edges, 1205 markings/sec, 430 secs
lola: 637003 markings, 1567953 edges, 1621 markings/sec, 435 secs
lola: 642624 markings, 1582955 edges, 1124 markings/sec, 440 secs
lola: 650480 markings, 1599993 edges, 1571 markings/sec, 445 secs
lola: 657283 markings, 1616930 edges, 1361 markings/sec, 450 secs
lola: 663053 markings, 1632463 edges, 1154 markings/sec, 455 secs
lola: 671865 markings, 1650502 edges, 1762 markings/sec, 460 secs
lola: 677962 markings, 1666379 edges, 1219 markings/sec, 465 secs
lola: 683835 markings, 1682051 edges, 1175 markings/sec, 470 secs
lola: 692635 markings, 1699909 edges, 1760 markings/sec, 475 secs
lola: 699077 markings, 1716367 edges, 1288 markings/sec, 480 secs
lola: 704859 markings, 1731953 edges, 1156 markings/sec, 485 secs
lola: 713011 markings, 1748678 edges, 1630 markings/sec, 490 secs
lola: 720644 markings, 1766795 edges, 1527 markings/sec, 495 secs
lola: 726367 markings, 1782250 edges, 1145 markings/sec, 500 secs
lola: 733298 markings, 1797929 edges, 1386 markings/sec, 505 secs
lola: 742145 markings, 1816721 edges, 1769 markings/sec, 510 secs
lola: 748315 markings, 1832905 edges, 1234 markings/sec, 515 secs
lola: 754125 markings, 1848621 edges, 1162 markings/sec, 520 secs
lola: 761788 markings, 1864643 edges, 1533 markings/sec, 525 secs
lola: 770670 markings, 1883809 edges, 1776 markings/sec, 530 secs
lola: 776410 markings, 1899372 edges, 1148 markings/sec, 535 secs
lola: 782222 markings, 1915073 edges, 1162 markings/sec, 540 secs
lola: 789482 markings, 1929053 edges, 1452 markings/sec, 545 secs
lola: 797132 markings, 1946971 edges, 1530 markings/sec, 550 secs
lola: 804941 markings, 1965458 edges, 1562 markings/sec, 555 secs
lola: 812816 markings, 1984587 edges, 1575 markings/sec, 560 secs
lola: 821200 markings, 2004953 edges, 1677 markings/sec, 565 secs
lola: 829407 markings, 2025393 edges, 1641 markings/sec, 570 secs
lola: 837262 markings, 2045165 edges, 1571 markings/sec, 575 secs
lola: 845032 markings, 2065383 edges, 1554 markings/sec, 580 secs
lola: 851431 markings, 2081149 edges, 1280 markings/sec, 585 secs
lola: 857902 markings, 2097007 edges, 1294 markings/sec, 590 secs
lola: 863652 markings, 2112547 edges, 1150 markings/sec, 595 secs
lola: 869453 markings, 2128237 edges, 1160 markings/sec, 600 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 871947 markings, 2135038 edges
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (((p44 + p45 <= p49)))) AND (E (F (((p74 <= 1)))) AND E (G (E (F ((2 <= p49)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((p74 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p74 <= 1))))
lola: processed formula length: 20
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: The predicate is reachable.
lola: formula 0: ((p74 <= 1))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N20-CTLCardinality-17-0.sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (((p44 + p45 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p44 + p45 <= p49))))
lola: processed formula length: 28
lola: 29 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P20N20-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 13713 markings, 30531 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N20-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no no no yes no yes no yes
lola: ========================================lola:
preliminary result: yes no no no no yes no no no no no yes no yes no yes
lola: memory consumption: 27856 KB
lola: time consumption: 1365 seconds
BK_STOP 1526527645219
--------------------
content from 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="lola"
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 lola"
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 r028-ebro-152646306100157"
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 '
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 ;