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

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

=== Now, execution of the tool begins

BK_START 1496464028413


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


checking for too many tokens
===========================================================================================
S_Diffusion2D-PT-D50N050: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_Diffusion2D-PT-D50N050 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 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-D50N050-ReachabilityCardinality.task
lola: E (F (((2 <= cAMP__42_41_) AND ((cAMP__13_35_ <= cAMP__10_33_) OR (1 <= cAMP__38_41_) OR ((cAMP__11_35_ <= cAMP__14_13_) AND (2 <= cAMP__8_12_)))))) : A (G ((cAMP__5_33_ <= cAMP__1_19_))) : A (G ((cAMP__26_13_ <= cAMP__5_39_))) : E (F (((cAMP__26_27_ + 1 <= cAMP__37_21_) AND (cAMP__9_36_ <= cAMP__9_28_)))) : A (G (((cAMP__7_22_ <= cAMP__15_26_) AND (cAMP__39_13_ <= cAMP__14_34_) AND (cAMP__2_44_ <= 2) AND (((cAMP__27_3_ <= cAMP__39_39_) AND (cAMP__6_47_ <= cAMP__49_19_)) OR (cAMP__32_41_ <= cAMP__28_3_))))) : E (F (((3 <= cAMP__37_12_) OR ((cAMP__33_5_ <= 2) AND (cAMP__23_13_ + 1 <= cAMP__3_34_))))) : E (F (((3 <= cAMP__5_2_) AND (3 <= cAMP__44_40_) AND ((cAMP__44_18_ <= cAMP__38_1_) OR (1 <= cAMP__8_19_)) AND ((1 <= cAMP__12_34_) OR (1 <= cAMP__28_37_) OR ((3 <= cAMP__13_42_) AND (1 <= cAMP__36_20_)))))) : E (F (((cAMP__10_23_ + 1 <= cAMP__22_3_) OR ((cAMP__9_38_ + 1 <= cAMP__8_10_) AND (cAMP__19_41_ <= 2))))) : E (F ((cAMP__44_42_ + 1 <= cAMP__6_44_))) : A (G (((cAMP__42_50_ <= 0) OR (cAMP__25_8_ <= cAMP__47_31_)))) : A (G (((2 <= cAMP__24_3_) OR (cAMP__45_9_ <= cAMP__12_33_)))) : E (F (((cAMP__50_29_ + 1 <= cAMP__44_14_) AND (cAMP__47_12_ + 1 <= cAMP__6_43_) AND (2 <= cAMP__8_46_)))) : A (G ((cAMP__43_1_ <= cAMP__5_35_))) : A (G ((cAMP__4_24_ <= cAMP__43_47_))) : E (F ((((cAMP__9_13_ <= 1) OR (cAMP__44_8_ <= 2)) AND (((2 <= cAMP__20_5_) AND (cAMP__29_12_ <= cAMP__16_31_)) OR (1 <= cAMP__46_44_))))) : E (F ((cAMP__47_11_ + 1 <= cAMP__14_36_)))
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 (((2 <= cAMP__42_41_) AND ((cAMP__13_35_ <= cAMP__10_33_) OR (1 <= cAMP__38_41_) OR ((cAMP__11_35_ <= cAMP__14_13_) AND (2 <= cAMP__8_12_))))))
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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N050-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 2460 markings, 8656 edges, 492 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__5_33_ <= cAMP__1_19_)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N050-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-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 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__26_13_ <= cAMP__5_39_)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N050-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__26_27_ + 1 <= cAMP__37_21_) AND (cAMP__9_36_ <= cAMP__9_28_))))
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-D50N050-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 2498 markings, 4056 edges, 500 markings/sec, 0 secs
lola: sara is running 5 secs || 4997 markings, 8142 edges, 500 markings/sec, 5 secs
lola: sara is running 10 secs || 7494 markings, 12603 edges, 499 markings/sec, 10 secs
lola: sara is running 15 secs || 9987 markings, 17090 edges, 499 markings/sec, 15 secs
lola: sara is running 20 secs || 12482 markings, 21366 edges, 499 markings/sec, 20 secs
lola: sara is running 25 secs || 14987 markings, 25887 edges, 501 markings/sec, 25 secs
lola: sara is running 30 secs || 17497 markings, 30189 edges, 502 markings/sec, 30 secs
lola: sara is running 35 secs || 20021 markings, 34302 edges, 505 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 22523 markings, 38586 edges, 500 markings/sec, 40 secs
lola: sara is running 45 secs || 25030 markings, 42671 edges, 501 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 4 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__7_22_ <= cAMP__15_26_) AND (cAMP__39_13_ <= cAMP__14_34_) AND (cAMP__2_44_ <= 2) AND (((cAMP__27_3_ <= cAMP__39_39_) AND (cAMP__6_47_ <= cAMP__49_19_)) OR (cAMP__32_41_ <= cAMP__28_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 (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 5 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N050-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__37_12_) OR ((cAMP__33_5_ <= 2) AND (cAMP__23_13_ + 1 <= cAMP__3_34_)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
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-D50N050-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 2496 markings, 8676 edges, 499 markings/sec, 0 secs
lola: sara is running 5 secs || 4984 markings, 17812 edges, 498 markings/sec, 5 secs
lola: sara is running 10 secs || 7465 markings, 27339 edges, 496 markings/sec, 10 secs
lola: sara is running 15 secs || 9956 markings, 36317 edges, 498 markings/sec, 15 secs
lola: sara is running 20 secs || 12435 markings, 45619 edges, 496 markings/sec, 20 secs
lola: sara is running 25 secs || 14909 markings, 55090 edges, 495 markings/sec, 25 secs
lola: sara is running 30 secs || 17381 markings, 63757 edges, 494 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 35 secs || 19843 markings, 73132 edges, 492 markings/sec, 35 secs
lola: sara is running 40 secs || 22311 markings, 82360 edges, 494 markings/sec, 40 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 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__5_2_) AND (3 <= cAMP__44_40_) AND ((cAMP__44_18_ <= cAMP__38_1_) OR (1 <= cAMP__8_19_)) AND ((1 <= cAMP__12_34_) OR (1 <= cAMP__28_37_) OR ((3 <= cAMP__13_42_) AND (1 <= cAMP__36_20_))))))
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 26 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N050-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 2477 markings, 8207 edges, 495 markings/sec, 0 secs
lola: sara is running 5 secs || 4969 markings, 16918 edges, 498 markings/sec, 5 secs
lola: sara is running 10 secs || 7481 markings, 25729 edges, 502 markings/sec, 10 secs
lola: sara is running 15 secs || 10007 markings, 34542 edges, 505 markings/sec, 15 secs
lola: sara is running 20 secs || 12520 markings, 43350 edges, 503 markings/sec, 20 secs
lola: sara is running 25 secs || 15048 markings, 52130 edges, 506 markings/sec, 25 secs
lola: sara is running 30 secs || 17531 markings, 61185 edges, 497 markings/sec, 30 secs
lola: sara is running 35 secs || 19970 markings, 70455 edges, 488 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 22412 markings, 79313 edges, 488 markings/sec, 40 secs
lola: sara is running 45 secs || 24880 markings, 88245 edges, 494 markings/sec, 45 secs
lola: sara is running 50 secs || 27347 markings, 97044 edges, 493 markings/sec, 50 secs
lola: sara is running 55 secs || 29788 markings, 105818 edges, 488 markings/sec, 55 secs

lola: sara is running 60 secs || 32240 markings, 114478 edges, 490 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__10_23_ + 1 <= cAMP__22_3_) OR ((cAMP__9_38_ + 1 <= cAMP__8_10_) AND (cAMP__19_41_ <= 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 (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-D50N050-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-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 420 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__44_42_ + 1 <= cAMP__6_44_)))
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-D50N050-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 2462 markings, 8693 edges, 492 markings/sec, 0 secs
lola: sara is running 5 secs || 4926 markings, 16718 edges, 493 markings/sec, 5 secs
lola: sara is running 10 secs || 7384 markings, 25016 edges, 492 markings/sec, 10 secs
lola: sara is running 15 secs || 9838 markings, 32961 edges, 491 markings/sec, 15 secs
lola: sara is running 20 secs || 12290 markings, 41765 edges, 490 markings/sec, 20 secs
lola: sara is running 25 secs || 14755 markings, 50104 edges, 493 markings/sec, 25 secs
lola: sara is running 30 secs || 17214 markings, 58532 edges, 492 markings/sec, 30 secs
lola: sara is running 35 secs || 19657 markings, 67383 edges, 489 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 22110 markings, 75554 edges, 491 markings/sec, 40 secs

lola: sara is running 45 secs || 24555 markings, 84532 edges, 489 markings/sec, 45 secs
lola: sara is running 50 secs || 27023 markings, 92820 edges, 494 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 9 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__42_50_ <= 0) OR (cAMP__25_8_ <= cAMP__47_31_))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N050-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= cAMP__24_3_) OR (cAMP__45_9_ <= cAMP__12_33_))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N050-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 2465 markings, 8819 edges, 493 markings/sec, 0 secs
lola: sara is running 5 secs || 4933 markings, 17145 edges, 494 markings/sec, 5 secs
lola: sara is running 10 secs || 7398 markings, 26091 edges, 493 markings/sec, 10 secs
lola: sara is running 15 secs || 9860 markings, 35240 edges, 492 markings/sec, 15 secs
lola: sara is running 20 secs || 12337 markings, 44506 edges, 495 markings/sec, 20 secs
lola: sara is running 25 secs || 14811 markings, 53281 edges, 495 markings/sec, 25 secs
lola: sara is running 30 secs || 17268 markings, 62414 edges, 491 markings/sec, 30 secs
lola: sara is running 35 secs || 19737 markings, 71112 edges, 494 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 22193 markings, 79636 edges, 491 markings/sec, 40 secs

lola: sara is running 45 secs || 24637 markings, 88192 edges, 489 markings/sec, 45 secs
lola: sara is running 50 secs || 27096 markings, 96889 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 11 will run for 650 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__50_29_ + 1 <= cAMP__44_14_) AND (cAMP__47_12_ + 1 <= cAMP__6_43_) AND (2 <= cAMP__8_46_))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N050-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 2447 markings, 8680 edges, 489 markings/sec, 0 secs
lola: sara is running 5 secs || 4891 markings, 16892 edges, 489 markings/sec, 5 secs
lola: sara is running 10 secs || 7330 markings, 25139 edges, 488 markings/sec, 10 secs
lola: sara is running 15 secs || 9801 markings, 33945 edges, 494 markings/sec, 15 secs
lola: sara is running 20 secs || 12272 markings, 43007 edges, 494 markings/sec, 20 secs
lola: sara is running 25 secs || 14725 markings, 51701 edges, 491 markings/sec, 25 secs
lola: sara is running 30 secs || 17155 markings, 60669 edges, 486 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 35 secs || 19608 markings, 69350 edges, 491 markings/sec, 35 secs
lola: sara is running 40 secs || 22092 markings, 78270 edges, 497 markings/sec, 40 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 801 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__43_1_ <= cAMP__5_35_)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N050-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 2462 markings, 8724 edges, 492 markings/sec, 0 secs
lola: sara is running 5 secs || 4911 markings, 17397 edges, 490 markings/sec, 5 secs
lola: sara is running 10 secs || 7378 markings, 25905 edges, 493 markings/sec, 10 secs
lola: sara is running 15 secs || 9853 markings, 34871 edges, 495 markings/sec, 15 secs
lola: sara is running 20 secs || 12333 markings, 43716 edges, 496 markings/sec, 20 secs
lola: sara is running 25 secs || 14811 markings, 52367 edges, 496 markings/sec, 25 secs
lola: sara is running 30 secs || 17297 markings, 61180 edges, 497 markings/sec, 30 secs
lola: sara is running 35 secs || 19798 markings, 69735 edges, 500 markings/sec, 35 secs
lola: sara is running 40 secs || 22311 markings, 79318 edges, 503 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 45 secs || 24801 markings, 87838 edges, 498 markings/sec, 45 secs
lola: sara is running 50 secs || 27309 markings, 97332 edges, 502 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 13 will run for 1049 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__4_24_ <= cAMP__43_47_)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N050-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1574 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__9_13_ <= 1) OR (cAMP__44_8_ <= 2)) AND (((2 <= cAMP__20_5_) AND (cAMP__29_12_ <= cAMP__16_31_)) OR (1 <= cAMP__46_44_)))))
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 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N050-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3149 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__47_11_ + 1 <= cAMP__14_36_)))
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-D50N050-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N050-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no yes yes yes yes no no yes no no yes yes
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N050-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496464419841

--------------------
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-D50N050"
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-D50N050.tgz
mv S_Diffusion2D-PT-D50N050 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-D50N050, 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-149488455900421"
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 ;