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 QuasiCertifProtocol-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140200075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463698561855

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ QuasiCertifProtocol-PT-02
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-14 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-15 TRUE 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: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 86 places, 56 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 71 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: read: !(!((AF (2 <= a2) AND !(3 <= a5)))) : AG (EF (!(Sstart_1 + Sstart_0 + Sstart_2 <= AstopOK))) : (!(EX (!(3 <= a3))) OR !(EG (!(3 <= n5_0 + n5_1 + n5_2)))) : (AG (((a3 <= AstopAbort OR 1 <= a3) OR (1 <= n1_2 + n1_0 + n1_1 AND 3 <= CstopAbort))) AND (!(3 <= malicious_reservoir) OR AF (AstopOK <= n3_0 + n3_1 + n3_2))) : (AF (((AstopOK <= SstopOK_1 + SstopOK_0 + SstopOK_2 AND 2 <= SstopAbort) OR 3 <= n... (shortened)
lola: formula length: 2133
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-a2 <= -2) AND -a5 > -3)
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: AF (-a2 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -a2 <= -2)
lola: processed formula length: 19
lola: 1391 rewrites
lola: formula mentions 1 of 86 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-AstopOK + Sstart_0 + Sstart_1 + Sstart_2 > 0))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -AstopOK + Sstart_0 + Sstart_1 + Sstart_2 > 0))))
lola: processed formula length: 71
lola: 1392 rewrites
lola: formula mentions 4 of 86 places; total mentions: 4
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX (-a3 <= -3) OR AF (-n5_2 + -n5_1 + -n5_0 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-a3 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-a3 <= -3)
lola: processed formula length: 13
lola: 1391 rewrites
lola: formula mentions 1 of 86 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-n5_2 + -n5_1 + -n5_0 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -n5_2 + -n5_1 + -n5_0 <= -3)
lola: processed formula length: 37
lola: 1391 rewrites
lola: formula mentions 3 of 86 places; total mentions: 3
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((a3 + -AstopAbort <= 0 OR (-a3 <= -1 OR (-n1_2 + -n1_1 + -n1_0 <= -1 AND -CstopAbort <= -3)))) AND (-malicious_reservoir > -3 OR AF (AstopOK + -n3_0 + -n3_1 + -n3_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((a3 + -AstopAbort <= 0 OR (-a3 <= -1 OR (-n1_2 + -n1_1 + -n1_0 <= -1 AND -CstopAbort <= -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 220 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -malicious_reservoir > -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-02-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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (((AstopOK + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 <= 0 AND -SstopAbort <= -2) OR -n7_0_1 + -n7_0_2 + -n7_1_1 + -n7_2_2 + -n7_2_1 + -n7_1_2 + -n7_2_0 + -n7_1_0 + -n7_0_0 <= -3)) AND -Sstart_0 + -Sstart_1 + -Sstart_2 + s4_2 + s4_1 + s4_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (((AstopOK + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 <= 0 AND -SstopAbort <= -2) OR -n7_0_1 + -n7_0_2 + -n7_1_1 + -n7_2_2 + -n7_2_1 + -n7_1_2 + -n7_2_0 + -n7_1_0 + -n7_0_0 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((AstopOK + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 <= 0 AND -SstopAbort <= -2) OR -n7_0_1 + -n7_0_2 + -n7_1_1 + -n7_2_2 + -n7_2_1 + -n7_1_2 + -n7_2_0 + -n7_1_0 + -n7_0_0 <= -3))
lola: processed formula length: 184
lola: 1391 rewrites
lola: formula mentions 14 of 86 places; total mentions: 14
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-a5 <= -1) OR EF (-AstopOK <= -2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-a5 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -a5 <= -1)
lola: processed formula length: 19
lola: 1391 rewrites
lola: formula mentions 1 of 86 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-AstopOK <= -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 220 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EF (-Astart <= -3) U EF (-Astart <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U -Astart <= -3) U E(TRUE U -Astart <= -2))
lola: processed formula length: 52
lola: 1393 rewrites
lola: formula mentions 1 of 86 places; total mentions: 2
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (-n6_2 + -n6_1 + -n6_0 > -1) AND ((-s6_2 + -s6_1 + -s6_0 <= -2 AND ((-n9_1_0 + -n9_1_1 + -n9_1_2 + -n9_2_0 + -n9_2_1 + -n9_2_2 + n2_2 + n2_1 + n2_0 + -n9_0_2 + -n9_0_1 + -n9_0_0 <= 0 OR n1_2 + n1_1 + n1_0 + -a5 <= 0) AND -a3 <= -3)) OR -n2_2 + -n2_1 + -n2_0 + s6_2 + s6_1 + s6_0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-n6_2 + -n6_1 + -n6_0 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-n6_2 + -n6_1 + -n6_0 > -1)))
lola: processed formula length: 42
lola: 1391 rewrites
lola: formula mentions 3 of 86 places; total mentions: 3
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-s6_2 + -s6_1 + -s6_0 <= -2 AND ((-n9_1_0 + -n9_1_1 + -n9_1_2 + -n9_2_0 + -n9_2_1 + -n9_2_2 + n2_2 + n2_1 + n2_0 + -n9_0_2 + -n9_0_1 + -n9_0_0 <= 0 OR n1_2 + n1_1 + n1_0 + -a5 <= 0) AND -a3 <= -3)) OR -n2_2 + -n2_1 + -n2_0 + s6_2 + s6_1 + s6_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 5 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-02-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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AF (CstopAbort + -a4 <= 0) U (-n3_0 + -n3_1 + -n3_2 <= -2 OR (-a1 <= -2 OR -AstopOK <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U CstopAbort + -a4 <= 0) U (-n3_0 + -n3_1 + -n3_2 <= -2 OR (-a1 <= -2 OR -AstopOK <= -2)))
lola: processed formula length: 99
lola: 1392 rewrites
lola: formula mentions 7 of 86 places; total mentions: 7
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((Astart + -AstopAbort <= 0 AND -n2_2 + -n2_1 + -n2_0 > -2)) AND AF ((-CstopOK_0 + -CstopOK_1 + -CstopOK_2 + a2 > 0 OR n8_1_1 + n8_1_2 + n8_2_1 + n8_2_2 + -n7_0_1 + -n7_0_2 + -n7_1_1 + -n7_2_2 + -n7_2_1 + -n7_1_2 + -n7_2_0 + -n7_1_0 + -n7_0_0 + n8_2_0 + n8_1_0 + n8_0_2 + n8_0_1 + n8_0_0 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((Astart + -AstopAbort <= 0 AND -n2_2 + -n2_1 + -n2_0 > -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 220 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 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-CstopOK_0 + -CstopOK_1 + -CstopOK_2 + a2 > 0 OR n8_1_1 + n8_1_2 + n8_2_1 + n8_2_2 + -n7_0_1 + -n7_0_2 + -n7_1_1 + -n7_2_2 + -n7_2_1 + -n7_1_2 + -n7_2_0 + -n7_1_0 + -n7_0_0 + n8_2_0 + n8_1_0 + n8_0_2 + n8_0_1 + n8_0_0 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-CstopOK_0 + -CstopOK_1 + -CstopOK_2 + a2 > 0 OR n8_1_1 + n8_1_2 + n8_2_1 + n8_2_2 + -n7_0_1 + -n7_0_2 + -n7_1_1 + -n7_2_2 + -n7_2_1 + -n7_1_2 + -n7_2_0 + -n7_1_0 + -n7_0_0 + n8_2_0 + n8_1_0 + n8_0_2 + n8_0_1 + n8_0_0 > 0))
lola: processed formula length: 233
lola: 1391 rewrites
lola: formula mentions 22 of 86 places; total mentions: 22
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX ((-Cstart_2 + -Cstart_1 + -Cstart_0 > -3 OR -SstopOK_2 + -SstopOK_1 + -SstopOK_0 > -1)) AND AF (-n8_1_1 + -n8_1_2 + -n8_2_1 + -n8_2_2 + -n8_2_0 + -n8_1_0 + -n8_0_2 + -n8_0_1 + -n8_0_0 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-Cstart_2 + -Cstart_1 + -Cstart_0 > -3 OR -SstopOK_2 + -SstopOK_1 + -SstopOK_0 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((-Cstart_2 + -Cstart_1 + -Cstart_0 > -3 OR -SstopOK_2 + -SstopOK_1 + -SstopOK_0 > -1))
lola: processed formula length: 89
lola: 1391 rewrites
lola: formula mentions 6 of 86 places; total mentions: 6
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-n8_1_1 + -n8_1_2 + -n8_2_1 + -n8_2_2 + -n8_2_0 + -n8_1_0 + -n8_0_2 + -n8_0_1 + -n8_0_0 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -n8_1_1 + -n8_1_2 + -n8_2_1 + -n8_2_2 + -n8_2_0 + -n8_1_0 + -n8_0_2 + -n8_0_1 + -n8_0_0 <= -3)
lola: processed formula length: 103
lola: 1391 rewrites
lola: formula mentions 9 of 86 places; total mentions: 9
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF ((-n5_2 + -n5_1 + -n5_0 <= -3 AND -n2_2 + -n2_1 + -n2_0 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U (-n5_2 + -n5_1 + -n5_0 <= -3 AND -n2_2 + -n2_1 + -n2_0 <= -3)))))
lola: processed formula length: 87
lola: 1392 rewrites
lola: formula mentions 6 of 86 places; total mentions: 6
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (E(-AstopAbort <= -2 U -CstopAbort <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(-AstopAbort <= -2 U -CstopAbort <= -2))
lola: processed formula length: 50
lola: 1392 rewrites
lola: formula mentions 2 of 86 places; total mentions: 2
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-a4 > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-a4 > -3)))
lola: processed formula length: 24
lola: 1391 rewrites
lola: formula mentions 1 of 86 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (-n1_2 + -n1_1 + -n1_0 + a4 <= 0) AND (((a2 + -a1 > 0 OR -Cstart_2 + -Cstart_1 + -Cstart_0 > -3) AND (-a4 > -3 OR -CstopOK_0 + -CstopOK_1 + -CstopOK_2 > -1)) OR E(n7_0_1 + n7_0_2 + n7_1_1 + n7_2_2 + n7_2_1 + n7_1_2 + n7_2_0 + n7_1_0 + -AstopOK + n7_0_0 <= 0 U -n9_1_0 + -n9_1_1 + -n9_1_2 + -n9_2_0 + -n9_2_1 + -n9_2_2 + -n9_0_2 + -n9_0_1 + -n9_0_0 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-n1_2 + -n1_1 + -n1_0 + a4 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-n1_2 + -n1_1 + -n1_0 + a4 <= 0)
lola: processed formula length: 35
lola: 1391 rewrites
lola: formula mentions 4 of 86 places; total mentions: 4
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((a2 + -a1 > 0 OR -Cstart_2 + -Cstart_1 + -Cstart_0 > -3) AND (-a4 > -3 OR -CstopOK_0 + -CstopOK_1 + -CstopOK_2 > -1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 4 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
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: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (E(n7_0_1 + n7_0_2 + n7_1_1 + n7_2_2 + n7_2_1 + n7_1_2 + n7_2_0 + n7_1_0 + n7_0_0 + -s5_2 + -s5_1 + -s5_0 <= 0 U n2_2 + n2_1 + -n7_0_1 + -n7_0_2 + -n7_1_1 + -n7_2_2 + -n7_2_1 + -n7_1_2 + -n7_2_0 + -n7_1_0 + n2_0 + -n7_0_0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(n7_0_1 + n7_0_2 + n7_1_1 + n7_2_2 + n7_2_1 + n7_1_2 + n7_2_0 + n7_1_0 + n7_0_0 + -s5_2 + -s5_1 + -s5_0 <= 0 U n2_2 + n2_1 + -n7_0_1 + -n7_0_2 + -n7_1_1 + -n7_2_2 + -n7_2_1 + -n7_1_2 + -n7_2_0 + -n7_1_0 + n2_0 + -n7_0_0 <= 0))))
lola: processed formula length: 242
lola: 1392 rewrites
lola: formula mentions 15 of 86 places; total mentions: 24
lola: closed formula file QuasiCertifProtocol-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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: RESULT
lola: summary: no no no yes no no no yes no no no no no yes unknown yes

BK_STOP 1463698562070

--------------------
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="QuasiCertifProtocol-PT-02"
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/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 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 QuasiCertifProtocol-PT-02, 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 r098kn-smll-146369140200075"
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 ;