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-D05N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026kn-smll-146348010500066
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463510128923

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Diffusion2D-PT-D05N050
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-0 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-3 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-7 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-8 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D05N050-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D05N050-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: 169/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 144 transitions, 24 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D05N050-CTLCardinality.task
lola: read: AG ((EF (cAMP__3_1_ <= cAMP__3_2_) OR !((1 <= cAMP__1_5_ OR 2 <= cAMP__5_5_)))) : (EF (((3 <= cAMP__5_3_ AND 1 <= cAMP__1_5_) AND 2 <= cAMP__3_1_)) AND (!(!((1 <= cAMP__5_4_ OR 3 <= cAMP__2_4_))) OR cAMP__2_3_ <= cAMP__5_5_)) : E(((cAMP__2_5_ <= cAMP__3_3_ AND cAMP__1_2_ <= cAMP__5_1_) OR (cAMP__3_3_ <= cAMP__3_1_ OR 2 <= cAMP__3_1_)) U 2 <= cAMP__1_3_) : EF ((!(1 <= cAMP__4_1_) AND !((1 <= cAMP__... (shortened)
lola: formula length: 1732
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((EF (-cAMP__3_2_ + cAMP__3_1_ <= 0) OR (-cAMP__1_5_ > -1 AND -cAMP__5_5_ > -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((E(TRUE U -cAMP__3_2_ + cAMP__3_1_ <= 0) OR (-cAMP__1_5_ > -1 AND -cAMP__5_5_ > -2)))))
lola: processed formula length: 100
lola: 284 rewrites
lola: formula mentions 4 of 25 places; total mentions: 4
lola: closed formula file Diffusion2D-PT-D05N050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 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 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-cAMP__5_3_ <= -3 AND (-cAMP__1_5_ <= -1 AND -cAMP__3_1_ <= -2))) AND (-cAMP__5_4_ <= -1 OR (-cAMP__2_4_ <= -3 OR -cAMP__5_5_ + cAMP__2_3_ <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__5_3_ <= -3 AND (-cAMP__1_5_ <= -1 AND -cAMP__3_1_ <= -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 96 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 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-cAMP__5_4_ <= -1 OR (-cAMP__2_4_ <= -3 OR -cAMP__5_5_ + cAMP__2_3_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file Diffusion2D-PT-D05N050-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(((cAMP__2_5_ + -cAMP__3_3_ <= 0 AND -cAMP__5_1_ + cAMP__1_2_ <= 0) OR (cAMP__3_3_ + -cAMP__3_1_ <= 0 OR -cAMP__3_1_ <= -2)) U -cAMP__1_3_ <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((cAMP__2_5_ + -cAMP__3_3_ <= 0 AND -cAMP__5_1_ + cAMP__1_2_ <= 0) OR (cAMP__3_3_ + -cAMP__3_1_ <= 0 OR -cAMP__3_1_ <= -2)) U -cAMP__1_3_ <= -2)
lola: processed formula length: 146
lola: 283 rewrites
lola: formula mentions 6 of 25 places; total mentions: 8
lola: closed formula file Diffusion2D-PT-D05N050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 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 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__4_1_ > -1 AND (-cAMP__2_2_ > -1 AND -cAMP__4_4_ + cAMP__4_1_ > 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 96 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-cAMP__4_5_ + cAMP__3_4_ > 0 AND (-cAMP__1_4_ + cAMP__3_1_ <= 0 AND -cAMP__1_4_ + cAMP__3_3_ <= 0))) OR -cAMP__5_3_ + cAMP__3_1_ > 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__4_5_ + cAMP__3_4_ > 0 AND (-cAMP__1_4_ + cAMP__3_1_ <= 0 AND -cAMP__1_4_ + cAMP__3_3_ <= 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 96 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-cAMP__3_3_ <= -2 OR -cAMP__5_5_ + cAMP__2_1_ > 0) U -cAMP__1_4_ <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-cAMP__3_3_ <= -2 OR -cAMP__5_5_ + cAMP__2_1_ > 0) U -cAMP__1_4_ <= -3)
lola: processed formula length: 74
lola: 283 rewrites
lola: formula mentions 4 of 25 places; total mentions: 4
lola: closed formula file Diffusion2D-PT-D05N050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 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 6 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A(cAMP__4_1_ + -cAMP__1_4_ > 0 R -cAMP__5_5_ > -2) AND EX ((-cAMP__4_4_ + cAMP__5_4_ > 0 OR -cAMP__2_2_ > -3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(cAMP__4_1_ + -cAMP__1_4_ > 0 R -cAMP__5_5_ > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(cAMP__4_1_ + -cAMP__1_4_ > 0) U !(-cAMP__5_5_ > -2)))
lola: processed formula length: 59
lola: 283 rewrites
lola: formula mentions 3 of 25 places; total mentions: 3
lola: closed formula file Diffusion2D-PT-D05N050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((-cAMP__4_2_ + cAMP__3_4_ <= 0 AND cAMP__5_1_ + -cAMP__3_4_ <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !((-cAMP__4_2_ + cAMP__3_4_ <= 0 AND cAMP__5_1_ + -cAMP__3_4_ <= 0)))))
lola: processed formula length: 91
lola: 284 rewrites
lola: formula mentions 3 of 25 places; total mentions: 4
lola: closed formula file Diffusion2D-PT-D05N050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 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 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-cAMP__5_1_ + cAMP__3_3_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -cAMP__5_1_ + cAMP__3_3_ <= 0))))
lola: processed formula length: 55
lola: 284 rewrites
lola: formula mentions 2 of 25 places; total mentions: 2
lola: closed formula file Diffusion2D-PT-D05N050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 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 9 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-cAMP__4_5_ <= -2) OR (EF (-cAMP__3_3_ <= -1) AND -cAMP__5_3_ <= -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cAMP__4_5_ <= -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 96 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 10 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG ((-cAMP__1_2_ + cAMP__3_5_ <= 0 OR -cAMP__4_3_ + cAMP__1_4_ <= 0)) OR AG ((-cAMP__2_1_ + cAMP__3_2_ <= 0 AND cAMP__1_4_ + -cAMP__1_1_ <= 0))) AND EF ((cAMP__1_1_ + -cAMP__2_3_ > 0 AND cAMP__4_4_ + -cAMP__5_4_ <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cAMP__1_2_ + cAMP__3_5_ <= 0 OR -cAMP__4_3_ + cAMP__1_4_ <= 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 96 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 11 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cAMP__2_1_ + cAMP__3_2_ <= 0 AND cAMP__1_4_ + -cAMP__1_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 96 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 11 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-cAMP__3_5_ <= -3 OR -cAMP__1_3_ + cAMP__3_3_ <= 0)) OR (-cAMP__1_1_ <= -3 OR AF (-cAMP__2_2_ <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__3_5_ <= -3 OR -cAMP__1_3_ + cAMP__3_3_ <= 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 96 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 12 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-cAMP__5_3_ <= -3 OR -cAMP__4_3_ <= -3) AND (-cAMP__1_2_ + cAMP__3_3_ <= 0 AND -cAMP__5_4_ + cAMP__1_2_ <= 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 96 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 13 will run for 794 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-cAMP__2_3_ <= -1 AND (-cAMP__5_4_ > -3 OR -cAMP__2_5_ + cAMP__3_5_ > 0)) OR (EF ((-cAMP__3_5_ + cAMP__3_3_ <= 0 OR -cAMP__1_5_ <= -3)) OR AG ((-cAMP__3_3_ <= -2 OR (cAMP__4_3_ + -cAMP__1_2_ <= 0 AND -cAMP__5_2_ <= -1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 794 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-cAMP__2_3_ <= -1 AND (-cAMP__5_4_ > -3 OR -cAMP__2_5_ + cAMP__3_5_ > 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file Diffusion2D-PT-D05N050-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__3_5_ + cAMP__3_3_ <= 0 OR -cAMP__1_5_ <= -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 96 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cAMP__4_1_ > -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 96 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 15 will run for 2382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(-cAMP__5_4_ <= -1 U (-cAMP__1_1_ <= -2 OR -cAMP__4_3_ + cAMP__4_2_ <= 0)) AND EF (-cAMP__2_5_ <= -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-cAMP__5_4_ <= -1 U (-cAMP__1_1_ <= -2 OR -cAMP__4_3_ + cAMP__4_2_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-cAMP__5_4_ <= -1 U (-cAMP__1_1_ <= -2 OR -cAMP__4_3_ + cAMP__4_2_ <= 0))
lola: processed formula length: 75
lola: 283 rewrites
lola: formula mentions 4 of 25 places; total mentions: 4
lola: closed formula file Diffusion2D-PT-D05N050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 96 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: 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: RESULT
lola: summary: unknown yes yes unknown yes yes no unknown unknown yes no yes yes yes no unknown
lola: ========================================

BK_STOP 1463511286997

--------------------
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-D05N050"
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-D05N050.tgz
mv Diffusion2D-PT-D05N050 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-D05N050, 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-146348010500066"
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 ;