fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LoLA for S_Diffusion2D-PT-D50N010

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
338.060 238712.00 475952.00 62.60 TFTTFTTTFTFFTTTT 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-D50N010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455900412
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496463525304


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


checking for too many tokens
===========================================================================================
S_Diffusion2D-PT-D50N010: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_Diffusion2D-PT-D50N010 @ 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-D50N010-ReachabilityCardinality.task
lola: E (F ((1 <= cAMP__24_31_))) : A (G (((cAMP__5_20_ + 1 <= cAMP__2_44_) OR (cAMP__22_16_ <= 1) OR (cAMP__18_16_ <= 1)))) : A (G ((cAMP__1_14_ <= 2))) : E (F ((cAMP__32_23_ + 1 <= cAMP__34_22_))) : A (G (((1 <= cAMP__22_14_) OR (cAMP__28_11_ <= cAMP__13_15_)))) : A (G (((cAMP__21_11_ <= 2) OR (cAMP__23_7_ + 1 <= cAMP__29_7_) OR (2 <= cAMP__12_6_)))) : E (F (((2 <= cAMP__34_43_) OR ((cAMP__14_40_ <= 0) AND ((3 <= cAMP__32_43_) OR (1 <= cAMP__34_28_)))))) : E (F (((cAMP__48_19_ + 1 <= cAMP__36_47_) AND (cAMP__14_48_ + 1 <= cAMP__45_14_) AND ((cAMP__5_24_ + 1 <= cAMP__39_49_) OR (cAMP__27_26_ + 1 <= cAMP__44_26_))))) : E (F (((2 <= cAMP__8_10_) OR (2 <= cAMP__17_21_)))) : E (F ((((cAMP__15_8_ + 1 <= cAMP__23_36_) AND ((2 <= cAMP__7_21_) OR (cAMP__9_49_ <= cAMP__26_7_))) OR ((3 <= cAMP__15_28_) AND (1 <= cAMP__22_42_) AND (cAMP__28_34_ + 1 <= cAMP__31_43_))))) : E (F (((cAMP__49_8_ + 1 <= cAMP__23_48_) AND ((cAMP__25_5_ + 1 <= cAMP__17_34_) OR (cAMP__8_42_ <= 1))))) : E (F ((2 <= cAMP__38_20_))) : A (G (((cAMP__25_7_ + 1 <= cAMP__35_10_) OR (cAMP__13_10_ <= 0) OR (3 <= cAMP__50_27_)))) : E (F (((1 <= cAMP__14_38_) OR (1 <= cAMP__17_9_)))) : E (F ((((cAMP__11_26_ + 1 <= cAMP__40_32_) AND (cAMP__16_8_ + 1 <= cAMP__36_6_)) OR (cAMP__43_23_ + 1 <= cAMP__14_2_)))) : E (F (((3 <= cAMP__49_30_) AND (cAMP__18_50_ + 1 <= cAMP__4_27_) AND (cAMP__13_33_ <= cAMP__49_20_))))
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 ((1 <= cAMP__24_31_)))
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-D50N010-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality.sara.
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_20_ + 1 <= cAMP__2_44_) OR (cAMP__22_16_ <= 1) OR (cAMP__18_16_ <= 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-D50N010-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 2426 markings, 8180 edges, 485 markings/sec, 0 secs
lola: sara is running 5 secs || 4890 markings, 17062 edges, 493 markings/sec, 5 secs
lola: sara is running 10 secs || 7306 markings, 25472 edges, 483 markings/sec, 10 secs
lola: sara is running 15 secs || 9752 markings, 33906 edges, 489 markings/sec, 15 secs
lola: sara is running 20 secs || 12210 markings, 41904 edges, 492 markings/sec, 20 secs
lola: sara is running 25 secs || 14661 markings, 50596 edges, 490 markings/sec, 25 secs
lola: sara is running 30 secs || 17108 markings, 58896 edges, 489 markings/sec, 30 secs
lola: sara is running 35 secs || 19539 markings, 67243 edges, 486 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 21995 markings, 76196 edges, 491 markings/sec, 40 secs

lola: sara is running 45 secs || 24472 markings, 84891 edges, 495 markings/sec, 45 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 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__1_14_ <= 2)))
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-D50N010-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 2473 markings, 8851 edges, 495 markings/sec, 0 secs
lola: sara is running 5 secs || 4966 markings, 17240 edges, 499 markings/sec, 5 secs
lola: sara is running 10 secs || 7455 markings, 26050 edges, 498 markings/sec, 10 secs
lola: sara is running 15 secs || 9937 markings, 35213 edges, 496 markings/sec, 15 secs
lola: sara is running 20 secs || 12431 markings, 44014 edges, 499 markings/sec, 20 secs
lola: sara is running 25 secs || 14900 markings, 52499 edges, 494 markings/sec, 25 secs
lola: sara is running 30 secs || 17401 markings, 61302 edges, 500 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 35 secs || 19888 markings, 69861 edges, 497 markings/sec, 35 secs
lola: sara is running 40 secs || 22383 markings, 78458 edges, 499 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 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__32_23_ + 1 <= cAMP__34_22_)))
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-D50N010-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= cAMP__22_14_) OR (cAMP__28_11_ <= cAMP__13_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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__21_11_ <= 2) OR (cAMP__23_7_ + 1 <= cAMP__29_7_) OR (2 <= cAMP__12_6_))))
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-D50N010-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 2481 markings, 9063 edges, 496 markings/sec, 0 secs
lola: sara is running 5 secs || 4962 markings, 17882 edges, 496 markings/sec, 5 secs
lola: sara is running 10 secs || 7434 markings, 27379 edges, 494 markings/sec, 10 secs
lola: sara is running 15 secs || 9916 markings, 36436 edges, 496 markings/sec, 15 secs
lola: sara is running 20 secs || 12382 markings, 45867 edges, 493 markings/sec, 20 secs
lola: sara is running 25 secs || 14858 markings, 54928 edges, 495 markings/sec, 25 secs
lola: sara is running 30 secs || 17333 markings, 64388 edges, 495 markings/sec, 30 secs
lola: sara is running 35 secs || 19812 markings, 73502 edges, 496 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 22278 markings, 82838 edges, 493 markings/sec, 40 secs
lola: sara is running 45 secs || 24712 markings, 91852 edges, 487 markings/sec, 45 secs
lola: sara is running 50 secs || 27178 markings, 101163 edges, 493 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 6 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__34_43_) OR ((cAMP__14_40_ <= 0) AND ((3 <= cAMP__32_43_) OR (1 <= cAMP__34_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 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__48_19_ + 1 <= cAMP__36_47_) AND (cAMP__14_48_ + 1 <= cAMP__45_14_) AND ((cAMP__5_24_ + 1 <= cAMP__39_49_) OR (cAMP__27_26_ + 1 <= cAMP__44_26_)))))
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-D50N010-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 2479 markings, 5066 edges, 496 markings/sec, 0 secs
lola: sara is running 5 secs || 4971 markings, 10150 edges, 498 markings/sec, 5 secs
lola: sara is running 10 secs || 7464 markings, 14928 edges, 499 markings/sec, 10 secs
lola: sara is running 15 secs || 9963 markings, 19816 edges, 500 markings/sec, 15 secs
lola: sara is running 20 secs || 12453 markings, 24704 edges, 498 markings/sec, 20 secs
lola: sara is running 25 secs || 14938 markings, 29719 edges, 497 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 17416 markings, 35202 edges, 496 markings/sec, 30 secs

lola: sara is running 35 secs || 19890 markings, 40617 edges, 495 markings/sec, 35 secs
lola: sara is running 40 secs || 22368 markings, 46121 edges, 496 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 8 will run for 416 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__8_10_) OR (2 <= cAMP__17_21_))))
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 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__15_8_ + 1 <= cAMP__23_36_) AND ((2 <= cAMP__7_21_) OR (cAMP__9_49_ <= cAMP__26_7_))) OR ((3 <= cAMP__15_28_) AND (1 <= cAMP__22_42_) AND (cAMP__28_34_ + 1 <= cAMP__31_43_)))))
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-D50N010-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 555 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__49_8_ + 1 <= cAMP__23_48_) AND ((cAMP__25_5_ + 1 <= cAMP__17_34_) OR (cAMP__8_42_ <= 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 666 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= cAMP__38_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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 12 will run for 832 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__25_7_ + 1 <= cAMP__35_10_) OR (cAMP__13_10_ <= 0) OR (3 <= cAMP__50_27_))))
lola: ========================================
lola: SUBTASK
lola: 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-D50N010-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1109 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= cAMP__14_38_) OR (1 <= cAMP__17_9_))))
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 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1664 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__11_26_ + 1 <= cAMP__40_32_) AND (cAMP__16_8_ + 1 <= cAMP__36_6_)) OR (cAMP__43_23_ + 1 <= cAMP__14_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-D50N010-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-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 3326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__49_30_) AND (cAMP__18_50_ + 1 <= cAMP__4_27_) AND (cAMP__13_33_ <= cAMP__49_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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N010-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 2462 markings, 9137 edges, 492 markings/sec, 0 secs
lola: sara is running 5 secs || 4911 markings, 18091 edges, 490 markings/sec, 5 secs
lola: sara is running 10 secs || 7375 markings, 26461 edges, 493 markings/sec, 10 secs
lola: sara is running 15 secs || 9851 markings, 34731 edges, 495 markings/sec, 15 secs
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 no yes yes yes yes yes yes no yes yes yes
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496463764016

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