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-2979
Executing tool lola
Input is BridgeAndVehicles-PT-V50P20N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662400340
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463491226751

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ BridgeAndVehicles-PT-V50P20N20
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-1 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 2486/65536 symbol table entries, 36 collisions
lola: preprocessing...
lola: finding significant places
lola: 138 places, 2348 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality.task
lola: read: AG (!(!((SUR_PONT_B <= SUR_PONT_B OR 3 <= SUR_PONT_A)))) : EF (!(((SUR_PONT_A <= ATTENTE_B OR 1 <= SUR_PONT_A) OR (2 <= ATTENTE_B AND 3 <= ROUTE_B)))) : AG (((ATTENTE_B <= SUR_PONT_A AND COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9 + COMPTEUR_10 + COMPTEUR_11 + COMPTEUR_12 + COMPTEUR_13 + COMPTEUR_14 + COMPTEUR_15 +... (shortened)
lola: formula length: 8451
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((SUR_PONT_A + -ATTENTE_B > 0 AND (-SUR_PONT_A > -1 AND (-ATTENTE_B > -2 OR -ROUTE_B > -3))))
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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
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=0)
lola: ========================================
lola: ...considering subproblem: AG (((-SUR_PONT_A + ATTENTE_B <= 0 AND COMPTEUR_9 + -SORTI_A + COMPTEUR_8 + COMPTEUR_7 + COMPTEUR_6 + COMPTEUR_5 + COMPTEUR_4 + COMPTEUR_3 + COMPTEUR_2 + COMPTEUR_1 + COMPTEUR_0 + COMPTEUR_20 + COMPTEUR_19 + COMPTEUR_18 + COMPTEUR_17 + COMPTEUR_16 + COMPTEUR_15 + COMPTEUR_14 + COMPTEUR_13 + COMPTEUR_12 + COMPTEUR_11 + COMPTEUR_10 <= 0) OR -CHOIX_2 + -CHOIX_1 > -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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((SUR_PONT_B + -SORTI_B <= 0 AND (-ATTENTE_A <= -3 AND (-COMPTEUR_9 + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_20 + -COMPTEUR_19 + -COMPTEUR_18 + -COMPTEUR_17 + -COMPTEUR_16 + -COMPTEUR_15 + -COMPTEUR_14 + -COMPTEUR_13 + -COMPTEUR_12 + -COMPTEUR_11 + -COMPTEUR_10 <= -2 AND -NB_ATTENTE_B_9 + -NB_ATTENT... (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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-COMPTEUR_9 + CONTROLEUR_2 + CONTROLEUR_1 + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_20 + -COMPTEUR_19 + -COMPTEUR_18 + -COMPTEUR_17 + -COMPTEUR_16 + -COMPTEUR_15 + -COMPTEUR_14 + -COMPTEUR_13 + -COMPTEUR_12 + -COMPTEUR_11 + -COMPTEUR_10 <= 0 AND (-CONTROLEUR_2 + -CONTROLEUR_1 <= -2 AND (NB_ATTENTE_... (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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 9 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-CONTROLEUR_2 + -CONTROLEUR_1 + ATTENTE_B <= 0 OR -ATTENTE_B <= -1))
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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (ROUTE_A + -ATTENTE_B > 0)
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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 366 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((SUR_PONT_B + -ROUTE_A <= 0 AND SORTI_B + -ROUTE_B <= 0) OR (COMPTEUR_9 + -ATTENTE_B + COMPTEUR_8 + COMPTEUR_7 + COMPTEUR_6 + COMPTEUR_5 + COMPTEUR_4 + COMPTEUR_3 + COMPTEUR_2 + COMPTEUR_1 + COMPTEUR_0 + COMPTEUR_20 + COMPTEUR_19 + COMPTEUR_18 + COMPTEUR_17 + COMPTEUR_16 + COMPTEUR_15 + COMPTEUR_14 + COMPTEUR_13 + COMPTEUR_12 + COMPTEUR_11 + COMPTEUR_10 <= 0 AND SUR_PONT_B + -SUR_PONT_A <= 0... (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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 9 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-NB_ATTENTE_A_50 + -NB_ATTENTE_A_49 + -NB_ATTENTE_A_48 + -NB_ATTENTE_A_47 + -NB_ATTENTE_A_46 + -NB_ATTENTE_A_45 + -NB_ATTENTE_A_44 + -NB_ATTENTE_A_43 + -NB_ATTENTE_A_42 + -NB_ATTENTE_A_41 + -NB_ATTENTE_A_40 + -NB_ATTENTE_A_39 + -NB_ATTENTE_A_38 + -NB_ATTENTE_A_37 + -NB_ATTENTE_A_36 + -NB_ATTENTE_A_35 + -NB_ATTENTE_A_34 + -NB_ATTENTE_A_33 + -NB_ATTENTE_A_32 + -NB_ATTENTE_A_31 + -NB_ATTENTE_A_30... (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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-COMPTEUR_9 + SORTI_A + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_20 + -COMPTEUR_19 + -COMPTEUR_18 + -COMPTEUR_17 + -COMPTEUR_16 + -COMPTEUR_15 + -COMPTEUR_14 + -COMPTEUR_13 + -COMPTEUR_12 + -COMPTEUR_11 + -COMPTEUR_10 <= 0 OR (-SORTI_A <= -3 OR (SORTI_B + -SORTI_A <= 0 OR -NB_ATTENTE_A_50 + -NB_ATTE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-SUR_PONT_A > -3 AND (-NB_ATTENTE_A_50 + -NB_ATTENTE_A_49 + -NB_ATTENTE_A_48 + -NB_ATTENTE_A_47 + -NB_ATTENTE_A_46 + -NB_ATTENTE_A_45 + -NB_ATTENTE_A_44 + -NB_ATTENTE_A_43 + -NB_ATTENTE_A_42 + -NB_ATTENTE_A_41 + -NB_ATTENTE_A_40 + -NB_ATTENTE_A_39 + -NB_ATTENTE_A_38 + -NB_ATTENTE_A_37 + -NB_ATTENTE_A_36 + -NB_ATTENTE_A_35 + -NB_ATTENTE_A_34 + -NB_ATTENTE_A_33 + -NB_ATTENTE_A_32 + -NB_ATTENTE_... (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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: Transformation into DNF: expect 6 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-10.sara
lola: subprocess 11 will run for 659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-ROUTE_B > -2 AND (-SUR_PONT_A > -1 OR -CHOIX_2 + -CHOIX_1 > -2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 823 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-VIDANGE_2 + -VIDANGE_1 > -1 OR (-NB_ATTENTE_A_50 + -NB_ATTENTE_A_49 + -NB_ATTENTE_A_48 + -NB_ATTENTE_A_47 + -NB_ATTENTE_A_46 + -NB_ATTENTE_A_45 + -NB_ATTENTE_A_44 + -NB_ATTENTE_A_43 + -NB_ATTENTE_A_42 + -NB_ATTENTE_A_41 + -NB_ATTENTE_A_40 + -NB_ATTENTE_A_39 + -NB_ATTENTE_A_38 + -NB_ATTENTE_A_37 + -NB_ATTENTE_A_36 + -NB_ATTENTE_A_35 + -NB_ATTENTE_A_34 + -NB_ATTENTE_A_33 + -NB_ATTENTE_A_32 + ... (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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1098 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-SUR_PONT_B > -1 AND (-CHOIX_2 + -CHOIX_1 <= -3 AND -ROUTE_A + VIDANGE_2 + VIDANGE_1 <= 0)) OR (-SUR_PONT_B <= -1 AND -ROUTE_B > -3)))
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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 5 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-COMPTEUR_9 + CAPACITE + -COMPTEUR_8 + -COMPTEUR_7 + -COMPTEUR_6 + -COMPTEUR_5 + -COMPTEUR_4 + -COMPTEUR_3 + -COMPTEUR_2 + -COMPTEUR_1 + -COMPTEUR_0 + -COMPTEUR_20 + -COMPTEUR_19 + -COMPTEUR_18 + -COMPTEUR_17 + -COMPTEUR_16 + -COMPTEUR_15 + -COMPTEUR_14 + -COMPTEUR_13 + -COMPTEUR_12 + -COMPTEUR_11 + -COMPTEUR_10 <= 0)
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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-CAPACITE <= -1 OR (-SUR_PONT_A > -2 AND -SORTI_A > -3)))
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 524 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N20-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: yes unknown yes no no yes no no no yes no yes yes yes yes no

BK_STOP 1463491472182

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P20N20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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-V50P20N20.tgz
mv BridgeAndVehicles-PT-V50P20N20 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is BridgeAndVehicles-PT-V50P20N20, 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 r002kn-ebro-146347662400340"
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 ;