About the Execution of LoLa for SwimmingPool-PT-04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9138.350 | 2052933.00 | 2058492.00 | 3231.30 | F?F??FF?F?F??FTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...........
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is SwimmingPool-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122kn-qhx2-146373368100390
=====================================================================
--------------------
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-04-CTLCardinality-0
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-1
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-15
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-2
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-3
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-4
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-5
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-6
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-7
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-8
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463798552064
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ SwimmingPool-PT-04
FORMULA SwimmingPool-PT-04-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-04-CTLCardinality-1 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-04-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-04-CTLCardinality-3 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-04-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-04-CTLCardinality-5 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-04-CTLCardinality-6 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-04-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-04-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-04-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-04-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-04-CTLCardinality-11 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-04-CTLCardinality-12 CANNOT_COMPUTE
FORMULA SwimmingPool-PT-04-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-04-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SwimmingPool-PT-04-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: 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-04-CTLCardinality.task
lola: read: AG (3 <= Cabins) : EF (AG (!(Bags <= Dress))) : AG (!((Cabins <= InBath AND Dressed <= Dressed))) : (AF ((!(Cabins <= Undress) AND (Entered <= Entered AND 1 <= Undress))) AND EG ((InBath <= Entered OR !(InBath <= InBath)))) : AG (1 <= Out) : E(!(Bags <= Undress) U AG (3 <= Dress)) : (!(2 <= Dressed) AND (EG ((2 <= Entered OR WaitBag <= Out)) AND EF (!(WaitBag <= Cabins)))) : AG (A(Dress <= InBath ... (shortened)
lola: formula length: 934
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 (-Cabins <= -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 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (Bags + -Dress > 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 !(Bags + -Dress > 0))))
lola: processed formula length: 43
lola: 230 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-04-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 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Cabins + -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 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF ((Cabins + -Undress > 0 AND -Undress <= -1)) AND EG (-Entered + InBath <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((Cabins + -Undress > 0 AND -Undress <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (Cabins + -Undress > 0 AND -Undress <= -1))
lola: processed formula length: 52
lola: 229 rewrites
lola: formula mentions 2 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-04-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: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-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 5 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(Bags + -Undress > 0 U AG (-Dress <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(Bags + -Undress > 0 U !(E(TRUE U !(-Dress <= -3))))
lola: processed formula length: 53
lola: 230 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-04-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 6 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Dressed > -2 AND (EG ((-Entered <= -2 OR -Out + WaitBag <= 0)) AND EF (-Cabins + WaitBag > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Dressed > -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SwimmingPool-PT-04-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-Entered <= -2 OR -Out + WaitBag <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-Entered <= -2 OR -Out + WaitBag <= 0))))
lola: processed formula length: 55
lola: 229 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-04-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: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (A(Dress + -InBath <= 0 U -Out <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(Dress + -InBath <= 0 U -Out <= -1))))
lola: processed formula length: 52
lola: 230 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-04-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: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Cabins + -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 9 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((-InBath <= -2 OR -Bags <= -2)) AND (A(Dressed + -Entered <= 0 U -Dress <= -1) AND (Cabins + -Dress > 0 AND EX ((-Bags + Entered <= 0 OR -Out + WaitBag <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-InBath <= -2 OR -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: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(Dressed + -Entered <= 0 U -Dress <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(Dressed + -Entered <= 0 U -Dress <= -1)
lola: processed formula length: 41
lola: 229 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SwimmingPool-PT-04-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: subprocess 11 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: Cabins + -Dress > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SwimmingPool-PT-04-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 620 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((-Bags + Entered <= 0 OR -Out + WaitBag <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((-Bags + Entered <= 0 OR -Out + WaitBag <= 0))
lola: processed formula length: 49
lola: 229 rewrites
lola: formula mentions 4 of 9 places; total mentions: 4
lola: closed formula file SwimmingPool-PT-04-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Cabins + Dress <= 0 OR -Dress + 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 11 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-Undress <= -3))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -Undress <= -3))))
lola: processed formula length: 40
lola: 230 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SwimmingPool-PT-04-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 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-Dress <= -3))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -Dress <= -3))))
lola: processed formula length: 38
lola: 230 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SwimmingPool-PT-04-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 13 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (WaitBag + -InBath <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(WaitBag + -InBath <= 0)))
lola: processed formula length: 38
lola: 229 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-04-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: ========================================
lola: subprocess 14 will run for 744 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Dressed + Cabins <= 0 OR -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: ========================================
lola: subprocess 15 will run for 1488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (-Dress + Undress <= 0) OR (-Cabins > -3 OR -Dressed + Cabins <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-Dress + Undress <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-Dress + Undress <= 0)))
lola: processed formula length: 37
lola: 229 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SwimmingPool-PT-04-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: ========================================
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: no unknown no unknown no unknown unknown no yes yes no unknown unknown no no unknown
lola: ========================================
BK_STOP 1463800604997
--------------------
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-04"
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-04.tgz
mv SwimmingPool-PT-04 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-04, 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-146373368100390"
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 '
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 ;