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-155225094600176.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-PT-V20P10N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-csrt-155225094600176
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.3K Feb 9 07:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 9 07:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Feb 5 04:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K Feb 5 04:41 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 117 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 355 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.1K 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 15K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 2 01:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 2 01:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Jan 29 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Jan 29 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 1.1M 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-PT-V20P10N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552407985965

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P10N20 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V20P10N20 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P10N20 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1046/65536 symbol table entries, 1 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-PT-V20P10N20-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= VIDANGE_1 + VIDANGE_2)
lola: LP says that atomic proposition is always false: (2 <= VIDANGE_1 + VIDANGE_2)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)
lola: after: (0 <= 0)
lola: always true
lola: A (G (((3 <= ROUTE_B) U X ((1 <= SUR_PONT_A))))) : A (X ((F (FALSE) U F ((2 <= SORTI_A))))) : A (G ((X (FALSE) U F (TRUE)))) : A ((1 <= CHOIX_1 + CHOIX_2)) : A ((ROUTE_A <= ATTENTE_A)) : A ((3 <= ATTENTE_B)) : A (F ((CHOIX_1 + CHOIX_2 <= SUR_PONT_A))) : A (X (G (F (F ((SUR_PONT_B <= ROUTE_A)))))) : A (G (F (X (F ((COMPTEUR_11 <= COMPTEUR_2)))))) : A ((COMPTEUR_2 <= NB_ATTENTE_B_3)) : A ((NB_ATTENTE_A_13 <= NB_ATTENTE_B_4)) : A (G (F (F (F ((NB_ATTENTE_A_12 <= COMPTEUR_10)))))) : A (F (G (((1 <= ATTENTE_B) U (COMPTEUR_17 <= COMPTEUR_1))))) : A (F ((F ((NB_ATTENTE_B_2 <= COMPTEUR_6)) U (NB_ATTENTE_A_20 <= NB_ATTENTE_B_5)))) : A (X ((NB_ATTENTE_A_11 <= NB_ATTENTE_A_14))) : A (G (F ((VIDANGE_1 <= NB_ATTENTE_A_13))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N20-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-PT-V20P10N20-LTLCardinality-2 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: (1 <= CHOIX_1 + CHOIX_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= CHOIX_1 + CHOIX_2)
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N20-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-PT-V20P10N20-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: (ROUTE_A <= ATTENTE_A)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ROUTE_A <= ATTENTE_A)
lola: processed formula length: 22
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N20-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-PT-V20P10N20-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: (3 <= ATTENTE_B)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ATTENTE_B)
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N20-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-PT-V20P10N20-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (COMPTEUR_2 <= NB_ATTENTE_B_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (COMPTEUR_2 <= NB_ATTENTE_B_3)
lola: processed formula length: 30
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N20-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-PT-V20P10N20-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NB_ATTENTE_A_13 <= NB_ATTENTE_B_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NB_ATTENTE_A_13 <= NB_ATTENTE_B_4)
lola: processed formula length: 35
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-V20P10N20-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-PT-V20P10N20-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((1 <= SUR_PONT_A)))) AND A (G (((3 <= ROUTE_B) OR X ((1 <= SUR_PONT_A))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= SUR_PONT_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= SUR_PONT_A))))
lola: processed formula length: 29
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-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: 22779 markings, 31411 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-0 FALSE 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 (F ((2 <= SORTI_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= SORTI_A))))
lola: processed formula length: 26
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-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: 765843 markings, 2220465 edges, 153169 markings/sec, 0 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: 971907 markings, 2858483 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-1 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 ((NB_ATTENTE_A_11 <= NB_ATTENTE_A_14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((NB_ATTENTE_A_11 <= NB_ATTENTE_A_14)))
lola: processed formula length: 44
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-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: 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

FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NB_ATTENTE_A_20 <= NB_ATTENTE_B_5)))
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: (NB_ATTENTE_B_5 + 1 <= NB_ATTENTE_A_20)
lola: processed formula length: 39
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-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-PT-V20P10N20-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((CHOIX_1 + CHOIX_2 <= SUR_PONT_A)))
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: (SUR_PONT_A + 1 <= CHOIX_1 + CHOIX_2)
lola: processed formula length: 37
lola: 34 rewrites
lola: closed formula file BridgeAndVehicles-PT-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: 441 markings, 840 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-6 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 (G (F ((NB_ATTENTE_A_12 <= COMPTEUR_10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((NB_ATTENTE_A_12 <= COMPTEUR_10))))
lola: processed formula length: 44
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-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: 32503 markings, 45935 edges, 6501 markings/sec, 0 secs
lola: 68433 markings, 102505 edges, 7186 markings/sec, 5 secs
lola: 106525 markings, 163558 edges, 7618 markings/sec, 10 secs
lola: 145389 markings, 225376 edges, 7773 markings/sec, 15 secs
lola: 184299 markings, 287405 edges, 7782 markings/sec, 20 secs
lola: 223134 markings, 349428 edges, 7767 markings/sec, 25 secs
lola: 262215 markings, 412179 edges, 7816 markings/sec, 30 secs
lola: 300266 markings, 472437 edges, 7610 markings/sec, 35 secs
lola: 338363 markings, 532781 edges, 7619 markings/sec, 40 secs
lola: 377114 markings, 595333 edges, 7750 markings/sec, 45 secs
lola: 413707 markings, 652641 edges, 7319 markings/sec, 50 secs
lola: 452048 markings, 713895 edges, 7668 markings/sec, 55 secs
lola: 489617 markings, 772399 edges, 7514 markings/sec, 60 secs
lola: 527679 markings, 833217 edges, 7612 markings/sec, 65 secs
lola: 564367 markings, 889617 edges, 7338 markings/sec, 70 secs
lola: 602291 markings, 950321 edges, 7585 markings/sec, 75 secs
lola: 638253 markings, 1006104 edges, 7192 markings/sec, 80 secs
lola: 675249 markings, 1063857 edges, 7399 markings/sec, 85 secs
lola: 712644 markings, 1124018 edges, 7479 markings/sec, 90 secs
lola: 747119 markings, 1176424 edges, 6895 markings/sec, 95 secs
lola: 782575 markings, 1232827 edges, 7091 markings/sec, 100 secs
lola: 819899 markings, 1292199 edges, 7465 markings/sec, 105 secs
lola: 853624 markings, 1343478 edges, 6745 markings/sec, 110 secs
lola: 888539 markings, 1397984 edges, 6983 markings/sec, 115 secs
lola: 923782 markings, 1455006 edges, 7049 markings/sec, 120 secs
lola: 955193 markings, 1502974 edges, 6282 markings/sec, 125 secs
lola: 986892 markings, 1551553 edges, 6340 markings/sec, 130 secs
lola: 1020302 markings, 1604649 edges, 6682 markings/sec, 135 secs
lola: 1054027 markings, 1658963 edges, 6745 markings/sec, 140 secs
lola: 1085838 markings, 1706637 edges, 6362 markings/sec, 145 secs
lola: 1117494 markings, 1755188 edges, 6331 markings/sec, 150 secs
lola: 1149411 markings, 1804777 edges, 6383 markings/sec, 155 secs
lola: 1186354 markings, 1864757 edges, 7389 markings/sec, 160 secs
lola: 1225656 markings, 1927738 edges, 7860 markings/sec, 165 secs
lola: 1266217 markings, 1994969 edges, 8112 markings/sec, 170 secs
lola: 1304551 markings, 2057391 edges, 7667 markings/sec, 175 secs
lola: 1341193 markings, 2116777 edges, 7328 markings/sec, 180 secs
lola: 1376533 markings, 2174116 edges, 7068 markings/sec, 185 secs
lola: 1412630 markings, 2231728 edges, 7219 markings/sec, 190 secs
lola: 1448903 markings, 2291462 edges, 7255 markings/sec, 195 secs
lola: 1486161 markings, 2352877 edges, 7452 markings/sec, 200 secs
lola: 1523714 markings, 2413576 edges, 7511 markings/sec, 205 secs
lola: 1561782 markings, 2475445 edges, 7614 markings/sec, 210 secs
lola: 1602147 markings, 2540425 edges, 8073 markings/sec, 215 secs
lola: 1643586 markings, 2608859 edges, 8288 markings/sec, 220 secs
lola: 1684229 markings, 2675849 edges, 8129 markings/sec, 225 secs
lola: 1725094 markings, 2743678 edges, 8173 markings/sec, 230 secs
lola: 1763588 markings, 2806133 edges, 7699 markings/sec, 235 secs
lola: 1801111 markings, 2865981 edges, 7505 markings/sec, 240 secs
lola: 1843783 markings, 2935596 edges, 8534 markings/sec, 245 secs
lola: 1885852 markings, 3005892 edges, 8414 markings/sec, 250 secs
lola: 1924896 markings, 3069022 edges, 7809 markings/sec, 255 secs
lola: 1959672 markings, 3126776 edges, 6955 markings/sec, 260 secs
lola: 1999460 markings, 3192174 edges, 7958 markings/sec, 265 secs
lola: 2036239 markings, 3250472 edges, 7356 markings/sec, 270 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: 2037466 markings, 3252490 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((SUR_PONT_B <= ROUTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((SUR_PONT_B <= ROUTE_A))))
lola: processed formula length: 35
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-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: 218542 markings, 852573 edges, 43708 markings/sec, 0 secs
lola: 426314 markings, 1630320 edges, 41554 markings/sec, 5 secs
lola: 613593 markings, 2297923 edges, 37456 markings/sec, 10 secs
lola: 809759 markings, 2979272 edges, 39233 markings/sec, 15 secs
lola: 983477 markings, 3558689 edges, 34744 markings/sec, 20 secs
lola: 1164551 markings, 4168043 edges, 36215 markings/sec, 25 secs
lola: 1332231 markings, 4717600 edges, 33536 markings/sec, 30 secs
lola: 1497876 markings, 5251643 edges, 33129 markings/sec, 35 secs
lola: 1659603 markings, 5768751 edges, 32345 markings/sec, 40 secs
lola: 1818488 markings, 6273299 edges, 31777 markings/sec, 45 secs
lola: 1975999 markings, 6787176 edges, 31502 markings/sec, 50 secs
lola: 2135437 markings, 7320976 edges, 31888 markings/sec, 55 secs
lola: 2300517 markings, 7877932 edges, 33016 markings/sec, 60 secs
lola: 2464669 markings, 8442152 edges, 32830 markings/sec, 65 secs
lola: 2621593 markings, 8947610 edges, 31385 markings/sec, 70 secs
lola: 2812184 markings, 9648344 edges, 38118 markings/sec, 75 secs
lola: 2977362 markings, 10191283 edges, 33036 markings/sec, 80 secs
lola: 3171109 markings, 10895198 edges, 38749 markings/sec, 85 secs
lola: 3362975 markings, 11576660 edges, 38373 markings/sec, 90 secs
lola: 3536814 markings, 12157217 edges, 34768 markings/sec, 95 secs
lola: 3737693 markings, 12923791 edges, 40176 markings/sec, 100 secs
lola: 3918340 markings, 13556210 edges, 36129 markings/sec, 105 secs
lola: 4102676 markings, 14195678 edges, 36867 markings/sec, 110 secs
lola: 4311282 markings, 15019919 edges, 41721 markings/sec, 115 secs
lola: 4506583 markings, 15725848 edges, 39060 markings/sec, 120 secs
lola: 4678773 markings, 16315050 edges, 34438 markings/sec, 125 secs
lola: 4900135 markings, 17192662 edges, 44272 markings/sec, 130 secs
lola: 5102433 markings, 17954952 edges, 40460 markings/sec, 135 secs
lola: 5290729 markings, 18614859 edges, 37659 markings/sec, 140 secs
lola: 5500617 markings, 19391675 edges, 41978 markings/sec, 145 secs
lola: 5726575 markings, 20300915 edges, 45192 markings/sec, 150 secs
lola: 5937627 markings, 21080606 edges, 42210 markings/sec, 155 secs
lola: 6152810 markings, 21860574 edges, 43037 markings/sec, 160 secs
lola: 6389193 markings, 22801982 edges, 47277 markings/sec, 165 secs
lola: 6617876 markings, 23709450 edges, 45737 markings/sec, 170 secs
lola: 6840373 markings, 24547578 edges, 44499 markings/sec, 175 secs
lola: 7042328 markings, 25270854 edges, 40391 markings/sec, 180 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: 7160376 markings, 25708137 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1027 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((COMPTEUR_11 <= COMPTEUR_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((COMPTEUR_11 <= COMPTEUR_2))))
lola: processed formula length: 39
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-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: 4768 markings, 5654 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((VIDANGE_1 <= NB_ATTENTE_A_13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((VIDANGE_1 <= NB_ATTENTE_A_13))))
lola: processed formula length: 42
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-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: 43762 markings, 67195 edges, 8752 markings/sec, 0 secs
lola: 88448 markings, 139497 edges, 8937 markings/sec, 5 secs
lola: 132439 markings, 211017 edges, 8798 markings/sec, 10 secs
lola: 175332 markings, 280227 edges, 8579 markings/sec, 15 secs
lola: 217644 markings, 348947 edges, 8462 markings/sec, 20 secs
lola: 257998 markings, 413451 edges, 8071 markings/sec, 25 secs
lola: 299125 markings, 479339 edges, 8225 markings/sec, 30 secs
lola: 340828 markings, 546000 edges, 8341 markings/sec, 35 secs
lola: 380732 markings, 609926 edges, 7981 markings/sec, 40 secs
lola: 420374 markings, 672554 edges, 7928 markings/sec, 45 secs
lola: 460058 markings, 735717 edges, 7937 markings/sec, 50 secs
lola: 500026 markings, 799067 edges, 7994 markings/sec, 55 secs
lola: 539055 markings, 861073 edges, 7806 markings/sec, 60 secs
lola: 578703 markings, 923722 edges, 7930 markings/sec, 65 secs
lola: 618543 markings, 986625 edges, 7968 markings/sec, 70 secs
lola: 658992 markings, 1050277 edges, 8090 markings/sec, 75 secs
lola: 696895 markings, 1109211 edges, 7581 markings/sec, 80 secs
lola: 735872 markings, 1170737 edges, 7795 markings/sec, 85 secs
lola: 774852 markings, 1231952 edges, 7796 markings/sec, 90 secs
lola: 813896 markings, 1292616 edges, 7809 markings/sec, 95 secs
lola: 852948 markings, 1354870 edges, 7810 markings/sec, 100 secs
lola: 890515 markings, 1412579 edges, 7513 markings/sec, 105 secs
lola: 928168 markings, 1471399 edges, 7531 markings/sec, 110 secs
lola: 966270 markings, 1530828 edges, 7620 markings/sec, 115 secs
lola: 1004637 markings, 1590251 edges, 7673 markings/sec, 120 secs
lola: 1041672 markings, 1647338 edges, 7407 markings/sec, 125 secs
lola: 1079039 markings, 1705798 edges, 7473 markings/sec, 130 secs
lola: 1118308 markings, 1766805 edges, 7854 markings/sec, 135 secs
lola: 1155642 markings, 1824668 edges, 7467 markings/sec, 140 secs
lola: 1193700 markings, 1883727 edges, 7612 markings/sec, 145 secs
lola: 1232668 markings, 1944503 edges, 7794 markings/sec, 150 secs
lola: 1271334 markings, 2005018 edges, 7733 markings/sec, 155 secs
lola: 1312227 markings, 2069056 edges, 8179 markings/sec, 160 secs
lola: 1352839 markings, 2134360 edges, 8122 markings/sec, 165 secs
lola: 1391854 markings, 2196452 edges, 7803 markings/sec, 170 secs
lola: 1431755 markings, 2259376 edges, 7980 markings/sec, 175 secs
lola: 1471345 markings, 2321018 edges, 7918 markings/sec, 180 secs
lola: 1514692 markings, 2391551 edges, 8669 markings/sec, 185 secs
lola: 1555845 markings, 2457567 edges, 8231 markings/sec, 190 secs
lola: 1597529 markings, 2524582 edges, 8337 markings/sec, 195 secs
lola: 1635556 markings, 2583299 edges, 7605 markings/sec, 200 secs
lola: 1675335 markings, 2645557 edges, 7956 markings/sec, 205 secs
lola: 1717854 markings, 2714905 edges, 8504 markings/sec, 210 secs
lola: 1759481 markings, 2781625 edges, 8325 markings/sec, 215 secs
lola: 1800048 markings, 2847524 edges, 8113 markings/sec, 220 secs
lola: 1838271 markings, 2908390 edges, 7645 markings/sec, 225 secs
lola: 1872449 markings, 2960618 edges, 6836 markings/sec, 230 secs
lola: 1910865 markings, 3021541 edges, 7683 markings/sec, 235 secs
lola: 1949407 markings, 3084298 edges, 7708 markings/sec, 240 secs
lola: 1986397 markings, 3143602 edges, 7398 markings/sec, 245 secs
lola: 2023785 markings, 3203672 edges, 7478 markings/sec, 250 secs
lola: 2063038 markings, 3265721 edges, 7851 markings/sec, 255 secs
lola: 2101127 markings, 3326025 edges, 7618 markings/sec, 260 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: 2133387 markings, 3376562 edges

FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 2812 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((COMPTEUR_17 <= COMPTEUR_1)) AND ((1 <= ATTENTE_B) OR (COMPTEUR_17 <= COMPTEUR_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((COMPTEUR_17 <= COMPTEUR_1)) AND ((1 <= ATTENTE_B) OR (COMPTEUR_17 <= COMPTEUR_1))))))
lola: processed formula length: 99
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-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: 95362 markings, 170690 edges, 19072 markings/sec, 0 secs
lola: 183913 markings, 329570 edges, 17710 markings/sec, 5 secs
lola: 271531 markings, 485879 edges, 17524 markings/sec, 10 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: 325931 markings, 582766 edges

FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes no no yes yes no yes yes yes no yes yes yes
lola:
preliminary result: no yes yes yes no no yes yes no yes yes yes no yes yes yes
lola: ========================================
lola: memory consumption: 22996 KB
lola: time consumption: 776 seconds

BK_STOP 1552408762027

--------------------
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-PT-V20P10N20"
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-PT-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 r022-csrt-155225094600176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N20.tgz
mv BridgeAndVehicles-PT-V20P10N20 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 ;