Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.....................
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 3.1K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 4.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 40K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BridgeAndVehicles-COL-V20P10N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r220-ebro-152732362500039
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527433729339

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P10N20 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P10N20 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V20P10N20 @ 3570 seconds
lola: LoLA will run for 3570 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-V20P10N20-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p48 + p49)
lola: LP says that atomic proposition is always false: (2 <= p22 + p23)
lola: place invariant simplifies atomic proposition
lola: before: (p47 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)
lola: after: (p47 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p73 + p72 + p71 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p74 <= p46)
lola: after: (1 <= p46)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p51 <= p73 + p72 + p71 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p74)
lola: after: (p51 <= 1)
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 <= p75)
lola: after: (1 <= p75)
lola: A ((F (X ((p45 <= p51))) U ((p75 <= p50) U FALSE))) : A (F (G ((p52 <= p76 + p77)))) : A (X (G (F ((2 <= p52))))) : A (X ((p47 <= p50))) : A ((X ((1 <= p50)) U ((3 <= p21) U FALSE))) : A ((((1 <= p48 + p49) U (2 <= p50)) U G ((p47 <= 1)))) : A (G ((X ((p46 <= p48 + p49)) U X ((2 <= p52))))) : A ((F (X ((p51 <= p45))) U FALSE)) : A (F ((F ((p47 <= p50)) U F ((3 <= p75))))) : A (G ((p76 + p77 <= p46))) : A (G ((p51 <= p50))) : A (F (G (((1 <= p53) U (p21 <= p52))))) : A (((2 <= p21) U G (F ((1 <= p46))))) : A (((TRUE U (p51 <= 1)) U F ((3 <= p45)))) : A (F ((G ((1 <= p48 + p49)) U F ((1 <= p75))))) : A (X (F ((p48 + p49 <= p75))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 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: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.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-V20P10N20-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 234 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: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.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-V20P10N20-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 251 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: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.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-V20P10N20-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((2 <= p52)) AND ((p46 <= p48 + p49) OR (2 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((2 <= p52)) AND ((p46 <= p48 + p49) OR (2 <= p52))))))
lola: processed formula length: 67
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 169 markings, 169 edges
lola:
FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p47 <= p50)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p47 <= p50)))
lola: processed formula length: 20
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 169 markings, 169 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p48 + p49 <= p75))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p48 + p49 <= p75))))
lola: processed formula length: 30
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p51 <= p50)))
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 ((p51 <= p50)))
lola: processed formula length: 20
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.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: (p50 + 1 <= p51)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P10N20-LTLCardinality-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: 35 markings, 34 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p76 + p77 <= p46)))
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 ((p76 + p77 <= p46)))
lola: processed formula length: 26
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.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: (p46 + 1 <= p76 + p77)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p45)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p45 <= 2)
lola: processed formula length: 10
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 502 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p75)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p75 <= 2)
lola: processed formula length: 10
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.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: 52757 markings, 136356 edges, 10551 markings/sec, 0 secs
lola: 109610 markings, 268895 edges, 11371 markings/sec, 5 secs
lola: 175490 markings, 464742 edges, 13176 markings/sec, 10 secs
lola: 237234 markings, 660095 edges, 12349 markings/sec, 15 secs
lola: 293885 markings, 830182 edges, 11330 markings/sec, 20 secs
lola: 307193 markings, 860441 edges, 2662 markings/sec, 25 secs
lola: 318649 markings, 884495 edges, 2291 markings/sec, 30 secs
lola: 330110 markings, 908526 edges, 2292 markings/sec, 35 secs
lola: 341923 markings, 933246 edges, 2363 markings/sec, 40 secs
lola: 352867 markings, 956103 edges, 2189 markings/sec, 45 secs
lola: 364356 markings, 980090 edges, 2298 markings/sec, 50 secs
lola: 375943 markings, 1004292 edges, 2317 markings/sec, 55 secs
lola: 389305 markings, 1032655 edges, 2672 markings/sec, 60 secs
lola: 460742 markings, 1256231 edges, 14287 markings/sec, 65 secs
lola: 529347 markings, 1486069 edges, 13721 markings/sec, 70 secs
lola: 598321 markings, 1714077 edges, 13795 markings/sec, 75 secs
lola: 651038 markings, 1874691 edges, 10543 markings/sec, 80 secs
lola: 661425 markings, 1896642 edges, 2077 markings/sec, 85 secs
lola: 672500 markings, 1919884 edges, 2215 markings/sec, 90 secs
lola: 683823 markings, 1943666 edges, 2265 markings/sec, 95 secs
lola: 695649 markings, 1968562 edges, 2365 markings/sec, 100 secs
lola: 706500 markings, 1991110 edges, 2170 markings/sec, 105 secs
lola: 717981 markings, 2015112 edges, 2296 markings/sec, 110 secs
lola: 729673 markings, 2039560 edges, 2338 markings/sec, 115 secs
lola: 742043 markings, 2065668 edges, 2474 markings/sec, 120 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 748179 markings, 2078476 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p52))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p52))))
lola: processed formula length: 22
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 11 will run for 678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p46))))
lola: processed formula length: 22
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
========================================
lola: 16282 markings, 33759 edges, 3256 markings/sec, 0 secs
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: 32692 markings, 66690 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 845 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((p21 <= p52)) AND ((1 <= p53) OR (p21 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((p21 <= p52)) AND ((1 <= p53) OR (p21 <= p52))))))
lola: processed formula length: 63
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 113060 markings, 364145 edges, 22612 markings/sec, 0 secs
lola: 292978 markings, 1087540 edges, 35984 markings/sec, 5 secs
lola: 475840 markings, 1816820 edges, 36572 markings/sec, 10 secs
lola: 664979 markings, 2562512 edges, 37828 markings/sec, 15 secs
lola: 854290 markings, 3301635 edges, 37862 markings/sec, 20 secs
lola: 1044388 markings, 4038057 edges, 38020 markings/sec, 25 secs
lola: 1238884 markings, 4798938 edges, 38899 markings/sec, 30 secs
lola: 1425228 markings, 5531666 edges, 37269 markings/sec, 35 secs
lola: 1612144 markings, 6253203 edges, 37383 markings/sec, 40 secs
lola: 1817908 markings, 7069926 edges, 41153 markings/sec, 45 secs
lola: 1996221 markings, 7781432 edges, 35663 markings/sec, 50 secs
lola: 2203319 markings, 8594992 edges, 41420 markings/sec, 55 secs
lola: 2382177 markings, 9323348 edges, 35772 markings/sec, 60 secs
lola: 2600843 markings, 10199014 edges, 43733 markings/sec, 65 secs
lola: 2768632 markings, 10884570 edges, 33558 markings/sec, 70 secs
lola: 2993949 markings, 11786098 edges, 45063 markings/sec, 75 secs
lola: 3177138 markings, 12540977 edges, 36638 markings/sec, 80 secs
lola: 3383010 markings, 13350429 edges, 41174 markings/sec, 85 secs
lola: 3604878 markings, 14303972 edges, 44374 markings/sec, 90 secs
lola: 3775745 markings, 15018004 edges, 34173 markings/sec, 95 secs
lola: 3992096 markings, 15876962 edges, 43270 markings/sec, 100 secs
lola: 4218025 markings, 16849521 edges, 45186 markings/sec, 105 secs
lola: 4391415 markings, 17584026 edges, 34678 markings/sec, 110 secs
lola: 4598127 markings, 18395461 edges, 41342 markings/sec, 115 secs
lola: 4830124 markings, 19407417 edges, 46399 markings/sec, 120 secs
lola: 5030424 markings, 20251817 edges, 40060 markings/sec, 125 secs
lola: 5196334 markings, 20996586 edges, 33182 markings/sec, 130 secs
lola: 5423430 markings, 21887056 edges, 45419 markings/sec, 135 secs
lola: 5651676 markings, 22883603 edges, 45649 markings/sec, 140 secs
lola: 5850530 markings, 23727246 edges, 39771 markings/sec, 145 secs
lola: 6014645 markings, 24473020 edges, 32823 markings/sec, 150 secs
lola: 6202387 markings, 25187298 edges, 37548 markings/sec, 155 secs
lola: 6428972 markings, 26185100 edges, 45317 markings/sec, 160 secs
lola: 6653124 markings, 27158459 edges, 44830 markings/sec, 165 secs
lola: 6830814 markings, 27925878 edges, 35538 markings/sec, 170 secs
lola: 6993045 markings, 28665683 edges, 32446 markings/sec, 175 secs
lola: 7164048 markings, 29307038 edges, 34201 markings/sec, 180 secs
lola: 7379139 markings, 30260199 edges, 43018 markings/sec, 185 secs
lola: 7610219 markings, 31268092 edges, 46216 markings/sec, 190 secs
lola: 7813909 markings, 32125724 edges, 40738 markings/sec, 195 secs
lola: 7977932 markings, 32900561 edges, 32805 markings/sec, 200 secs
lola: 8102798 markings, 33401122 edges, 24973 markings/sec, 205 secs
lola: 8265905 markings, 34064207 edges, 32621 markings/sec, 210 secs
lola: 8480165 markings, 35014333 edges, 42852 markings/sec, 215 secs
lola: 8709711 markings, 36021896 edges, 45909 markings/sec, 220 secs
lola: 8927881 markings, 36961997 edges, 43634 markings/sec, 225 secs
lola: 9096987 markings, 37723443 edges, 33821 markings/sec, 230 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9223036 markings, 38335080 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1047 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((1 <= p75)) OR (G ((1 <= p48 + p49)) AND F ((1 <= p75))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((1 <= p75)) OR (G ((1 <= p48 + p49)) AND F ((1 <= p75))))))
lola: processed formula length: 69
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 82846 markings, 317095 edges, 16569 markings/sec, 0 secs
lola: 142790 markings, 581360 edges, 11989 markings/sec, 5 secs
lola: 209447 markings, 874832 edges, 13331 markings/sec, 10 secs
lola: 274637 markings, 1162264 edges, 13038 markings/sec, 15 secs
lola: 336546 markings, 1434961 edges, 12382 markings/sec, 20 secs
lola: 412105 markings, 1768011 edges, 15112 markings/sec, 25 secs
lola: 482299 markings, 2040380 edges, 14039 markings/sec, 30 secs
lola: 580051 markings, 2399142 edges, 19550 markings/sec, 35 secs
lola: 649562 markings, 2644897 edges, 13902 markings/sec, 40 secs
lola: 724926 markings, 2897433 edges, 15073 markings/sec, 45 secs
lola: 801936 markings, 3136040 edges, 15402 markings/sec, 50 secs
lola: 873299 markings, 3332297 edges, 14273 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 876190 markings, 3343927 edges

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p52 <= p76 + p77))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p52 <= p76 + p77))))
lola: processed formula length: 30
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 169944 markings, 661024 edges, 33989 markings/sec, 0 secs
lola: 326740 markings, 1313676 edges, 31359 markings/sec, 5 secs
lola: 477025 markings, 1958437 edges, 30057 markings/sec, 10 secs
lola: 631302 markings, 2617673 edges, 30855 markings/sec, 15 secs
lola: 781269 markings, 3257739 edges, 29993 markings/sec, 20 secs
lola: 926343 markings, 3877462 edges, 29015 markings/sec, 25 secs
lola: 1079310 markings, 4524687 edges, 30593 markings/sec, 30 secs
lola: 1238479 markings, 5198279 edges, 31834 markings/sec, 35 secs
lola: 1371588 markings, 5791887 edges, 26622 markings/sec, 40 secs
lola: 1519417 markings, 6414452 edges, 29566 markings/sec, 45 secs
lola: 1666863 markings, 7063972 edges, 29489 markings/sec, 50 secs
lola: 1802450 markings, 7637394 edges, 27117 markings/sec, 55 secs
lola: 1955419 markings, 8305476 edges, 30594 markings/sec, 60 secs
lola: 2088657 markings, 8871018 edges, 26648 markings/sec, 65 secs
lola: 2240429 markings, 9537145 edges, 30354 markings/sec, 70 secs
lola: 2377512 markings, 10112409 edges, 27417 markings/sec, 75 secs
lola: 2518504 markings, 10739410 edges, 28198 markings/sec, 80 secs
lola: 2669366 markings, 11366433 edges, 30172 markings/sec, 85 secs
lola: 2786087 markings, 11891643 edges, 23344 markings/sec, 90 secs
lola: 2950639 markings, 12594852 edges, 32910 markings/sec, 95 secs
lola: 3083149 markings, 13161081 edges, 26502 markings/sec, 100 secs
lola: 3215137 markings, 13751157 edges, 26398 markings/sec, 105 secs
lola: 3378959 markings, 14428125 edges, 32764 markings/sec, 110 secs
lola: 3499204 markings, 14961838 edges, 24049 markings/sec, 115 secs
lola: 3634863 markings, 15567839 edges, 27132 markings/sec, 120 secs
lola: 3798848 markings, 16244464 edges, 32797 markings/sec, 125 secs
lola: 3919444 markings, 16779852 edges, 24119 markings/sec, 130 secs
lola: 4046204 markings, 17348182 edges, 25352 markings/sec, 135 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4196602 markings, 17995776 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2938 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p48 + p49) U (2 <= p50)) U G ((p47 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p48 + p49) U (2 <= p50)) U G ((p47 <= 1))))
lola: processed formula length: 54
lola: 28 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N20-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 59748 markings, 149904 edges, 11950 markings/sec, 0 secs
lola: 117977 markings, 295553 edges, 11646 markings/sec, 5 secs
lola: 186039 markings, 464214 edges, 13612 markings/sec, 10 secs
lola: 281418 markings, 741629 edges, 19076 markings/sec, 15 secs
lola: 380083 markings, 1052884 edges, 19733 markings/sec, 20 secs
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: 436656 markings, 1229524 edges

FORMULA BridgeAndVehicles-COL-V20P10N20-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no no no no yes no no yes no yes yes yes
lola:
preliminary result: no yes no no no no no no yes no no yes no yes yes yes
lola: ========================================
lola: memory consumption: 25420 KB
lola: time consumption: 660 seconds

BK_STOP 1527434389328

--------------------
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-V20P10N20"
export BK_EXAMINATION="LTLCardinality"
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-V20P10N20.tgz
mv BridgeAndVehicles-COL-V20P10N20 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-V20P10N20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r220-ebro-152732362500039"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;