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

--------------------
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 1496350560414


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


checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-PT-V50P50N10: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_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 || 26928 markings, 65668 edges, 5386 markings/sec, 0 secs
lola: sara is running 5 secs || 52588 markings, 134451 edges, 5132 markings/sec, 5 secs
lola: sara is running 10 secs || 78714 markings, 204821 edges, 5225 markings/sec, 10 secs
lola: sara is running 15 secs || 103849 markings, 273319 edges, 5027 markings/sec, 15 secs
lola: sara is running 20 secs || 129207 markings, 342477 edges, 5072 markings/sec, 20 secs
lola: sara is running 25 secs || 155004 markings, 413019 edges, 5159 markings/sec, 25 secs
lola: sara is running 30 secs || 183449 markings, 491811 edges, 5689 markings/sec, 30 secs
lola: sara is running 35 secs || 209648 markings, 563039 edges, 5240 markings/sec, 35 secs
lola: sara is running 40 secs || 235724 markings, 636751 edges, 5215 markings/sec, 40 secs
lola: sara is running 45 secs || 261558 markings, 711609 edges, 5167 markings/sec, 45 secs
lola: sara is running 50 secs || 286529 markings, 780031 edges, 4994 markings/sec, 50 secs
lola: sara is running 55 secs || 312870 markings, 856624 edges, 5268 markings/sec, 55 secs
lola: sara is running 60 secs || 340407 markings, 933585 edges, 5507 markings/sec, 60 secs
lola: sara is running 65 secs || 368051 markings, 1011248 edges, 5529 markings/sec, 65 secs
lola: sara is running 70 secs || 394614 markings, 1088903 edges, 5313 markings/sec, 70 secs
lola: sara is running 75 secs || 421572 markings, 1166073 edges, 5392 markings/sec, 75 secs
lola: sara is running 80 secs || 450683 markings, 1246598 edges, 5822 markings/sec, 80 secs
lola: sara is running 85 secs || 477519 markings, 1323967 edges, 5367 markings/sec, 85 secs
lola: sara is running 90 secs || 503876 markings, 1401537 edges, 5271 markings/sec, 90 secs
lola: sara is running 95 secs || 533609 markings, 1482345 edges, 5947 markings/sec, 95 secs
lola: sara is running 100 secs || 561572 markings, 1562830 edges, 5593 markings/sec, 100 secs
lola: sara is running 105 secs || 586533 markings, 1636018 edges, 4992 markings/sec, 105 secs
lola: sara is running 110 secs || 611565 markings, 1709247 edges, 5006 markings/sec, 110 secs
lola: sara is running 115 secs || 638118 markings, 1780319 edges, 5311 markings/sec, 115 secs
lola: sara is running 120 secs || 663251 markings, 1852963 edges, 5027 markings/sec, 120 secs
lola: sara is running 125 secs || 687522 markings, 1923552 edges, 4854 markings/sec, 125 secs
lola: sara is running 130 secs || 711532 markings, 1993179 edges, 4802 markings/sec, 130 secs
lola: sara is running 135 secs || 736877 markings, 2065220 edges, 5069 markings/sec, 135 secs
lola: sara is running 140 secs || 763823 markings, 2139623 edges, 5389 markings/sec, 140 secs
lola: sara is running 145 secs || 788646 markings, 2212155 edges, 4965 markings/sec, 145 secs
lola: sara is running 150 secs || 813290 markings, 2283606 edges, 4929 markings/sec, 150 secs
lola: sara is running 155 secs || 839572 markings, 2361905 edges, 5256 markings/sec, 155 secs
lola: sara is running 160 secs || 868409 markings, 2440204 edges, 5767 markings/sec, 160 secs
lola: sara is running 165 secs || 896661 markings, 2521210 edges, 5650 markings/sec, 165 secs
lola: sara is running 170 secs || 924025 markings, 2600001 edges, 5473 markings/sec, 170 secs
lola: sara is running 175 secs || 950673 markings, 2678973 edges, 5330 markings/sec, 175 secs
lola: sara is running 180 secs || 976576 markings, 2755318 edges, 5181 markings/sec, 180 secs
lola: sara is running 185 secs || 1003257 markings, 2826313 edges, 5336 markings/sec, 185 secs
lola: sara is running 190 secs || 1029262 markings, 2900962 edges, 5201 markings/sec, 190 secs
lola: sara is running 195 secs || 1055978 markings, 2977998 edges, 5343 markings/sec, 195 secs
lola: sara is running 200 secs || 1083497 markings, 3058796 edges, 5504 markings/sec, 200 secs
lola: sara is running 205 secs || 1110335 markings, 3138560 edges, 5368 markings/sec, 205 secs
lola: sara is running 210 secs || 1137900 markings, 3215516 edges, 5513 markings/sec, 210 secs
lola: sara is running 215 secs || 1167007 markings, 3296754 edges, 5821 markings/sec, 215 secs
lola: sara is running 220 secs || 1194297 markings, 3375932 edges, 5458 markings/sec, 220 secs
lola: sara is running 225 secs || 1220962 markings, 3453785 edges, 5333 markings/sec, 225 secs
lola: sara is running 230 secs || 1248208 markings, 3533446 edges, 5449 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: 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: ========================================
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
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 || 30610 markings, 71594 edges, 6122 markings/sec, 0 secs
lola: sara is running 5 secs || 59030 markings, 146215 edges, 5684 markings/sec, 5 secs
lola: sara is running 10 secs || 86775 markings, 220645 edges, 5549 markings/sec, 10 secs
lola: sara is running 15 secs || 114222 markings, 295218 edges, 5489 markings/sec, 15 secs
lola: sara is running 20 secs || 141339 markings, 369202 edges, 5423 markings/sec, 20 secs
lola: sara is running 25 secs || 168552 markings, 442575 edges, 5443 markings/sec, 25 secs
lola: sara is running 30 secs || 193965 markings, 510420 edges, 5083 markings/sec, 30 secs
lola: sara is running 35 secs || 218708 markings, 579948 edges, 4949 markings/sec, 35 secs
lola: sara is running 40 secs || 243194 markings, 650136 edges, 4897 markings/sec, 40 secs
lola: sara is running 45 secs || 272339 markings, 728829 edges, 5829 markings/sec, 45 secs
lola: sara is running 50 secs || 299055 markings, 804868 edges, 5343 markings/sec, 50 secs
lola: sara is running 55 secs || 326252 markings, 883447 edges, 5439 markings/sec, 55 secs
lola: sara is running 60 secs || 353438 markings, 956429 edges, 5437 markings/sec, 60 secs
lola: sara is running 65 secs || 379493 markings, 1030550 edges, 5211 markings/sec, 65 secs
lola: sara is running 70 secs || 405471 markings, 1106169 edges, 5196 markings/sec, 70 secs
lola: sara is running 75 secs || 435440 markings, 1186645 edges, 5994 markings/sec, 75 secs
lola: sara is running 80 secs || 462085 markings, 1262972 edges, 5329 markings/sec, 80 secs
lola: sara is running 85 secs || 488519 markings, 1340099 edges, 5287 markings/sec, 85 secs
lola: sara is running 90 secs || 518576 markings, 1419977 edges, 6011 markings/sec, 90 secs
lola: sara is running 95 secs || 546227 markings, 1498707 edges, 5530 markings/sec, 95 secs
lola: sara is running 100 secs || 572353 markings, 1575202 edges, 5225 markings/sec, 100 secs
lola: sara is running 105 secs || 597659 markings, 1647831 edges, 5061 markings/sec, 105 secs
lola: sara is running 110 secs || 625267 markings, 1720783 edges, 5522 markings/sec, 110 secs
lola: sara is running 115 secs || 652185 markings, 1797491 edges, 5384 markings/sec, 115 secs
lola: sara is running 120 secs || 679075 markings, 1875978 edges, 5378 markings/sec, 120 secs
lola: sara is running 125 secs || 704263 markings, 1949322 edges, 5038 markings/sec, 125 secs
lola: sara is running 130 secs || 730631 markings, 2017905 edges, 5274 markings/sec, 130 secs
lola: sara is running 135 secs || 755549 markings, 2089113 edges, 4984 markings/sec, 135 secs
lola: sara is running 140 secs || 780155 markings, 2160500 edges, 4921 markings/sec, 140 secs
lola: sara is running 145 secs || 805868 markings, 2234481 edges, 5143 markings/sec, 145 secs
lola: sara is running 150 secs || 831665 markings, 2310102 edges, 5159 markings/sec, 150 secs
lola: sara is running 155 secs || 862825 markings, 2390973 edges, 6232 markings/sec, 155 secs
lola: sara is running 160 secs || 889892 markings, 2469268 edges, 5413 markings/sec, 160 secs
lola: sara is running 165 secs || 916190 markings, 2545012 edges, 5260 markings/sec, 165 secs
lola: sara is running 170 secs || 943306 markings, 2623801 edges, 5423 markings/sec, 170 secs
lola: sara is running 175 secs || 972767 markings, 2703625 edges, 5892 markings/sec, 175 secs
lola: sara is running 180 secs || 998184 markings, 2774524 edges, 5083 markings/sec, 180 secs
lola: sara is running 185 secs || 1025557 markings, 2853202 edges, 5475 markings/sec, 185 secs
lola: sara is running 190 secs || 1051077 markings, 2927606 edges, 5104 markings/sec, 190 secs
lola: sara is running 195 secs || 1076971 markings, 3002088 edges, 5179 markings/sec, 195 secs
lola: sara is running 200 secs || 1102317 markings, 3077204 edges, 5069 markings/sec, 200 secs
lola: sara is running 205 secs || 1133340 markings, 3156800 edges, 6205 markings/sec, 205 secs
lola: sara is running 210 secs || 1159063 markings, 3230885 edges, 5145 markings/sec, 210 secs
lola: sara is running 215 secs || 1184733 markings, 3304908 edges, 5134 markings/sec, 215 secs
lola: sara is running 220 secs || 1211267 markings, 3383143 edges, 5307 markings/sec, 220 secs
lola: sara is running 225 secs || 1237476 markings, 3460086 edges, 5242 markings/sec, 225 secs
lola: sara is running 230 secs || 1263982 markings, 3533815 edges, 5301 markings/sec, 230 secs
lola: sara is running 235 secs || 1291038 markings, 3606816 edges, 5411 markings/sec, 235 secs
lola: sara is running 240 secs || 1319357 markings, 3685360 edges, 5664 markings/sec, 240 secs
lola: sara is running 245 secs || 1345776 markings, 3759325 edges, 5284 markings/sec, 245 secs
lola: sara is running 250 secs || 1371230 markings, 3830049 edges, 5091 markings/sec, 250 secs
lola: sara is running 255 secs || 1396606 markings, 3899946 edges, 5075 markings/sec, 255 secs
lola: sara is running 260 secs || 1421450 markings, 3966881 edges, 4969 markings/sec, 260 secs
lola: sara is running 265 secs || 1444723 markings, 4038396 edges, 4655 markings/sec, 265 secs
lola: sara is running 270 secs || 1469005 markings, 4110500 edges, 4856 markings/sec, 270 secs
lola: sara is running 275 secs || 1494670 markings, 4189102 edges, 5133 markings/sec, 275 secs
lola: sara is running 280 secs || 1521233 markings, 4268258 edges, 5313 markings/sec, 280 secs
lola: sara is running 285 secs || 1548007 markings, 4348994 edges, 5355 markings/sec, 285 secs
lola: sara is running 290 secs || 1573883 markings, 4424178 edges, 5175 markings/sec, 290 secs
lola: sara is running 295 secs || 1601834 markings, 4500607 edges, 5590 markings/sec, 295 secs
lola: sara is running 300 secs || 1629625 markings, 4575419 edges, 5558 markings/sec, 300 secs
lola: sara is running 305 secs || 1656464 markings, 4651205 edges, 5368 markings/sec, 305 secs
lola: sara is running 310 secs || 1683413 markings, 4727234 edges, 5390 markings/sec, 310 secs
lola: sara is running 315 secs || 1710570 markings, 4803433 edges, 5431 markings/sec, 315 secs
lola: sara is running 320 secs || 1737914 markings, 4880051 edges, 5469 markings/sec, 320 secs
lola: sara is running 325 secs || 1764023 markings, 4951133 edges, 5222 markings/sec, 325 secs
lola: sara is running 330 secs || 1789365 markings, 5027734 edges, 5068 markings/sec, 330 secs
lola: sara is running 335 secs || 1814928 markings, 5102696 edges, 5113 markings/sec, 335 secs
lola: sara is running 340 secs || 1840665 markings, 5177750 edges, 5147 markings/sec, 340 secs
lola: sara is running 345 secs || 1866241 markings, 5254473 edges, 5115 markings/sec, 345 secs
lola: sara is running 350 secs || 1891525 markings, 5328501 edges, 5057 markings/sec, 350 secs
lola: sara is running 355 secs || 1917445 markings, 5405571 edges, 5184 markings/sec, 355 secs
lola: sara is running 360 secs || 1941837 markings, 5473356 edges, 4878 markings/sec, 360 secs
lola: sara is running 365 secs || 1966504 markings, 5541362 edges, 4933 markings/sec, 365 secs
lola: sara is running 370 secs || 1992482 markings, 5612057 edges, 5196 markings/sec, 370 secs
lola: sara is running 375 secs || 2017875 markings, 5683728 edges, 5079 markings/sec, 375 secs
lola: sara is running 380 secs || 2042359 markings, 5752955 edges, 4897 markings/sec, 380 secs
lola: sara is running 385 secs || 2068872 markings, 5827772 edges, 5303 markings/sec, 385 secs
lola: sara is running 390 secs || 2096946 markings, 5906448 edges, 5615 markings/sec, 390 secs
lola: sara is running 395 secs || 2124767 markings, 5984310 edges, 5564 markings/sec, 395 secs
lola: sara is running 400 secs || 2151395 markings, 6056589 edges, 5326 markings/sec, 400 secs
lola: sara is running 405 secs || 2177373 markings, 6136181 edges, 5196 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 || 73321 markings, 183804 edges, 14664 markings/sec, 0 secs
lola: sara is running 5 secs || 145531 markings, 368602 edges, 14442 markings/sec, 5 secs
lola: sara is running 10 secs || 222052 markings, 571757 edges, 15304 markings/sec, 10 secs
lola: sara is running 15 secs || 294235 markings, 766504 edges, 14437 markings/sec, 15 secs
lola: sara is running 20 secs || 353738 markings, 918043 edges, 11901 markings/sec, 20 secs
lola: sara is running 25 secs || 411049 markings, 1072914 edges, 11462 markings/sec, 25 secs
lola: sara is running 30 secs || 469712 markings, 1236326 edges, 11733 markings/sec, 30 secs
lola: sara is running 35 secs || 526584 markings, 1395431 edges, 11374 markings/sec, 35 secs
lola: sara is running 40 secs || 587417 markings, 1569137 edges, 12167 markings/sec, 40 secs
lola: sara is running 45 secs || 641935 markings, 1718026 edges, 10904 markings/sec, 45 secs
lola: sara is running 50 secs || 703371 markings, 1891712 edges, 12287 markings/sec, 50 secs
lola: sara is running 55 secs || 756193 markings, 2037774 edges, 10564 markings/sec, 55 secs
lola: sara is running 60 secs || 798186 markings, 2146693 edges, 8399 markings/sec, 60 secs
lola: sara is running 65 secs || 853034 markings, 2304152 edges, 10970 markings/sec, 65 secs
lola: sara is running 70 secs || 906088 markings, 2449025 edges, 10611 markings/sec, 70 secs
lola: sara is running 75 secs || 949858 markings, 2574151 edges, 8754 markings/sec, 75 secs
lola: sara is running 80 secs || 1006783 markings, 2737258 edges, 11385 markings/sec, 80 secs
lola: sara is running 85 secs || 1062818 markings, 2899213 edges, 11207 markings/sec, 85 secs
lola: sara is running 90 secs || 1118107 markings, 3058983 edges, 11058 markings/sec, 90 secs
lola: sara is running 95 secs || 1173488 markings, 3217694 edges, 11076 markings/sec, 95 secs
lola: sara is running 100 secs || 1228648 markings, 3378308 edges, 11032 markings/sec, 100 secs
lola: sara is running 105 secs || 1283822 markings, 3537200 edges, 11035 markings/sec, 105 secs
lola: sara is running 110 secs || 1342829 markings, 3709390 edges, 11801 markings/sec, 110 secs
lola: sara is running 115 secs || 1384096 markings, 3821661 edges, 8253 markings/sec, 115 secs
lola: sara is running 120 secs || 1421766 markings, 3921729 edges, 7534 markings/sec, 120 secs
lola: sara is running 125 secs || 1470268 markings, 4056345 edges, 9700 markings/sec, 125 secs
lola: sara is running 130 secs || 1515947 markings, 4188199 edges, 9136 markings/sec, 130 secs
lola: sara is running 135 secs || 1569713 markings, 4336020 edges, 10753 markings/sec, 135 secs
lola: sara is running 140 secs || 1604590 markings, 4436231 edges, 6975 markings/sec, 140 secs
lola: sara is running 145 secs || 1651166 markings, 4572963 edges, 9315 markings/sec, 145 secs
lola: sara is running 150 secs || 1706362 markings, 4733604 edges, 11039 markings/sec, 150 secs
lola: sara is running 155 secs || 1762032 markings, 4899381 edges, 11134 markings/sec, 155 secs
lola: sara is running 160 secs || 1809901 markings, 5037911 edges, 9574 markings/sec, 160 secs
lola: sara is running 165 secs || 1865668 markings, 5201146 edges, 11153 markings/sec, 165 secs
lola: sara is running 170 secs || 1919990 markings, 5361559 edges, 10864 markings/sec, 170 secs
lola: sara is running 175 secs || 1975624 markings, 5522198 edges, 11127 markings/sec, 175 secs
lola: sara is running 180 secs || 2031455 markings, 5685320 edges, 11166 markings/sec, 180 secs
lola: sara is running 185 secs || 2085321 markings, 5846831 edges, 10773 markings/sec, 185 secs
lola: sara is running 190 secs || 2132848 markings, 5985490 edges, 9505 markings/sec, 190 secs
lola: sara is running 195 secs || 2173601 markings, 6096296 edges, 8151 markings/sec, 195 secs
lola: sara is running 200 secs || 2206268 markings, 6187639 edges, 6533 markings/sec, 200 secs
lola: sara is running 205 secs || 2242347 markings, 6284615 edges, 7216 markings/sec, 205 secs
lola: sara is running 210 secs || 2276770 markings, 6378152 edges, 6885 markings/sec, 210 secs
lola: sara is running 215 secs || 2318837 markings, 6495837 edges, 8413 markings/sec, 215 secs
lola: sara is running 220 secs || 2362269 markings, 6622532 edges, 8686 markings/sec, 220 secs
lola: sara is running 225 secs || 2415230 markings, 6782225 edges, 10592 markings/sec, 225 secs
lola: sara is running 230 secs || 2449154 markings, 6869400 edges, 6785 markings/sec, 230 secs
lola: sara is running 235 secs || 2478878 markings, 6955295 edges, 5945 markings/sec, 235 secs
lola: sara is running 240 secs || 2514229 markings, 7054949 edges, 7070 markings/sec, 240 secs
lola: sara is running 245 secs || 2558825 markings, 7188904 edges, 8919 markings/sec, 245 secs
lola: sara is running 250 secs || 2610644 markings, 7341553 edges, 10364 markings/sec, 250 secs
lola: sara is running 255 secs || 2656870 markings, 7480232 edges, 9245 markings/sec, 255 secs
lola: sara is running 260 secs || 2709905 markings, 7636949 edges, 10607 markings/sec, 260 secs
lola: sara is running 265 secs || 2758692 markings, 7783648 edges, 9757 markings/sec, 265 secs
lola: sara is running 270 secs || 2805028 markings, 7918714 edges, 9267 markings/sec, 270 secs
lola: sara is running 275 secs || 2856417 markings, 8069584 edges, 10278 markings/sec, 275 secs
lola: sara is running 280 secs || 2900521 markings, 8202835 edges, 8821 markings/sec, 280 secs
lola: sara is running 285 secs || 2951195 markings, 8352209 edges, 10135 markings/sec, 285 secs
lola: sara is running 290 secs || 3002619 markings, 8503044 edges, 10285 markings/sec, 290 secs
lola: sara is running 295 secs || 3048573 markings, 8642053 edges, 9191 markings/sec, 295 secs
lola: sara is running 300 secs || 3101624 markings, 8798326 edges, 10610 markings/sec, 300 secs
lola: sara is running 305 secs || 3149694 markings, 8940754 edges, 9614 markings/sec, 305 secs
lola: sara is running 310 secs || 3186125 markings, 9038379 edges, 7286 markings/sec, 310 secs
lola: sara is running 315 secs || 3218756 markings, 9130359 edges, 6526 markings/sec, 315 secs
lola: sara is running 320 secs || 3253948 markings, 9222386 edges, 7038 markings/sec, 320 secs
lola: sara is running 325 secs || 3286920 markings, 9315627 edges, 6594 markings/sec, 325 secs
lola: sara is running 330 secs || 3322199 markings, 9411190 edges, 7056 markings/sec, 330 secs
lola: sara is running 335 secs || 3367799 markings, 9538813 edges, 9120 markings/sec, 335 secs
lola: sara is running 340 secs || 3410220 markings, 9663385 edges, 8484 markings/sec, 340 secs
lola: sara is running 345 secs || 3458771 markings, 9807839 edges, 9710 markings/sec, 345 secs
lola: sara is running 350 secs || 3509270 markings, 9944316 edges, 10100 markings/sec, 350 secs
lola: sara is running 355 secs || 3546199 markings, 10054759 edges, 7386 markings/sec, 355 secs
lola: sara is running 360 secs || 3577573 markings, 10144431 edges, 6275 markings/sec, 360 secs
lola: sara is running 365 secs || 3612863 markings, 10242212 edges, 7058 markings/sec, 365 secs
lola: sara is running 370 secs || 3660039 markings, 10385406 edges, 9435 markings/sec, 370 secs
lola: sara is running 375 secs || 3715439 markings, 10552872 edges, 11080 markings/sec, 375 secs
lola: sara is running 380 secs || 3762514 markings, 10690806 edges, 9415 markings/sec, 380 secs
lola: sara is running 385 secs || 3818229 markings, 10860180 edges, 11143 markings/sec, 385 secs
lola: sara is running 390 secs || 3864986 markings, 10997075 edges, 9351 markings/sec, 390 secs
lola: sara is running 395 secs || 3920192 markings, 11162112 edges, 11041 markings/sec, 395 secs
lola: sara is running 400 secs || 3967222 markings, 11303740 edges, 9406 markings/sec, 400 secs
lola: sara is running 405 secs || 4021856 markings, 11464184 edges, 10927 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 826 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)
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

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 1496351623310

--------------------
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-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/S_BridgeAndVehicles-PT-V50P50N10.tgz
mv S_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 S_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 r088-csrt-149441074500502"
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 ;