About the Execution of LoLa for BridgeAndVehicles-PT-V50P20N50
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
287.260 | 58235.00 | 124838.00 | 22.60 | FFTTTTFFTTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is BridgeAndVehicles-PT-V50P20N50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662400349
=====================================================================
--------------------
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-V50P20N50-ReachabilityCardinality-0
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-1
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-15
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-3
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-4
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-5
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-6
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-7
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-8
FORMULA_NAME BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1463492776458
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ BridgeAndVehicles-PT-V50P20N50
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P20N50-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: 5576/65536 symbol table entries, 632 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 5408 transitions, 161 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5813 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality.task
lola: read: EF ((!(CONTROLEUR_1 + CONTROLEUR_2 <= 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 + COMPTEUR_16 + COMPTEUR_17 + COMPTEUR_18 + COMPTEUR_19 + COMPTEUR_20 + COMPTEUR_21 + COMPTEUR_22 + COMPTEUR_23 + COMPTEUR_24 + COMPTEUR_25 + COMPTEUR... (shortened)
lola: formula length: 9839
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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_50 + -COMPTEUR_49 + -COMPTEUR_48 + -COMPTEUR_47 + -COMPTEUR_46 + -COMPTEUR_45 + -COMPTEUR_44 + -COMPTEUR_43 + -COMPTEUR_42 + -COMPTEUR_41 + -COMPTEUR_40 + -COMPTEUR_39 + -COMPTEUR_38 + -COMPTEUR_37 + -COMPTEUR_36 + ... (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 644 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 3 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality.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 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-VIDANGE_2 + -VIDANGE_1 <= -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 644 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-V50P20N50-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality.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 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-CHOIX_2 + -CHOIX_1 <= -3 OR -ATTENTE_A <= -1) AND (-ATTENTE_B <= -1 AND (-SORTI_B + 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_... (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 644 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 20 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-VIDANGE_2 + -VIDANGE_1 > -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 644 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-V50P20N50-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-3.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 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-SORTI_A > -1 AND -SUR_PONT_B > -2) OR -ROUTE_B <= -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 644 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-V50P20N50-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-SORTI_B <= -1 AND (SORTI_B + -ATTENTE_B <= 0 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 + N... (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 644 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 8 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-5.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 6 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (CONTROLEUR_2 + CONTROLEUR_1 + -ROUTE_A <= 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 644 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-V50P20N50-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-VIDANGE_2 + -VIDANGE_1 > -2 AND -SORTI_A > -1) OR (-ATTENTE_A + SORTI_A <= 0 OR (-CAPACITE <= -2 OR -SUR_PONT_B + 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_ATTENT... (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 644 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 8 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((SUR_PONT_B + -SUR_PONT_A > 0 AND (-ATTENTE_A + ROUTE_A > 0 AND (-CONTROLEUR_2 + -CONTROLEUR_1 + ROUTE_B <= 0 AND (-ROUTE_B <= -3 OR -CHOIX_2 + -CHOIX_1 <= -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 644 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 8 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ROUTE_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 644 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-V50P20N50-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-NB_ATTENTE_B_9 + ATTENTE_B + -NB_ATTENTE_B_8 + -NB_ATTENTE_B_7 + -NB_ATTENTE_B_6 + -NB_ATTENTE_B_5 + -NB_ATTENTE_B_4 + -NB_ATTENTE_B_3 + -NB_ATTENTE_B_2 + -NB_ATTENTE_B_1 + -NB_ATTENTE_B_0 + -NB_ATTENTE_B_50 + -NB_ATTENTE_B_49 + -NB_ATTENTE_B_48 + -NB_ATTENTE_B_47 + -NB_ATTENTE_B_46 + -NB_ATTENTE_B_45 + -NB_ATTENTE_B_44 + -NB_ATTENTE_B_43 + -NB_ATTENTE_B_42 + -NB_ATTENTE_B_41 + -NB_ATTENTE_B... (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 644 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 3 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-10.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 11 will run for 698 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-SUR_PONT_A + ROUTE_A <= 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 644 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-V50P20N50-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-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_3... (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 644 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: yes
lola: The predicate is invariant.
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-12.sara
lola: subprocess 13 will run for 1164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: calling and running sara
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 + NB_ATTENTE_A_29 +... (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 644 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-12.sara.
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1745 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-SUR_PONT_B + SUR_PONT_A > 0 AND (-SORTI_B <= -1 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 + ... (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 644 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 3 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
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 15 will run for 3483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ROUTE_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 644 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-V50P20N50-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P20N50-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: no no yes yes no no no no yes no yes yes yes yes no no
BK_STOP 1463492834693
--------------------
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-V50P20N50"
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-V50P20N50.tgz
mv BridgeAndVehicles-PT-V50P20N50 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-V50P20N50, 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-146347662400349"
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 '
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 ;