fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r088-csrt-149441074500475
Last Updated
June 27, 2017

About the Execution of LoLA for S_BridgeAndVehicles-PT-V50P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1040.370 1458120.00 2920209.00 87.60 F?F?FFFTFFTF?T?T 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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_BridgeAndVehicles-PT-V50P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074500475
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-0
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-1
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1496348789425


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_BridgeAndVehicles-PT-V50P20N10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-PT-V50P20N10: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_BridgeAndVehicles-PT-V50P20N10 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 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: 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-COL-V50P20N10-ReachabilityCardinality.task
lola: E (F (((3 <= VIDANGE_1 + VIDANGE_2) AND (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B) AND (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) AND ((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) OR (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= SORTI_B) OR (ROUTE_B <= 0))))) : A (G (((2 <= CAPACITE) OR (3 <= ROUTE_A) OR (VIDANGE_1 + VIDANGE_2 + 1 <= SORTI_A)))) : A (G ((((CHOIX_1 + CHOIX_2 <= 1) AND (ATTENTE_B <= 1)) OR (((3 <= SUR_PONT_A) OR (SUR_PONT_A <= ROUTE_A)) AND ((CAPACITE <= SUR_PONT_B) OR (SUR_PONT_A <= CAPACITE)))))) : A (G (((((ROUTE_B <= ATTENTE_B) AND (CONTROLEUR_1 + CONTROLEUR_2 <= VIDANGE_1 + VIDANGE_2)) OR (VIDANGE_1 + VIDANGE_2 <= ROUTE_A)) AND ((SORTI_B <= 0) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 2))))) : A (G ((((1 <= VIDANGE_1 + VIDANGE_2) AND (3 <= SORTI_B)) OR ((3 <= 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) AND (SUR_PONT_A <= SORTI_A)) OR (SUR_PONT_A <= VIDANGE_1 + VIDANGE_2) OR (COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 <= SUR_PONT_A) OR (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 + 1 <= CHOIX_1 + CHOIX_2)))) : A (G ((((3 <= 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) AND (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 <= ATTENTE_A) AND (CHOIX_1 + CHOIX_2 <= SORTI_A)) OR (SUR_PONT_A <= ROUTE_B)))) : A (G ((((2 <= ATTENTE_A) OR (1 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) OR ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) AND (3 <= ATTENTE_A))) AND (((2 <= SORTI_A) AND (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 <= SUR_PONT_B)) OR (1 <= CAPACITE))))) : A (G (((CHOIX_1 + CHOIX_2 <= 2) OR ((2 <= ROUTE_A) AND (SUR_PONT_B <= ATTENTE_B))))) : A (G ((2 <= CAPACITE))) : E (F ((((ROUTE_A <= 2) AND (CHOIX_1 + CHOIX_2 <= 0)) OR (((VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B) OR (3 <= ROUTE_B)) AND (2 <= CHOIX_1 + CHOIX_2))))) : A (G ((COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + 1 <= ROUTE_B))) : E (F (((2 <= SUR_PONT_B) AND (CAPACITE + 1 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)))) : A (G ((1 <= ROUTE_A))) : E (F (((ROUTE_B <= SUR_PONT_B) AND (2 <= CONTROLEUR_1 + CONTROLEUR_2)))) : A (G ((((SUR_PONT_B + 1 <= CAPACITE) OR (SORTI_A <= 0)) AND ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= VIDANGE_1 + VIDANGE_2) OR (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 <= 1))))) : E (F (((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 <= 0) OR (ROUTE_B <= 2))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= VIDANGE_1 + VIDANGE_2) AND (VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B) AND (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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= CAPACITE) OR (3 <= ROUTE_A) OR (VIDANGE_1 + VIDANGE_2 + 1 <= SORTI_A))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 35311 markings, 74386 edges, 7062 markings/sec, 0 secs
lola: sara is running 5 secs || 73000 markings, 154958 edges, 7538 markings/sec, 5 secs
lola: sara is running 10 secs || 111321 markings, 237724 edges, 7664 markings/sec, 10 secs
lola: sara is running 15 secs || 150448 markings, 322025 edges, 7825 markings/sec, 15 secs
lola: sara is running 20 secs || 189860 markings, 406780 edges, 7882 markings/sec, 20 secs
lola: sara is running 25 secs || 228999 markings, 496201 edges, 7828 markings/sec, 25 secs
lola: sara is running 30 secs || 267967 markings, 589287 edges, 7794 markings/sec, 30 secs
lola: sara is running 35 secs || 306393 markings, 681426 edges, 7685 markings/sec, 35 secs
lola: sara is running 40 secs || 343884 markings, 774787 edges, 7498 markings/sec, 40 secs
lola: sara is running 45 secs || 381678 markings, 867659 edges, 7559 markings/sec, 45 secs
lola: sara is running 50 secs || 419069 markings, 959935 edges, 7478 markings/sec, 50 secs
lola: sara is running 55 secs || 456458 markings, 1052020 edges, 7478 markings/sec, 55 secs
lola: sara is running 60 secs || 494772 markings, 1146316 edges, 7663 markings/sec, 60 secs
lola: sara is running 65 secs || 533979 markings, 1241852 edges, 7841 markings/sec, 65 secs
lola: sara is running 70 secs || 571883 markings, 1335250 edges, 7581 markings/sec, 70 secs
lola: sara is running 75 secs || 610334 markings, 1429153 edges, 7690 markings/sec, 75 secs
lola: sara is running 80 secs || 649131 markings, 1524465 edges, 7759 markings/sec, 80 secs
lola: sara is running 85 secs || 688255 markings, 1622531 edges, 7825 markings/sec, 85 secs
lola: sara is running 90 secs || 724615 markings, 1713660 edges, 7272 markings/sec, 90 secs
lola: sara is running 95 secs || 761096 markings, 1804340 edges, 7296 markings/sec, 95 secs
lola: sara is running 100 secs || 797323 markings, 1896571 edges, 7245 markings/sec, 100 secs
lola: sara is running 105 secs || 833634 markings, 1986733 edges, 7262 markings/sec, 105 secs
lola: sara is running 110 secs || 871011 markings, 2080628 edges, 7475 markings/sec, 110 secs
lola: sara is running 115 secs || 909536 markings, 2173287 edges, 7705 markings/sec, 115 secs
lola: sara is running 120 secs || 946090 markings, 2261219 edges, 7311 markings/sec, 120 secs
lola: sara is running 125 secs || 982379 markings, 2352838 edges, 7258 markings/sec, 125 secs
lola: sara is running 130 secs || 1018993 markings, 2437397 edges, 7323 markings/sec, 130 secs
lola: sara is running 135 secs || 1055478 markings, 2528337 edges, 7297 markings/sec, 135 secs
lola: sara is running 140 secs || 1091645 markings, 2612307 edges, 7233 markings/sec, 140 secs
lola: sara is running 145 secs || 1128496 markings, 2702471 edges, 7370 markings/sec, 145 secs
lola: sara is running 150 secs || 1165755 markings, 2796042 edges, 7452 markings/sec, 150 secs
lola: sara is running 155 secs || 1202783 markings, 2882243 edges, 7406 markings/sec, 155 secs
lola: sara is running 160 secs || 1240143 markings, 2975168 edges, 7472 markings/sec, 160 secs
lola: sara is running 165 secs || 1277560 markings, 3062038 edges, 7483 markings/sec, 165 secs
lola: sara is running 170 secs || 1314813 markings, 3153406 edges, 7451 markings/sec, 170 secs
lola: sara is running 175 secs || 1352280 markings, 3247931 edges, 7493 markings/sec, 175 secs
lola: sara is running 180 secs || 1390110 markings, 3334667 edges, 7566 markings/sec, 180 secs
lola: sara is running 185 secs || 1427462 markings, 3428347 edges, 7470 markings/sec, 185 secs
lola: sara is running 190 secs || 1465216 markings, 3518073 edges, 7551 markings/sec, 190 secs
lola: sara is running 195 secs || 1502391 markings, 3607156 edges, 7435 markings/sec, 195 secs
lola: sara is running 200 secs || 1539792 markings, 3699848 edges, 7480 markings/sec, 200 secs
lola: sara is running 205 secs || 1577850 markings, 3787889 edges, 7612 markings/sec, 205 secs
lola: sara is running 210 secs || 1616994 markings, 3884680 edges, 7829 markings/sec, 210 secs
lola: sara is running 215 secs || 1654796 markings, 3980456 edges, 7560 markings/sec, 215 secs
lola: sara is running 220 secs || 1692864 markings, 4067252 edges, 7614 markings/sec, 220 secs
lola: sara is running 225 secs || 1731090 markings, 4162598 edges, 7645 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((CHOIX_1 + CHOIX_2 <= 1) AND (ATTENTE_B <= 1)) OR (((3 <= SUR_PONT_A) OR (SUR_PONT_A <= ROUTE_A)) AND ((CAPACITE <= SUR_PONT_B) OR (SUR_PONT_A <= CAPACITE))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((ROUTE_B <= ATTENTE_B) AND (CONTROLEUR_1 + CONTROLEUR_2 <= VIDANGE_1 + VIDANGE_2)) OR (VIDANGE_1 + VIDANGE_2 <= ROUTE_A)) AND ((SORTI_B <= 0) OR (CONTROLEUR_1 + CONTROLEUR_2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= VIDANGE_1 + VIDANGE_2) AND (3 <= SORTI_B)) OR ((3 <= 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 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4.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.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= 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_ATTEN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= ATTENTE_A) OR (1 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) OR ((VIDANGE_1 + VIDANGE_2 <= SORTI_B) AND (3 <= ATTENTE_A))) AND (((2 <= SORTI_A) AND (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_ATTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 36133 markings, 83545 edges, 7227 markings/sec, 0 secs
lola: sara is running 5 secs || 70427 markings, 173423 edges, 6859 markings/sec, 5 secs
lola: sara is running 10 secs || 104622 markings, 265680 edges, 6839 markings/sec, 10 secs
lola: sara is running 15 secs || 137650 markings, 356283 edges, 6606 markings/sec, 15 secs
lola: sara is running 20 secs || 172007 markings, 450485 edges, 6871 markings/sec, 20 secs
lola: sara is running 25 secs || 207624 markings, 547739 edges, 7123 markings/sec, 25 secs
lola: sara is running 30 secs || 245481 markings, 649355 edges, 7571 markings/sec, 30 secs
lola: sara is running 35 secs || 281397 markings, 752119 edges, 7183 markings/sec, 35 secs
lola: sara is running 40 secs || 317778 markings, 848398 edges, 7276 markings/sec, 40 secs
lola: sara is running 45 secs || 353068 markings, 949951 edges, 7058 markings/sec, 45 secs
lola: sara is running 50 secs || 390464 markings, 1048466 edges, 7479 markings/sec, 50 secs
lola: sara is running 55 secs || 424882 markings, 1146882 edges, 6884 markings/sec, 55 secs
lola: sara is running 60 secs || 459781 markings, 1239538 edges, 6980 markings/sec, 60 secs
lola: sara is running 65 secs || 493591 markings, 1334974 edges, 6762 markings/sec, 65 secs
lola: sara is running 70 secs || 528716 markings, 1432396 edges, 7025 markings/sec, 70 secs
lola: sara is running 75 secs || 565195 markings, 1531190 edges, 7296 markings/sec, 75 secs
lola: sara is running 80 secs || 600626 markings, 1632707 edges, 7086 markings/sec, 80 secs
lola: sara is running 85 secs || 636935 markings, 1730291 edges, 7262 markings/sec, 85 secs
lola: sara is running 90 secs || 671324 markings, 1826681 edges, 6878 markings/sec, 90 secs
lola: sara is running 95 secs || 706109 markings, 1926978 edges, 6957 markings/sec, 95 secs
lola: sara is running 100 secs || 742445 markings, 2023409 edges, 7267 markings/sec, 100 secs
lola: sara is running 105 secs || 777539 markings, 2121362 edges, 7019 markings/sec, 105 secs
lola: sara is running 110 secs || 811027 markings, 2217381 edges, 6698 markings/sec, 110 secs
lola: sara is running 115 secs || 849489 markings, 2321734 edges, 7692 markings/sec, 115 secs
lola: sara is running 120 secs || 887725 markings, 2426956 edges, 7647 markings/sec, 120 secs
lola: sara is running 125 secs || 922602 markings, 2528801 edges, 6975 markings/sec, 125 secs
lola: sara is running 130 secs || 958933 markings, 2631370 edges, 7266 markings/sec, 130 secs
lola: sara is running 135 secs || 995548 markings, 2727204 edges, 7323 markings/sec, 135 secs
lola: sara is running 140 secs || 1029725 markings, 2824426 edges, 6835 markings/sec, 140 secs
lola: sara is running 145 secs || 1065665 markings, 2930125 edges, 7188 markings/sec, 145 secs
lola: sara is running 150 secs || 1103671 markings, 3036930 edges, 7601 markings/sec, 150 secs
lola: sara is running 155 secs || 1140162 markings, 3140633 edges, 7298 markings/sec, 155 secs
lola: sara is running 160 secs || 1174170 markings, 3238936 edges, 6802 markings/sec, 160 secs
lola: sara is running 165 secs || 1208134 markings, 3337915 edges, 6793 markings/sec, 165 secs
lola: sara is running 170 secs || 1241717 markings, 3436369 edges, 6717 markings/sec, 170 secs
lola: sara is running 175 secs || 1275451 markings, 3535350 edges, 6747 markings/sec, 175 secs
lola: sara is running 180 secs || 1310410 markings, 3638085 edges, 6992 markings/sec, 180 secs
lola: sara is running 185 secs || 1345580 markings, 3741835 edges, 7034 markings/sec, 185 secs
lola: sara is running 190 secs || 1382737 markings, 3849445 edges, 7431 markings/sec, 190 secs
lola: sara is running 195 secs || 1417604 markings, 3949998 edges, 6973 markings/sec, 195 secs
lola: sara is running 200 secs || 1454365 markings, 4053198 edges, 7352 markings/sec, 200 secs
lola: sara is running 205 secs || 1487962 markings, 4150753 edges, 6719 markings/sec, 205 secs
lola: sara is running 210 secs || 1520874 markings, 4246002 edges, 6582 markings/sec, 210 secs
lola: sara is running 215 secs || 1553785 markings, 4342640 edges, 6582 markings/sec, 215 secs
lola: sara is running 220 secs || 1587079 markings, 4440206 edges, 6659 markings/sec, 220 secs
lola: sara is running 225 secs || 1622737 markings, 4544657 edges, 7132 markings/sec, 225 secs
lola: sara is running 230 secs || 1657597 markings, 4646579 edges, 6972 markings/sec, 230 secs
lola: sara is running 235 secs || 1692860 markings, 4749598 edges, 7053 markings/sec, 235 secs
lola: sara is running 240 secs || 1727850 markings, 4851624 edges, 6998 markings/sec, 240 secs
lola: sara is running 245 secs || 1761073 markings, 4947820 edges, 6645 markings/sec, 245 secs
lola: sara is running 250 secs || 1795268 markings, 5045985 edges, 6839 markings/sec, 250 secs
lola: sara is running 255 secs || 1830631 markings, 5149564 edges, 7073 markings/sec, 255 secs
lola: sara is running 260 secs || 1866260 markings, 5253569 edges, 7126 markings/sec, 260 secs
lola: sara is running 265 secs || 1901238 markings, 5356854 edges, 6996 markings/sec, 265 secs
lola: sara is running 270 secs || 1936368 markings, 5460422 edges, 7026 markings/sec, 270 secs
lola: sara is running 275 secs || 1970820 markings, 5561817 edges, 6890 markings/sec, 275 secs
lola: sara is running 280 secs || 2005367 markings, 5663637 edges, 6909 markings/sec, 280 secs
lola: sara is running 285 secs || 2038373 markings, 5762197 edges, 6601 markings/sec, 285 secs
lola: sara is running 290 secs || 2071224 markings, 5858795 edges, 6570 markings/sec, 290 secs
lola: sara is running 295 secs || 2105884 markings, 5960852 edges, 6932 markings/sec, 295 secs
lola: sara is running 300 secs || 2140748 markings, 6061881 edges, 6973 markings/sec, 300 secs
lola: sara is running 305 secs || 2177282 markings, 6168377 edges, 7307 markings/sec, 305 secs
lola: sara is running 310 secs || 2213758 markings, 6275239 edges, 7295 markings/sec, 310 secs
lola: sara is running 315 secs || 2249556 markings, 6380455 edges, 7160 markings/sec, 315 secs
lola: sara is running 320 secs || 2284399 markings, 6483276 edges, 6969 markings/sec, 320 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((CHOIX_1 + CHOIX_2 <= 2) OR ((2 <= ROUTE_A) AND (SUR_PONT_B <= ATTENTE_B)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7.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.
lola: ========================================
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= CAPACITE)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 7)
lola: sara is running 0 secs || 29123 markings, 71425 edges, 5825 markings/sec, 0 secs
lola: sara is running 5 secs || 57112 markings, 146202 edges, 5598 markings/sec, 5 secs
lola: sara is running 10 secs || 84452 markings, 220126 edges, 5468 markings/sec, 10 secs
lola: sara is running 15 secs || 111681 markings, 294298 edges, 5446 markings/sec, 15 secs
lola: sara is running 20 secs || 139219 markings, 370148 edges, 5508 markings/sec, 20 secs
lola: sara is running 25 secs || 166572 markings, 444732 edges, 5471 markings/sec, 25 secs
lola: sara is running 30 secs || 193742 markings, 519427 edges, 5434 markings/sec, 30 secs
lola: sara is running 35 secs || 220776 markings, 594632 edges, 5407 markings/sec, 35 secs
lola: sara is running 40 secs || 247041 markings, 669460 edges, 5253 markings/sec, 40 secs
lola: sara is running 45 secs || 275178 markings, 748256 edges, 5627 markings/sec, 45 secs
lola: sara is running 50 secs || 302088 markings, 825382 edges, 5382 markings/sec, 50 secs
lola: sara is running 55 secs || 328218 markings, 901129 edges, 5226 markings/sec, 55 secs
lola: sara is running 60 secs || 356679 markings, 978790 edges, 5692 markings/sec, 60 secs
lola: sara is running 65 secs || 383817 markings, 1057359 edges, 5428 markings/sec, 65 secs
lola: sara is running 70 secs || 410433 markings, 1135050 edges, 5323 markings/sec, 70 secs
lola: sara is running 75 secs || 439180 markings, 1213683 edges, 5749 markings/sec, 75 secs
lola: sara is running 80 secs || 466548 markings, 1291124 edges, 5474 markings/sec, 80 secs
lola: sara is running 85 secs || 493272 markings, 1369810 edges, 5345 markings/sec, 85 secs
lola: sara is running 90 secs || 520929 markings, 1447167 edges, 5531 markings/sec, 90 secs
lola: sara is running 95 secs || 548915 markings, 1526311 edges, 5597 markings/sec, 95 secs
lola: sara is running 100 secs || 575688 markings, 1604078 edges, 5355 markings/sec, 100 secs
lola: sara is running 105 secs || 602202 markings, 1681404 edges, 5303 markings/sec, 105 secs
lola: sara is running 110 secs || 630829 markings, 1760086 edges, 5725 markings/sec, 110 secs
lola: sara is running 115 secs || 657748 markings, 1836907 edges, 5384 markings/sec, 115 secs
lola: sara is running 120 secs || 684555 markings, 1915285 edges, 5361 markings/sec, 120 secs
lola: sara is running 125 secs || 711074 markings, 1991766 edges, 5304 markings/sec, 125 secs
lola: sara is running 130 secs || 739009 markings, 2070156 edges, 5587 markings/sec, 130 secs
lola: sara is running 135 secs || 767049 markings, 2149344 edges, 5608 markings/sec, 135 secs
lola: sara is running 140 secs || 793781 markings, 2226181 edges, 5346 markings/sec, 140 secs
lola: sara is running 145 secs || 820271 markings, 2305038 edges, 5298 markings/sec, 145 secs
lola: sara is running 150 secs || 847034 markings, 2383539 edges, 5353 markings/sec, 150 secs
lola: sara is running 155 secs || 875336 markings, 2460009 edges, 5660 markings/sec, 155 secs
lola: sara is running 160 secs || 902917 markings, 2538202 edges, 5516 markings/sec, 160 secs
lola: sara is running 165 secs || 929374 markings, 2616606 edges, 5291 markings/sec, 165 secs
lola: sara is running 170 secs || 955893 markings, 2693617 edges, 5304 markings/sec, 170 secs
lola: sara is running 175 secs || 982457 markings, 2771570 edges, 5313 markings/sec, 175 secs
lola: sara is running 180 secs || 1011049 markings, 2849187 edges, 5718 markings/sec, 180 secs
lola: sara is running 185 secs || 1038554 markings, 2927430 edges, 5501 markings/sec, 185 secs
lola: sara is running 190 secs || 1065355 markings, 3006261 edges, 5360 markings/sec, 190 secs
lola: sara is running 195 secs || 1092031 markings, 3084968 edges, 5335 markings/sec, 195 secs
lola: sara is running 200 secs || 1117300 markings, 3159459 edges, 5054 markings/sec, 200 secs
lola: sara is running 205 secs || 1143621 markings, 3229851 edges, 5264 markings/sec, 205 secs
lola: sara is running 210 secs || 1170477 markings, 3305970 edges, 5371 markings/sec, 210 secs
lola: sara is running 215 secs || 1196078 markings, 3381346 edges, 5120 markings/sec, 215 secs
lola: sara is running 220 secs || 1221297 markings, 3454665 edges, 5044 markings/sec, 220 secs
lola: sara is running 225 secs || 1246418 markings, 3528481 edges, 5024 markings/sec, 225 secs
lola: sara is running 230 secs || 1271601 markings, 3603434 edges, 5037 markings/sec, 230 secs
lola: sara is running 235 secs || 1297377 markings, 3673554 edges, 5155 markings/sec, 235 secs
lola: sara is running 240 secs || 1324277 markings, 3747643 edges, 5380 markings/sec, 240 secs
lola: sara is running 245 secs || 1349675 markings, 3819234 edges, 5080 markings/sec, 245 secs
lola: sara is running 250 secs || 1376103 markings, 3896140 edges, 5286 markings/sec, 250 secs
lola: sara is running 255 secs || 1402911 markings, 3973958 edges, 5362 markings/sec, 255 secs
lola: sara is running 260 secs || 1430062 markings, 4053065 edges, 5430 markings/sec, 260 secs
lola: sara is running 265 secs || 1456543 markings, 4130259 edges, 5296 markings/sec, 265 secs
lola: sara is running 270 secs || 1482900 markings, 4207451 edges, 5271 markings/sec, 270 secs
lola: sara is running 275 secs || 1510025 markings, 4287364 edges, 5425 markings/sec, 275 secs
lola: sara is running 280 secs || 1536442 markings, 4362406 edges, 5283 markings/sec, 280 secs
lola: sara is running 285 secs || 1562147 markings, 4438568 edges, 5141 markings/sec, 285 secs
lola: sara is running 290 secs || 1586120 markings, 4509867 edges, 4795 markings/sec, 290 secs
lola: sara is running 295 secs || 1613982 markings, 4586791 edges, 5572 markings/sec, 295 secs
lola: sara is running 300 secs || 1641766 markings, 4662965 edges, 5557 markings/sec, 300 secs
lola: sara is running 305 secs || 1669527 markings, 4736630 edges, 5552 markings/sec, 305 secs
lola: sara is running 310 secs || 1695548 markings, 4811676 edges, 5204 markings/sec, 310 secs
lola: sara is running 315 secs || 1720748 markings, 4884302 edges, 5040 markings/sec, 315 secs
lola: sara is running 320 secs || 1745700 markings, 4956388 edges, 4990 markings/sec, 320 secs
lola: sara is running 325 secs || 1769852 markings, 5026103 edges, 4830 markings/sec, 325 secs
lola: sara is running 330 secs || 1794553 markings, 5097982 edges, 4940 markings/sec, 330 secs
lola: sara is running 335 secs || 1820728 markings, 5171795 edges, 5235 markings/sec, 335 secs
lola: sara is running 340 secs || 1848456 markings, 5252339 edges, 5546 markings/sec, 340 secs
lola: sara is running 345 secs || 1874325 markings, 5327534 edges, 5174 markings/sec, 345 secs
lola: sara is running 350 secs || 1900713 markings, 5403549 edges, 5278 markings/sec, 350 secs
lola: sara is running 355 secs || 1928275 markings, 5482796 edges, 5512 markings/sec, 355 secs
lola: sara is running 360 secs || 1954656 markings, 5560709 edges, 5276 markings/sec, 360 secs
lola: sara is running 365 secs || 1982585 markings, 5636934 edges, 5586 markings/sec, 365 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((ROUTE_A <= 2) AND (CHOIX_1 + CHOIX_2 <= 0)) OR (((VIDANGE_1 + VIDANGE_2 <= SUR_PONT_B) OR (3 <= ROUTE_B)) AND (2 <= CHOIX_1 + CHOIX_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + 1 <= ROUTE_B)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= SUR_PONT_B) AND (CAPACITE + 1 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 38179 markings, 80770 edges, 7636 markings/sec, 0 secs
lola: sara is running 5 secs || 74934 markings, 168632 edges, 7351 markings/sec, 5 secs
lola: sara is running 10 secs || 114178 markings, 258015 edges, 7849 markings/sec, 10 secs
lola: sara is running 15 secs || 151810 markings, 344319 edges, 7526 markings/sec, 15 secs
lola: sara is running 20 secs || 190795 markings, 437629 edges, 7797 markings/sec, 20 secs
lola: sara is running 25 secs || 229335 markings, 524837 edges, 7708 markings/sec, 25 secs
lola: sara is running 30 secs || 269605 markings, 619287 edges, 8054 markings/sec, 30 secs
lola: sara is running 35 secs || 306789 markings, 703782 edges, 7437 markings/sec, 35 secs
lola: sara is running 40 secs || 346145 markings, 786183 edges, 7871 markings/sec, 40 secs
lola: sara is running 45 secs || 382866 markings, 864557 edges, 7344 markings/sec, 45 secs
lola: sara is running 50 secs || 419936 markings, 952192 edges, 7414 markings/sec, 50 secs
lola: sara is running 55 secs || 456283 markings, 1038344 edges, 7269 markings/sec, 55 secs
lola: sara is running 60 secs || 490831 markings, 1121207 edges, 6910 markings/sec, 60 secs
lola: sara is running 65 secs || 525781 markings, 1204030 edges, 6990 markings/sec, 65 secs
lola: sara is running 70 secs || 563326 markings, 1293128 edges, 7509 markings/sec, 70 secs
lola: sara is running 75 secs || 600298 markings, 1380039 edges, 7394 markings/sec, 75 secs
lola: sara is running 80 secs || 636840 markings, 1466920 edges, 7308 markings/sec, 80 secs
lola: sara is running 85 secs || 672503 markings, 1550911 edges, 7133 markings/sec, 85 secs
lola: sara is running 90 secs || 708101 markings, 1635501 edges, 7120 markings/sec, 90 secs
lola: sara is running 95 secs || 742345 markings, 1716304 edges, 6849 markings/sec, 95 secs
lola: sara is running 100 secs || 774330 markings, 1789899 edges, 6397 markings/sec, 100 secs
lola: sara is running 105 secs || 808469 markings, 1872879 edges, 6828 markings/sec, 105 secs
lola: sara is running 110 secs || 841406 markings, 1952659 edges, 6587 markings/sec, 110 secs
lola: sara is running 115 secs || 878644 markings, 2043461 edges, 7448 markings/sec, 115 secs
lola: sara is running 120 secs || 915247 markings, 2132849 edges, 7321 markings/sec, 120 secs
lola: sara is running 125 secs || 947728 markings, 2211729 edges, 6496 markings/sec, 125 secs
lola: sara is running 130 secs || 983256 markings, 2298558 edges, 7106 markings/sec, 130 secs
lola: sara is running 135 secs || 1018222 markings, 2384100 edges, 6993 markings/sec, 135 secs
lola: sara is running 140 secs || 1053612 markings, 2470870 edges, 7078 markings/sec, 140 secs
lola: sara is running 145 secs || 1088560 markings, 2555278 edges, 6990 markings/sec, 145 secs
lola: sara is running 150 secs || 1124467 markings, 2642701 edges, 7181 markings/sec, 150 secs
lola: sara is running 155 secs || 1160124 markings, 2729985 edges, 7131 markings/sec, 155 secs
lola: sara is running 160 secs || 1197030 markings, 2819797 edges, 7381 markings/sec, 160 secs
lola: sara is running 165 secs || 1233876 markings, 2909988 edges, 7369 markings/sec, 165 secs
lola: sara is running 170 secs || 1265316 markings, 2984084 edges, 6288 markings/sec, 170 secs
lola: sara is running 175 secs || 1297880 markings, 3062445 edges, 6513 markings/sec, 175 secs
lola: sara is running 180 secs || 1333928 markings, 3150206 edges, 7210 markings/sec, 180 secs
lola: sara is running 185 secs || 1368668 markings, 3236453 edges, 6948 markings/sec, 185 secs
lola: sara is running 190 secs || 1404962 markings, 3327733 edges, 7259 markings/sec, 190 secs
lola: sara is running 195 secs || 1440442 markings, 3414526 edges, 7096 markings/sec, 195 secs
lola: sara is running 200 secs || 1475738 markings, 3503301 edges, 7059 markings/sec, 200 secs
lola: sara is running 205 secs || 1509809 markings, 3586412 edges, 6814 markings/sec, 205 secs
lola: sara is running 210 secs || 1544915 markings, 3672523 edges, 7021 markings/sec, 210 secs
lola: sara is running 215 secs || 1577297 markings, 3752944 edges, 6476 markings/sec, 215 secs
lola: sara is running 220 secs || 1612849 markings, 3841667 edges, 7110 markings/sec, 220 secs
lola: sara is running 225 secs || 1647579 markings, 3927625 edges, 6946 markings/sec, 225 secs
lola: sara is running 230 secs || 1684023 markings, 4017726 edges, 7289 markings/sec, 230 secs
lola: sara is running 235 secs || 1719215 markings, 4104728 edges, 7038 markings/sec, 235 secs
lola: sara is running 240 secs || 1751798 markings, 4185895 edges, 6517 markings/sec, 240 secs
lola: sara is running 245 secs || 1788193 markings, 4276007 edges, 7279 markings/sec, 245 secs
lola: sara is running 250 secs || 1823492 markings, 4363697 edges, 7060 markings/sec, 250 secs
lola: sara is running 255 secs || 1858481 markings, 4451338 edges, 6998 markings/sec, 255 secs
lola: sara is running 260 secs || 1892333 markings, 4533883 edges, 6770 markings/sec, 260 secs
lola: sara is running 265 secs || 1921027 markings, 4605853 edges, 5739 markings/sec, 265 secs
lola: sara is running 270 secs || 1953556 markings, 4685415 edges, 6506 markings/sec, 270 secs
lola: sara is running 275 secs || 1985561 markings, 4763522 edges, 6401 markings/sec, 275 secs
lola: sara is running 280 secs || 2019166 markings, 4845078 edges, 6721 markings/sec, 280 secs
lola: sara is running 285 secs || 2052308 markings, 4930574 edges, 6628 markings/sec, 285 secs
lola: sara is running 290 secs || 2086403 markings, 5014959 edges, 6819 markings/sec, 290 secs
lola: sara is running 295 secs || 2122962 markings, 5105801 edges, 7312 markings/sec, 295 secs
lola: sara is running 300 secs || 2158097 markings, 5195177 edges, 7027 markings/sec, 300 secs
lola: sara is running 305 secs || 2194145 markings, 5285737 edges, 7210 markings/sec, 305 secs
lola: sara is running 310 secs || 2230420 markings, 5375272 edges, 7255 markings/sec, 310 secs
lola: sara is running 315 secs || 2265070 markings, 5462747 edges, 6930 markings/sec, 315 secs
lola: sara is running 320 secs || 2298498 markings, 5547416 edges, 6686 markings/sec, 320 secs
lola: sara is running 325 secs || 2332179 markings, 5630860 edges, 6736 markings/sec, 325 secs
lola: sara is running 330 secs || 2368336 markings, 5722726 edges, 7231 markings/sec, 330 secs
lola: sara is running 335 secs || 2401056 markings, 5803655 edges, 6544 markings/sec, 335 secs
lola: sara is running 340 secs || 2436743 markings, 5893890 edges, 7137 markings/sec, 340 secs
lola: sara is running 345 secs || 2469811 markings, 5976324 edges, 6614 markings/sec, 345 secs
lola: sara is running 350 secs || 2506304 markings, 6068801 edges, 7299 markings/sec, 350 secs
lola: sara is running 355 secs || 2541209 markings, 6155807 edges, 6981 markings/sec, 355 secs
lola: sara is running 360 secs || 2576525 markings, 6243510 edges, 7063 markings/sec, 360 secs
lola: sara is running 365 secs || 2611075 markings, 6332138 edges, 6910 markings/sec, 365 secs
lola: sara is running 370 secs || 2646016 markings, 6419177 edges, 6988 markings/sec, 370 secs
lola: sara is running 375 secs || 2683098 markings, 6509946 edges, 7416 markings/sec, 375 secs
lola: sara is running 380 secs || 2713712 markings, 6588702 edges, 6123 markings/sec, 380 secs
lola: sara is running 385 secs || 2741820 markings, 6661219 edges, 5622 markings/sec, 385 secs
lola: sara is running 390 secs || 2774955 markings, 6743700 edges, 6627 markings/sec, 390 secs
lola: sara is running 395 secs || 2803604 markings, 6816876 edges, 5730 markings/sec, 395 secs
lola: sara is running 400 secs || 2834813 markings, 6894080 edges, 6242 markings/sec, 400 secs
lola: sara is running 405 secs || 2864573 markings, 6967617 edges, 5952 markings/sec, 405 secs
lola: sara is running 410 secs || 2899612 markings, 7056536 edges, 7008 markings/sec, 410 secs
lola: sara is running 415 secs || 2934217 markings, 7143628 edges, 6921 markings/sec, 415 secs
lola: sara is running 420 secs || 2967081 markings, 7227047 edges, 6573 markings/sec, 420 secs
lola: sara is running 425 secs || 3001453 markings, 7313757 edges, 6874 markings/sec, 425 secs
lola: sara is running 430 secs || 3036349 markings, 7402246 edges, 6979 markings/sec, 430 secs
lola: sara is running 435 secs || 3069208 markings, 7485614 edges, 6572 markings/sec, 435 secs
lola: sara is running 440 secs || 3106329 markings, 7579783 edges, 7424 markings/sec, 440 secs
lola: sara is running 445 secs || 3140021 markings, 7665601 edges, 6738 markings/sec, 445 secs
lola: sara is running 450 secs || 3175459 markings, 7754592 edges, 7088 markings/sec, 450 secs
lola: sara is running 455 secs || 3209336 markings, 7841880 edges, 6775 markings/sec, 455 secs
lola: sara is running 460 secs || 3243827 markings, 7927939 edges, 6898 markings/sec, 460 secs
lola: sara is running 465 secs || 3279052 markings, 8016131 edges, 7045 markings/sec, 465 secs
lola: sara is running 470 secs || 3313602 markings, 8104527 edges, 6910 markings/sec, 470 secs
lola: sara is running 475 secs || 3348563 markings, 8192840 edges, 6992 markings/sec, 475 secs
lola: sara is running 480 secs || 3382079 markings, 8279395 edges, 6703 markings/sec, 480 secs
lola: sara is running 485 secs || 3416357 markings, 8364999 edges, 6856 markings/sec, 485 secs
lola: sara is running 490 secs || 3451926 markings, 8455290 edges, 7114 markings/sec, 490 secs
lola: sara is running 495 secs || 3483048 markings, 8533596 edges, 6224 markings/sec, 495 secs
lola: sara is running 500 secs || 3514781 markings, 8615434 edges, 6347 markings/sec, 500 secs
lola: sara is running 505 secs || 3550408 markings, 8704989 edges, 7125 markings/sec, 505 secs
lola: sara is running 510 secs || 3583576 markings, 8790550 edges, 6634 markings/sec, 510 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= ROUTE_A)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ROUTE_B <= SUR_PONT_B) AND (2 <= CONTROLEUR_1 + CONTROLEUR_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1041 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((SUR_PONT_B + 1 <= CAPACITE) OR (SORTI_A <= 0)) AND ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= VIDANGE_1 + VIDANGE_2) OR (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_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2082 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((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_ATT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 484 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: no unknown no no yes no unknown yes unknown yes no unknown no no no yes
lola: ========================================
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496350247545

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_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/S_BridgeAndVehicles-PT-V50P20N10.tgz
mv S_BridgeAndVehicles-PT-V50P20N10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_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 r088-csrt-149441074500475"
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 ;