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

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

=== Now, execution of the tool begins

BK_START 1463710232866

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ PermAdmissibility-PT-20
FORMULA PermAdmissibility-COL-20-CTLCardinality-0 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-20-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-20-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-20-CTLCardinality-3 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-20-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-20-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-20-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-20-CTLCardinality-7 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-20-CTLCardinality-8 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-20-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-20-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-20-CTLCardinality-11 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-20-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-20-CTLCardinality-13 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-20-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-20-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-20-CTLCardinality.task
lola: read: AG (c20 <= aux16_0 + aux16_1 + aux16_2 + aux16_3 + aux16_4 + aux16_5 + aux16_6 + aux16_7) : EF ((!(3 <= c17) AND (aux9_4 + aux9_5 + aux9_6 + aux9_7 + aux9_0 + aux9_1 + aux9_2 + aux9_3 <= aux11_5 + aux11_4 + aux11_3 + aux11_2 + aux11_1 + aux11_0 + aux11_7 + aux11_6 AND !(out5_1 + out5_2 + out5_0 + out5_5 + out5_6 + out5_3 + out5_4 + out5_7 <= out7_1 + out7_0 + out7_3 + out7_2 + out7_5 + out7_4 + ou... (shortened)
lola: formula length: 2804
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 + 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-c17 > -3 AND (-aux11_7 + aux9_7 + aux9_5 + aux9_0 + aux9_1 + aux9_2 + aux9_3 + aux9_4 + aux9_6 + -aux11_6 + -aux11_5 + -aux11_4 + -aux11_3 + -aux11_2 + -aux11_1 + -aux11_0 <= 0 AND out5_7 + -out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 + out5_6 + out5_5 + out5_4 + out5_3 + out5_2 + out5_1 + out5_0 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((aux12_7 + -aux8_7 + -aux8_6 + -aux8_3 + -aux8_2 + aux12_6 + aux12_5 + aux12_4 + aux12_3 + aux12_2 + aux12_1 + aux12_0 <= 0 OR -c19 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !((aux12_7 + -aux8_7 + -aux8_6 + -aux8_3 + -aux8_2 + aux12_6 + aux12_5 + aux12_4 + aux12_3 + aux12_2 + aux12_1 + aux12_0 <= 0 OR -c19 <= -1)))))
lola: processed formula length: 164
lola: 2240 rewrites
lola: formula mentions 13 of 168 places; total mentions: 13
lola: closed formula file PermAdmissibility-COL-20-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 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (aux11_7 + -out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 + aux11_6 + aux11_5 + aux11_4 + aux11_3 + aux11_2 + aux11_1 + aux11_0 <= 0 AND (EF ((-out2_7 + -out2_6 + -out2_5 + -out2_4 + -out2_3 + -out2_2 + -out2_1 + -out2_0 <= -1 OR aux11_7 + -aux14_7 + -aux14_6 + -aux14_5 + -aux14_4 + -aux14_3 + -aux14_2 + -aux14_1 + -aux14_0 + aux11_6 + aux11_5 + aux11_4 + aux11_3 + a... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: aux11_7 + -out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 + aux11_6 + aux11_5 + aux11_4 + aux11_3 + aux11_2 + aux11_1 + aux11_0 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-out2_7 + -out2_6 + -out2_5 + -out2_4 + -out2_3 + -out2_2 + -out2_1 + -out2_0 <= -1 OR aux11_7 + -aux14_7 + -aux14_6 + -aux14_5 + -aux14_4 + -aux14_3 + -aux14_2 + -aux14_1 + -aux14_0 + aux11_6 + aux11_5 + aux11_4 + aux11_3 + aux11_2 + aux11_1 + aux11_0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 <= -3)
lola: processed formula length: 95
lola: 2239 rewrites
lola: formula mentions 8 of 168 places; total mentions: 8
lola: closed formula file PermAdmissibility-COL-20-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 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 + out1_7 + out1_6 + out1_5 + out1_4 + out1_3 + out1_2 + out1_1 + out1_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 + out1_7 + out1_6 + out1_5 + out1_4 + out1_3 + out1_2 + out1_1 + out1_0 <= 0)))
lola: processed formula length: 178
lola: 2239 rewrites
lola: formula mentions 16 of 168 places; total mentions: 16
lola: closed formula file PermAdmissibility-COL-20-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: 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 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-c17 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -c17 <= -2))))
lola: processed formula length: 36
lola: 2240 rewrites
lola: formula mentions 1 of 168 places; total mentions: 1
lola: closed formula file PermAdmissibility-COL-20-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 5 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((c12 + -c11 <= 0 OR -c11 <= -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 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 6 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-c9 > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-c9 > -2)))
lola: processed formula length: 24
lola: 2239 rewrites
lola: formula mentions 1 of 168 places; total mentions: 1
lola: closed formula file PermAdmissibility-COL-20-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 7 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF (-c14 <= -3) U EG (-c5 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U -c14 <= -3) U !(A(TRUE U !(-c5 <= -2))))
lola: processed formula length: 51
lola: 2241 rewrites
lola: formula mentions 2 of 168 places; total mentions: 2
lola: closed formula file PermAdmissibility-COL-20-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 3 significant temporal operators and needs 13 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-in3_5 + -in3_4 + c18 > 0 OR EG (-in2_3 + -in2_2 + out7_7 + out7_6 + out7_5 + out7_4 + out7_3 + out7_2 + out7_1 + out7_0 <= 0)) AND (EF (-c20 > -3) OR EX (-aux13_7 + -aux13_6 + -aux13_5 + -aux13_4 + -aux13_3 + -aux13_2 + -aux13_1 + -aux13_0 > -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -in3_5 + -in3_4 + c18 > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-in2_3 + -in2_2 + out7_7 + out7_6 + out7_5 + out7_4 + out7_3 + out7_2 + out7_1 + out7_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-in2_3 + -in2_2 + out7_7 + out7_6 + out7_5 + out7_4 + out7_3 + out7_2 + out7_1 + out7_0 <= 0)))
lola: processed formula length: 108
lola: 2239 rewrites
lola: formula mentions 10 of 168 places; total mentions: 10
lola: closed formula file PermAdmissibility-COL-20-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: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-c20 > -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 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: yes
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG (-c110 + out1_7 + out1_6 + out1_5 + out1_4 + out1_3 + out1_2 + out1_1 + out1_0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !(-c110 + out1_7 + out1_6 + out1_5 + out1_4 + out1_3 + out1_2 + out1_1 + out1_0 <= 0))))
lola: processed formula length: 108
lola: 2240 rewrites
lola: formula mentions 9 of 168 places; total mentions: 9
lola: closed formula file PermAdmissibility-COL-20-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 10 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PermAdmissibility-COL-20-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 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (EF (-out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 <= -1)) AND (AX (-aux14_7 + -aux14_6 + -aux14_5 + -aux14_4 + -aux14_3 + -aux14_2 + -aux14_1 + -aux14_0 + c8 <= 0) OR (-c13 > -3 OR (-aux8_7 + -aux8_6 + -aux8_3 + -aux8_2 > -3 OR ((-aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 + c11 > 0 AND (-in1_1 + -in1_0 <= -3 OR c110 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 <= -1))))
lola: processed formula length: 109
lola: 2240 rewrites
lola: formula mentions 8 of 168 places; total mentions: 8
lola: closed formula file PermAdmissibility-COL-20-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: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-c19 > -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 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 13 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF (-in2_3 + -in2_2 + c6 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U -in2_3 + -in2_2 + c6 > 0))
lola: processed formula length: 44
lola: 2240 rewrites
lola: formula mentions 3 of 168 places; total mentions: 3
lola: closed formula file PermAdmissibility-COL-20-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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AF (-aux9_7 + -aux9_5 + -aux9_0 + -aux9_1 + -aux9_2 + -aux9_3 + -aux9_4 + -aux9_6 <= -3) U -out4_7 + -out4_6 + -out4_5 + -out4_4 + -out4_3 + -out4_2 + -out4_1 + -out4_0 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U -aux9_7 + -aux9_5 + -aux9_0 + -aux9_1 + -aux9_2 + -aux9_3 + -aux9_4 + -aux9_6 <= -3) U -out4_7 + -out4_6 + -out4_5 + -out4_4 + -out4_3 + -out4_2 + -out4_1 + -out4_0 <= -1)
lola: processed formula length: 182
lola: 2240 rewrites
lola: formula mentions 16 of 168 places; total mentions: 16
lola: closed formula file PermAdmissibility-COL-20-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 15 will run for 1274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-out2_7 + -out2_6 + -out2_5 + -out2_4 + -out2_3 + -out2_2 + -out2_1 + -out2_0 + c17 <= 0 U EG (aux13_7 + aux13_6 + aux13_5 + aux13_4 + aux13_3 + aux13_2 + aux13_1 + aux13_0 + -c16 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-out2_7 + -out2_6 + -out2_5 + -out2_4 + -out2_3 + -out2_2 + -out2_1 + -out2_0 + c17 <= 0 U !(A(TRUE U !(aux13_7 + aux13_6 + aux13_5 + aux13_4 + aux13_3 + aux13_2 + aux13_1 + aux13_0 + -c16 <= 0))))
lola: processed formula length: 199
lola: 2240 rewrites
lola: formula mentions 18 of 168 places; total mentions: 18
lola: closed formula file PermAdmissibility-COL-20-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: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: unknown yes yes unknown no no yes unknown unknown no yes unknown no unknown no unknown

BK_STOP 1463712787635

--------------------
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-20"
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-20.tgz
mv PermAdmissibility-PT-20 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-20, 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-146363811200336"
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 ;