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 BridgeAndVehicles-PT-V50P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126400502
=====================================================================

--------------------
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-V50P50N10-ReachabilityCardinality-0
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-1
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-4
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-5
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-7
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-8
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1494616019639


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ BridgeAndVehicles-PT-V50P50N10 @ 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-V50P50N10-ReachabilityCardinality.task
lola: E (F ((ROUTE_B <= CHOIX_1 + CHOIX_2))) : A (G ((2 <= CAPACITE))) : A (G (((CONTROLEUR_1 + CONTROLEUR_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 (2 <= ROUTE_A)))) : E (F ((3 <= SORTI_B))) : A (G ((2 <= ROUTE_B))) : E (F (((ROUTE_A <= 0) AND ((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 (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 ((CHOIX_1 + CHOIX_2 <= 2) OR (ROUTE_B + 1 <= ROUTE_A))))) : A (G (((((ATTENTE_B <= ROUTE_A) OR (2 <= ATTENTE_A)) AND (ATTENTE_A <= ROUTE_B)) OR (ROUTE_A <= CHOIX_1 + CHOIX_2)))) : E (F (((3 <= SUR_PONT_B) AND (SUR_PONT_A + 1 <= ATTENTE_B)))) : E (F (((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 + 1 <= ATTENTE_A) AND (CAPACITE + 1 <= ROUTE_A) AND ((CONTROLEUR_1 + CONTROLEUR_2 + 1 <= ATTENTE_A) OR (SUR_PONT_A + 1 <= CONTROLEUR_1 + CONTROLEUR_2))))) : E (F (((CAPACITE <= 1) 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 + 1 <= SUR_PONT_A)))) : E (F ((((1 <= SUR_PONT_B) OR (3 <= CONTROLEUR_1 + CONTROLEUR_2)) AND (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)))) : E (F (((2 <= CONTROLEUR_1 + CONTROLEUR_2) AND ((2 <= CONTROLEUR_1 + CONTROLEUR_2) OR (SORTI_B <= ROUTE_A) OR (ROUTE_B <= 1))))) : E (F ((((SUR_PONT_A <= ROUTE_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 <= CONTROLEUR_1 + CONTROLEUR_2)) AND (SORTI_A + 1 <= CHOIX_1 + CHOIX_2) AND (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)))) : A (G ((CHOIX_1 + CHOIX_2 <= COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9))) : E (F ((ROUTE_B <= VIDANGE_1 + VIDANGE_2))) : E (F ((((ROUTE_A <= SORTI_B) 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 <= 1)) OR ((CAPACITE <= 2) AND (ATTENTE_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 ((ROUTE_B <= 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 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-V50P50N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 14)
lola: sara is running 0 secs || 28500 markings, 69818 edges, 5700 markings/sec, 0 secs
lola: sara is running 5 secs || 56286 markings, 143909 edges, 5557 markings/sec, 5 secs
lola: sara is running 10 secs || 83803 markings, 218397 edges, 5503 markings/sec, 10 secs
lola: sara is running 15 secs || 109923 markings, 289623 edges, 5224 markings/sec, 15 secs
lola: sara is running 20 secs || 136207 markings, 362079 edges, 5257 markings/sec, 20 secs
lola: sara is running 25 secs || 162338 markings, 433128 edges, 5226 markings/sec, 25 secs
lola: sara is running 30 secs || 188612 markings, 506840 edges, 5255 markings/sec, 30 secs
lola: sara is running 35 secs || 216265 markings, 581554 edges, 5531 markings/sec, 35 secs
lola: sara is running 40 secs || 243493 markings, 659960 edges, 5446 markings/sec, 40 secs
lola: sara is running 45 secs || 271446 markings, 737704 edges, 5591 markings/sec, 45 secs
lola: sara is running 50 secs || 299223 markings, 816724 edges, 5555 markings/sec, 50 secs
lola: sara is running 55 secs || 325208 markings, 892393 edges, 5197 markings/sec, 55 secs
lola: sara is running 60 secs || 353187 markings, 969386 edges, 5596 markings/sec, 60 secs
lola: sara is running 65 secs || 379033 markings, 1042990 edges, 5169 markings/sec, 65 secs
lola: sara is running 70 secs || 405365 markings, 1119351 edges, 5266 markings/sec, 70 secs
lola: sara is running 75 secs || 432494 markings, 1194853 edges, 5426 markings/sec, 75 secs
lola: sara is running 80 secs || 458138 markings, 1267899 edges, 5129 markings/sec, 80 secs
lola: sara is running 85 secs || 483018 markings, 1339623 edges, 4976 markings/sec, 85 secs
lola: sara is running 90 secs || 508006 markings, 1413355 edges, 4998 markings/sec, 90 secs
lola: sara is running 95 secs || 534457 markings, 1484991 edges, 5290 markings/sec, 95 secs
lola: sara is running 100 secs || 560282 markings, 1559466 edges, 5165 markings/sec, 100 secs
lola: sara is running 105 secs || 585958 markings, 1634040 edges, 5135 markings/sec, 105 secs
lola: sara is running 110 secs || 612176 markings, 1710897 edges, 5244 markings/sec, 110 secs
lola: sara is running 115 secs || 639829 markings, 1785646 edges, 5531 markings/sec, 115 secs
lola: sara is running 120 secs || 665748 markings, 1860706 edges, 5184 markings/sec, 120 secs
lola: sara is running 125 secs || 692381 markings, 1937163 edges, 5327 markings/sec, 125 secs
lola: sara is running 130 secs || 718819 markings, 2016161 edges, 5288 markings/sec, 130 secs
lola: sara is running 135 secs || 748655 markings, 2097189 edges, 5967 markings/sec, 135 secs
lola: sara is running 140 secs || 778023 markings, 2180384 edges, 5874 markings/sec, 140 secs
lola: sara is running 145 secs || 805296 markings, 2260383 edges, 5455 markings/sec, 145 secs
lola: sara is running 150 secs || 832176 markings, 2338265 edges, 5376 markings/sec, 150 secs
lola: sara is running 155 secs || 860466 markings, 2419202 edges, 5658 markings/sec, 155 secs
lola: sara is running 160 secs || 890954 markings, 2503629 edges, 6098 markings/sec, 160 secs
lola: sara is running 165 secs || 919210 markings, 2585351 edges, 5651 markings/sec, 165 secs
lola: sara is running 170 secs || 945251 markings, 2662441 edges, 5208 markings/sec, 170 secs
lola: sara is running 175 secs || 971322 markings, 2739849 edges, 5214 markings/sec, 175 secs
lola: sara is running 180 secs || 997716 markings, 2811432 edges, 5279 markings/sec, 180 secs
lola: sara is running 185 secs || 1024430 markings, 2886718 edges, 5343 markings/sec, 185 secs
lola: sara is running 190 secs || 1051485 markings, 2965829 edges, 5411 markings/sec, 190 secs
lola: sara is running 195 secs || 1078486 markings, 3042598 edges, 5400 markings/sec, 195 secs
lola: sara is running 200 secs || 1104984 markings, 3121460 edges, 5300 markings/sec, 200 secs
lola: sara is running 205 secs || 1132004 markings, 3201086 edges, 5404 markings/sec, 205 secs
lola: sara is running 210 secs || 1161722 markings, 3281442 edges, 5944 markings/sec, 210 secs
lola: sara is running 215 secs || 1189316 markings, 3360297 edges, 5519 markings/sec, 215 secs
lola: sara is running 220 secs || 1215704 markings, 3438849 edges, 5278 markings/sec, 220 secs
lola: sara is running 225 secs || 1242671 markings, 3517962 edges, 5393 markings/sec, 225 secs
lola: sara is running 230 secs || 1268738 markings, 3594991 edges, 5213 markings/sec, 230 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 (((CONTROLEUR_1 + CONTROLEUR_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 + N... (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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2.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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= SORTI_B)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= 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-V50P50N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ROUTE_A <= 0) AND ((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 (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_ATTE... (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 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((ATTENTE_B <= ROUTE_A) OR (2 <= ATTENTE_A)) AND (ATTENTE_A <= ROUTE_B)) OR (ROUTE_A <= CHOIX_1 + CHOIX_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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= SUR_PONT_B) AND (SUR_PONT_A + 1 <= ATTENTE_B))))
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-V50P50N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((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_3... (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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 156)
lola: sara is running 0 secs || 30359 markings, 70899 edges, 6072 markings/sec, 0 secs
lola: sara is running 5 secs || 57967 markings, 143540 edges, 5522 markings/sec, 5 secs
lola: sara is running 10 secs || 85466 markings, 217102 edges, 5500 markings/sec, 10 secs
lola: sara is running 15 secs || 112914 markings, 291700 edges, 5490 markings/sec, 15 secs
lola: sara is running 20 secs || 140840 markings, 367981 edges, 5585 markings/sec, 20 secs
lola: sara is running 25 secs || 168589 markings, 442669 edges, 5550 markings/sec, 25 secs
lola: sara is running 30 secs || 195966 markings, 516117 edges, 5475 markings/sec, 30 secs
lola: sara is running 35 secs || 221530 markings, 587718 edges, 5113 markings/sec, 35 secs
lola: sara is running 40 secs || 248247 markings, 664606 edges, 5343 markings/sec, 40 secs
lola: sara is running 45 secs || 274566 markings, 735587 edges, 5264 markings/sec, 45 secs
lola: sara is running 50 secs || 298512 markings, 803531 edges, 4789 markings/sec, 50 secs
lola: sara is running 55 secs || 323016 markings, 874229 edges, 4901 markings/sec, 55 secs
lola: sara is running 60 secs || 352149 markings, 952660 edges, 5827 markings/sec, 60 secs
lola: sara is running 65 secs || 378228 markings, 1027006 edges, 5216 markings/sec, 65 secs
lola: sara is running 70 secs || 404587 markings, 1103538 edges, 5272 markings/sec, 70 secs
lola: sara is running 75 secs || 432539 markings, 1178177 edges, 5590 markings/sec, 75 secs
lola: sara is running 80 secs || 457705 markings, 1250549 edges, 5033 markings/sec, 80 secs
lola: sara is running 85 secs || 483163 markings, 1322981 edges, 5092 markings/sec, 85 secs
lola: sara is running 90 secs || 511989 markings, 1401658 edges, 5765 markings/sec, 90 secs
lola: sara is running 95 secs || 538297 markings, 1475518 edges, 5262 markings/sec, 95 secs
lola: sara is running 100 secs || 563765 markings, 1549539 edges, 5094 markings/sec, 100 secs
lola: sara is running 105 secs || 589880 markings, 1626313 edges, 5223 markings/sec, 105 secs
lola: sara is running 110 secs || 618774 markings, 1702466 edges, 5779 markings/sec, 110 secs
lola: sara is running 115 secs || 645419 markings, 1778148 edges, 5329 markings/sec, 115 secs
lola: sara is running 120 secs || 671132 markings, 1852492 edges, 5143 markings/sec, 120 secs
lola: sara is running 125 secs || 696688 markings, 1927111 edges, 5111 markings/sec, 125 secs
lola: sara is running 130 secs || 726888 markings, 2007426 edges, 6040 markings/sec, 130 secs
lola: sara is running 135 secs || 752908 markings, 2081101 edges, 5204 markings/sec, 135 secs
lola: sara is running 140 secs || 778976 markings, 2157013 edges, 5214 markings/sec, 140 secs
lola: sara is running 145 secs || 805194 markings, 2232373 edges, 5244 markings/sec, 145 secs
lola: sara is running 150 secs || 829991 markings, 2305148 edges, 4959 markings/sec, 150 secs
lola: sara is running 155 secs || 860752 markings, 2385665 edges, 6152 markings/sec, 155 secs
lola: sara is running 160 secs || 886867 markings, 2460577 edges, 5223 markings/sec, 160 secs
lola: sara is running 165 secs || 912411 markings, 2534298 edges, 5109 markings/sec, 165 secs
lola: sara is running 170 secs || 938919 markings, 2610678 edges, 5302 markings/sec, 170 secs
lola: sara is running 175 secs || 964321 markings, 2686086 edges, 5080 markings/sec, 175 secs
lola: sara is running 180 secs || 995317 markings, 2765955 edges, 6199 markings/sec, 180 secs
lola: sara is running 185 secs || 1020617 markings, 2838794 edges, 5060 markings/sec, 185 secs
lola: sara is running 190 secs || 1045696 markings, 2911736 edges, 5016 markings/sec, 190 secs
lola: sara is running 195 secs || 1071426 markings, 2986199 edges, 5146 markings/sec, 195 secs
lola: sara is running 200 secs || 1097203 markings, 3062089 edges, 5155 markings/sec, 200 secs
lola: sara is running 205 secs || 1126763 markings, 3138142 edges, 5912 markings/sec, 205 secs
lola: sara is running 210 secs || 1153379 markings, 3214264 edges, 5323 markings/sec, 210 secs
lola: sara is running 215 secs || 1178554 markings, 3286898 edges, 5035 markings/sec, 215 secs
lola: sara is running 220 secs || 1204351 markings, 3361348 edges, 5159 markings/sec, 220 secs
lola: sara is running 225 secs || 1229865 markings, 3435859 edges, 5103 markings/sec, 225 secs
lola: sara is running 230 secs || 1255743 markings, 3511360 edges, 5176 markings/sec, 230 secs
lola: sara is running 235 secs || 1283643 markings, 3587304 edges, 5580 markings/sec, 235 secs
lola: sara is running 240 secs || 1311724 markings, 3663923 edges, 5616 markings/sec, 240 secs
lola: sara is running 245 secs || 1338956 markings, 3740103 edges, 5446 markings/sec, 245 secs
lola: sara is running 250 secs || 1367777 markings, 3820282 edges, 5764 markings/sec, 250 secs
lola: sara is running 255 secs || 1396184 markings, 3898747 edges, 5681 markings/sec, 255 secs
lola: sara is running 260 secs || 1422897 markings, 3971683 edges, 5343 markings/sec, 260 secs
lola: sara is running 265 secs || 1448984 markings, 4050921 edges, 5217 markings/sec, 265 secs
lola: sara is running 270 secs || 1474032 markings, 4126836 edges, 5010 markings/sec, 270 secs
lola: sara is running 275 secs || 1499863 markings, 4205059 edges, 5166 markings/sec, 275 secs
lola: sara is running 280 secs || 1526193 markings, 4283750 edges, 5266 markings/sec, 280 secs
lola: sara is running 285 secs || 1551353 markings, 4359594 edges, 5032 markings/sec, 285 secs
lola: sara is running 290 secs || 1576236 markings, 4430592 edges, 4977 markings/sec, 290 secs
lola: sara is running 295 secs || 1603615 markings, 4505144 edges, 5476 markings/sec, 295 secs
lola: sara is running 300 secs || 1631097 markings, 4579320 edges, 5496 markings/sec, 300 secs
lola: sara is running 305 secs || 1657134 markings, 4653085 edges, 5207 markings/sec, 305 secs
lola: sara is running 310 secs || 1683059 markings, 4725909 edges, 5185 markings/sec, 310 secs
lola: sara is running 315 secs || 1709055 markings, 4799360 edges, 5199 markings/sec, 315 secs
lola: sara is running 320 secs || 1735053 markings, 4871797 edges, 5200 markings/sec, 320 secs
lola: sara is running 325 secs || 1760772 markings, 4943189 edges, 5144 markings/sec, 325 secs
lola: sara is running 330 secs || 1784500 markings, 5013155 edges, 4746 markings/sec, 330 secs
lola: sara is running 335 secs || 1809204 markings, 5086062 edges, 4941 markings/sec, 335 secs
lola: sara is running 340 secs || 1833853 markings, 5158989 edges, 4930 markings/sec, 340 secs
lola: sara is running 345 secs || 1857972 markings, 5228655 edges, 4824 markings/sec, 345 secs
lola: sara is running 350 secs || 1881358 markings, 5299100 edges, 4677 markings/sec, 350 secs
lola: sara is running 355 secs || 1905439 markings, 5370002 edges, 4816 markings/sec, 355 secs
lola: sara is running 360 secs || 1929690 markings, 5439571 edges, 4850 markings/sec, 360 secs
lola: sara is running 365 secs || 1955919 markings, 5512406 edges, 5246 markings/sec, 365 secs
lola: sara is running 370 secs || 1983072 markings, 5586574 edges, 5431 markings/sec, 370 secs
lola: sara is running 375 secs || 2009668 markings, 5660346 edges, 5319 markings/sec, 375 secs
lola: sara is running 380 secs || 2036849 markings, 5737231 edges, 5436 markings/sec, 380 secs
lola: sara is running 385 secs || 2063202 markings, 5811842 edges, 5271 markings/sec, 385 secs
lola: sara is running 390 secs || 2089424 markings, 5885250 edges, 5244 markings/sec, 390 secs
lola: sara is running 395 secs || 2116735 markings, 5961793 edges, 5462 markings/sec, 395 secs
lola: sara is running 400 secs || 2144557 markings, 6039357 edges, 5564 markings/sec, 400 secs
lola: sara is running 405 secs || 2169198 markings, 6111446 edges, 4928 markings/sec, 405 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 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CAPACITE <= 1) 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... (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 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 4)
lola: sara is running 0 secs || 70126 markings, 179365 edges, 14025 markings/sec, 0 secs
lola: sara is running 5 secs || 140678 markings, 357996 edges, 14110 markings/sec, 5 secs
lola: sara is running 10 secs || 213889 markings, 549993 edges, 14642 markings/sec, 10 secs
lola: sara is running 15 secs || 286462 markings, 742286 edges, 14515 markings/sec, 15 secs
lola: sara is running 20 secs || 344919 markings, 897543 edges, 11691 markings/sec, 20 secs
lola: sara is running 25 secs || 401064 markings, 1049426 edges, 11229 markings/sec, 25 secs
lola: sara is running 30 secs || 453154 markings, 1190666 edges, 10418 markings/sec, 30 secs
lola: sara is running 35 secs || 513887 markings, 1360299 edges, 12147 markings/sec, 35 secs
lola: sara is running 40 secs || 570662 markings, 1518248 edges, 11355 markings/sec, 40 secs
lola: sara is running 45 secs || 633216 markings, 1694150 edges, 12511 markings/sec, 45 secs
lola: sara is running 50 secs || 687041 markings, 1844730 edges, 10765 markings/sec, 50 secs
lola: sara is running 55 secs || 744646 markings, 2007282 edges, 11521 markings/sec, 55 secs
lola: sara is running 60 secs || 785570 markings, 2114847 edges, 8185 markings/sec, 60 secs
lola: sara is running 65 secs || 835963 markings, 2254151 edges, 10079 markings/sec, 65 secs
lola: sara is running 70 secs || 890324 markings, 2410725 edges, 10872 markings/sec, 70 secs
lola: sara is running 75 secs || 929872 markings, 2515022 edges, 7910 markings/sec, 75 secs
lola: sara is running 80 secs || 984035 markings, 2675571 edges, 10833 markings/sec, 80 secs
lola: sara is running 85 secs || 1037998 markings, 2830099 edges, 10793 markings/sec, 85 secs
lola: sara is running 90 secs || 1094549 markings, 2993149 edges, 11310 markings/sec, 90 secs
lola: sara is running 95 secs || 1152834 markings, 3162270 edges, 11657 markings/sec, 95 secs
lola: sara is running 100 secs || 1207516 markings, 3317588 edges, 10936 markings/sec, 100 secs
lola: sara is running 105 secs || 1260040 markings, 3467090 edges, 10505 markings/sec, 105 secs
lola: sara is running 110 secs || 1312068 markings, 3619030 edges, 10406 markings/sec, 110 secs
lola: sara is running 115 secs || 1361591 markings, 3758340 edges, 9905 markings/sec, 115 secs
lola: sara is running 120 secs || 1398222 markings, 3858329 edges, 7326 markings/sec, 120 secs
lola: sara is running 125 secs || 1435600 markings, 3957261 edges, 7476 markings/sec, 125 secs
lola: sara is running 130 secs || 1483942 markings, 4091375 edges, 9668 markings/sec, 130 secs
lola: sara is running 135 secs || 1531031 markings, 4230911 edges, 9418 markings/sec, 135 secs
lola: sara is running 140 secs || 1581370 markings, 4370487 edges, 10068 markings/sec, 140 secs
lola: sara is running 145 secs || 1618628 markings, 4473755 edges, 7452 markings/sec, 145 secs
lola: sara is running 150 secs || 1665966 markings, 4614766 edges, 9468 markings/sec, 150 secs
lola: sara is running 155 secs || 1720229 markings, 4773294 edges, 10853 markings/sec, 155 secs
lola: sara is running 160 secs || 1774274 markings, 4931508 edges, 10809 markings/sec, 160 secs
lola: sara is running 165 secs || 1825582 markings, 5085039 edges, 10262 markings/sec, 165 secs
lola: sara is running 170 secs || 1875597 markings, 5229617 edges, 10003 markings/sec, 170 secs
lola: sara is running 175 secs || 1929284 markings, 5386528 edges, 10737 markings/sec, 175 secs
lola: sara is running 180 secs || 1981988 markings, 5542515 edges, 10541 markings/sec, 180 secs
lola: sara is running 185 secs || 2034892 markings, 5695907 edges, 10581 markings/sec, 185 secs
lola: sara is running 190 secs || 2087425 markings, 5851227 edges, 10507 markings/sec, 190 secs
lola: sara is running 195 secs || 2138993 markings, 6004697 edges, 10314 markings/sec, 195 secs
lola: sara is running 200 secs || 2176421 markings, 6104096 edges, 7486 markings/sec, 200 secs
lola: sara is running 205 secs || 2210806 markings, 6201020 edges, 6877 markings/sec, 205 secs
lola: sara is running 210 secs || 2246630 markings, 6297375 edges, 7165 markings/sec, 210 secs
lola: sara is running 215 secs || 2282332 markings, 6392994 edges, 7140 markings/sec, 215 secs
lola: sara is running 220 secs || 2329360 markings, 6522892 edges, 9406 markings/sec, 220 secs
lola: sara is running 225 secs || 2377184 markings, 6666556 edges, 9565 markings/sec, 225 secs
lola: sara is running 230 secs || 2429960 markings, 6814357 edges, 10555 markings/sec, 230 secs
lola: sara is running 235 secs || 2465563 markings, 6917911 edges, 7121 markings/sec, 235 secs
lola: sara is running 240 secs || 2497148 markings, 7006134 edges, 6317 markings/sec, 240 secs
lola: sara is running 245 secs || 2545471 markings, 7149822 edges, 9665 markings/sec, 245 secs
lola: sara is running 250 secs || 2600899 markings, 7310972 edges, 11086 markings/sec, 250 secs
lola: sara is running 255 secs || 2648369 markings, 7454111 edges, 9494 markings/sec, 255 secs
lola: sara is running 260 secs || 2702855 markings, 7616484 edges, 10897 markings/sec, 260 secs
lola: sara is running 265 secs || 2750482 markings, 7758226 edges, 9525 markings/sec, 265 secs
lola: sara is running 270 secs || 2804490 markings, 7917005 edges, 10802 markings/sec, 270 secs
lola: sara is running 275 secs || 2856312 markings, 8069216 edges, 10364 markings/sec, 275 secs
lola: sara is running 280 secs || 2901119 markings, 8204780 edges, 8961 markings/sec, 280 secs
lola: sara is running 285 secs || 2952690 markings, 8355671 edges, 10314 markings/sec, 285 secs
lola: sara is running 290 secs || 3006289 markings, 8513819 edges, 10720 markings/sec, 290 secs
lola: sara is running 295 secs || 3054590 markings, 8660162 edges, 9660 markings/sec, 295 secs
lola: sara is running 300 secs || 3107782 markings, 8817901 edges, 10638 markings/sec, 300 secs
lola: sara is running 305 secs || 3155071 markings, 8952379 edges, 9458 markings/sec, 305 secs
lola: sara is running 310 secs || 3191060 markings, 9052442 edges, 7198 markings/sec, 310 secs
lola: sara is running 315 secs || 3223665 markings, 9142442 edges, 6521 markings/sec, 315 secs
lola: sara is running 320 secs || 3259446 markings, 9238137 edges, 7156 markings/sec, 320 secs
lola: sara is running 325 secs || 3293684 markings, 9334459 edges, 6848 markings/sec, 325 secs
lola: sara is running 330 secs || 3327991 markings, 9426825 edges, 6861 markings/sec, 330 secs
lola: sara is running 335 secs || 3372973 markings, 9553210 edges, 8996 markings/sec, 335 secs
lola: sara is running 340 secs || 3414731 markings, 9674771 edges, 8352 markings/sec, 340 secs
lola: sara is running 345 secs || 3458345 markings, 9806838 edges, 8723 markings/sec, 345 secs
lola: sara is running 350 secs || 3504762 markings, 9934337 edges, 9283 markings/sec, 350 secs
lola: sara is running 355 secs || 3542522 markings, 10044278 edges, 7552 markings/sec, 355 secs
lola: sara is running 360 secs || 3573932 markings, 10134385 edges, 6282 markings/sec, 360 secs
lola: sara is running 365 secs || 3604961 markings, 10220417 edges, 6206 markings/sec, 365 secs
lola: sara is running 370 secs || 3652203 markings, 10360092 edges, 9448 markings/sec, 370 secs
lola: sara is running 375 secs || 3700154 markings, 10506831 edges, 9590 markings/sec, 375 secs
lola: sara is running 380 secs || 3752871 markings, 10661600 edges, 10543 markings/sec, 380 secs
lola: sara is running 385 secs || 3800032 markings, 10805366 edges, 9432 markings/sec, 385 secs
lola: sara is running 390 secs || 3855565 markings, 10968239 edges, 11107 markings/sec, 390 secs
lola: sara is running 395 secs || 3903399 markings, 11114230 edges, 9567 markings/sec, 395 secs
lola: sara is running 400 secs || 3957103 markings, 11271779 edges, 10741 markings/sec, 400 secs
lola: sara is running 405 secs || 4009253 markings, 11430955 edges, 10430 markings/sec, 405 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= SUR_PONT_B) OR (3 <= CONTROLEUR_1 + CONTROLEUR_2)) AND (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 + ... (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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10.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 11 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= CONTROLEUR_1 + CONTROLEUR_2) AND ((2 <= CONTROLEUR_1 + CONTROLEUR_2) OR (SORTI_B <= ROUTE_A) OR (ROUTE_B <= 1)))))
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-V50P50N10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-11.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 12 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((SUR_PONT_A <= ROUTE_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_... (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 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 13 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((CHOIX_1 + CHOIX_2 <= 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 invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-12.sara.
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-V50P50N10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

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 14 will run for 1238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ROUTE_B <= VIDANGE_1 + VIDANGE_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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2477 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((ROUTE_A <= SORTI_B) 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_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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown yes yes no yes no yes unknown unknown no no no yes yes yes
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494617082490

--------------------
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="BridgeAndVehicles-PT-V50P50N10"
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-V50P50N10.tgz
mv BridgeAndVehicles-PT-V50P50N10 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 BridgeAndVehicles-PT-V50P50N10, 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 r008-csrt-149436126400502"
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 ;