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 AirplaneLD-PT-1000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r206su-blw3-146445817200142
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464484198340

bkconf 3600
===========================================================================================
===========================================================================================
AirplaneLD-PT-1000: translating formula ReachabilityCardinality into LoLA format
AirplaneLD-PT-1000: translating Petri net model.pnml into LoLA format
===========================================================================================
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
/home/mcc/BenchKit/bin/formula2lola.py ReachabilityCardinality.xml
touch formulae;


in benchkit_head lolaszeit 3520
ReachabilityCardinality @ AirplaneLD-PT-1000
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA AirplaneLD-COL-1000-ReachabilityCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3520 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 15027/65536 symbol table entries, 931 collisions
lola: preprocessing...
lola: finding significant places
lola: 7019 places, 8008 transitions, 4014 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 6015 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-COL-1000-ReachabilityCardinality.task
lola: read: EF ((((1 <= P5 AND 2 <= P3) OR (2 <= Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9 + Speed_Right_Wheel_10 + Speed_Right_Wheel_11 + Speed_Right_Wheel_12 + Speed_Right_Wheel_13 + Speed_Right_Wheel_14 + Speed_Right_Wheel_15 + Speed_Right_Wheel_16 + Spee... (shortened)
lola: formula length: 495216
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 148 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((-P5 <= -1 AND -P3 <= -2) OR (-Speed_Right_Wheel_1000 + -Speed_Right_Wheel_100 + -Speed_Right_Wheel_101 + -Speed_Right_Wheel_102 + -Speed_Right_Wheel_103 + -Speed_Right_Wheel_104 + -Speed_Right_Wheel_105 + -Speed_Right_Wheel_106 + -Speed_Right_Wheel_107 + -Speed_Right_Wheel_108 + -Speed_Right_Wheel_109 + -Speed_Right_Wheel_110 + -Speed_Right_Wheel_111 + -Speed_Right_Wheel_112 + -Speed_Right_... (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 16056 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 AirplaneLD-COL-1000-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file AirplaneLD-COL-1000-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 155 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (P4 + -P1 <= 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 16056 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 AirplaneLD-COL-1000-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 166 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Weight_Right_Wheel_on + -Weight_Right_Wheel_off <= -3 AND -Weight_Left_Wheel_off + -Weight_Left_Wheel_on > -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 16056 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: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-SpeedPossibleVal_99 + -SpeedPossibleVal_98 + -SpeedPossibleVal_97 + -SpeedPossibleVal_96 + -SpeedPossibleVal_95 + -SpeedPossibleVal_94 + -SpeedPossibleVal_93 + -SpeedPossibleVal_92 + -SpeedPossibleVal_91 + -SpeedPossibleVal_90 + -SpeedPossibleVal_89 + -SpeedPossibleVal_88 + -SpeedPossibleVal_87 + -SpeedPossibleVal_86 + -SpeedPossibleVal_85 + -SpeedPossibleVal_84 + -SpeedPossibleVal_83 + -Sp... (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 16056 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 AirplaneLD-COL-1000-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file AirplaneLD-COL-1000-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 192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (WeightPossibleVal_on + -P6 + WeightPossibleVal_off <= 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 16056 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 AirplaneLD-COL-1000-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file AirplaneLD-COL-1000-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 208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P6 + -P1 <= 0 OR -P5 <= -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 16056 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 AirplaneLD-COL-1000-ReachabilityCardinality-5.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P4 <= -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 16056 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 AirplaneLD-COL-1000-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-stp2 > -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 16056 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 AirplaneLD-COL-1000-ReachabilityCardinality-7.sara
lola: subprocess 8 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Weight_Left_Wheel_off + -Weight_Left_Wheel_on > -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16056 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: calling and running sara
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: ========================================
sara: try reading problem file AirplaneLD-COL-1000-ReachabilityCardinality-7.sara.
lola: subprocess 9 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((TheAltitude_1760 + TheAltitude_1761 + TheAltitude_1762 + TheAltitude_1763 + TheAltitude_1764 + TheAltitude_1765 + TheAltitude_1759 + TheAltitude_1758 + TheAltitude_1757 + TheAltitude_1756 + TheAltitude_1755 + TheAltitude_1754 + TheAltitude_1753 + TheAltitude_1752 + TheAltitude_1751 + TheAltitude_1750 + TheAltitude_1766 + TheAltitude_1767 + TheAltitude_1768 + TheAltitude_1769 + TheAltitude_17... (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 16056 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 10 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P5 <= -2 AND ((stp5 + -P5 <= 0 OR -Plane_On_Ground_Signal_no_T + -Plane_On_Ground_Signal_no_F <= -3) AND (-Speed_Left_Wheel_1 + -Speed_Left_Wheel_2 + -Speed_Left_Wheel_3 + -Speed_Left_Wheel_4 + -Speed_Left_Wheel_5 + -Speed_Left_Wheel_6 + -Speed_Left_Wheel_7 + -Speed_Left_Wheel_8 + -Speed_Left_Wheel_9 + -Speed_Left_Wheel_600 + -Speed_Left_Wheel_601 + -Speed_Left_Wheel_602 + -Speed_Left_Wheel_... (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 16056 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 AirplaneLD-COL-1000-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file AirplaneLD-COL-1000-ReachabilityCardinality-10.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 11 will run for 448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((Plane_On_Ground_Signal_no_T + Plane_On_Ground_Signal_no_F + -stp5 <= 0 AND -stp1 + Weight_Left_Wheel_off + Weight_Left_Wheel_on <= 0) OR (-Speed_Right_Wheel_1000 + -Speed_Right_Wheel_100 + -Speed_Right_Wheel_101 + -Speed_Right_Wheel_102 + -Speed_Right_Wheel_103 + -Speed_Right_Wheel_104 + -Speed_Right_Wheel_105 + -Speed_Right_Wheel_106 + -Speed_Right_Wheel_107 + -Speed_Right_Wheel_108 + -Spe... (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 16056 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 AirplaneLD-COL-1000-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file AirplaneLD-COL-1000-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P3 <= -3 AND (-P3 <= -3 AND (SpeedPossibleVal_99 + SpeedPossibleVal_98 + SpeedPossibleVal_97 + SpeedPossibleVal_96 + SpeedPossibleVal_95 + SpeedPossibleVal_94 + SpeedPossibleVal_93 + SpeedPossibleVal_92 + SpeedPossibleVal_91 + SpeedPossibleVal_90 + SpeedPossibleVal_89 + SpeedPossibleVal_88 + SpeedPossibleVal_87 + SpeedPossibleVal_86 + SpeedPossibleVal_85 + SpeedPossibleVal_84 + SpeedPossible... (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 16056 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 4 literals
lola: write sara problem file to AirplaneLD-COL-1000-ReachabilityCardinality-12.sara
lola: subprocess 13 will run for 746 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-P4 <= -2 OR -stp5 <= -2) AND ((-stp3 <= -3 OR stp4 + -P2 <= 0) AND ((-P4 + P1 <= 0 OR -stp5 <= -3) AND -stp4 + P4 <= 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 16056 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: ========================================
lola: calling and running sara
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 30 literals
lola: write sara problem file to AirplaneLD-COL-1000-ReachabilityCardinality-13.sara
sara: try reading problem file AirplaneLD-COL-1000-ReachabilityCardinality-12.sara.
lola: calling and running sara
sara: try reading problem file AirplaneLD-COL-1000-ReachabilityCardinality-13.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 14 will run for 1091 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Plane_On_Ground_Signal_no_T + -Plane_On_Ground_Signal_no_F > -2 OR (P6 + -Plane_On_Ground_Signal_no_T + -Plane_On_Ground_Signal_no_F > 0 OR -P4 + P3 > 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 16056 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 AirplaneLD-COL-1000-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file AirplaneLD-COL-1000-ReachabilityCardinality-14.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 15 will run for 2159 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P3 <= -1 AND -P2 <= -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 16056 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: no
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola: summary: no no no no no no yes yes yes no no no no no yes no

BK_STOP 1464485579147

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

parsing of model.pnml complete

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="AirplaneLD-PT-1000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/hulinhub/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/AirplaneLD-PT-1000.tgz
mv AirplaneLD-PT-1000 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 AirplaneLD-PT-1000, 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 r206su-blw3-146445817200142"
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 ;