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 S_Diffusion2D-PT-D50N150, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146kn-smll-146416248900313
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464334613559

bkconf 3600
===========================================================================================
===========================================================================================
S_Diffusion2D-PT-D50N150: translating Petri net model.pnml into LoLA format
S_Diffusion2D-PT-D50N150: translating formula ReachabilityCardinality 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 3502
ReachabilityCardinality @ S_Diffusion2D-PT-D50N150
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3502 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 21904/65536 symbol table entries, 8280 collisions
lola: preprocessing...
lola: finding significant places
lola: 2500 places, 19404 transitions, 2499 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2500 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D50N150-ReachabilityCardinality.task
lola: read: EF (3 <= cAMP__24_41_) : EF (!(((2 <= cAMP__35_7_ AND 3 <= cAMP__39_4_) OR (cAMP__21_16_ <= cAMP__44_11_ OR cAMP__1_12_ <= cAMP__24_36_)))) : EF ((!((2 <= cAMP__35_26_ OR cAMP__22_47_ <= cAMP__23_43_)) OR 2 <= cAMP__14_3_)) : EF ((2 <= cAMP__45_1_ OR 1 <= cAMP__11_26_)) : EF (!(!((cAMP__36_46_ <= cAMP__25_35_ AND 2 <= cAMP__18_18_)))) : AG ((!(cAMP__21_19_ <= cAMP__28_26_) OR (3 <= cAMP__4_28_ OR ... (shortened)
lola: formula length: 1361
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cAMP__24_41_ <= -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-cAMP__35_7_ > -2 OR -cAMP__39_4_ > -3) AND (cAMP__21_16_ + -cAMP__44_11_ > 0 AND cAMP__1_12_ + -cAMP__24_36_ > 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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-cAMP__35_26_ > -2 AND -cAMP__23_43_ + cAMP__22_47_ > 0) OR -cAMP__14_3_ <= -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__45_1_ <= -2 OR -cAMP__11_26_ <= -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__25_35_ + cAMP__36_46_ <= 0 AND -cAMP__18_18_ <= -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((cAMP__21_19_ + -cAMP__28_26_ > 0 OR (-cAMP__4_28_ <= -3 OR cAMP__19_47_ + -cAMP__25_24_ <= 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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-cAMP__25_34_ <= -2 AND (-cAMP__1_22_ <= -3 OR -cAMP__42_36_ + cAMP__4_48_ <= 0)) OR (-cAMP__43_39_ <= -1 OR cAMP__4_15_ + -cAMP__12_43_ > 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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((cAMP__41_31_ + -cAMP__32_37_ > 0 OR -cAMP__8_47_ <= -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((cAMP__44_3_ + -cAMP__16_49_ <= 0 OR (-cAMP__22_31_ <= -3 OR (cAMP__16_27_ + -cAMP__12_43_ <= 0 OR -cAMP__29_22_ <= -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-cAMP__14_49_ > -3 AND -cAMP__11_27_ + cAMP__45_22_ > 0) OR (cAMP__3_22_ + -cAMP__30_47_ <= 0 OR (-cAMP__1_37_ <= -1 OR -cAMP__22_28_ <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 9996 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 8 literals
lola: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((cAMP__25_36_ + -cAMP__31_10_ <= 0 AND (-cAMP__45_29_ <= -3 OR (cAMP__34_45_ + -cAMP__46_15_ <= 0 OR -cAMP__25_46_ > -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((cAMP__6_41_ + -cAMP__43_32_ > 0 AND (-cAMP__49_19_ + cAMP__7_2_ > 0 AND -cAMP__3_11_ <= -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 833 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cAMP__30_18_ <= -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((cAMP__12_31_ + -cAMP__50_6_ > 0 OR ((-cAMP__40_1_ <= -3 AND cAMP__38_2_ + -cAMP__22_11_ <= 0) OR -cAMP__20_36_ <= -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__1_23_ + cAMP__37_6_ > 0 AND (-cAMP__34_14_ > -2 AND -cAMP__26_32_ > -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cAMP__19_5_ <= -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 9996 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 Diffusion2D-PT-D50N150-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: yes yes yes yes yes no yes yes no no no yes yes yes yes yes

BK_STOP 1464334826194

--------------------
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="S_Diffusion2D-PT-D50N150"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/S_Diffusion2D-PT-D50N150.tgz
mv S_Diffusion2D-PT-D50N150 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 S_Diffusion2D-PT-D50N150, 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 r146kn-smll-146416248900313"
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 ;