fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r028-ebro-152646306400313
Last Updated
June 26, 2018

About the Execution of LoLA for BridgeAndVehicles-PT-V50P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
385.090 949650.00 1895113.00 110.10 FFTFTFFFTTFFFFFT normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 69K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 205K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 121 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 359 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 72K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 1.5M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BridgeAndVehicles-PT-V50P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306400313
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526568567948

info: Time: 3600 - MCC
===========================================================================================
prep: translating BridgeAndVehicles-PT-V50P20N10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating BridgeAndVehicles-PT-V50P20N10 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V50P20N10 @ 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: 1456/65536 symbol table entries, 11 collisions
lola: preprocessing...
lola: Size of bit vector: 4096
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (CHOIX_1 + CHOIX_2 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)
lola: after: (CHOIX_1 + CHOIX_2 <= 1)
lola: LP says that atomic proposition is always true: (CHOIX_1 + CHOIX_2 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (1 <= COMPTEUR_10 + 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: place invariant simplifies atomic proposition
lola: before: (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 <= VIDANGE_1 + VIDANGE_2)
lola: after: (1 <= VIDANGE_1 + VIDANGE_2)
lola: place invariant simplifies atomic proposition
lola: before: (NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_21 + NB_ATTENTE_B_22 + NB_ATTENTE_B_23 + NB_ATTENTE_B_24 + NB_ATTENTE_B_25 + NB_ATTENTE_B_26 + NB_ATTENTE_B_27 + NB_ATTENTE_B_28 + NB_ATTENTE_B_29 + NB_ATTENTE_B_30 + NB_ATTENTE_B_31 + NB_ATTENTE_B_32 + NB_ATTENTE_B_33 + NB_ATTENTE_B_34 + NB_ATTENTE_B_35 + NB_ATTENTE_B_36 + NB_ATTENTE_B_37 + NB_ATTENTE_B_38 + NB_ATTENTE_B_39 + NB_ATTENTE_B_40 + NB_ATTENTE_B_41 + NB_ATTENTE_B_42 + NB_ATTENTE_B_43 + NB_ATTENTE_B_44 + NB_ATTENTE_B_45 + NB_ATTENTE_B_46 + NB_ATTENTE_B_47 + NB_ATTENTE_B_48 + NB_ATTENTE_B_49 + NB_ATTENTE_B_50 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9 <= CHOIX_1 + CHOIX_2)
lola: after: (1 <= CHOIX_1 + CHOIX_2)
lola: LP says that atomic proposition is always false: (2 <= CHOIX_1 + CHOIX_2)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20 + NB_ATTENTE_A_21 + NB_ATTENTE_A_22 + NB_ATTENTE_A_23 + NB_ATTENTE_A_24 + NB_ATTENTE_A_25 + NB_ATTENTE_A_26 + NB_ATTENTE_A_27 + NB_ATTENTE_A_28 + NB_ATTENTE_A_29 + NB_ATTENTE_A_30 + NB_ATTENTE_A_31 + NB_ATTENTE_A_32 + NB_ATTENTE_A_33 + NB_ATTENTE_A_34 + NB_ATTENTE_A_35 + NB_ATTENTE_A_36 + NB_ATTENTE_A_37 + NB_ATTENTE_A_38 + NB_ATTENTE_A_39 + NB_ATTENTE_A_40 + NB_ATTENTE_A_41 + NB_ATTENTE_A_42 + NB_ATTENTE_A_43 + NB_ATTENTE_A_44 + NB_ATTENTE_A_45 + NB_ATTENTE_A_46 + NB_ATTENTE_A_47 + NB_ATTENTE_A_48 + NB_ATTENTE_A_49 + NB_ATTENTE_A_50)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (2 <= CHOIX_1 + CHOIX_2)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)
lola: after: (2 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= VIDANGE_1 + VIDANGE_2)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_A_38)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_B_43)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_A_16)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_A_44)
lola: LP says that atomic proposition is always false: (3 <= COMPTEUR_4)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_B_39)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_B_23)
lola: LP says that atomic proposition is always false: (3 <= NB_ATTENTE_A_39)
lola: LP says that atomic proposition is always false: (3 <= COMPTEUR_4)
lola: LP says that atomic proposition is always false: (2 <= NB_ATTENTE_B_40)
lola: E (F (())) : E (F (FALSE)) : E (F ((ROUTE_B <= 1))) : E (F (FALSE)) : A (G (())) : A (G ((((SUR_PONT_B + 1 <= ROUTE_B) OR (ROUTE_B <= 2)) AND ((CHOIX_1 + CHOIX_2 <= 0) OR (VIDANGE_1 + VIDANGE_2 <= 0))))) : E (F (())) : E (F (())) : E (F ((1 <= NB_ATTENTE_B_19))) : A (G (((NB_ATTENTE_A_10 <= NB_ATTENTE_A_9) OR (NB_ATTENTE_A_49 <= NB_ATTENTE_B_9) OR (1 <= ATTENTE_A)))) : A (G (((NB_ATTENTE_A_31 <= NB_ATTENTE_B_37)))) : E (F (FALSE)) : E (F (())) : E (F (FALSE)) : A (G (((NB_ATTENTE_A_22 <= NB_ATTENTE_B_0)))) : A (G (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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-PT-V50P20N10-ReachabilityCardinality.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: ========================================
check_solution: Constraint R1 = 6.95178725707e-310 is above its upper bound -1
check_solution: Constraint R2 = 4.6491898872e-310 is above its equality of -1
check_solution: Constraint R66 = 0 is above its equality of -1
check_solution: Constraint R78 = 0 is above its equality of -50
check_solution: Constraint R79 = 0 is above its equality of -50
check_solution: Constraint R80 = 0 is above its equality of -20

Seriously low accuracy found ||*|| = 50 (rel. error 1)

FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality.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-PT-V50P20N10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality.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-PT-V50P20N10-ReachabilityCardinality-3 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: 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-PT-V50P20N10-ReachabilityCardinality.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-V50P20N10-ReachabilityCardinality-4 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: 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-PT-V50P20N10-ReachabilityCardinality.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-PT-V50P20N10-ReachabilityCardinality-6 FALSE 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: 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-PT-V50P20N10-ReachabilityCardinality.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-PT-V50P20N10-ReachabilityCardinality-7 FALSE 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: 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-PT-V50P20N10-ReachabilityCardinality.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-PT-V50P20N10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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-PT-V50P20N10-ReachabilityCardinality.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-PT-V50P20N10-ReachabilityCardinality-12 FALSE 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: 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-PT-V50P20N10-ReachabilityCardinality.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-PT-V50P20N10-ReachabilityCardinality-13 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: 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-PT-V50P20N10-ReachabilityCardinality.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-V50P20N10-ReachabilityCardinality-15 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: E (F ((ROUTE_B <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((ROUTE_B <= 1)))
lola: processed formula length: 22
lola: 31 rewrites
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (ROUTE_B <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50 markings, 49 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-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: E (F ((1 <= NB_ATTENTE_B_19)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((1 <= NB_ATTENTE_B_19)))
lola: processed formula length: 30
lola: 31 rewrites
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (1 <= NB_ATTENTE_B_19)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NB_ATTENTE_A_22 <= NB_ATTENTE_B_0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NB_ATTENTE_A_22 <= NB_ATTENTE_B_0))))
lola: processed formula length: 45
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NB_ATTENTE_B_0 + 1 <= NB_ATTENTE_A_22))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 234 markings, 233 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-14 FALSE 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 (G (((NB_ATTENTE_A_31 <= NB_ATTENTE_B_37))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NB_ATTENTE_A_31 <= NB_ATTENTE_B_37))))
lola: processed formula length: 46
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NB_ATTENTE_B_37 + 1 <= NB_ATTENTE_A_31))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 37 markings, 36 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NB_ATTENTE_A_10 <= NB_ATTENTE_A_9) OR (NB_ATTENTE_A_49 <= NB_ATTENTE_B_9) OR (1 <= ATTENTE_A))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NB_ATTENTE_A_10 <= NB_ATTENTE_A_9) OR (NB_ATTENTE_A_49 <= NB_ATTENTE_B_9) OR (1 <= ATTENTE_A))))
lola: processed formula length: 106
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((NB_ATTENTE_A_9 + 1 <= NB_ATTENTE_A_10) AND (NB_ATTENTE_B_9 + 1 <= NB_ATTENTE_A_49) AND (ATTENTE_A <= 0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.

FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((SUR_PONT_B + 1 <= ROUTE_B) OR (ROUTE_B <= 2)) AND ((CHOIX_1 + CHOIX_2 <= 0) OR (VIDANGE_1 + VIDANGE_2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((SUR_PONT_B + 1 <= ROUTE_B) OR (ROUTE_B <= 2)) AND ((CHOIX_1 + CHOIX_2 <= 0) OR (VIDANGE_1 + VIDANGE_2 <= 0)))))
lola: processed formula length: 122
lola: 32 rewrites
lola: closed formula file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((ROUTE_B <= SUR_PONT_B) AND (3 <= ROUTE_B)) OR ((1 <= CHOIX_1 + CHOIX_2) AND (1 <= VIDANGE_1 + VIDANGE_2)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-15-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 20505 markings, 43576 edges, 4101 markings/sec, 0 secs
lola: sara is running 5 secs || 41261 markings, 89289 edges, 4151 markings/sec, 5 secs
lola: sara is running 10 secs || 63120 markings, 137452 edges, 4372 markings/sec, 10 secs
lola: sara is running 15 secs || 84829 markings, 185676 edges, 4342 markings/sec, 15 secs
lola: sara is running 20 secs || 107795 markings, 236808 edges, 4593 markings/sec, 20 secs
lola: sara is running 25 secs || 129459 markings, 284964 edges, 4333 markings/sec, 25 secs
lola: sara is running 30 secs || 151439 markings, 333923 edges, 4396 markings/sec, 30 secs
lola: sara is running 35 secs || 174043 markings, 384427 edges, 4521 markings/sec, 35 secs
lola: sara is running 40 secs || 196262 markings, 433883 edges, 4444 markings/sec, 40 secs
lola: sara is running 45 secs || 218177 markings, 482666 edges, 4383 markings/sec, 45 secs
lola: sara is running 50 secs || 240360 markings, 532207 edges, 4437 markings/sec, 50 secs
lola: sara is running 55 secs || 263233 markings, 583390 edges, 4575 markings/sec, 55 secs
lola: sara is running 60 secs || 285617 markings, 633364 edges, 4477 markings/sec, 60 secs
lola: sara is running 65 secs || 307852 markings, 683051 edges, 4447 markings/sec, 65 secs
lola: sara is running 70 secs || 329495 markings, 731506 edges, 4329 markings/sec, 70 secs
lola: sara is running 75 secs || 353804 markings, 785931 edges, 4862 markings/sec, 75 secs
lola: sara is running 80 secs || 376907 markings, 837574 edges, 4621 markings/sec, 80 secs
lola: sara is running 85 secs || 397487 markings, 883523 edges, 4116 markings/sec, 85 secs
lola: sara is running 90 secs || 421862 markings, 938303 edges, 4875 markings/sec, 90 secs
lola: sara is running 95 secs || 445121 markings, 990421 edges, 4652 markings/sec, 95 secs
lola: sara is running 100 secs || 465829 markings, 1036670 edges, 4142 markings/sec, 100 secs
lola: sara is running 105 secs || 489944 markings, 1090671 edges, 4823 markings/sec, 105 secs
lola: sara is running 110 secs || 512387 markings, 1141067 edges, 4489 markings/sec, 110 secs
lola: sara is running 115 secs || 535595 markings, 1192808 edges, 4642 markings/sec, 115 secs
lola: sara is running 120 secs || 558892 markings, 1245189 edges, 4659 markings/sec, 120 secs
lola: sara is running 125 secs || 579161 markings, 1290399 edges, 4054 markings/sec, 125 secs
lola: sara is running 130 secs || 602649 markings, 1345597 edges, 4698 markings/sec, 130 secs
lola: sara is running 135 secs || 621028 markings, 1396191 edges, 3676 markings/sec, 135 secs
lola: sara is running 140 secs || 639354 markings, 1447561 edges, 3665 markings/sec, 140 secs
lola: sara is running 145 secs || 657785 markings, 1499746 edges, 3686 markings/sec, 145 secs
lola: sara is running 150 secs || 676568 markings, 1552785 edges, 3757 markings/sec, 150 secs
lola: sara is running 155 secs || 695715 markings, 1607184 edges, 3829 markings/sec, 155 secs
lola: sara is running 160 secs || 714198 markings, 1660308 edges, 3697 markings/sec, 160 secs
lola: sara is running 165 secs || 732406 markings, 1713682 edges, 3642 markings/sec, 165 secs
lola: sara is running 170 secs || 750800 markings, 1767249 edges, 3679 markings/sec, 170 secs
lola: sara is running 175 secs || 769033 markings, 1819832 edges, 3647 markings/sec, 175 secs
lola: sara is running 180 secs || 787844 markings, 1873662 edges, 3762 markings/sec, 180 secs
lola: sara is running 185 secs || 806499 markings, 1927571 edges, 3731 markings/sec, 185 secs
lola: sara is running 190 secs || 825028 markings, 1981539 edges, 3706 markings/sec, 190 secs
lola: sara is running 195 secs || 844233 markings, 2036867 edges, 3841 markings/sec, 195 secs
lola: sara is running 200 secs || 863663 markings, 2091929 edges, 3886 markings/sec, 200 secs
lola: sara is running 205 secs || 882199 markings, 2146409 edges, 3707 markings/sec, 205 secs
lola: sara is running 210 secs || 899671 markings, 2198311 edges, 3494 markings/sec, 210 secs
lola: sara is running 215 secs || 919191 markings, 2254019 edges, 3904 markings/sec, 215 secs
lola: sara is running 220 secs || 936474 markings, 2304990 edges, 3457 markings/sec, 220 secs
lola: sara is running 225 secs || 955491 markings, 2360748 edges, 3803 markings/sec, 225 secs
lola: sara is running 230 secs || 974434 markings, 2416210 edges, 3789 markings/sec, 230 secs
lola: sara is running 235 secs || 991753 markings, 2467748 edges, 3464 markings/sec, 235 secs
lola: sara is running 240 secs || 1011178 markings, 2523124 edges, 3885 markings/sec, 240 secs
lola: sara is running 245 secs || 1028048 markings, 2575223 edges, 3374 markings/sec, 245 secs
lola: sara is running 250 secs || 1047954 markings, 2631393 edges, 3981 markings/sec, 250 secs
lola: sara is running 255 secs || 1065046 markings, 2681307 edges, 3418 markings/sec, 255 secs
lola: sara is running 260 secs || 1084225 markings, 2737589 edges, 3836 markings/sec, 260 secs
lola: sara is running 265 secs || 1102925 markings, 2791630 edges, 3740 markings/sec, 265 secs
lola: sara is running 270 secs || 1121507 markings, 2846344 edges, 3716 markings/sec, 270 secs
lola: sara is running 275 secs || 1140681 markings, 2902784 edges, 3835 markings/sec, 275 secs
lola: sara is running 280 secs || 1158412 markings, 2950940 edges, 3546 markings/sec, 280 secs
lola: sara is running 285 secs || 1175996 markings, 3000853 edges, 3517 markings/sec, 285 secs
lola: sara is running 290 secs || 1193418 markings, 3051367 edges, 3484 markings/sec, 290 secs
lola: sara is running 295 secs || 1211016 markings, 3102303 edges, 3520 markings/sec, 295 secs
lola: sara is running 300 secs || 1229365 markings, 3155125 edges, 3670 markings/sec, 300 secs
lola: sara is running 305 secs || 1247207 markings, 3206347 edges, 3568 markings/sec, 305 secs
lola: sara is running 310 secs || 1265674 markings, 3260867 edges, 3693 markings/sec, 310 secs
lola: sara is running 315 secs || 1283705 markings, 3313898 edges, 3606 markings/sec, 315 secs
lola: sara is running 320 secs || 1301726 markings, 3367018 edges, 3604 markings/sec, 320 secs
lola: sara is running 325 secs || 1319766 markings, 3420232 edges, 3608 markings/sec, 325 secs
lola: sara is running 330 secs || 1337814 markings, 3473542 edges, 3610 markings/sec, 330 secs
lola: sara is running 335 secs || 1356001 markings, 3527291 edges, 3637 markings/sec, 335 secs
lola: sara is running 340 secs || 1373104 markings, 3577190 edges, 3421 markings/sec, 340 secs
lola: sara is running 345 secs || 1391510 markings, 3631000 edges, 3681 markings/sec, 345 secs
lola: sara is running 350 secs || 1409181 markings, 3685070 edges, 3534 markings/sec, 350 secs
lola: sara is running 355 secs || 1427793 markings, 3738527 edges, 3722 markings/sec, 355 secs
lola: sara is running 360 secs || 1446173 markings, 3793264 edges, 3676 markings/sec, 360 secs
lola: sara is running 365 secs || 1463510 markings, 3845423 edges, 3467 markings/sec, 365 secs
lola: sara is running 370 secs || 1482225 markings, 3900162 edges, 3743 markings/sec, 370 secs
lola: sara is running 375 secs || 1499262 markings, 3952589 edges, 3407 markings/sec, 375 secs
lola: sara is running 380 secs || 1518153 markings, 4007022 edges, 3778 markings/sec, 380 secs
lola: sara is running 385 secs || 1535244 markings, 4058349 edges, 3418 markings/sec, 385 secs
lola: sara is running 390 secs || 1554426 markings, 4115024 edges, 3836 markings/sec, 390 secs
lola: sara is running 395 secs || 1571492 markings, 4165160 edges, 3413 markings/sec, 395 secs
lola: sara is running 400 secs || 1590779 markings, 4223755 edges, 3857 markings/sec, 400 secs
lola: sara is running 405 secs || 1607484 markings, 4272168 edges, 3341 markings/sec, 405 secs
lola: sara is running 410 secs || 1626689 markings, 4330626 edges, 3841 markings/sec, 410 secs
lola: sara is running 415 secs || 1643397 markings, 4379925 edges, 3342 markings/sec, 415 secs
lola: sara is running 420 secs || 1662269 markings, 4435946 edges, 3774 markings/sec, 420 secs
lola: sara is running 425 secs || 1678480 markings, 4486248 edges, 3242 markings/sec, 425 secs
lola: sara is running 430 secs || 1698011 markings, 4542810 edges, 3906 markings/sec, 430 secs
lola: sara is running 435 secs || 1715114 markings, 4595430 edges, 3421 markings/sec, 435 secs
lola: sara is running 440 secs || 1734225 markings, 4650962 edges, 3822 markings/sec, 440 secs
lola: sara is running 445 secs || 1751454 markings, 4703327 edges, 3446 markings/sec, 445 secs
lola: sara is running 450 secs || 1770558 markings, 4759579 edges, 3821 markings/sec, 450 secs
lola: sara is running 455 secs || 1790738 markings, 4811019 edges, 4036 markings/sec, 455 secs
lola: sara is running 460 secs || 1811161 markings, 4856538 edges, 4085 markings/sec, 460 secs
lola: sara is running 465 secs || 1834017 markings, 4913848 edges, 4571 markings/sec, 465 secs
lola: sara is running 470 secs || 1852391 markings, 4966686 edges, 3675 markings/sec, 470 secs
lola: sara is running 475 secs || 1871302 markings, 5023194 edges, 3782 markings/sec, 475 secs
lola: sara is running 480 secs || 1888570 markings, 5072700 edges, 3454 markings/sec, 480 secs
lola: sara is running 485 secs || 1908283 markings, 5131615 edges, 3943 markings/sec, 485 secs
lola: sara is running 490 secs || 1928688 markings, 5182716 edges, 4081 markings/sec, 490 secs
lola: sara is running 495 secs || 1949447 markings, 5229146 edges, 4152 markings/sec, 495 secs
lola: sara is running 500 secs || 1973423 markings, 5288084 edges, 4795 markings/sec, 500 secs
lola: sara is running 505 secs || 1990467 markings, 5339566 edges, 3409 markings/sec, 505 secs
lola: sara is running 510 secs || 2009884 markings, 5395097 edges, 3883 markings/sec, 510 secs
lola: sara is running 515 secs || 2028084 markings, 5449643 edges, 3640 markings/sec, 515 secs
lola: sara is running 520 secs || 2044199 markings, 5498713 edges, 3223 markings/sec, 520 secs
lola: sara is running 525 secs || 2064076 markings, 5556631 edges, 3975 markings/sec, 525 secs
lola: sara is running 530 secs || 2085977 markings, 5608224 edges, 4380 markings/sec, 530 secs
lola: sara is running 535 secs || 2108380 markings, 5658528 edges, 4481 markings/sec, 535 secs
lola: sara is running 540 secs || 2129836 markings, 5713632 edges, 4291 markings/sec, 540 secs
lola: sara is running 545 secs || 2147100 markings, 5766158 edges, 3453 markings/sec, 545 secs
lola: sara is running 550 secs || 2167258 markings, 5823637 edges, 4032 markings/sec, 550 secs
lola: sara is running 555 secs || 2184669 markings, 5876565 edges, 3482 markings/sec, 555 secs
lola: sara is running 560 secs || 2202076 markings, 5927771 edges, 3481 markings/sec, 560 secs
lola: sara is running 565 secs || 2222074 markings, 5987132 edges, 4000 markings/sec, 565 secs
lola: sara is running 570 secs || 2243387 markings, 6035718 edges, 4263 markings/sec, 570 secs
lola: sara is running 575 secs || 2266347 markings, 6087353 edges, 4592 markings/sec, 575 secs
lola: sara is running 580 secs || 2287836 markings, 6143528 edges, 4298 markings/sec, 580 secs
lola: sara is running 585 secs || 2305024 markings, 6195958 edges, 3438 markings/sec, 585 secs
lola: sara is running 590 secs || 2323109 markings, 6247532 edges, 3617 markings/sec, 590 secs
lola: sara is running 595 secs || 2341346 markings, 6302399 edges, 3647 markings/sec, 595 secs
lola: sara is running 600 secs || 2357441 markings, 6352471 edges, 3219 markings/sec, 600 secs
lola: sara is running 605 secs || 2377353 markings, 6409651 edges, 3982 markings/sec, 605 secs
lola: sara is running 610 secs || 2398240 markings, 6459597 edges, 4177 markings/sec, 610 secs
lola: sara is running 615 secs || 2420025 markings, 6508544 edges, 4357 markings/sec, 615 secs
lola: sara is running 620 secs || 2444079 markings, 6567941 edges, 4811 markings/sec, 620 secs
lola: sara is running 625 secs || 2461528 markings, 6620389 edges, 3490 markings/sec, 625 secs
lola: sara is running 630 secs || 2481036 markings, 6676786 edges, 3902 markings/sec, 630 secs
lola: sara is running 635 secs || 2498582 markings, 6728340 edges, 3509 markings/sec, 635 secs
lola: sara is running 640 secs || 2515578 markings, 6780571 edges, 3399 markings/sec, 640 secs
lola: sara is running 645 secs || 2534199 markings, 6835124 edges, 3724 markings/sec, 645 secs
lola: sara is running 650 secs || 2554710 markings, 6889320 edges, 4102 markings/sec, 650 secs
lola: sara is running 655 secs || 2575341 markings, 6935332 edges, 4126 markings/sec, 655 secs
lola: sara is running 660 secs || 2600992 markings, 6993310 edges, 5130 markings/sec, 660 secs
lola: sara is running 665 secs || 2619072 markings, 7046961 edges, 3616 markings/sec, 665 secs
lola: sara is running 670 secs || 2635299 markings, 7096777 edges, 3245 markings/sec, 670 secs
lola: sara is running 675 secs || 2656078 markings, 7154227 edges, 4156 markings/sec, 675 secs
lola: sara is running 680 secs || 2673065 markings, 7206226 edges, 3397 markings/sec, 680 secs
lola: sara is running 685 secs || 2690577 markings, 7258341 edges, 3502 markings/sec, 685 secs
lola: sara is running 690 secs || 2710227 markings, 7316890 edges, 3930 markings/sec, 690 secs
lola: sara is running 695 secs || 2731422 markings, 7365815 edges, 4239 markings/sec, 695 secs
lola: sara is running 700 secs || 2752903 markings, 7413848 edges, 4296 markings/sec, 700 secs
lola: sara is running 705 secs || 2777280 markings, 7474407 edges, 4875 markings/sec, 705 secs
lola: sara is running 710 secs || 2794471 markings, 7525640 edges, 3438 markings/sec, 710 secs
lola: sara is running 715 secs || 2813048 markings, 7578942 edges, 3715 markings/sec, 715 secs
lola: sara is running 720 secs || 2831675 markings, 7635120 edges, 3725 markings/sec, 720 secs
lola: sara is running 725 secs || 2849182 markings, 7688374 edges, 3501 markings/sec, 725 secs
lola: sara is running 730 secs || 2866710 markings, 7738135 edges, 3506 markings/sec, 730 secs
lola: sara is running 735 secs || 2886564 markings, 7796072 edges, 3971 markings/sec, 735 secs
lola: sara is running 740 secs || 2907502 markings, 7842619 edges, 4188 markings/sec, 740 secs
lola: sara is running 745 secs || 2930541 markings, 7894423 edges, 4608 markings/sec, 745 secs
lola: sara is running 750 secs || 2952300 markings, 7951289 edges, 4352 markings/sec, 750 secs
lola: sara is running 755 secs || 2969846 markings, 8004329 edges, 3509 markings/sec, 755 secs
lola: sara is running 760 secs || 2989703 markings, 8061354 edges, 3971 markings/sec, 760 secs
lola: sara is running 765 secs || 3007090 markings, 8112545 edges, 3477 markings/sec, 765 secs
lola: sara is running 770 secs || 3024530 markings, 8166506 edges, 3488 markings/sec, 770 secs
lola: sara is running 775 secs || 3042387 markings, 8217349 edges, 3571 markings/sec, 775 secs
lola: sara is running 780 secs || 3062758 markings, 8275150 edges, 4074 markings/sec, 780 secs
lola: sara is running 785 secs || 3084622 markings, 8323976 edges, 4373 markings/sec, 785 secs
lola: sara is running 790 secs || 3107395 markings, 8375113 edges, 4555 markings/sec, 790 secs
lola: sara is running 795 secs || 3128942 markings, 8431562 edges, 4309 markings/sec, 795 secs
lola: sara is running 800 secs || 3146207 markings, 8484480 edges, 3453 markings/sec, 800 secs
lola: sara is running 805 secs || 3166615 markings, 8543003 edges, 4082 markings/sec, 805 secs
lola: sara is running 810 secs || 3184202 markings, 8594680 edges, 3517 markings/sec, 810 secs
lola: sara is running 815 secs || 3201332 markings, 8647910 edges, 3426 markings/sec, 815 secs
lola: sara is running 820 secs || 3219253 markings, 8698869 edges, 3584 markings/sec, 820 secs
lola: sara is running 825 secs || 3239710 markings, 8757711 edges, 4091 markings/sec, 825 secs
lola: sara is running 830 secs || 3260529 markings, 8803857 edges, 4164 markings/sec, 830 secs
lola: sara is running 835 secs || 3283814 markings, 8856710 edges, 4657 markings/sec, 835 secs
lola: sara is running 840 secs || 3306639 markings, 8915117 edges, 4565 markings/sec, 840 secs
lola: sara is running 845 secs || 3324149 markings, 8967765 edges, 3502 markings/sec, 845 secs
lola: sara is running 850 secs || 3342393 markings, 9019513 edges, 3649 markings/sec, 850 secs
lola: sara is running 855 secs || 3362061 markings, 9078354 edges, 3934 markings/sec, 855 secs
lola: sara is running 860 secs || 3379131 markings, 9129829 edges, 3414 markings/sec, 860 secs
lola: sara is running 865 secs || 3396345 markings, 9179564 edges, 3443 markings/sec, 865 secs
lola: sara is running 870 secs || 3416023 markings, 9239632 edges, 3936 markings/sec, 870 secs
lola: sara is running 875 secs || 3437041 markings, 9287416 edges, 4204 markings/sec, 875 secs
lola: sara is running 880 secs || 3458268 markings, 9335302 edges, 4245 markings/sec, 880 secs
lola: sara is running 885 secs || 3484353 markings, 9395749 edges, 5217 markings/sec, 885 secs
lola: sara is running 890 secs || 3501319 markings, 9447640 edges, 3393 markings/sec, 890 secs
lola: sara is running 895 secs || 3518184 markings, 9499912 edges, 3373 markings/sec, 895 secs
lola: sara is running 900 secs || 3539204 markings, 9557801 edges, 4204 markings/sec, 900 secs
lola: sara is running 905 secs || 3557098 markings, 9612797 edges, 3579 markings/sec, 905 secs
lola: sara is running 910 secs || 3573529 markings, 9663364 edges, 3286 markings/sec, 910 secs
lola: sara is running 915 secs || 3592468 markings, 9717996 edges, 3788 markings/sec, 915 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3603686 markings, 9751072 edges
lola: ========================================

FORMULA BridgeAndVehicles-PT-V50P20N10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no yes no no no yes yes no no no no no yes
lola:
preliminary result: no no yes no yes no no no yes yes no no no no no yes
lola: memory consumption: 29300 KB
lola: time consumption: 949 seconds

BK_STOP 1526569517598

--------------------
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-V50P20N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N10.tgz
mv BridgeAndVehicles-PT-V50P20N10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is BridgeAndVehicles-PT-V50P20N10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-ebro-152646306400313"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;