About the Execution of 2018-Gold for BridgeAndVehicles-COL-V10P10N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
193.600 | 29593.00 | 31450.00 | 29.90 | TTTTFFTTTTTTTTFT | normal |
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-155225094500110.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-V10P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-csrt-155225094500110
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.3K Feb 9 07:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 9 07:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 5 04:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 5 04:37 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 3.1K Feb 4 22:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 4 22:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 4.0K Feb 2 01:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 2 01:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Jan 29 12:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Jan 29 12:10 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 38K 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-V10P10N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552404003462
info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-COL-V10P10N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-COL-V10P10N10 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V10P10N10 @ 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: 336/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1536
lola: finding significant places
lola: 48 places, 288 transitions, 41 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 373 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V10P10N10-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 <= p46 + p47)
lola: after: (1 <= p46 + p47)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 <= p38 + p39)
lola: after: (1 <= p38 + p39)
lola: place invariant simplifies atomic proposition
lola: before: (p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 <= p45 + p44)
lola: after: (1 <= p45 + p44)
lola: A (F (G (F ((p42 <= p2))))) : A ((X (G ((p45 + p44 <= p42))) U X (X ((p41 <= p0))))) : A (F (F ((p0 <= p41)))) : A (F (X (((2 <= p3) U (p45 + p44 <= p3))))) : A (X (X (G (G ((p38 + p39 <= p2)))))) : A (F ((G ((3 <= p40)) U (2 <= p1)))) : A ((((1 <= p41) U (p46 + p47 <= p42)) U F (X ((p41 <= p2))))) : A ((TRUE U ((p42 <= p0) U (p42 <= p41)))) : A (G (X (F ((p26 <= p1))))) : A (F (F ((FALSE U (p42 <= p41))))) : A ((((3 <= p3) U (1 <= p46 + p47)) U X (X ((2 <= p0))))) : A (X ((p40 <= p3))) : A ((X (FALSE) U ((2 <= p43) U TRUE))) : A (X ((TRUE U X ((1 <= p2))))) : A (G ((X ((p0 <= p1)) U X ((1 <= p38 + p39))))) : A (F (G (X (F ((1 <= p45 + p44))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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
lola: ========================================
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-12 TRUE 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: A (X (F ((p45 + p44 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p45 + p44 <= p3))))
lola: processed formula length: 29
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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-V10P10N10-LTLCardinality-3 TRUE 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: A (X (X (G ((p38 + p39 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((p38 + p39 <= p2)))))
lola: processed formula length: 33
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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: 86 markings, 86 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p41) U (p46 + p47 <= p42)) U X (F ((p41 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p41) U (p46 + p47 <= p42)) U X (F ((p41 <= p2)))))
lola: processed formula length: 61
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 10 markings, 9 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-6 TRUE 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 ((((3 <= p3) U (1 <= p46 + p47)) U X (X ((2 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= p3) U (1 <= p46 + p47)) U X (X ((2 <= p0)))))
lola: processed formula length: 56
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-LTLCardinality.task
lola: the resulting Büchi automaton has 11 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: 11 markings, 13 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V10P10N10-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: A (X ((p40 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p40 <= p3)))
lola: processed formula length: 19
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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-V10P10N10-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: A (X ((X ((p41 <= p0)) OR (G ((p45 + p44 <= p42)) AND X (F ((p41 <= p0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((p41 <= p0)) OR (G ((p45 + p44 <= p42)) AND X (F ((p41 <= p0)))))))
lola: processed formula length: 77
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-LTLCardinality.task
lola: the resulting Büchi automaton has 9 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: 19 markings, 24 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-1 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 (X (F ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((1 <= p2)))))
lola: processed formula length: 25
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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: 1149 markings, 1965 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-13 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 ((F ((1 <= p38 + p39)) AND ((p0 <= p1) OR (1 <= p38 + p39))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((1 <= p38 + p39)) AND ((p0 <= p1) OR (1 <= p38 + p39))))))
lola: processed formula length: 71
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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: 6810 markings, 21108 edges
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p42 <= p41)))
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: (p41 + 1 <= p42)
lola: processed formula length: 16
lola: 36 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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-V10P10N10-LTLCardinality-9 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 (F ((p0 <= p41)))
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: (p41 + 1 <= p0)
lola: processed formula length: 15
lola: 36 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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: 70956 markings, 145905 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-2 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 (F ((p42 <= p41)))
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: (p41 + 1 <= p42)
lola: processed formula length: 16
lola: 36 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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-V10P10N10-LTLCardinality-7 TRUE 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 (G (F ((p42 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p42 <= p2))))
lola: processed formula length: 23
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 243832 markings, 753804 edges
lola: ========================================
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1181 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p1) OR (G ((3 <= p40)) AND F ((2 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= p1) OR (G ((3 <= p40)) AND F ((2 <= p1))))))
lola: processed formula length: 57
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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: 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: 65685 markings, 127938 edges
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p26 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p26 <= p1))))
lola: processed formula length: 23
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 142188 markings, 385904 edges
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p45 + p44))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p45 + p44))))
lola: processed formula length: 28
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-COL-V10P10N10-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: ========================================
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: 162192 markings, 419747 edges
FORMULA BridgeAndVehicles-COL-V10P10N10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no yes yes yes yes yes yes yes yes no yes
lola:
preliminary result: yes yes yes yes no no yes yes yes yes yes yes yes yes no yes
lola: ========================================
lola: memory consumption: 20112 KB
lola: time consumption: 30 seconds
BK_STOP 1552404033055
--------------------
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-V10P10N10"
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-V10P10N10, 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-155225094500110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V10P10N10.tgz
mv BridgeAndVehicles-COL-V10P10N10 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 '
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 ;