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 LamportFastMutEx-PT-4, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358896900255
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463599644327

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ LamportFastMutEx-PT-4
FORMULA LamportFastMutEx-COL-4-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA LamportFastMutEx-COL-4-CTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 365/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 135 places, 230 transitions, 98 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 327 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-4-CTLCardinality.task
lola: read: !(EF (AF (P-b_0_false + P-b_0_true + P-b_1_false + P-b_1_true + P-b_2_false + P-b_2_true + P-b_3_false + P-b_3_true + P-b_4_false + P-b_4_true <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4))) : !(EG (!((1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 AND P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 <= P-setbi_11_0 +... (shortened)
lola: formula length: 8440
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 (EG (P-b_3_true + P-b_0_true + P-b_4_true + P-b_1_false + P-b_2_true + -P-await_13_4 + -P-await_13_3 + -P-await_13_2 + -P-await_13_1 + -P-await_13_0 + P-b_0_false + P-b_2_false + P-b_3_false + P-b_4_false + P-b_1_true > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(!(A(TRUE U !(P-b_3_true + P-b_0_true + P-b_4_true + P-b_1_false + P-b_2_true + -P-await_13_4 + -P-await_13_3 + -P-await_13_2 + -P-await_13_1 + -P-await_13_0 + P-b_0_false + P-b_2_false + P-b_3_false + P-b_4_false + P-b_1_true > 0))))))
lola: processed formula length: 248
lola: 7239 rewrites
lola: formula mentions 15 of 135 places; total mentions: 15
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 <= -1 AND P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-ifyi_15_1 + P-ifyi_15_0 + -P-setbi_11_4 + -P-setbi_11_3 + -P-setbi_11_2 + -P-setbi_11_1 + -P-setbi_11_0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 <= -1 AND P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-ifyi_15_1 + P-ifyi_15_0 + -P-setbi_11_4 + -P-setbi_11_3 + -P-setbi_11_2 + -P-setbi_11_1 + -P-setbi_11_0 <= 0))
lola: processed formula length: 252
lola: 7238 rewrites
lola: formula mentions 15 of 135 places; total mentions: 15
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (((-P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 <= -3 OR -x_4 + -x_3 + -x_2 + -x_1 + -x_0 <= -2) AND (-x_4 + -x_3 + -x_2 + -x_1 + -x_0 + P-sety_9_4 + P-sety_9_3 + P-sety_9_2 + P-sety_9_1 + P-sety_9_0 <= 0 OR P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_1 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_1 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((-P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 <= -3 OR -x_4 + -x_3 + -x_2 + -x_1 + -x_0 <= -2) AND (-x_4 + -x_3 + -x_2 + -x_1 + -x_0 + P-sety_9_4 + P-sety_9_3 + P-sety_9_2 + P-sety_9_1 + P-sety_9_0 <= 0 OR P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_1 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_1 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P-done_2_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((-P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 <= -3 OR -x_4 + -x_3 + -x_2 + -x_1 + -x_0 <= -2) AND (-x_4 + -x_3 + -x_2 + -x_1 + -x_0 + P-sety_9_4 + P-sety_9_3 + P-sety_9_2 + P-sety_9_1 + P-sety_9_0 <= 0 OR P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_1 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3_2 + P-done_3_1 + P-done_3_0 + P-done_2_4 + P-done_2_3 + P... (shortened)
lola: processed formula length: 645
lola: 7238 rewrites
lola: formula mentions 45 of 135 places; total mentions: 50
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_0 <= -3))
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 !(-P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_0 <= -3))))
lola: processed formula length: 99
lola: 7239 rewrites
lola: formula mentions 5 of 135 places; total mentions: 5
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (-P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 + P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 <= 0) OR (-P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 <= -3 AND -P-fordo_12_4 + -P-fordo_12_3 + -P-fordo_12_2 + -P-fordo_12_1 + -P-fordo_12_0 > -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 + P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 + P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 <= 0)))
lola: processed formula length: 168
lola: 7238 rewrites
lola: formula mentions 10 of 135 places; total mentions: 10
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================lola:
subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EF (-P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 + P-sety_9_4 + P-sety_9_3 + P-sety_9_2 + P-sety_9_1 + P-sety_9_0 <= 0) U EX (-P-fordo_12_4 + -P-fordo_12_3 + -P-fordo_12_2 + -P-fordo_12_1 + -P-fordo_12_0 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U -P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 + P-sety_9_4 + P-sety_9_3 + P-sety_9_2 + P-sety_9_1 + P-sety_9_0 <= 0) U EX(-P-fordo_12_4 + -P-fordo_12_3 + -P-fordo_12_2 + -P-fordo_12_1 + -P-fordo_12_0 <= -1))
lola: processed formula length: 240
lola: 7240 rewrites
lola: formula mentions 15 of 135 places; total mentions: 15
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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 317 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 LamportFastMutEx-COL-4-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-ifyi_15_1 + P-ifyi_15_0 + -P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 <= 0) AND (A(-x_4 + -x_3 + -x_2 + -x_1 + -x_0 <= -2 U P-setbi_11_4 + P-setbi_11_3 + P-setbi_11_2 + P-setbi_11_1 + P-setbi_11_0 + -P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_0 <= 0) OR AF ((P-sety_9_4 + P-sety_9_3 + P-set... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-ifyi_15_1 + P-ifyi_15_0 + -P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 <= 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 16 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((P-start_1_4 + P-start_1_3 + P-start_1_2 + P-start_1_1 + P-start_1_0 + -P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_0 <= 0 OR (P-start_1_4 + P-start_1_3 + P-start_1_2 + P-start_1_1 + P-start_1_0 + -P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 <= 0 OR P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_1 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((P-start_1_4 + P-start_1_3 + P-start_1_2 + P-start_1_1 + P-start_1_0 + -P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_0 <= 0 OR (P-start_1_4 + P-start_1_3 + P-start_1_2 + P-start_1_1 + P-start_1_0 + -P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 <= 0 OR P-done_4_4 + P-done_4_3 + P-done_4_2 + P-done_4_1 + P-done_4_0 + P-done_3_4 + P-done_3_3 + P-done_3... (shortened)
lola: processed formula length: 832
lola: 7239 rewrites
lola: formula mentions 50 of 135 places; total mentions: 60
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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 8 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG ((-P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_1 + -P-start_1_0 > -3 OR -P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_0 > -3)) OR ((((-P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 <= -1 OR -x_4 + -x_3 + -x_2 + -x_1 + -x_0 + P-setbi_24_4 + P-setbi_24_3 + P-setbi_24_2 + P-setbi_24_1 + P-setbi_24_0 <= 0) AND -P-setbi_11_4 + -P-setbi_11_3 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_1 + -P-start_1_0 > -3 OR -P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_0 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_1 + -P-start_1_0 > -3 OR -P-ifxi_10_4 + -P-ifxi_10_3 + -P-ifxi_10_2 + -P-ifxi_10_1 + -P-ifxi_10_0 > -3))))
lola: processed formula length: 176
lola: 7238 rewrites
lola: formula mentions 10 of 135 places; total mentions: 10
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 493 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((AF (P-b_3_true + P-b_0_true + P-b_4_true + P-b_1_false + P-b_2_true + -P-CS_21_4 + -P-CS_21_3 + -P-CS_21_2 + -P-CS_21_1 + -P-CS_21_0 + P-b_0_false + P-b_2_false + P-b_3_false + P-b_4_false + P-b_1_true <= 0) OR -P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((A(TRUE U P-b_3_true + P-b_0_true + P-b_4_true + P-b_1_false + P-b_2_true + -P-CS_21_4 + -P-CS_21_3 + -P-CS_21_2 + -P-CS_21_1 + -P-CS_21_0 + P-b_0_false + P-b_2_false + P-b_3_false + P-b_4_false + P-b_1_true <= 0) OR -P-setbi_5_4 + -P-setbi_5_3 + -P-setbi_5_2 + -P-setbi_5_1 + -P-setbi_5_0 > -3))))
lola: processed formula length: 311
lola: 7239 rewrites
lola: formula mentions 20 of 135 places; total mentions: 20
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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 10 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (-P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 > -1) AND (-P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_1 + -P-start_1_0 <= -3 AND ((P-ify0_4_4 + P-ify0_4_3 + P-ify0_4_2 + P-ify0_4_1 + P-ify0_4_0 + -P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_0 <= 0 OR (y_4 + -P-wait_3_4 + -P-wait_3_3 + -P-wait_3_2 + -P-wait_3_1 + -P-wait_3_0 + -P-wait_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 > -1)
lola: processed formula length: 81
lola: 7238 rewrites
lola: formula mentions 5 of 135 places; total mentions: 5
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_1 + -P-start_1_0 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 855 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P-ify0_4_4 + P-ify0_4_3 + P-ify0_4_2 + P-ify0_4_1 + P-ify0_4_0 + -P-awaity_4 + -P-awaity_3 + -P-awaity_2 + -P-awaity_1 + -P-awaity_0 <= 0 OR (y_4 + -P-wait_3_4 + -P-wait_3_3 + -P-wait_3_2 + -P-wait_3_1 + -P-wait_3_0 + -P-wait_2_4 + -P-wait_2_3 + -P-wait_2_2 + -P-wait_2_1 + -P-wait_2_0 + -P-wait_1_4 + -P-wait_1_3 + -P-wait_1_2 + -P-wait_1_1 + -P-wait_1_0 + -P-wait_4_0 + -P-wait_0_4 + -P-wait_0_3 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 1140 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (P-fordo_12_4 + P-fordo_12_3 + P-fordo_12_2 + P-fordo_12_1 + P-fordo_12_0 + -P-ify0_4_4 + -P-ify0_4_3 + -P-ify0_4_2 + -P-ify0_4_1 + -P-ify0_4_0 <= 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 16 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EX (P-wait_3_4 + P-wait_3_3 + P-wait_3_2 + P-wait_3_1 + P-wait_3_0 + P-wait_2_4 + P-wait_2_3 + P-wait_2_2 + P-wait_2_1 + P-wait_2_0 + P-wait_1_4 + P-wait_1_3 + P-wait_1_2 + P-wait_1_1 + P-wait_1_0 + -P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_1 + -P-start_1_0 + P-wait_4_0 + P-wait_0_4 + P-wait_0_3 + P-wait_0_2 + P-wait_0_1 + P-wait_0_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX(P-wait_3_4 + P-wait_3_3 + P-wait_3_2 + P-wait_3_1 + P-wait_3_0 + P-wait_2_4 + P-wait_2_3 + P-wait_2_2 + P-wait_2_1 + P-wait_2_0 + P-wait_1_4 + P-wait_1_3 + P-wait_1_2 + P-wait_1_1 + P-wait_1_0 + -P-start_1_4 + -P-start_1_3 + -P-start_1_2 + -P-start_1_1 + -P-start_1_0 + P-wait_4_0 + P-wait_0_4 + P-wait_0_3 + P-wait_0_2 + P-wait_0_1 + P-wait_0_0 + P-wait_4_1 + P-wait_4_2 + P-wait_4_3 + P-wait_4... (shortened)
lola: processed formula length: 511
lola: 7240 rewrites
lola: formula mentions 35 of 135 places; total mentions: 35
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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 855 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-P-done_4_4 + -P-done_4_3 + -P-done_4_2 + -P-done_4_1 + -P-done_4_0 + -P-done_3_4 + -P-done_3_3 + -P-done_3_2 + -P-done_3_1 + -P-done_3_0 + -P-done_2_4 + -P-done_2_3 + -P-done_2_2 + -P-done_2_1 + -P-done_2_0 + -P-done_1_4 + -P-done_1_3 + -P-done_1_2 + -P-done_1_1 + -P-done_1_0 + y_4 + -P-done_0_4 + -P-done_0_3 + -P-done_0_2 + -P-done_0_1 + -P-done_0_0 + y_3 + y_2 + y_1 + y_0 > 0))
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 !(-P-done_4_4 + -P-done_4_3 + -P-done_4_2 + -P-done_4_1 + -P-done_4_0 + -P-done_3_4 + -P-done_3_3 + -P-done_3_2 + -P-done_3_1 + -P-done_3_0 + -P-done_2_4 + -P-done_2_3 + -P-done_2_2 + -P-done_2_1 + -P-done_2_0 + -P-done_1_4 + -P-done_1_3 + -P-done_1_2 + -P-done_1_1 + -P-done_1_0 + y_4 + -P-done_0_4 + -P-done_0_3 + -P-done_0_2 + -P-done_0_1 + -P-done_0_0 + y_3 + y_2 + y_1 + y_0 ... (shortened)
lola: processed formula length: 407
lola: 7239 rewrites
lola: formula mentions 30 of 135 places; total mentions: 30
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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 1136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((x_4 + x_3 + x_2 + x_1 + x_0 + -P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 <= 0 AND y_4 + -P-await_13_4 + -P-await_13_3 + -P-await_13_2 + -P-await_13_1 + -P-await_13_0 + y_3 + y_2 + y_1 + y_0 <= 0) OR EF (-P-await_13_4 + -P-await_13_3 + -P-await_13_2 + -P-await_13_1 + -P-await_13_0 + P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-ifyi_15_1 + P-ifyi_15_0 > 0)) AND (-x_4 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (x_4 + x_3 + x_2 + x_1 + x_0 + -P-ifyi_15_4 + -P-ifyi_15_3 + -P-ifyi_15_2 + -P-ifyi_15_1 + -P-ifyi_15_0 <= 0 AND y_4 + -P-await_13_4 + -P-await_13_3 + -P-await_13_2 + -P-await_13_1 + -P-await_13_0 + y_3 + y_2 + y_1 + y_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P-await_13_4 + -P-await_13_3 + -P-await_13_2 + -P-await_13_1 + -P-await_13_0 + P-ifyi_15_4 + P-ifyi_15_3 + P-ifyi_15_2 + P-ifyi_15_1 + P-ifyi_15_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 16 bytes per marking, with 30 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 15 will run for 3410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-x_4 + P-ify0_4_4 + P-ify0_4_3 + P-ify0_4_2 + P-ify0_4_1 + P-ify0_4_0 + -x_3 + -x_2 + -x_1 + -x_0 <= 0 OR -y_4 + P-wait_3_4 + P-wait_3_3 + P-wait_3_2 + P-wait_3_1 + P-wait_3_0 + P-wait_2_4 + P-wait_2_3 + P-wait_2_2 + P-wait_2_1 + P-wait_2_0 + P-wait_1_4 + P-wait_1_3 + P-wait_1_2 + P-wait_1_1 + P-wait_1_0 + P-wait_4_0 + P-wait_0_4 + P-wait_0_3 + P-wait_0_2 + P-wait_0_1 + P-wait_0_0 + P-wait_4_1 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file LamportFastMutEx-COL-4-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 14 will run for 1705 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 LamportFastMutEx-COL-4-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AF (-P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 <= -1) U AX (-P-await_13_4 + -P-await_13_3 + -P-await_13_2 + -P-await_13_1 + -P-await_13_0 + P-start_1_4 + P-start_1_3 + P-start_1_2 + P-start_1_1 + P-start_1_0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U -P-setbi_24_4 + -P-setbi_24_3 + -P-setbi_24_2 + -P-setbi_24_1 + -P-setbi_24_0 <= -1) U AX(-P-await_13_4 + -P-await_13_3 + -P-await_13_2 + -P-await_13_1 + -P-await_13_0 + P-start_1_4 + P-start_1_3 + P-start_1_2 + P-start_1_1 + P-start_1_0 <= 0))
lola: processed formula length: 255
lola: 7240 rewrites
lola: formula mentions 15 of 135 places; total mentions: 15
lola: closed formula file LamportFastMutEx-COL-4-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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: RESULT
lola: summary: yes no no yes no yes no yes yes yes no no no yes yes no
lola: ========================================

BK_STOP 1463599782183

--------------------
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="LamportFastMutEx-PT-4"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/hulinhub/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/LamportFastMutEx-PT-4.tgz
mv LamportFastMutEx-PT-4 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 LamportFastMutEx-PT-4, 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 r062kn-blw3-146358896900255"
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 ;