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

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

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ BridgeAndVehicles-PT-V50P50N10
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-7 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15 TRUE 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: 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: read: AG (!(((1 <= ATTENTE_B AND 3 <= 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 + 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 + ... (shortened)
lola: formula length: 14710
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-ATTENTE_B > -1 OR (-NB_ATTENTE_B_9 + -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_A... (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
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-V50P50N10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality.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 1 will run for 235 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-V50P50N10-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ROUTE_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 484 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-V50P50N10-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-CONTROLEUR_2 + -CONTROLEUR_1 <= -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
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-V50P50N10-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-3.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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-CAPACITE + CHOIX_2 + CHOIX_1 <= 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 484 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-V50P50N10-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 51)
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-CONTROLEUR_2 + -CONTROLEUR_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 484 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-V50P50N10-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-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 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-NB_ATTENTE_B_9 + VIDANGE_2 + VIDANGE_1 + -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 + -... (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
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 10 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-6.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 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (SUR_PONT_B + -CAPACITE <= 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 484 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-V50P50N10-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-7.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 8 will run for 360 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-V50P50N10-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 411 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 484 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: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9.sara
lola: subprocess 10 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: lola: ========================================
calling and running sara
lola: ...considering subproblem: EF ((-ATTENTE_A > -1 AND -SORTI_B + ROUTE_B <= 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 484 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
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-9.sara.
lola: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 576 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_30... (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
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: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-11.sara
lola: subprocess 12 will run for 720 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: calling and running sara
lola: ...considering subproblem: AG (NB_ATTENTE_B_9 + -CAPACITE + 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_40 + NB_ATTENTE_B_39 ... (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
lola: using reachability graph (--search=depth)
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-11.sara.
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-V50P50N10-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


sara: warning, failure of lp_solve (at job 88)
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 721 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-CONTROLEUR_2 + -CONTROLEUR_1 <= -2 OR -SUR_PONT_B + CONTROLEUR_2 + CONTROLEUR_1 <= 0) AND (-SORTI_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... (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
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 13 literals
lola: write sara problem file to BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-13.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 14 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ROUTE_B <= -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 484 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-V50P50N10-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2163 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-ROUTE_B > -2 AND (CONTROLEUR_2 + -ATTENTE_A + CONTROLEUR_1 > 0 AND 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_ATTENTE_A_35 + -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 484 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-V50P50N10-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V50P50N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: yes yes no no unknown yes yes unknown yes yes yes yes unknown yes no yes

BK_STOP 1463494966223

--------------------
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-V50P50N10"
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-V50P50N10.tgz
mv BridgeAndVehicles-PT-V50P50N10 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-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 r002kn-ebro-146347662400358"
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 ;