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 FMS-PT-200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050kn-smll-146358762600111
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463608894883

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ FMS-PT-200
FORMULA FMS-PT-200-CTLCardinality-0 CANNOT_COMPUTE
FORMULA FMS-PT-200-CTLCardinality-1 CANNOT_COMPUTE
FORMULA FMS-PT-200-CTLCardinality-2 CANNOT_COMPUTE
FORMULA FMS-PT-200-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-200-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-200-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-200-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-200-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-200-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-200-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-200-CTLCardinality-10 CANNOT_COMPUTE
FORMULA FMS-PT-200-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-200-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-200-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-200-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA FMS-PT-200-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: 42/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from FMS-PT-200-CTLCardinality.task
lola: read: EF (AX ((1 <= M1 AND 1 <= P2M2))) : AG (E(P2s <= P2s U 2 <= M1)) : EF (AG (2 <= P3s)) : !(EF (2 <= P12wM3)) : (A((2 <= M1 AND P1wM1 <= P2M2) U !(P3s <= P2)) OR AG ((2 <= P1 OR (M2 <= P2 OR 3 <= P12s)))) : !(E((3 <= P2wM2 OR P1wP2 <= P1s) U (P2 <= P2M2 AND P3s <= P2M2))) : AG (!(!((P12wM3 <= P2wM2 OR 3 <= P3M2)))) : !((AG (!(2 <= M2)) OR E(P12s <= P12M3 U P2 <= P3M2))) : (AG (AG (P12 <= P3M2)) OR !... (shortened)
lola: formula length: 800
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 (AX ((-M1 <= -1 AND -P2M2 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((-M1 <= -1 AND -P2M2 <= -1)))
lola: processed formula length: 41
lola: 234 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-M1 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -M1 <= -2))))
lola: processed formula length: 35
lola: 234 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-P3s <= -2))
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 !(-P3s <= -2))))
lola: processed formula length: 36
lola: 234 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 3 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P12wM3 > -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 64 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 4 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A((-M1 <= -2 AND -P2M2 + P1wM1 <= 0) U P3s + -P2 > 0) OR AG ((-P1 <= -2 OR (-P2 + M2 <= 0 OR -P12s <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-M1 <= -2 AND -P2M2 + P1wM1 <= 0) U P3s + -P2 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-M1 <= -2 AND -P2M2 + P1wM1 <= 0) U P3s + -P2 > 0)
lola: processed formula length: 53
lola: 233 rewrites
lola: formula mentions 5 of 22 places; total mentions: 5
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 5 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P1 <= -2 OR (-P2 + M2 <= 0 OR -P12s <= -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 64 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 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-P2wM2 > -3 AND P1wP2 + -P1s > 0) R (-P2M2 + P2 > 0 OR P3s + -P2M2 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!((-P2wM2 > -3 AND P1wP2 + -P1s > 0)) U !((-P2M2 + P2 > 0 OR P3s + -P2M2 > 0))))
lola: processed formula length: 84
lola: 233 rewrites
lola: formula mentions 6 of 22 places; total mentions: 7
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 6 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P2wM2 + P12wM3 <= 0 OR -P3M2 <= -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 64 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 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-M2 <= -2) AND A(-P12M3 + P12s > 0 R -P3M2 + P2 > 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-M2 <= -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 64 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: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-P12M3 + P12s > 0 R -P3M2 + P2 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(-P12M3 + P12s > 0) U !(-P3M2 + P2 > 0)))
lola: processed formula length: 46
lola: 233 rewrites
lola: formula mentions 4 of 22 places; total mentions: 4
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 8 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (P12 + -P3M2 <= 0) OR (-P3 <= -2 AND (-P2wM2 + M3 <= 0 AND (-P2wP1 <= -2 OR P3 + -P2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (P12 + -P3M2 <= 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 64 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 9 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-P3 <= -2 AND (-P2wM2 + M3 <= 0 AND (-P2wP1 <= -2 OR P3 + -P2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 4 atomic propositions
lola: closed formula file FMS-PT-200-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 9 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AX ((P1wP2 + -P1d <= 0 OR P2s + -P3M2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(AX((P1wP2 + -P1d <= 0 OR P2s + -P3M2 <= 0)))))
lola: processed formula length: 59
lola: 234 rewrites
lola: formula mentions 4 of 22 places; total mentions: 4
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((-P2M2 + P2wP1 <= 0 OR -P2wM2 <= -1)))
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 !((-P2M2 + P2wP1 <= 0 OR -P2wM2 <= -1)))))
lola: processed formula length: 62
lola: 234 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 11 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P1s > -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 64 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 12 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (-P1wM1 <= -3) OR AG ((P2M2 + -P1 <= 0 OR (-P3 <= -1 AND -P12 + P1wM1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-P1wM1 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-P1wM1 <= -3)))
lola: processed formula length: 28
lola: 233 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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 13 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P2M2 + -P1 <= 0 OR (-P3 <= -1 AND -P12 + P1wM1 <= 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 64 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 13 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (M3 + -M2 <= 0) OR -P3M2 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (M3 + -M2 <= 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 64 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 1132 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((-P2s + P2d <= 0 OR -P3s <= -1) AND EF ((-P12s <= -2 AND -P2M2 + P1 <= 0))) OR A(P1wP2 + -P1 > 0 R -P2 + P1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1132 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-P2s + P2d <= 0 OR -P3s <= -1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P12s <= -2 AND -P2M2 + P1 <= 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 64 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 15 will run for 2264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-P2wP1 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -P2wP1 <= -3))))
lola: processed formula length: 38
lola: 234 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 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: RESULT
lola: summary: unknown unknown unknown no no no no no no no unknown no no yes yes unknown

BK_STOP 1463610482612

--------------------
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="FMS-PT-200"
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/FMS-PT-200.tgz
mv FMS-PT-200 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 FMS-PT-200, 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 r050kn-smll-146358762600111"
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 ;