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 Parking-PT-208, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363811000201
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463681631254

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Parking-PT-208
FORMULA Parking-PT-208-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-1 CANNOT_COMPUTE
FORMULA Parking-PT-208-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-8 CANNOT_COMPUTE
FORMULA Parking-PT-208-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Parking-PT-208-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: 338/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 137 places, 201 transitions, 103 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 132 transition conflict sets
lola: TASK
lola: reading formula from Parking-PT-208-CTLCardinality.task
lola: read: !((((p7 <= p30 AND (1 <= p86 OR 3 <= p19)) AND EG (3 <= p13)) OR (EG (p52 <= p128) OR AF (2 <= p47)))) : AX (!(EF (3 <= p123))) : !(AG (!(3 <= p4))) : EF (3 <= p100) : (!(EG (p8 <= p2)) OR EX (((2 <= p105 AND p29 <= p113) AND 3 <= p122))) : !(AF ((!(3 <= p21) AND (2 <= p26 OR 1 <= p3)))) : AF (EG (!(p105 <= p15))) : !((EX ((1 <= p56 AND 1 <= p92)) OR !(EF (1 <= p120)))) : (((EG (1 <= p94) AND (!(1... (shortened)
lola: formula length: 898
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-p30 + p7 > 0 OR ((-p86 > -1 AND -p19 > -3) OR AF (-p13 > -3))) AND (AF (p52 + -p128 > 0) AND EG (-p47 > -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p30 + p7 > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-p86 > -1 AND -p19 > -3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (p52 + -p128 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U p52 + -p128 > 0)
lola: processed formula length: 25
lola: 242 rewrites
lola: formula mentions 2 of 137 places; total mentions: 2
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-p47 > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-p47 > -2)))
lola: processed formula length: 25
lola: 242 rewrites
lola: formula mentions 1 of 137 places; total mentions: 1
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AG (-p123 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(E(TRUE U !(-p123 > -3))))
lola: processed formula length: 30
lola: 243 rewrites
lola: formula mentions 1 of 137 places; total mentions: 1
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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: 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: EF (-p4 <= -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 412 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 unreachable.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p100 <= -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 412 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 unreachable.
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-p2 + p8 > 0) OR EX ((-p105 <= -2 AND (p29 + -p113 <= 0 AND -p122 <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-p2 + p8 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -p2 + p8 > 0)
lola: processed formula length: 22
lola: 242 rewrites
lola: formula mentions 2 of 137 places; total mentions: 2
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((-p105 <= -2 AND (p29 + -p113 <= 0 AND -p122 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((-p105 <= -2 AND (p29 + -p113 <= 0 AND -p122 <= -3)))
lola: processed formula length: 56
lola: 242 rewrites
lola: formula mentions 4 of 137 places; total mentions: 4
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-p21 <= -3 OR (-p26 > -2 AND -p3 > -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-p21 <= -3 OR (-p26 > -2 AND -p3 > -1)))))
lola: processed formula length: 56
lola: 242 rewrites
lola: formula mentions 3 of 137 places; total mentions: 3
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG (-p15 + p105 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !(-p15 + p105 > 0))))
lola: processed formula length: 41
lola: 243 rewrites
lola: formula mentions 2 of 137 places; total mentions: 2
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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 7 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX ((-p56 > -1 OR -p92 > -1)) AND EF (-p120 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-p56 > -1 OR -p92 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((-p56 > -1 OR -p92 > -1))
lola: processed formula length: 28
lola: 242 rewrites
lola: formula mentions 2 of 137 places; total mentions: 2
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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 8 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p120 <= -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 412 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 8 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((EG (-p94 <= -1) AND (-p86 > -1 OR -p23 <= -1)) OR (EX (p122 + -p95 <= 0) AND (-p107 > -3 AND (-p1 <= -2 OR -p6 + p126 <= 0)))) AND EX (EG (p58 + -p47 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-p94 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-p94 <= -1)))
lola: processed formula length: 26
lola: 242 rewrites
lola: formula mentions 1 of 137 places; total mentions: 1
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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 9 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (p122 + -p95 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(p122 + -p95 <= 0)
lola: processed formula length: 20
lola: 242 rewrites
lola: formula mentions 2 of 137 places; total mentions: 2
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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 10 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-p107 > -3 AND (-p1 <= -2 OR -p6 + p126 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EG (p58 + -p47 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(A(TRUE U !(p58 + -p47 <= 0))))
lola: processed formula length: 35
lola: 243 rewrites
lola: formula mentions 2 of 137 places; total mentions: 2
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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 9 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p78 + -p64 <= 0 AND EG ((-p20 > -2 OR (-p27 <= -3 OR -p126 <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: p78 + -p64 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-p20 > -2 OR (-p27 <= -3 OR -p126 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-p20 > -2 OR (-p27 <= -3 OR -p126 <= -3)))))
lola: processed formula length: 58
lola: 242 rewrites
lola: formula mentions 3 of 137 places; total mentions: 3
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EG (p14 + -p21 <= 0) U EG (-p86 + p60 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(!(A(TRUE U !(p14 + -p21 <= 0))) U !(A(TRUE U !(-p86 + p60 <= 0))))
lola: processed formula length: 68
lola: 244 rewrites
lola: formula mentions 4 of 137 places; total mentions: 4
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((p34 + -p85 <= 0 AND p54 + -p115 <= 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 412 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 720 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AF (-p15 + p9 <= 0) U p60 + -p26 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U -p15 + p9 <= 0) U p60 + -p26 > 0)
lola: processed formula length: 44
lola: 243 rewrites
lola: formula mentions 4 of 137 places; total mentions: 4
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 950 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AF (p110 + -p108 <= 0) U (-p18 + p122 > 0 AND -p25 + p22 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U p110 + -p108 <= 0) U (-p18 + p122 > 0 AND -p25 + p22 > 0))
lola: processed formula length: 69
lola: 243 rewrites
lola: formula mentions 6 of 137 places; total mentions: 6
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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 14 will run for 1426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (EX (p60 + -p15 <= 0)) AND (AG ((-p116 <= -3 AND -p97 <= -2)) OR ((-p72 + p38 > 0 AND -p102 > -2) OR EG (p39 + -p101 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX (p60 + -p15 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(p60 + -p15 <= 0))
lola: processed formula length: 29
lola: 243 rewrites
lola: formula mentions 2 of 137 places; total mentions: 2
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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 15 will run for 2852 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p116 <= -3 AND -p97 <= -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 412 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (p39 + -p101 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(p39 + -p101 <= 0)))
lola: processed formula length: 32
lola: 242 rewrites
lola: formula mentions 2 of 137 places; total mentions: 2
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2852 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-p36 + p87 <= 0 AND -p90 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-p36 + p87 <= 0 AND -p90 <= -1))
lola: processed formula length: 42
lola: 242 rewrites
lola: formula mentions 3 of 137 places; total mentions: 3
lola: closed formula file Parking-PT-208-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 412 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: RESULT
lola: summary: yes unknown no no no yes no yes unknown yes yes no yes no yes no
lola: ========================================

BK_STOP 1463682319339

--------------------
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="Parking-PT-208"
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/Parking-PT-208.tgz
mv Parking-PT-208 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 Parking-PT-208, 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 r074kn-smll-146363811000201"
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 ;