fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r098-ebro-149488455900430
Last Updated
June 27, 2017

About the Execution of LoLA for S_Diffusion2D-PT-D50N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
343.180 381776.00 762624.00 120.10 TFFTTFTTTFTTFTFT normal

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-3253
Executing tool lola
Input is S_Diffusion2D-PT-D50N100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455900430
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496465071362


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_Diffusion2D-PT-D50N100: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_Diffusion2D-PT-D50N100: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_Diffusion2D-PT-D50N100 @ 3540 seconds
----- Start make result stdout -----
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: 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-D50N100-ReachabilityCardinality.task
lola: E (F ((3 <= cAMP__37_4_))) : A (G ((((cAMP__11_32_ <= 1) OR (cAMP__11_17_ + 1 <= cAMP__26_8_)) AND (cAMP__17_41_ <= cAMP__2_15_)))) : E (F ((2 <= cAMP__16_17_))) : A (G ((((3 <= cAMP__10_16_) OR (cAMP__23_37_ <= cAMP__25_1_) OR ((2 <= cAMP__20_40_) AND (2 <= cAMP__10_22_))) AND (cAMP__9_22_ <= cAMP__10_20_)))) : E (F (((3 <= cAMP__12_10_) AND (cAMP__37_19_ <= cAMP__23_27_) AND (cAMP__2_21_ <= 1) AND ((cAMP__5_34_ <= cAMP__21_21_) OR (cAMP__25_36_ <= cAMP__30_12_) OR (cAMP__35_40_ + 1 <= cAMP__12_4_))))) : E (F (((cAMP__9_13_ + 1 <= cAMP__18_16_) OR (cAMP__25_2_ + 1 <= cAMP__4_15_) OR (cAMP__31_20_ + 1 <= cAMP__6_1_)))) : A (G (((cAMP__4_50_ <= cAMP__18_31_) OR (1 <= cAMP__10_40_) OR (1 <= cAMP__48_5_) OR ((cAMP__49_20_ <= cAMP__33_43_) AND (cAMP__37_43_ <= cAMP__48_24_))))) : E (F (((1 <= cAMP__32_24_) OR ((cAMP__48_28_ + 1 <= cAMP__50_39_) AND (cAMP__19_4_ + 1 <= cAMP__41_15_))))) : A (G ((((cAMP__2_9_ <= cAMP__28_34_) OR (3 <= cAMP__14_4_) OR ((cAMP__11_22_ <= cAMP__18_43_) AND (cAMP__43_32_ <= cAMP__23_34_))) AND (cAMP__19_22_ <= 1)))) : E (F ((((cAMP__26_19_ <= cAMP__42_2_) OR (1 <= cAMP__40_18_)) AND (cAMP__41_30_ + 1 <= cAMP__2_45_) AND (3 <= cAMP__22_35_)))) : A (G (((cAMP__33_20_ + 1 <= cAMP__39_29_) OR (cAMP__4_30_ <= 1) OR (cAMP__31_31_ <= 1)))) : E (F ((((cAMP__45_34_ + 1 <= cAMP__15_42_) OR (cAMP__25_22_ + 1 <= cAMP__43_35_)) AND ((cAMP__47_27_ + 1 <= cAMP__45_32_) OR (cAMP__35_29_ + 1 <= cAMP__28_32_))))) : E (F (((cAMP__5_37_ <= cAMP__4_47_) AND (3 <= cAMP__49_4_)))) : A (G ((((cAMP__29_9_ <= cAMP__42_48_) OR (cAMP__9_6_ <= cAMP__40_22_)) AND (cAMP__48_12_ <= 1)))) : E (F ((((cAMP__2_47_ <= 2) OR (cAMP__49_20_ + 1 <= cAMP__7_16_)) AND (2 <= cAMP__4_41_)))) : E (F ((cAMP__23_48_ + 1 <= cAMP__31_47_)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__37_4_)))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 2336 markings, 8671 edges, 467 markings/sec, 0 secs
lola: sara is running 5 secs || 4762 markings, 16834 edges, 485 markings/sec, 5 secs
lola: sara is running 10 secs || 7214 markings, 24762 edges, 490 markings/sec, 10 secs
lola: sara is running 15 secs || 9660 markings, 32809 edges, 489 markings/sec, 15 secs
lola: sara is running 20 secs || 12095 markings, 41003 edges, 487 markings/sec, 20 secs
lola: sara is running 25 secs || 14533 markings, 48896 edges, 488 markings/sec, 25 secs
lola: sara is running 30 secs || 16975 markings, 56898 edges, 488 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__11_32_ <= 1) OR (cAMP__11_17_ + 1 <= cAMP__26_8_)) AND (cAMP__17_41_ <= cAMP__2_15_))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= cAMP__16_17_)))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ...considering subproblem: A (G ((((3 <= cAMP__10_16_) OR (cAMP__23_37_ <= cAMP__25_1_) OR ((2 <= cAMP__20_40_) AND (2 <= cAMP__10_22_))) AND (cAMP__9_22_ <= cAMP__10_20_))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__12_10_) AND (cAMP__37_19_ <= cAMP__23_27_) AND (cAMP__2_21_ <= 1) AND ((cAMP__5_34_ <= cAMP__21_21_) OR (cAMP__25_36_ <= cAMP__30_12_) OR (cAMP__35_40_ + 1 <= cAMP__12_4_)))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 2437 markings, 8581 edges, 487 markings/sec, 0 secs
lola: sara is running 5 secs || 4871 markings, 17286 edges, 487 markings/sec, 5 secs
lola: sara is running 10 secs || 7197 markings, 25675 edges, 465 markings/sec, 10 secs
lola: sara is running 15 secs || 9625 markings, 34500 edges, 486 markings/sec, 15 secs
lola: sara is running 20 secs || 12060 markings, 43419 edges, 487 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__9_13_ + 1 <= cAMP__18_16_) OR (cAMP__25_2_ + 1 <= cAMP__4_15_) OR (cAMP__31_20_ + 1 <= cAMP__6_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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 2423 markings, 8130 edges, 485 markings/sec, 0 secs
lola: sara is running 5 secs || 4861 markings, 16480 edges, 488 markings/sec, 5 secs
lola: sara is running 10 secs || 7299 markings, 24195 edges, 488 markings/sec, 10 secs
lola: sara is running 15 secs || 9703 markings, 31667 edges, 481 markings/sec, 15 secs
lola: sara is running 20 secs || 12130 markings, 39872 edges, 485 markings/sec, 20 secs
lola: sara is running 25 secs || 14549 markings, 48486 edges, 484 markings/sec, 25 secs
lola: sara is running 30 secs || 16976 markings, 56940 edges, 485 markings/sec, 30 secs
lola: sara is running 35 secs || 19419 markings, 65186 edges, 489 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 21863 markings, 72703 edges, 489 markings/sec, 40 secs

lola: sara is running 45 secs || 24304 markings, 81185 edges, 488 markings/sec, 45 secs
lola: sara is running 50 secs || 26744 markings, 89362 edges, 488 markings/sec, 50 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__4_50_ <= cAMP__18_31_) OR (1 <= cAMP__10_40_) OR (1 <= cAMP__48_5_) OR ((cAMP__49_20_ <= cAMP__33_43_) AND (cAMP__37_43_ <= cAMP__48_24_)))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 2506 markings, 8646 edges, 501 markings/sec, 0 secs
lola: sara is running 5 secs || 5000 markings, 17403 edges, 499 markings/sec, 5 secs
lola: sara is running 10 secs || 7501 markings, 26293 edges, 500 markings/sec, 10 secs
lola: sara is running 15 secs || 10002 markings, 35019 edges, 500 markings/sec, 15 secs
lola: sara is running 20 secs || 12506 markings, 43414 edges, 501 markings/sec, 20 secs
lola: sara is running 25 secs || 15000 markings, 52120 edges, 499 markings/sec, 25 secs
lola: sara is running 30 secs || 17443 markings, 60608 edges, 489 markings/sec, 30 secs
lola: sara is running 35 secs || 19840 markings, 69345 edges, 479 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 22243 markings, 78125 edges, 481 markings/sec, 40 secs

lola: sara is running 45 secs || 24691 markings, 86600 edges, 490 markings/sec, 45 secs
lola: sara is running 50 secs || 27151 markings, 95342 edges, 492 markings/sec, 50 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 372 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= cAMP__32_24_) OR ((cAMP__48_28_ + 1 <= cAMP__50_39_) AND (cAMP__19_4_ + 1 <= cAMP__41_15_)))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__2_9_ <= cAMP__28_34_) OR (3 <= cAMP__14_4_) OR ((cAMP__11_22_ <= cAMP__18_43_) AND (cAMP__43_32_ <= cAMP__23_34_))) AND (cAMP__19_22_ <= 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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 479 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__26_19_ <= cAMP__42_2_) OR (1 <= cAMP__40_18_)) AND (cAMP__41_30_ + 1 <= cAMP__2_45_) AND (3 <= cAMP__22_35_))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 2424 markings, 8549 edges, 485 markings/sec, 0 secs
lola: sara is running 5 secs || 4870 markings, 16695 edges, 489 markings/sec, 5 secs
lola: sara is running 10 secs || 7313 markings, 25329 edges, 489 markings/sec, 10 secs
lola: sara is running 15 secs || 9766 markings, 33745 edges, 491 markings/sec, 15 secs
lola: sara is running 20 secs || 12248 markings, 41850 edges, 496 markings/sec, 20 secs
lola: sara is running 25 secs || 14703 markings, 49420 edges, 491 markings/sec, 25 secs
lola: sara is running 30 secs || 17173 markings, 57304 edges, 494 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 19623 markings, 65877 edges, 490 markings/sec, 35 secs

lola: sara is running 40 secs || 22082 markings, 74372 edges, 492 markings/sec, 40 secs
lola: sara is running 45 secs || 24533 markings, 82642 edges, 490 markings/sec, 45 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__33_20_ + 1 <= cAMP__39_29_) OR (cAMP__4_30_ <= 1) OR (cAMP__31_31_ <= 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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 2499 markings, 8294 edges, 500 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__45_34_ + 1 <= cAMP__15_42_) OR (cAMP__25_22_ + 1 <= cAMP__43_35_)) AND ((cAMP__47_27_ + 1 <= cAMP__45_32_) OR (cAMP__35_29_ + 1 <= cAMP__28_32_)))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 2466 markings, 7770 edges, 493 markings/sec, 0 secs
lola: sara is running 5 secs || 4943 markings, 15044 edges, 495 markings/sec, 5 secs
lola: sara is running 10 secs || 7425 markings, 23084 edges, 496 markings/sec, 10 secs
lola: sara is running 15 secs || 9861 markings, 31614 edges, 487 markings/sec, 15 secs
lola: sara is running 20 secs || 12314 markings, 40345 edges, 491 markings/sec, 20 secs
lola: sara is running 25 secs || 14800 markings, 47603 edges, 497 markings/sec, 25 secs
lola: sara is running 30 secs || 17286 markings, 55319 edges, 497 markings/sec, 30 secs
lola: sara is running 35 secs || 19694 markings, 61430 edges, 482 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 22176 markings, 67876 edges, 496 markings/sec, 40 secs
lola: sara is running 45 secs || 24662 markings, 74345 edges, 497 markings/sec, 45 secs

lola: sara is running 50 secs || 27143 markings, 81105 edges, 496 markings/sec, 50 secs
lola: sara is running 55 secs || 29639 markings, 89359 edges, 499 markings/sec, 55 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 809 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__5_37_ <= cAMP__4_47_) AND (3 <= cAMP__49_4_))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 2509 markings, 7561 edges, 502 markings/sec, 0 secs
lola: sara is running 5 secs || 5037 markings, 15378 edges, 506 markings/sec, 5 secs
lola: sara is running 10 secs || 7559 markings, 23181 edges, 504 markings/sec, 10 secs
lola: sara is running 15 secs || 10075 markings, 30812 edges, 503 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1071 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__29_9_ <= cAMP__42_48_) OR (cAMP__9_6_ <= cAMP__40_22_)) AND (cAMP__48_12_ <= 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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 2463 markings, 8585 edges, 493 markings/sec, 0 secs
lola: sara is running 5 secs || 4918 markings, 17541 edges, 491 markings/sec, 5 secs
lola: sara is running 10 secs || 7342 markings, 25864 edges, 485 markings/sec, 10 secs
lola: sara is running 15 secs || 9790 markings, 33786 edges, 490 markings/sec, 15 secs
lola: sara is running 20 secs || 12205 markings, 42321 edges, 483 markings/sec, 20 secs
lola: sara is running 25 secs || 14626 markings, 50430 edges, 484 markings/sec, 25 secs
lola: sara is running 30 secs || 17059 markings, 59305 edges, 487 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 35 secs || 19458 markings, 67225 edges, 480 markings/sec, 35 secs
lola: sara is running 40 secs || 21874 markings, 75240 edges, 483 markings/sec, 40 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1583 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__2_47_ <= 2) OR (cAMP__49_20_ + 1 <= cAMP__7_16_)) AND (2 <= cAMP__4_41_))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 2506 markings, 8787 edges, 501 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3159 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__23_48_ + 1 <= cAMP__31_47_)))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N100-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N100-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes no yes no yes no yes yes no yes yes
lola: ========================================
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496465453138

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_Diffusion2D-PT-D50N100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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-D50N100.tgz
mv S_Diffusion2D-PT-D50N100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_Diffusion2D-PT-D50N100, 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 r098-ebro-149488455900430"
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 ;