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

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

=== Now, execution of the tool begins

BK_START 1463696299197

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ PermAdmissibility-PT-01
FORMULA PermAdmissibility-COL-01-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-01-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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-01-CTLCardinality.task
lola: read: E(2 <= c9 U AF (3 <= out7_1 + out7_0 + out7_3 + out7_2 + out7_5 + out7_4 + out7_7 + out7_6)) : !(AF (((3 <= c12 AND c12 <= aux16_0 + aux16_1 + aux16_2 + aux16_3 + aux16_4 + aux16_5 + aux16_6 + aux16_7) AND (c9 <= in1_1 + in1_0 AND in1_1 + in1_0 <= out5_1 + out5_2 + out5_0 + out5_5 + out5_6 + out5_3 + out5_4 + out5_7)))) : A(out1_0 + out1_6 + out1_5 + out1_7 + out1_2 + out1_1 + out1_4 + out1_3 <= o... (shortened)
lola: formula length: 2308
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-c9 <= -2 U AF (-out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-c9 <= -2 U A(TRUE U -out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 <= -3))
lola: processed formula length: 108
lola: 1718 rewrites
lola: formula mentions 9 of 168 places; total mentions: 9
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-c12 > -3 OR (-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 + c12 > 0 OR (-in1_1 + -in1_0 + c9 > 0 OR in1_1 + in1_0 + -out5_7 + -out5_6 + -out5_5 + -out5_4 + -out5_3 + -out5_2 + -out5_1 + -out5_0 > 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-c12 > -3 OR (-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 + c12 > 0 OR (-in1_1 + -in1_0 + c9 > 0 OR in1_1 + in1_0 + -out5_7 + -out5_6 + -out5_5 + -out5_4 + -out5_3 + -out5_2 + -out5_1 + -out5_0 > 0))))))
lola: processed formula length: 259
lola: 1717 rewrites
lola: formula mentions 20 of 168 places; total mentions: 23
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 + out1_7 + out1_6 + out1_5 + out1_4 + out1_3 + out1_2 + out1_1 + out1_0 <= 0 U (-aux13_7 + -aux13_6 + -aux13_5 + -aux13_4 + -aux13_3 + -aux13_2 + -aux13_1 + -aux13_0 + c5 > 0 AND (-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 + out1_7 + out1_6 + out1_5 + out1_4 + out1_3 + out1_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 + out1_7 + out1_6 + out1_5 + out1_4 + out1_3 + out1_2 + out1_1 + out1_0 <= 0 U (-aux13_7 + -aux13_6 + -aux13_5 + -aux13_4 + -aux13_3 + -aux13_2 + -aux13_1 + -aux13_0 + c5 > 0 AND (-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 + out1_7 + out1_6 + out1_5 + out1_4 + out1_3 + out1_2 ... (shortened)
lola: processed formula length: 488
lola: 1717 rewrites
lola: formula mentions 39 of 168 places; total mentions: 47
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX (-aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 <= -2) OR (AG ((-c110 <= -3 OR c8 + -c20 <= 0)) OR ((aux14_7 + aux14_6 + aux14_5 + aux14_4 + aux14_3 + aux14_2 + aux14_1 + aux14_0 + -c19 <= 0 AND (-in4_7 + -in4_6 <= -3 AND c14 + -c12 > 0)) OR AF (-c7 <= -2))))
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: AX (-aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 <= -2)
lola: processed formula length: 47
lola: 1717 rewrites
lola: formula mentions 4 of 168 places; total mentions: 4
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-c110 <= -3 OR c8 + -c20 <= 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 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (aux14_7 + aux14_6 + aux14_5 + aux14_4 + aux14_3 + aux14_2 + aux14_1 + aux14_0 + -c19 <= 0 AND (-in4_7 + -in4_6 <= -3 AND c14 + -c12 > 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-c7 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -c7 <= -2)
lola: processed formula length: 19
lola: 1717 rewrites
lola: formula mentions 1 of 168 places; total mentions: 1
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AF ((-c16 <= -2 AND -aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (-c16 <= -2 AND -aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 <= -2)))
lola: processed formula length: 122
lola: 1718 rewrites
lola: formula mentions 9 of 168 places; total mentions: 9
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AG ((-out5_7 + -out5_6 + -out5_5 + -out5_4 + -out5_3 + -out5_2 + -out5_1 + -out5_0 <= -3 OR -c20 + c17 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(E(TRUE U !((-out5_7 + -out5_6 + -out5_5 + -out5_4 + -out5_3 + -out5_2 + -out5_1 + -out5_0 <= -3 OR -c20 + c17 <= 0)))))
lola: processed formula length: 124
lola: 1718 rewrites
lola: formula mentions 10 of 168 places; total mentions: 10
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: A((-out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 > -3 OR -c5 + c20 > 0) U AG (-aux11_7 + -aux11_6 + -aux11_5 + -aux11_4 + -aux11_3 + -aux11_2 + -aux11_1 + -aux11_0 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 > -3 OR -c5 + c20 > 0) U !(E(TRUE U !(-aux11_7 + -aux11_6 + -aux11_5 + -aux11_4 + -aux11_3 + -aux11_2 + -aux11_1 + -aux11_0 <= -1))))
lola: processed formula length: 214
lola: 1718 rewrites
lola: formula mentions 18 of 168 places; total mentions: 18
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-c13 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -c13 <= -3)
lola: processed formula length: 20
lola: 1717 rewrites
lola: formula mentions 1 of 168 places; total mentions: 1
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX ((-out1_7 + -out1_6 + -out1_5 + -out1_4 + -out1_3 + -out1_2 + -out1_1 + -out1_0 <= -3 AND aux9_7 + aux9_5 + -aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 + aux9_0 + aux9_1 + aux9_2 + aux9_3 + aux9_4 + aux9_6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((-out1_7 + -out1_6 + -out1_5 + -out1_4 + -out1_3 + -out1_2 + -out1_1 + -out1_0 <= -3 AND aux9_7 + aux9_5 + -aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 + aux9_0 + aux9_1 + aux9_2 + aux9_3 + aux9_4 + aux9_6 <= 0)))
lola: processed formula length: 266
lola: 1718 rewrites
lola: formula mentions 24 of 168 places; total mentions: 24
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-c15 > -2 AND AX (-aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 + c19 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-c15 > -2 AND AX(-aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 + c19 <= 0)))))
lola: processed formula length: 132
lola: 1718 rewrites
lola: formula mentions 10 of 168 places; total mentions: 10
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AG (aux14_7 + aux14_6 + aux14_5 + aux14_4 + aux14_3 + aux14_2 + aux14_1 + aux14_0 + -c19 <= 0) U (c8 + -c20 > 0 AND aux12_7 + aux12_6 + aux12_5 + aux12_4 + aux12_3 + aux12_2 + aux12_1 + aux12_0 + -c17 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(!(E(TRUE U !(aux14_7 + aux14_6 + aux14_5 + aux14_4 + aux14_3 + aux14_2 + aux14_1 + aux14_0 + -c19 <= 0))) U (c8 + -c20 > 0 AND aux12_7 + aux12_6 + aux12_5 + aux12_4 + aux12_3 + aux12_2 + aux12_1 + aux12_0 + -c17 > 0))
lola: processed formula length: 219
lola: 1718 rewrites
lola: formula mentions 20 of 168 places; total mentions: 20
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-c12 > -3))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -c12 > -3))))
lola: processed formula length: 35
lola: 1718 rewrites
lola: formula mentions 1 of 168 places; total mentions: 1
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-out4_7 + -out4_6 + -out4_5 + -out4_4 + -out4_3 + -out4_2 + -out4_1 + -out4_0 > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-out4_7 + -out4_6 + -out4_5 + -out4_4 + -out4_3 + -out4_2 + -out4_1 + -out4_0 > -2)))
lola: processed formula length: 98
lola: 1717 rewrites
lola: formula mentions 8 of 168 places; total mentions: 8
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((AG (-c6 + c11 <= 0) AND -c20 + c19 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (!(E(TRUE U !(-c6 + c11 <= 0))) AND -c20 + c19 <= 0))
lola: processed formula length: 62
lola: 1718 rewrites
lola: formula mentions 4 of 168 places; total mentions: 4
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-c8 <= -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 544 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 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A(-c9 > -2 R -aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 > -2) AND EF (AG (aux6_5 + aux6_4 + aux6_1 + aux6_0 + -c7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-c9 > -2 R -aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(-c9 > -2) U !(-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 > -2)))
lola: processed formula length: 113
lola: 1717 rewrites
lola: formula mentions 9 of 168 places; total mentions: 9
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: RESULT
lola: summary: no yes no no no no no no no no no yes yes yes no unknown
lola: ========================================

BK_STOP 1463696300371

--------------------
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="PermAdmissibility-PT-01"
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/PermAdmissibility-PT-01.tgz
mv PermAdmissibility-PT-01 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 PermAdmissibility-PT-01, 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-146363811200300"
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 ;