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

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

=== Now, execution of the tool begins

BK_START 1463499255835

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ BridgeAndVehicles-PT-V80P20N50
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N50-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: 8816/65536 symbol table entries, 2413 collisions
lola: preprocessing...
lola: finding significant places
lola: 228 places, 8588 transitions, 221 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9173 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality.task
lola: read: EF ((3 <= 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_A... (shortened)
lola: formula length: 23587
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 (-NB_ATTENTE_A_80 + -NB_ATTENTE_A_79 + -NB_ATTENTE_A_78 + -NB_ATTENTE_A_77 + -NB_ATTENTE_A_76 + -NB_ATTENTE_A_75 + -NB_ATTENTE_A_74 + -NB_ATTENTE_A_73 + -NB_ATTENTE_A_72 + -NB_ATTENTE_A_71 + -NB_ATTENTE_A_70 + -NB_ATTENTE_A_69 + -NB_ATTENTE_A_68 + -NB_ATTENTE_A_67 + -NB_ATTENTE_A_66 + -NB_ATTENTE_A_65 + -NB_ATTENTE_A_64 + -NB_ATTENTE_A_63 + -NB_ATTENTE_A_62 + -NB_ATTENTE_A_61 + -NB_ATTENTE_A_60... (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 884 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: Transformation into DNF: expect 1 literals
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 (((-SUR_PONT_B <= -1 AND -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_80 + -NB_ATTENTE_B_79 + -NB_ATTENTE_B_78 + -NB_ATTENTE_B_77 + -NB_ATTENTE_B_76 + -NB_ATTENTE_B_75 + -NB_ATTENTE_B_74 + -NB_ATTENTE_B_73 + -NB_ATTENTE_B_72 + -NB_ATTENTE_B_71 + -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 884 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-V80P20N50-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-SUR_PONT_B <= -2 AND -SORTI_A <= -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 884 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-V80P20N50-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-ATTENTE_A <= -1 AND (ROUTE_A + -CHOIX_2 + -CHOIX_1 <= 0 AND SUR_PONT_A + -CAPACITE <= 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 884 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-V80P20N50-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-ROUTE_B + ATTENTE_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 884 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-V80P20N50-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-NB_ATTENTE_A_80 + -NB_ATTENTE_A_79 + -NB_ATTENTE_A_78 + -NB_ATTENTE_A_77 + -NB_ATTENTE_A_76 + -NB_ATTENTE_A_75 + -NB_ATTENTE_A_74 + -NB_ATTENTE_A_73 + -NB_ATTENTE_A_72 + -NB_ATTENTE_A_71 + -NB_ATTENTE_A_70 + -NB_ATTENTE_A_69 + -NB_ATTENTE_A_68 + -NB_ATTENTE_A_67 + -NB_ATTENTE_A_66 + -NB_ATTENTE_A_65 + -NB_ATTENTE_A_64 + -NB_ATTENTE_A_63 + -NB_ATTENTE_A_62 + -NB_ATTENTE_A_61 + -NB_ATTENTE_A_6... (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 884 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 8 literals
lola: write sara problem file to BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-VIDANGE_2 + -VIDANGE_1 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: lola: calling and running sara
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 884 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-V80P20N50-ReachabilityCardinality-5.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-V80P20N50-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-6.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 7 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-ATTENTE_A <= -3 AND -NB_ATTENTE_A_80 + -NB_ATTENTE_A_79 + -NB_ATTENTE_A_78 + -NB_ATTENTE_A_77 + -NB_ATTENTE_A_76 + -NB_ATTENTE_A_75 + -NB_ATTENTE_A_74 + -NB_ATTENTE_A_73 + -NB_ATTENTE_A_72 + -NB_ATTENTE_A_71 + -NB_ATTENTE_A_70 + -NB_ATTENTE_A_69 + -NB_ATTENTE_A_68 + -NB_ATTENTE_A_67 + -NB_ATTENTE_A_66 + -NB_ATTENTE_A_65 + -NB_ATTENTE_A_64 + -NB_ATTENTE_A_63 + -NB_ATTENTE_A_62 + -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 884 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-V80P20N50-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-7.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 8 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-ATTENTE_A <= -3 AND (-ATTENTE_A <= -1 AND (-CONTROLEUR_2 + -CONTROLEUR_1 > -3 AND -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_80 + -NB_ATTENTE_B_79 + -NB_ATTENTE_B_78 + -NB_ATTENTE_B_77 + -NB_ATTENTE_B_76 + -NB_ATTENTE_B_75 + -NB_ATTENTE_B_74 +... (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 884 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-V80P20N50-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N50-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 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-ATTENTE_A + SORTI_A > 0 AND -ROUTE_A <= -3) OR -NB_ATTENTE_A_80 + -NB_ATTENTE_A_79 + -NB_ATTENTE_A_78 + -NB_ATTENTE_A_77 + -NB_ATTENTE_A_76 + -NB_ATTENTE_A_75 + -NB_ATTENTE_A_74 + -NB_ATTENTE_A_73 + -NB_ATTENTE_A_72 + -NB_ATTENTE_A_71 + -NB_ATTENTE_A_70 + -NB_ATTENTE_A_69 + -NB_ATTENTE_A_68 + -NB_ATTENTE_A_67 + -NB_ATTENTE_A_66 + -NB_ATTENTE_A_65 + -NB_ATTENTE_A_64 + -NB_ATTENTE_A_63 + -NB_... (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 884 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-V80P20N50-ReachabilityCardinality-9.sara
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: lola: ========================================calling and running sara

lola: ...considering subproblem: EF ((-COMPTEUR_9 + ATTENTE_A + -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 + -COMPTEUR_35 + -CO... (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 884 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-V80P20N50-ReachabilityCardinality-9.sara.
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 2 literals
lola: write sara problem file to BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-10.sara
lola: ========================================
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=0)
lola: ========================================
lola: calling and running sara
lola: ...considering subproblem: EF (((-CAPACITE > -3 OR (-COMPTEUR_9 + -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 + -COMPTEUR_... (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 884 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-V80P20N50-ReachabilityCardinality-10.sara.
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 18 literals
lola: write sara problem file to BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-CONTROLEUR_2 + -CONTROLEUR_1 > -2 OR (-SUR_PONT_A > -1 OR -CAPACITE + VIDANGE_2 + VIDANGE_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 884 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-V80P20N50-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N50-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


lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1149 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-V80P20N50-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1724 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-COMPTEUR_9 + -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 + -COMPTEUR_35 + -COMPTEUR_34 + -... (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 884 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: RESULT
Transformation into DNF: expect 1 literalslola:
summary: no yes yes yes yes yes no no no yes no yes yes yes no no
lola: write sara problem file to BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-15.sara
lola: ========================================lola:
calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N50-ReachabilityCardinality-15.sara.

BK_STOP 1463499347120

--------------------
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-V80P20N50"
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-V80P20N50.tgz
mv BridgeAndVehicles-PT-V80P20N50 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-V80P20N50, 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-146347662500403"
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 ;