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 CSRepetitions-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662600540
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463508726613

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ CSRepetitions-PT-10
FORMULA CSRepetitions-COL-10-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-3 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-10-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-5 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-10-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-10-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-ReachabilityFireability-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: 3611/65536 symbol table entries, 88 collisions
lola: preprocessing...
lola: finding significant places
lola: 1311 places, 2300 transitions, 1201 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3501 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-COL-10-ReachabilityFireability.task
lola: read: AG ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((FIREABLE(Prepare_Request_39) OR FIREABLE(Prepare_Request_53)) OR FIREABLE(Prepare_Request_97)) OR FIREABLE(Prepare_Request_17)) OR FIREABLE(Prepare_Request_26)) OR FIREABLE(Prepare_Request_52)) OR FIREABLE(Prepare_Request_67)) OR FIREABLE(Prepare_Request_88)) OR FIREABLE(Prepare_Request_66)) OR F... (shortened)
lola: formula length: 1443664
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 166 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_39) OR (FIREABLE(Prepare_Request_53) OR (FIREABLE(Prepare_Request_97) OR (FIREABLE(Prepare_Request_17) OR (FIREABLE(Prepare_Request_26) OR (FIREABLE(Prepare_Request_52) OR (FIREABLE(Prepare_Request_67) OR (FIREABLE(Prepare_Request_88) OR (FIREABLE(Prepare_Request_66) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_45) OR (FIREABLE(Prepare_Request_32) OR (... (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 4804 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 100 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((((FIREABLE(Lose_Request_17) OR (FIREABLE(Lose_Request_74) OR (FIREABLE(Lose_Request_59) OR (FIREABLE(Lose_Request_88) OR (FIREABLE(Lose_Request_95) OR (FIREABLE(Lose_Request_31) OR (FIREABLE(Lose_Request_60) OR (FIREABLE(Lose_Request_46) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_80) OR (FIREABLE(Lose_Request_73) OR (FIREABLE(Lose_Request_45) OR (FIREABLE(Lose_Request_25) OR (FI... (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 4804 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 reachable.
lola: ========================================
lola: subprocess 2 will run for 190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Read_Request_45_1) OR (FIREABLE(Read_Request_7_10) OR (FIREABLE(Read_Request_15_4) OR (FIREABLE(Read_Request_70_3) OR (FIREABLE(Read_Request_6_10) OR (FIREABLE(Read_Request_43_10) OR (FIREABLE(Read_Request_92_2) OR (FIREABLE(Read_Request_57_7) OR (FIREABLE(Read_Request_62_9) OR (FIREABLE(Read_Request_100_6) OR (FIREABLE(Read_Request_35_10) OR (FIREABLE(Read_Request_66_7) OR (FIREABLE... (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 4804 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 not invariant.
lola: ========================================
lola: subprocess 3 will run for 205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(Lose_Request_17) OR (FIREABLE(Lose_Request_74) OR (FIREABLE(Lose_Request_59) OR (FIREABLE(Lose_Request_88) OR (FIREABLE(Lose_Request_95) OR (FIREABLE(Lose_Request_31) OR (FIREABLE(Lose_Request_60) OR (FIREABLE(Lose_Request_46) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_80) OR (FIREABLE(Lose_Request_73) OR (FIREABLE(Lose_Request_45) OR (FIREABLE(Lose_Request_25) OR (FIRE... (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 4804 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 inf literals
lola: DNF formula is too big, sara cannot be used
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 213 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Send_Answer_79_10) OR (FIREABLE(Send_Answer_9_7) OR (FIREABLE(Send_Answer_36_8) OR (FIREABLE(Send_Answer_9_1) OR (FIREABLE(Send_Answer_9_8) OR (FIREABLE(Send_Answer_65_7) OR (FIREABLE(Send_Answer_25_6) OR (FIREABLE(Send_Answer_52_10) OR (FIREABLE(Send_Answer_46_10) OR (FIREABLE(Send_Answer_88_2) OR (FIREABLE(Send_Answer_87_4) OR (FIREABLE(Send_Answer_18_8) OR (FIREABLE(Send_Answer_6... (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 4804 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 reachable.
lola: ========================================
lola: subprocess 5 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Send_Request_28) OR (FIREABLE(Send_Request_97) OR (FIREABLE(Send_Request_35) OR (FIREABLE(Send_Request_47) OR (FIREABLE(Send_Request_46) OR (FIREABLE(Send_Request_88) OR (FIREABLE(Send_Request_69) OR (FIREABLE(Send_Request_22) OR (FIREABLE(Send_Request_96) OR (FIREABLE(Send_Request_8) OR (FIREABLE(Send_Request_75) OR (FIREABLE(Send_Request_60) OR (FIREABLE(Send_Request_61) OR (FIREA... (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 4804 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 2265459800 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(Prepare_Request_39) AND (! FIREABLE(Prepare_Request_53) AND (! FIREABLE(Prepare_Request_97) AND (! FIREABLE(Prepare_Request_17) AND (! FIREABLE(Prepare_Request_26) AND (! FIREABLE(Prepare_Request_52) AND (! FIREABLE(Prepare_Request_67) AND (! FIREABLE(Prepare_Request_88) AND (! FIREABLE(Prepare_Request_66) AND (! FIREABLE(Prepare_Request_3) AND (! FIREABLE(Prepare_Request_45) AND (... (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 4804 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 inf literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(Send_Answer_79_10) OR (FIREABLE(Send_Answer_9_7) OR (FIREABLE(Send_Answer_36_8) OR (FIREABLE(Send_Answer_9_1) OR (FIREABLE(Send_Answer_9_8) OR (FIREABLE(Send_Answer_65_7) OR (FIREABLE(Send_Answer_25_6) OR (FIREABLE(Send_Answer_52_10) OR (FIREABLE(Send_Answer_46_10) OR (FIREABLE(Send_Answer_88_2) OR (FIREABLE(Send_Answer_87_4) OR (FIREABLE(Send_Answer_18_8) OR (FIREABLE(Send_Answer_... (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 4804 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 42860344287450687965279996262400532245764998530627188859636586737310278611044216293253589769414783092296253975696996260355027695723358470014353377697247275926744622942970214176045448442012969632116988983585361723534531025460405633393863213086870778785102978176263362256772317774471724006434527676320448512 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Send_Request_28) OR (FIREABLE(Send_Request_97) OR (FIREABLE(Send_Request_35) OR (FIREABLE(Send_Request_47) OR (FIREABLE(Send_Request_46) OR (FIREABLE(Send_Request_88) OR (FIREABLE(Send_Request_69) OR (FIREABLE(Send_Request_22) OR (FIREABLE(Send_Request_96) OR (FIREABLE(Send_Request_8) OR (FIREABLE(Send_Request_75) OR (FIREABLE(Send_Request_60) OR (FIREABLE(Send_Request_61) OR (FIREA... (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 4804 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 reachable.
lola: ========================================
lola: subprocess 9 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Send_Answer_79_10) OR (FIREABLE(Send_Answer_9_7) OR (FIREABLE(Send_Answer_36_8) OR (FIREABLE(Send_Answer_9_1) OR (FIREABLE(Send_Answer_9_8) OR (FIREABLE(Send_Answer_65_7) OR (FIREABLE(Send_Answer_25_6) OR (FIREABLE(Send_Answer_52_10) OR (FIREABLE(Send_Answer_46_10) OR (FIREABLE(Send_Answer_88_2) OR (FIREABLE(Send_Answer_87_4) OR (FIREABLE(Send_Answer_18_8) OR (FIREABLE(Send_Answer_6... (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 4804 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 reachable.
lola: ========================================
lola: subprocess 10 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(Send_Answer_79_10) AND (! FIREABLE(Send_Answer_9_7) AND (! FIREABLE(Send_Answer_36_8) AND (! FIREABLE(Send_Answer_9_1) AND (! FIREABLE(Send_Answer_9_8) AND (! FIREABLE(Send_Answer_65_7) AND (! FIREABLE(Send_Answer_25_6) AND (! FIREABLE(Send_Answer_52_10) AND (! FIREABLE(Send_Answer_46_10) AND (! FIREABLE(Send_Answer_88_2) AND (! FIREABLE(Send_Answer_87_4) AND (! FIREABLE(Send_Answe... (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 4804 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 not invariant.
lola: ========================================
lola: subprocess 11 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_39) OR (FIREABLE(Prepare_Request_53) OR (FIREABLE(Prepare_Request_97) OR (FIREABLE(Prepare_Request_17) OR (FIREABLE(Prepare_Request_26) OR (FIREABLE(Prepare_Request_52) OR (FIREABLE(Prepare_Request_67) OR (FIREABLE(Prepare_Request_88) OR (FIREABLE(Prepare_Request_66) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_45) OR (FIREABLE(Prepare_Request_32) OR (... (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 4804 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 100 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_39) OR (FIREABLE(Prepare_Request_53) OR (FIREABLE(Prepare_Request_97) OR (FIREABLE(Prepare_Request_17) OR (FIREABLE(Prepare_Request_26) OR (FIREABLE(Prepare_Request_52) OR (FIREABLE(Prepare_Request_67) OR (FIREABLE(Prepare_Request_88) OR (FIREABLE(Prepare_Request_66) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_45) OR (FIREABLE(Prepare_Request_32) OR (... (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 4804 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 not invariant.
lola: ========================================
lola: subprocess 13 will run for 698 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Send_Answer_79_10) OR (FIREABLE(Send_Answer_9_7) OR (FIREABLE(Send_Answer_36_8) OR (FIREABLE(Send_Answer_9_1) OR (FIREABLE(Send_Answer_9_8) OR (FIREABLE(Send_Answer_65_7) OR (FIREABLE(Send_Answer_25_6) OR (FIREABLE(Send_Answer_52_10) OR (FIREABLE(Send_Answer_46_10) OR (FIREABLE(Send_Answer_88_2) OR (FIREABLE(Send_Answer_87_4) OR (FIREABLE(Send_Answer_18_8) OR (FIREABLE(Send_Answer_6... (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 4804 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 reachable.
lola: ========================================
lola: subprocess 14 will run for 1047 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(Send_Answer_79_10) OR (FIREABLE(Send_Answer_9_7) OR (FIREABLE(Send_Answer_36_8) OR (FIREABLE(Send_Answer_9_1) OR (FIREABLE(Send_Answer_9_8) OR (FIREABLE(Send_Answer_65_7) OR (FIREABLE(Send_Answer_25_6) OR (FIREABLE(Send_Answer_52_10) OR (FIREABLE(Send_Answer_46_10) OR (FIREABLE(Send_Answer_88_2) OR (FIREABLE(Send_Answer_87_4) OR (FIREABLE(Send_Answer_18_8) OR (FIREABLE(Send_Answer_67... (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 4804 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 reachable.
lola: ========================================
lola: subprocess 15 will run for 2093 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(Send_Answer_79_10) OR (FIREABLE(Send_Answer_9_7) OR (FIREABLE(Send_Answer_36_8) OR (FIREABLE(Send_Answer_9_1) OR (FIREABLE(Send_Answer_9_8) OR (FIREABLE(Send_Answer_65_7) OR (FIREABLE(Send_Answer_25_6) OR (FIREABLE(Send_Answer_52_10) OR (FIREABLE(Send_Answer_46_10) OR (FIREABLE(Send_Answer_88_2) OR (FIREABLE(Send_Answer_87_4) OR (FIREABLE(Send_Answer_18_8) OR (FIREABLE(Send_Answer_6... (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 4804 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 reachable.
lola: ========================================
lola: RESULT
lola: summary: no yes no unknown yes unknown unknown no yes yes no no no yes yes yes

BK_STOP 1463510174479

--------------------
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="CSRepetitions-PT-10"
export BK_EXAMINATION="ReachabilityFireability"
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/CSRepetitions-PT-10.tgz
mv CSRepetitions-PT-10 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 CSRepetitions-PT-10, examination is ReachabilityFireability"
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-146347662600540"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;