Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
............................................
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is Diffusion2D-PT-D30N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026kn-smll-146348010700228
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463596971595

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Diffusion2D-PT-D30N100
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-1 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-7 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-14 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D30N100-CTLCardinality-15 CANNOT_COMPUTE
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: 7744/65536 symbol table entries, 1051 collisions
lola: preprocessing...
lola: finding significant places
lola: 900 places, 6844 transitions, 899 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 900 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D30N100-CTLCardinality.task
lola: read: (!(AG (!(3 <= cAMP__21_27_))) OR EG (((1 <= cAMP__20_25_ AND 1 <= cAMP__18_27_) AND cAMP__12_15_ <= cAMP__6_25_))) : EF (EG ((1 <= cAMP__28_9_ AND 2 <= cAMP__8_7_))) : AF (!(AG (cAMP__13_7_ <= cAMP__25_29_))) : EF ((EX (3 <= cAMP__25_3_) OR (2 <= cAMP__4_23_ OR (3 <= cAMP__29_10_ AND cAMP__2_17_ <= cAMP__2_13_)))) : ((((!(1 <= cAMP__12_3_) OR cAMP__16_2_ <= cAMP__10_10_) AND 2 <= cAMP__24_14_) AND... (shortened)
lola: formula length: 1776
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-cAMP__21_27_ <= -3) OR EG ((-cAMP__20_25_ <= -1 AND (-cAMP__18_27_ <= -1 AND cAMP__12_15_ + -cAMP__6_25_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cAMP__21_27_ <= -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG ((-cAMP__28_9_ <= -1 AND -cAMP__8_7_ <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !((-cAMP__28_9_ <= -1 AND -cAMP__8_7_ <= -2)))))
lola: processed formula length: 68
lola: 256 rewrites
lola: formula mentions 2 of 900 places; total mentions: 2
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF (cAMP__13_7_ + -cAMP__25_29_ > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U cAMP__13_7_ + -cAMP__25_29_ > 0))
lola: processed formula length: 51
lola: 256 rewrites
lola: formula mentions 2 of 900 places; total mentions: 2
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((EX (-cAMP__25_3_ <= -3) OR (-cAMP__4_23_ <= -2 OR (-cAMP__29_10_ <= -3 AND cAMP__2_17_ + -cAMP__2_13_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (EX(-cAMP__25_3_ <= -3) OR (-cAMP__4_23_ <= -2 OR (-cAMP__29_10_ <= -3 AND cAMP__2_17_ + -cAMP__2_13_ <= 0))))
lola: processed formula length: 119
lola: 256 rewrites
lola: formula mentions 5 of 900 places; total mentions: 5
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((-cAMP__12_3_ > -1 OR -cAMP__10_10_ + cAMP__16_2_ <= 0) AND (-cAMP__24_14_ <= -2 AND EG (-cAMP__6_28_ > -3))) OR (EX ((-cAMP__23_27_ + cAMP__5_20_ <= 0 OR -cAMP__11_20_ + cAMP__5_18_ <= 0)) AND (EX (-cAMP__27_6_ <= -1) OR AG (-cAMP__21_9_ + cAMP__21_1_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-cAMP__12_3_ > -1 OR -cAMP__10_10_ + cAMP__16_2_ <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -cAMP__24_14_ <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((-cAMP__23_27_ + cAMP__5_20_ <= 0 OR -cAMP__11_20_ + cAMP__5_18_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((-cAMP__23_27_ + cAMP__5_20_ <= 0 OR -cAMP__11_20_ + cAMP__5_18_ <= 0))
lola: processed formula length: 74
lola: 255 rewrites
lola: formula mentions 4 of 900 places; total mentions: 4
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-cAMP__27_6_ <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-cAMP__27_6_ <= -1)
lola: processed formula length: 22
lola: 255 rewrites
lola: formula mentions 1 of 900 places; total mentions: 1
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cAMP__21_9_ + cAMP__21_1_ <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((cAMP__28_14_ + -cAMP__7_4_ > 0 AND -cAMP__26_18_ + cAMP__6_25_ <= 0) OR AG (-cAMP__17_22_ > -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cAMP__28_14_ + -cAMP__7_4_ > 0 AND -cAMP__26_18_ + cAMP__6_25_ <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cAMP__17_22_ > -1)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((cAMP__1_10_ + -cAMP__6_19_ <= 0 AND -cAMP__3_12_ + cAMP__27_27_ > 0) U EF (-cAMP__22_25_ <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((cAMP__1_10_ + -cAMP__6_19_ <= 0 AND -cAMP__3_12_ + cAMP__27_27_ > 0) U E(TRUE U -cAMP__22_25_ <= -1))
lola: processed formula length: 104
lola: 256 rewrites
lola: formula mentions 5 of 900 places; total mentions: 5
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (A(cAMP__29_27_ + -cAMP__3_21_ <= 0 U -cAMP__12_7_ <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(cAMP__29_27_ + -cAMP__3_21_ <= 0 U -cAMP__12_7_ <= -2))
lola: processed formula length: 66
lola: 256 rewrites
lola: formula mentions 3 of 900 places; total mentions: 3
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((AG (-cAMP__30_15_ + cAMP__10_1_ <= 0) AND (-cAMP__30_11_ + cAMP__23_23_ > 0 AND (-cAMP__11_5_ <= -3 OR -cAMP__23_20_ + cAMP__27_9_ <= 0))) OR (((-cAMP__5_6_ <= -1 OR -cAMP__18_25_ <= -3) AND -cAMP__2_6_ > -1) OR EF (-cAMP__5_22_ <= -1))) AND AX ((cAMP__21_21_ + -cAMP__17_23_ <= 0 OR (-cAMP__17_3_ <= -1 OR -cAMP__30_21_ + cAMP__12_20_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cAMP__30_15_ + cAMP__10_1_ <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: subprocess 9 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-cAMP__5_6_ <= -1 OR -cAMP__18_25_ <= -3) AND -cAMP__2_6_ > -1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: ========================================
lola: processed formula with 3 atomic propositions
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cAMP__5_22_ <= -1)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((cAMP__21_21_ + -cAMP__17_23_ <= 0 OR (-cAMP__17_3_ <= -1 OR -cAMP__30_21_ + cAMP__12_20_ <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((cAMP__21_21_ + -cAMP__17_23_ <= 0 OR (-cAMP__17_3_ <= -1 OR -cAMP__30_21_ + cAMP__12_20_ <= 0)))
lola: processed formula length: 100
lola: 255 rewrites
lola: formula mentions 5 of 900 places; total mentions: 5
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AG ((cAMP__1_12_ + -cAMP__22_28_ <= 0 OR -cAMP__5_4_ <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(E(TRUE U !((cAMP__1_12_ + -cAMP__22_28_ <= 0 OR -cAMP__5_4_ <= -3)))))
lola: processed formula length: 75
lola: 256 rewrites
lola: formula mentions 3 of 900 places; total mentions: 3
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 464 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__17_23_ + cAMP__13_23_ > 0 AND (cAMP__1_25_ + -cAMP__1_4_ > 0 AND cAMP__7_19_ + -cAMP__27_30_ > 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((-cAMP__6_16_ + cAMP__22_1_ <= 0 AND (cAMP__18_1_ + -cAMP__5_29_ <= 0 AND (cAMP__21_17_ + -cAMP__11_6_ <= 0 OR -cAMP__14_4_ <= -3))) OR AG (-cAMP__11_17_ <= -1)) AND AG (cAMP__13_4_ + -cAMP__11_8_ <= 0)) OR -cAMP__23_7_ <= -1)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-cAMP__6_16_ + cAMP__22_1_ <= 0 AND (cAMP__18_1_ + -cAMP__5_29_ <= 0 AND (cAMP__21_17_ + -cAMP__11_6_ <= 0 OR -cAMP__14_4_ <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 4 atomic propositions
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 696 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (cAMP__13_4_ + -cAMP__11_8_ <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 928 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -cAMP__23_7_ <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 696 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cAMP__21_15_ + cAMP__21_6_ <= 0 OR -cAMP__15_18_ <= -3))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 928 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-cAMP__9_7_ <= -2) AND E(-cAMP__6_1_ <= -1 U (-cAMP__21_20_ + cAMP__2_4_ <= 0 AND -cAMP__3_13_ + cAMP__24_23_ <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 928 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cAMP__9_7_ <= -2)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-cAMP__6_1_ <= -1 U (-cAMP__21_20_ + cAMP__2_4_ <= 0 AND -cAMP__3_13_ + cAMP__24_23_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-cAMP__6_1_ <= -1 U (-cAMP__21_20_ + cAMP__2_4_ <= 0 AND -cAMP__3_13_ + cAMP__24_23_ <= 0))
lola: processed formula length: 93
lola: 255 rewrites
lola: formula mentions 5 of 900 places; total mentions: 5
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-cAMP__29_22_ <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -cAMP__29_22_ <= -1))))
lola: processed formula length: 45
lola: 256 rewrites
lola: formula mentions 1 of 900 places; total mentions: 1
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cAMP__4_14_ + -cAMP__15_22_ <= 0 AND EF (AX (-cAMP__27_26_ <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: cAMP__4_14_ + -cAMP__15_22_ <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Diffusion2D-PT-D30N100-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola: summary: yes unknown yes yes no no yes unknown yes no yes no no yes unknown unknown

BK_STOP 1463598433592

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D30N100"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N100.tgz
mv Diffusion2D-PT-D30N100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is Diffusion2D-PT-D30N100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026kn-smll-146348010700228"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;