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 SwimmingPool-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122kn-qhx2-146373368200408
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463802225460

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ SwimmingPool-PT-06
FORMULA SwimmingPool-PT-06-CTLCardinality-0 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-06-CTLCardinality-1 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-06-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-11 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-06-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-06-CTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-06-CTLCardinality.task
lola: read: E(EX (3 <= Dress) U AG (3 <= Bags)) : EF ((AF (Bags <= Entered) AND !(3 <= Dress))) : !(!(((InBath <= Dressed AND Undress <= Dress) AND AG (1 <= Cabins)))) : ((!(AG (1 <= Bags)) OR (AX (1 <= Dress) AND ((Undress <= InBath OR 3 <= Out) OR (Dress <= WaitBag OR 3 <= Dressed)))) OR (1 <= Entered AND A(InBath <= Dressed U 3 <= Entered))) : (EX (!((1 <= Bags OR Undress <= WaitBag))) OR (!(EX (1 <= Dress... (shortened)
lola: formula length: 1061
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EX (-Dress <= -3) U AG (-Bags <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX(-Dress <= -3) U !(E(TRUE U !(-Bags <= -3))))
lola: processed formula length: 49
lola: 260 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 ((AF (Bags + -Entered <= 0) AND -Dress > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (A(TRUE U Bags + -Entered <= 0) AND -Dress > -3))
lola: processed formula length: 58
lola: 259 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Dressed + InBath <= 0 AND (-Dress + Undress <= 0 AND AG (-Cabins <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Dressed + InBath <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Dress + Undress <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Cabins <= -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 24 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 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-Bags > -1) OR ((AX (-Dress <= -1) AND (-InBath + Undress <= 0 OR (-Out <= -3 OR (-WaitBag + Dress <= 0 OR -Dressed <= -3)))) OR (-Entered <= -1 AND A(-Dressed + InBath <= 0 U -Entered <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Bags > -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 24 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 4 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX ((-Bags > -1 AND -WaitBag + Undress > 0)) OR (AX (-Dress > -1) AND (AG (-Bags <= -2) OR (-Cabins + WaitBag > 0 AND -Dressed + Entered > 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((-Bags > -1 AND -WaitBag + Undress > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((-Bags > -1 AND -WaitBag + Undress > 0))
lola: processed formula length: 43
lola: 258 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 5 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-Dress > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-Dress > -1)
lola: processed formula length: 15
lola: 258 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 6 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Bags <= -2)
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 24 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 7 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Cabins + WaitBag > 0 AND -Dressed + Entered > 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file SwimmingPool-PT-06-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 5 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Out + Undress <= 0 OR -Out <= -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 24 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 6 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Cabins <= -2)
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 24 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 7 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Out + Entered > 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 24 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 8 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Cabins + Undress > 0 OR (Cabins + -Undress > 0 AND -Bags > -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 24 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 9 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-WaitBag <= -1) OR -Out + Undress > 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-WaitBag <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -WaitBag <= -1)
lola: processed formula length: 24
lola: 258 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-Cabins > -1) AND -Entered > -2)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Cabins > -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 24 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 619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Entered > -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SwimmingPool-PT-06-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 11 will run for 619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((Cabins + -Entered > 0 OR (-Out <= -3 OR EG (Dressed + -Bags <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((Cabins + -Entered > 0 OR (-Out <= -3 OR !(A(TRUE U !(Dressed + -Bags <= 0))))))))
lola: processed formula length: 95
lola: 259 rewrites
lola: formula mentions 5 of 9 places; total mentions: 5
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 12 will run for 619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (-WaitBag <= -3) OR (AG ((-Dressed <= -3 OR -Out + InBath <= 0)) OR -Out > -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-WaitBag <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-WaitBag <= -3)
lola: processed formula length: 18
lola: 258 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 13 will run for 825 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Dressed <= -3 OR -Out + InBath <= 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 24 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 14 will run for 1238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Out > -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SwimmingPool-PT-06-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 13 will run for 825 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-InBath > -3 OR (-Dress > -1 OR ((-Entered > -2 AND Dressed + -Undress > 0) OR EX (-Dress > -1)))) AND EG ((-Dress > -2 AND -Dress > -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 825 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -InBath > -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-Dress > -2 AND -Dress > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-Dress > -2 AND -Dress > -1))))
lola: processed formula length: 45
lola: 258 rewrites
lola: formula mentions 1 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file SwimmingPool-PT-06-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Bags <= -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 24 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: RESULT
lola: summary: unknown unknown no yes no no no yes yes yes yes unknown no no no no
lola: ========================================

BK_STOP 1463803347831

--------------------
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="SwimmingPool-PT-06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/fko/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/SwimmingPool-PT-06.tgz
mv SwimmingPool-PT-06 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 SwimmingPool-PT-06, 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 r122kn-qhx2-146373368200408"
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 ;