Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r022-csrt-155225094500113.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is BridgeAndVehicles-COL-V20P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-csrt-155225094500113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 4.2K Feb 9 07:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 9 07:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 5 04:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 5 04:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 118 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 356 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.9K Feb 4 22:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 2 01:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 2 01:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Jan 29 12:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Jan 29 12:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 39K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552404012354

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P10N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-COL-V20P10N10 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V20P10N10 @ 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: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P10N10-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p66 + p67)
lola: place invariant simplifies atomic proposition
lola: before: (p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= p62 + p61 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p63)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p19 + p20 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11)
lola: after: (p19 + p20 <= 1)
lola: LP says that atomic proposition is always true: (p19 + p20 <= 1)
lola: LP says that atomic proposition is always false: (3 <= p66 + p67)
lola: place invariant simplifies atomic proposition
lola: before: (p18 <= p62 + p61 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p63)
lola: after: (p18 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p14 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)
lola: after: (p14 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p65 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)
lola: after: (p65 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p62 + p61 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p63)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 <= p64)
lola: after: (1 <= p64)
lola: A (G (FALSE)) : A (TRUE) : A (X (TRUE)) : A ((G (X ((p17 <= p0))) U ((p21 <= p65) U (1 <= p65)))) : A ((1 <= p12 + p13)) : A (G ((X ((p18 <= p15)) U FALSE))) : A (F ((p65 <= p14))) : A (((1 <= p14) U ((2 <= p64) U (p15 <= p0)))) : A (F ((X ((1 <= p65)) U X ((p19 + p20 <= p12 + p13))))) : A (F (F (G (G ((p18 <= 1)))))) : A ((p16 <= p18)) : A ((p14 <= 1)) : A ((p14 <= p21)) : A (G ((F ((p18 <= p12 + p13)) U G ((p65 <= 1))))) : A (F (X (G (X (TRUE))))) : A ((G (X ((1 <= p64))) U ((1 <= p64) U (1 <= p12 + p13))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p12 + p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p12 + p13)
lola: processed formula length: 16
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-4 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: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-LTLCardinality-5 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: (p16 <= p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p16 <= p18)
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p14 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 <= 1)
lola: processed formula length: 10
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p14 <= p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 <= p21)
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 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-V20P10N10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((p17 <= p0))) U ((p21 <= p65) U (1 <= p65))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((p17 <= p0))) U ((p21 <= p65) U (1 <= p65))))
lola: processed formula length: 55
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: 170 markings, 170 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p19 + p20 <= p12 + p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p19 + p20 <= p12 + p13))))
lola: processed formula length: 36
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 884 markings, 1283 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 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-V20P10N10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((1 <= p64))) U ((1 <= p64) U (1 <= p12 + p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((1 <= p64))) U ((1 <= p64) U (1 <= p12 + p13))))
lola: processed formula length: 58
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: 170 markings, 170 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p65 <= p14)))
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: (p14 + 1 <= p65)
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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-V20P10N10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p18 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p18 <= 1))))
lola: processed formula length: 22
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 254843 markings, 910468 edges, 50969 markings/sec, 0 secs
lola: 585227 markings, 2287845 edges, 66077 markings/sec, 5 secs
lola: 909947 markings, 3666698 edges, 64944 markings/sec, 10 secs
lola: 1258426 markings, 5164153 edges, 69696 markings/sec, 15 secs
lola: 1604870 markings, 6666989 edges, 69289 markings/sec, 20 secs
lola: 1968796 markings, 8257148 edges, 72785 markings/sec, 25 secs
lola: 2357444 markings, 9969906 edges, 77730 markings/sec, 30 secs
lola: 2755051 markings, 11724840 edges, 79521 markings/sec, 35 secs
lola: 3157926 markings, 13517246 edges, 80575 markings/sec, 40 secs
lola: 3562506 markings, 15315416 edges, 80916 markings/sec, 45 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: 3607436 markings, 15514096 edges

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p14) U ((2 <= p64) U (p15 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p14) U ((2 <= p64) U (p15 <= p0))))
lola: processed formula length: 45
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((p65 <= 1)))) AND A (G ((F ((p18 <= p12 + p13)) OR G ((p65 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p65 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p65 <= 1))))
lola: processed formula length: 22
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 153266 markings, 720052 edges, 30653 markings/sec, 0 secs
lola: 315879 markings, 1593915 edges, 32523 markings/sec, 5 secs
lola: 474156 markings, 2469184 edges, 31655 markings/sec, 10 secs
lola: 635088 markings, 3364479 edges, 32186 markings/sec, 15 secs
lola: 796921 markings, 4272026 edges, 32367 markings/sec, 20 secs
lola: 972850 markings, 5293477 edges, 35186 markings/sec, 25 secs
lola: 1140739 markings, 6216124 edges, 33578 markings/sec, 30 secs
lola: 1301089 markings, 7106327 edges, 32070 markings/sec, 35 secs
lola: 1465474 markings, 8064590 edges, 32877 markings/sec, 40 secs
lola: 1618874 markings, 8894614 edges, 30680 markings/sec, 45 secs
lola: 1795544 markings, 9933114 edges, 35334 markings/sec, 50 secs
lola: 1958848 markings, 10795204 edges, 32661 markings/sec, 55 secs
lola: 2137331 markings, 11819051 edges, 35697 markings/sec, 60 secs
lola: 2291337 markings, 12640032 edges, 30801 markings/sec, 65 secs
lola: 2450390 markings, 13546269 edges, 31811 markings/sec, 70 secs
lola: 2608508 markings, 14425697 edges, 31624 markings/sec, 75 secs
lola: 2764431 markings, 15280523 edges, 31185 markings/sec, 80 secs
lola: 2925402 markings, 16204146 edges, 32194 markings/sec, 85 secs
lola: 3069161 markings, 16964438 edges, 28752 markings/sec, 90 secs
lola: 3227514 markings, 17861100 edges, 31671 markings/sec, 95 secs
lola: 3390000 markings, 18804663 edges, 32497 markings/sec, 100 secs
lola: 3527689 markings, 19506165 edges, 27538 markings/sec, 105 secs
lola: 3694472 markings, 20451388 edges, 33357 markings/sec, 110 secs
lola: 3873022 markings, 21500945 edges, 35710 markings/sec, 115 secs
lola: 4016286 markings, 22222535 edges, 28653 markings/sec, 120 secs
lola: 4182393 markings, 23162076 edges, 33221 markings/sec, 125 secs
lola: 4360423 markings, 24206652 edges, 35606 markings/sec, 130 secs
lola: 4500687 markings, 24905633 edges, 28053 markings/sec, 135 secs
lola: 4668900 markings, 25865129 edges, 33643 markings/sec, 140 secs
lola: 4838153 markings, 26841447 edges, 33851 markings/sec, 145 secs
lola: 4981821 markings, 27575683 edges, 28734 markings/sec, 150 secs
lola: 5144429 markings, 28489136 edges, 32522 markings/sec, 155 secs
lola: 5311255 markings, 29445456 edges, 33365 markings/sec, 160 secs
lola: 5483588 markings, 30416388 edges, 34467 markings/sec, 165 secs
lola: 5635417 markings, 31200516 edges, 30366 markings/sec, 170 secs
lola: 5811883 markings, 32206417 edges, 35293 markings/sec, 175 secs
lola: 5989982 markings, 33244867 edges, 35620 markings/sec, 180 secs
lola: 6156494 markings, 34208556 edges, 33302 markings/sec, 185 secs
lola: 6328756 markings, 35233827 edges, 34452 markings/sec, 190 secs
lola: 6493854 markings, 36209767 edges, 33020 markings/sec, 195 secs
lola: 6656639 markings, 37163725 edges, 32557 markings/sec, 200 secs
lola: 6822939 markings, 38146933 edges, 33260 markings/sec, 205 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: 6914158 markings, 38579830 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (G ((p65 <= 1)))) AND A (G ((F ((p18 <= p12 + p13)) OR G ((p65 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (G ((p65 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p65 <= 1))))
lola: processed formula length: 22
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 149988 markings, 705521 edges, 29998 markings/sec, 0 secs
lola: 301642 markings, 1514822 edges, 30331 markings/sec, 5 secs
lola: 459751 markings, 2387520 edges, 31622 markings/sec, 10 secs
lola: 627973 markings, 3325894 edges, 33644 markings/sec, 15 secs
lola: 792994 markings, 4248841 edges, 33004 markings/sec, 20 secs
lola: 971502 markings, 5286489 edges, 35702 markings/sec, 25 secs
lola: 1118389 markings, 6085773 edges, 29377 markings/sec, 30 secs
lola: 1274561 markings, 6957708 edges, 31234 markings/sec, 35 secs
lola: 1433081 markings, 7872054 edges, 31704 markings/sec, 40 secs
lola: 1586482 markings, 8712132 edges, 30680 markings/sec, 45 secs
lola: 1744358 markings, 9625223 edges, 31575 markings/sec, 50 secs
lola: 1890240 markings, 10419796 edges, 29176 markings/sec, 55 secs
lola: 2055031 markings, 11342596 edges, 32958 markings/sec, 60 secs
lola: 2223503 markings, 12302010 edges, 33694 markings/sec, 65 secs
lola: 2374083 markings, 13112127 edges, 30116 markings/sec, 70 secs
lola: 2541649 markings, 14074068 edges, 33513 markings/sec, 75 secs
lola: 2691485 markings, 14867195 edges, 29967 markings/sec, 80 secs
lola: 2859785 markings, 15829768 edges, 33660 markings/sec, 85 secs
lola: 3018652 markings, 16694235 edges, 31773 markings/sec, 90 secs
lola: 3181526 markings, 17597407 edges, 32575 markings/sec, 95 secs
lola: 3353973 markings, 18588474 edges, 34489 markings/sec, 100 secs
lola: 3505121 markings, 19382769 edges, 30230 markings/sec, 105 secs
lola: 3668477 markings, 20307309 edges, 32671 markings/sec, 110 secs
lola: 3840252 markings, 21300312 edges, 34355 markings/sec, 115 secs
lola: 3989202 markings, 22067270 edges, 29790 markings/sec, 120 secs
lola: 4158264 markings, 23030634 edges, 33812 markings/sec, 125 secs
lola: 4332760 markings, 24037952 edges, 34899 markings/sec, 130 secs
lola: 4485670 markings, 24823003 edges, 30582 markings/sec, 135 secs
lola: 4657861 markings, 25797549 edges, 34438 markings/sec, 140 secs
lola: 4837486 markings, 26836867 edges, 35925 markings/sec, 145 secs
lola: 4989395 markings, 27617406 edges, 30382 markings/sec, 150 secs
lola: 5158908 markings, 28569973 edges, 33903 markings/sec, 155 secs
lola: 5329088 markings, 29550874 edges, 34036 markings/sec, 160 secs
lola: 5491385 markings, 30441881 edges, 32459 markings/sec, 165 secs
lola: 5640597 markings, 31229026 edges, 29842 markings/sec, 170 secs
lola: 5813923 markings, 32218815 edges, 34665 markings/sec, 175 secs
lola: 5987010 markings, 33225059 edges, 34617 markings/sec, 180 secs
lola: 6164417 markings, 34255799 edges, 35481 markings/sec, 185 secs
lola: 6338082 markings, 35281538 edges, 34733 markings/sec, 190 secs
lola: 6512283 markings, 36309318 edges, 34840 markings/sec, 195 secs
lola: 6689745 markings, 37365422 edges, 35492 markings/sec, 200 secs
lola: 6867092 markings, 38402588 edges, 35469 markings/sec, 205 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: 6914158 markings, 38579830 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((F ((p18 <= p12 + p13)) OR G ((p65 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((p18 <= p12 + p13)) OR G ((p65 <= 1)))))
lola: processed formula length: 50
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-COL-V20P10N10-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: 297766 markings, 709701 edges, 59553 markings/sec, 0 secs
lola: 672916 markings, 1804009 edges, 75030 markings/sec, 5 secs
lola: 1059060 markings, 2976375 edges, 77229 markings/sec, 10 secs
lola: 1458742 markings, 4224710 edges, 79936 markings/sec, 15 secs
lola: 1857663 markings, 5472945 edges, 79784 markings/sec, 20 secs
lola: 2257959 markings, 6727530 edges, 80059 markings/sec, 25 secs
lola: 2688886 markings, 8075238 edges, 86185 markings/sec, 30 secs
lola: 3122378 markings, 9428756 edges, 86698 markings/sec, 35 secs
lola: 3557706 markings, 10793896 edges, 87066 markings/sec, 40 secs
lola: 3996521 markings, 12175233 edges, 87763 markings/sec, 45 secs
lola: 4447319 markings, 13627421 edges, 90160 markings/sec, 50 secs
lola: 4893066 markings, 15013174 edges, 89149 markings/sec, 55 secs
lola: 5347918 markings, 16455555 edges, 90970 markings/sec, 60 secs
lola: 5828761 markings, 18015854 edges, 96169 markings/sec, 65 secs
lola: 6302408 markings, 19506417 edges, 94729 markings/sec, 70 secs
lola: 6781941 markings, 21024789 edges, 95907 markings/sec, 75 secs
lola: 7278034 markings, 22656898 edges, 99219 markings/sec, 80 secs
lola: 7758019 markings, 24145890 edges, 95997 markings/sec, 85 secs
lola: 8143775 markings, 25398353 edges, 77151 markings/sec, 90 secs
lola: 8435229 markings, 27157548 edges, 58291 markings/sec, 95 secs
lola: 8705860 markings, 29215265 edges, 54126 markings/sec, 100 secs
lola: 8978716 markings, 31375448 edges, 54571 markings/sec, 105 secs
lola: 9248044 markings, 33474750 edges, 53866 markings/sec, 110 secs
lola: 9523310 markings, 35648801 edges, 55053 markings/sec, 115 secs
lola: 9804059 markings, 37865078 edges, 56150 markings/sec, 120 secs
lola: 10080398 markings, 40045745 edges, 55268 markings/sec, 125 secs
lola: 10354740 markings, 42209660 edges, 54868 markings/sec, 130 secs
lola: 10627288 markings, 44359458 edges, 54510 markings/sec, 135 secs
lola: 10916739 markings, 46689727 edges, 57890 markings/sec, 140 secs
lola: 11203750 markings, 48989221 edges, 57402 markings/sec, 145 secs
lola: 11503606 markings, 51346602 edges, 59971 markings/sec, 150 secs
lola: 11799799 markings, 53673765 edges, 59239 markings/sec, 155 secs
lola: 12101934 markings, 56075619 edges, 60427 markings/sec, 160 secs
lola: 12395664 markings, 58485353 edges, 58746 markings/sec, 165 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: 12574472 markings, 59360818 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no no yes yes yes yes yes yes yes yes yes no
lola:
preliminary result: no yes yes no no no yes yes yes yes yes yes yes yes yes no
lola: memory consumption: 20616 KB
lola: time consumption: 671 seconds

BK_STOP 1552404683504

--------------------
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-V20P10N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is BridgeAndVehicles-COL-V20P10N10, 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 r022-csrt-155225094500113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P10N10.tgz
mv BridgeAndVehicles-COL-V20P10N10 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;