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 PolyORBLF-PT-S06J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369089000777
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463733006462

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ PolyORBLF-PT-S06J04T06
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-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: 11132/65536 symbol table entries, 6611 collisions
lola: preprocessing...
lola: finding significant places
lola: 632 places, 10500 transitions, 578 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2723 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: read: (!(EG (2 <= cSources)) AND !(3 <= P_1099)) : (!(A(Abort_Check_Sources_B_4 + Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_3 <= QueueJobB_6_4 + QueueJobB_2_0 + QueueJobB_3_1 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_3_0 + QueueJobB_3_2 + QueueJobB_5_2 + QueueJobB_4_2 + QueueJobB_2_2 + QueueJobB_3_3 + QueueJobB_6_3 + Q... (shortened)
lola: formula length: 10349
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-cSources > -2) AND -P_1099 > -3)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-cSources > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -cSources > -2)
lola: processed formula length: 24
lola: 11199 rewrites
lola: formula mentions 1 of 632 places; total mentions: 1
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(-QueueJobB_6_4 + -QueueJobB_6_3 + -QueueJobB_6_2 + -QueueJobB_6_1 + -QueueJobB_6_0 + -QueueJobB_5_4 + -QueueJobB_5_3 + -QueueJobB_5_2 + -QueueJobB_5_1 + -QueueJobB_5_0 + -QueueJobB_4_4 + -QueueJobB_4_3 + -QueueJobB_4_2 + -QueueJobB_4_1 + -QueueJobB_4_0 + -QueueJobB_3_4 + -QueueJobB_3_3 + -QueueJobB_3_2 + -QueueJobB_3_1 + -QueueJobB_3_0 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_5 + Abort... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-QueueJobB_6_4 + -QueueJobB_6_3 + -QueueJobB_6_2 + -QueueJobB_6_1 + -QueueJobB_6_0 + -QueueJobB_5_4 + -QueueJobB_5_3 + -QueueJobB_5_2 + -QueueJobB_5_1 + -QueueJobB_5_0 + -QueueJobB_4_4 + -QueueJobB_4_3 + -QueueJobB_4_2 + -QueueJobB_4_1 + -QueueJobB_4_0 + -QueueJobB_3_4 + -QueueJobB_3_3 + -QueueJobB_3_2 + -QueueJobB_3_1 + -QueueJobB_3_0 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_5 + Abort_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(!(-QueueJobB_6_4 + -QueueJobB_6_3 + -QueueJobB_6_2 + -QueueJobB_6_1 + -QueueJobB_6_0 + -QueueJobB_5_4 + -QueueJobB_5_3 + -QueueJobB_5_2 + -QueueJobB_5_1 + -QueueJobB_5_0 + -QueueJobB_4_4 + -QueueJobB_4_3 + -QueueJobB_4_2 + -QueueJobB_4_1 + -QueueJobB_4_0 + -QueueJobB_3_4 + -QueueJobB_3_3 + -QueueJobB_3_2 + -QueueJobB_3_1 + -QueueJobB_3_0 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_5 + Ab... (shortened)
lola: processed formula length: 858
lola: 11199 rewrites
lola: formula mentions 42 of 632 places; total mentions: 42
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 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: P_1097 + -QueueJobB_6_4 + -QueueJobB_6_3 + -QueueJobB_6_2 + -QueueJobB_6_1 + -QueueJobB_6_0 + -QueueJobB_5_4 + -QueueJobB_5_3 + -QueueJobB_5_2 + -QueueJobB_5_1 + -QueueJobB_5_0 + -QueueJobB_4_4 + -QueueJobB_4_3 + -QueueJobB_4_2 + -QueueJobB_4_1 + -QueueJobB_4_0 + -QueueJobB_3_4 + -QueueJobB_3_3 + -QueueJobB_3_2 + -QueueJobB_3_1 + -QueueJobB_3_0 + -QueueJobB_2_4 + -QueueJobB_2_3 + -QueueJobB_2_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S06J04T06-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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (cIsMonitoring + -MarkerRead <= 0) OR (-Perform_Work_E_6 + -Perform_Work_E_5 + -Perform_Work_E_4 + -Perform_Work_E_3 + -Perform_Work_E_2 + -Perform_Work_E_1 > -1 OR (-P_1727 + P_1093 > 0 OR (-P_1119_6_6 + -P_1119_6_5 + -P_1119_6_4 + -P_1119_6_3 + -P_1119_6_2 + -P_1119_6_1 + -P_1119_5_6 + -P_1119_5_5 + -P_1119_5_4 + -P_1119_5_3 + -P_1119_5_2 + -P_1119_5_1 + -P_1119_4_6 + -P_1119_4_5 + -P_1119_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (cIsMonitoring + -MarkerRead <= 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 2312 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Perform_Work_E_6 + -Perform_Work_E_5 + -Perform_Work_E_4 + -Perform_Work_E_3 + -Perform_Work_E_2 + -Perform_Work_E_1 > -1 OR (-P_1727 + P_1093 > 0 OR (-P_1119_6_6 + -P_1119_6_5 + -P_1119_6_4 + -P_1119_6_3 + -P_1119_6_2 + -P_1119_6_1 + -P_1119_5_6 + -P_1119_5_5 + -P_1119_5_4 + -P_1119_5_3 + -P_1119_5_2 + -P_1119_5_1 + -P_1119_4_6 + -P_1119_4_5 + -P_1119_4_4 + -P_1119_4_3 + -P_1119_4_2 + -P_1119_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 6 atomic propositions
lola: closed formula file PolyORBLF-COL-S06J04T06-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 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EG (-P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 + -P_2321_5 + -P_2321_6 + P_1159_6 + P_1159_5 + P_1159_4 + P_1159_3 + P_1159_2 + P_1159_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(A(TRUE U !(-P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 + -P_2321_5 + -P_2321_6 + P_1159_6 + P_1159_5 + P_1159_4 + P_1159_3 + P_1159_2 + P_1159_1 <= 0))))
lola: processed formula length: 160
lola: 11200 rewrites
lola: formula mentions 12 of 632 places; total mentions: 12
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (AG (-BlockedTasks + Try_Check_Sources_B_6 + Try_Check_Sources_B_5 + Try_Check_Sources_B_4 + Try_Check_Sources_B_3 + Try_Check_Sources_B_2 + Try_Check_Sources_B_1 <= 0) AND (-FetchJobB_6 + -FetchJobB_5 + -FetchJobB_4 + -FetchJobB_3 + -FetchJobB_2 + -FetchJobB_1 > -2 OR (-NotifyEventEndOfCheckSourcesE_6 + -NotifyEventEndOfCheckSourcesE_5 + -NotifyEventEndOfCheckSourcesE_4 + -NotifyEventEndOfCheckSo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-BlockedTasks + Try_Check_Sources_B_6 + Try_Check_Sources_B_5 + Try_Check_Sources_B_4 + Try_Check_Sources_B_3 + Try_Check_Sources_B_2 + Try_Check_Sources_B_1 <= 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 2312 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: 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 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-QueueJobB_6_4 + -QueueJobB_6_3 + -QueueJobB_6_2 + -QueueJobB_6_1 + -QueueJobB_6_0 + -QueueJobB_5_4 + -QueueJobB_5_3 + -QueueJobB_5_2 + -QueueJobB_5_1 + -QueueJobB_5_0 + -QueueJobB_4_4 + -QueueJobB_4_3 + -QueueJobB_4_2 + -QueueJobB_4_1 + -QueueJobB_4_0 + -QueueJobB_3_4 + -QueueJobB_3_3 + -QueueJobB_3_2 + -QueueJobB_3_1 + -QueueJobB_3_0 + -QueueJobB_2_4 + -QueueJobB_2_3 + -QueueJobB_2_2 + -Queu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -QueueJobB_6_4 + -QueueJobB_6_3 + -QueueJobB_6_2 + -QueueJobB_6_1 + -QueueJobB_6_0 + -QueueJobB_5_4 + -QueueJobB_5_3 + -QueueJobB_5_2 + -QueueJobB_5_1 + -QueueJobB_5_0 + -QueueJobB_4_4 + -QueueJobB_4_3 + -QueueJobB_4_2 + -QueueJobB_4_1 + -QueueJobB_4_0 + -QueueJobB_3_4 + -QueueJobB_3_3 + -QueueJobB_3_2 + -QueueJobB_3_1 + -QueueJobB_3_0 + -QueueJobB_2_4 + -QueueJobB_2_3 + -QueueJobB_2_2 + ... (shortened)
lola: processed formula length: 523
lola: 11199 rewrites
lola: formula mentions 30 of 632 places; total mentions: 30
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 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 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (-cJobCnt <= -3) AND (AF (cSources + -P_1159_6 + -P_1159_5 + -P_1159_4 + -P_1159_3 + -P_1159_2 + -P_1159_1 <= 0) AND AX ((-P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_0 <= -2 OR (-PlaceSources_6 + -PlaceSources_5 + -PlaceSources_4 + -PlaceSources_3 + -PlaceSources_2 + -PlaceSources_1 <= -2 OR -P_1717 <= -1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-cJobCnt <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-cJobCnt <= -3)))
lola: processed formula length: 30
lola: 11199 rewrites
lola: formula mentions 1 of 632 places; total mentions: 1
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (cSources + -P_1159_6 + -P_1159_5 + -P_1159_4 + -P_1159_3 + -P_1159_2 + -P_1159_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U cSources + -P_1159_6 + -P_1159_5 + -P_1159_4 + -P_1159_3 + -P_1159_2 + -P_1159_1 <= 0)
lola: processed formula length: 95
lola: 11199 rewrites
lola: formula mentions 7 of 632 places; total mentions: 7
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 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 6 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AX (-cPollingAbort + PlaceSources_6 + PlaceSources_5 + PlaceSources_4 + PlaceSources_3 + PlaceSources_2 + PlaceSources_1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(AX(-cPollingAbort + PlaceSources_6 + PlaceSources_5 + PlaceSources_4 + PlaceSources_3 + PlaceSources_2 + PlaceSources_1 > 0))))
lola: processed formula length: 140
lola: 11200 rewrites
lola: formula mentions 7 of 632 places; total mentions: 7
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EX (-QueueJobE_6 + -QueueJobE_5 + -QueueJobE_4 + -QueueJobE_3 + -QueueJobE_2 + -QueueJobE_1 + ProcessingEvt_6 + ProcessingEvt_5 + ProcessingEvt_4 + ProcessingEvt_3 + ProcessingEvt_2 + ProcessingEvt_1 <= 0) U (-P_1099 <= -1 OR (-ProcessingEvt_6 + -ProcessingEvt_5 + -ProcessingEvt_4 + -ProcessingEvt_3 + -ProcessingEvt_2 + -ProcessingEvt_1 <= -1 AND -SigAbort + PollingAbort <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX(-QueueJobE_6 + -QueueJobE_5 + -QueueJobE_4 + -QueueJobE_3 + -QueueJobE_2 + -QueueJobE_1 + ProcessingEvt_6 + ProcessingEvt_5 + ProcessingEvt_4 + ProcessingEvt_3 + ProcessingEvt_2 + ProcessingEvt_1 <= 0) U (-P_1099 <= -1 OR (-ProcessingEvt_6 + -ProcessingEvt_5 + -ProcessingEvt_4 + -ProcessingEvt_3 + -ProcessingEvt_2 + -ProcessingEvt_1 <= -1 AND -SigAbort + PollingAbort <= 0)))
lola: processed formula length: 382
lola: 11200 rewrites
lola: formula mentions 15 of 632 places; total mentions: 21
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 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 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Abort_Check_Sources_E_6 + -Abort_Check_Sources_E_5 + -Abort_Check_Sources_E_4 + -Abort_Check_Sources_E_3 + -Abort_Check_Sources_E_2 + -Abort_Check_Sources_E_1 <= -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 2312 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 9 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P_1113_6 + P_1113_1 + P_1113_2 + P_1113_3 + P_1113_4 + P_1113_5 + -QueueJobE_6 + -QueueJobE_5 + -QueueJobE_4 + -QueueJobE_3 + -QueueJobE_2 + -QueueJobE_1 <= 0 AND (-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 + -DataOnSrc_6 <= -1 OR (-P_2579_3_6 + -P_2579_3_5 + -P_2579_3_4 + -P_2579_3_3 + -P_2579_3_2 + -P_2579_3_1 + -P_2579_1_6 + -P_2579_1_5 + -P_2579_1_4 + -P_2579... (shortened)
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 2312 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 10 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_1 + -P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_0 > 0) OR EG (-FetchJobB_6 + -FetchJobB_5 + -FetchJobB_4 + -FetchJobB_3 + -FetchJobB_2 + -FetchJobB_1 > -2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_1 + -P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_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 2312 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: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((-cJobCnt + P_1716 > 0 OR -Check_Sources_E_6 + -Check_Sources_E_5 + -Check_Sources_E_4 + -Check_Sources_E_3 + -Check_Sources_E_2 + -Check_Sources_E_1 <= -2)) OR (EF (-P_1712_4 + -P_1712_3 + -P_1712_2 + -P_1712_1 + -P_1712_0 <= -2) OR EG (-BlockedTasks > -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cJobCnt + P_1716 > 0 OR -Check_Sources_E_6 + -Check_Sources_E_5 + -Check_Sources_E_4 + -Check_Sources_E_3 + -Check_Sources_E_2 + -Check_Sources_E_1 <= -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 2312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P_1712_4 + -P_1712_3 + -P_1712_2 + -P_1712_1 + -P_1712_0 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AG (-NoSigAbort <= -3) U AG (-DisablePollingB_4_6 + P_1726 + -DisablePollingB_2_6 + -DisablePollingB_2_5 + -DisablePollingB_2_4 + -DisablePollingB_2_3 + -DisablePollingB_2_2 + -DisablePollingB_2_1 + -DisablePollingB_3_1 + -DisablePollingB_3_2 + -DisablePollingB_3_3 + -DisablePollingB_3_4 + -DisablePollingB_3_5 + -DisablePollingB_3_6 + -DisablePollingB_1_6 + -DisablePollingB_1_5 + -DisablePolling... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(!(E(TRUE U !(-NoSigAbort <= -3))) U !(E(TRUE U !(-DisablePollingB_4_6 + P_1726 + -DisablePollingB_2_6 + -DisablePollingB_2_5 + -DisablePollingB_2_4 + -DisablePollingB_2_3 + -DisablePollingB_2_2 + -DisablePollingB_2_1 + -DisablePollingB_3_1 + -DisablePollingB_3_2 + -DisablePollingB_3_3 + -DisablePollingB_3_4 + -DisablePollingB_3_5 + -DisablePollingB_3_6 + -DisablePollingB_1_6 + -DisablePollingB_1... (shortened)
lola: processed formula length: 894
lola: 11201 rewrites
lola: formula mentions 38 of 632 places; total mentions: 38
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 850 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG ((-P_1119_6_6 + -P_1119_6_5 + -P_1119_6_4 + -P_1119_6_3 + -P_1119_6_2 + -P_1119_6_1 + -P_1119_5_6 + -P_1119_5_5 + -P_1119_5_4 + -P_1119_5_3 + -P_1119_5_2 + -P_1119_5_1 + -P_1119_4_6 + -P_1119_4_5 + -P_1119_4_4 + -P_1119_4_3 + -P_1119_4_2 + -P_1119_4_1 + -P_1119_3_6 + -P_1119_3_5 + -P_1119_3_4 + -P_1119_3_3 + -P_1119_3_2 + -P_1119_3_1 + -P_1119_2_6 + -P_1119_2_5 + -P_1119_2_4 + -P_1119_2_3 + -P... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 850 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-P_1119_6_6 + -P_1119_6_5 + -P_1119_6_4 + -P_1119_6_3 + -P_1119_6_2 + -P_1119_6_1 + -P_1119_5_6 + -P_1119_5_5 + -P_1119_5_4 + -P_1119_5_3 + -P_1119_5_2 + -P_1119_5_1 + -P_1119_4_6 + -P_1119_4_5 + -P_1119_4_4 + -P_1119_4_3 + -P_1119_4_2 + -P_1119_4_1 + -P_1119_3_6 + -P_1119_3_5 + -P_1119_3_4 + -P_1119_3_3 + -P_1119_3_2 + -P_1119_3_1 + -P_1119_2_6 + -P_1119_2_5 + -P_1119_2_4 + -P_1119_2_3 + -P_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-P_1119_6_6 + -P_1119_6_5 + -P_1119_6_4 + -P_1119_6_3 + -P_1119_6_2 + -P_1119_6_1 + -P_1119_5_6 + -P_1119_5_5 + -P_1119_5_4 + -P_1119_5_3 + -P_1119_5_2 + -P_1119_5_1 + -P_1119_4_6 + -P_1119_4_5 + -P_1119_4_4 + -P_1119_4_3 + -P_1119_4_2 + -P_1119_4_1 + -P_1119_3_6 + -P_1119_3_5 + -P_1119_3_4 + -P_1119_3_3 + -P_1119_3_2 + -P_1119_3_1 + -P_1119_2_6 + -P_1119_2_5 + -P_1119_2_4 + -P_1119_... (shortened)
lola: processed formula length: 626
lola: 11199 rewrites
lola: formula mentions 42 of 632 places; total mentions: 42
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-Check_Sources_E_6 + -Check_Sources_E_5 + -Check_Sources_E_4 + -Check_Sources_E_3 + -Check_Sources_E_2 + -Check_Sources_E_1 + Try_Check_Sources_B_6 + Try_Check_Sources_B_5 + Try_Check_Sources_B_4 + Try_Check_Sources_B_3 + Try_Check_Sources_B_2 + Try_Check_Sources_B_1 <= 0 OR -P_1095 > -3) U EG (P_1727 + -TryAllocateOneTaskE_6 + -TryAllocateOneTaskE_5 + -TryAllocateOneTaskE_4 + -TryAllocateOneTa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-Check_Sources_E_6 + -Check_Sources_E_5 + -Check_Sources_E_4 + -Check_Sources_E_3 + -Check_Sources_E_2 + -Check_Sources_E_1 + Try_Check_Sources_B_6 + Try_Check_Sources_B_5 + Try_Check_Sources_B_4 + Try_Check_Sources_B_3 + Try_Check_Sources_B_2 + Try_Check_Sources_B_1 <= 0 OR -P_1095 > -3) U !(A(TRUE U !(P_1727 + -TryAllocateOneTaskE_6 + -TryAllocateOneTaskE_5 + -TryAllocateOneTaskE_4 + -TryAllo... (shortened)
lola: processed formula length: 473
lola: 11200 rewrites
lola: formula mentions 20 of 632 places; total mentions: 20
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 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 15 will run for 2549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (((-CreatedJobs_4_6 + -CreatedJobs_4_5 + -CreatedJobs_4_4 + -CreatedJobs_4_3 + -CreatedJobs_4_2 + -CreatedJobs_4_1 + -CreatedJobs_3_6 + -CreatedJobs_3_5 + -CreatedJobs_3_4 + -CreatedJobs_3_3 + -CreatedJobs_3_2 + -CreatedJobs_3_1 + -CreatedJobs_2_6 + -CreatedJobs_2_5 + -CreatedJobs_2_4 + -CreatedJobs_2_3 + -CreatedJobs_2_2 + -CreatedJobs_2_1 + -CreatedJobs_1_6 + -CreatedJobs_1_5 + -CreatedJobs_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((-CreatedJobs_4_6 + -CreatedJobs_4_5 + -CreatedJobs_4_4 + -CreatedJobs_4_3 + -CreatedJobs_4_2 + -CreatedJobs_4_1 + -CreatedJobs_3_6 + -CreatedJobs_3_5 + -CreatedJobs_3_4 + -CreatedJobs_3_3 + -CreatedJobs_3_2 + -CreatedJobs_3_1 + -CreatedJobs_2_6 + -CreatedJobs_2_5 + -CreatedJobs_2_4 + -CreatedJobs_2_3 + -CreatedJobs_2_2 + -CreatedJobs_2_1 + -CreatedJobs_1_6 + -CreatedJobs_1_5 + -CreatedJobs_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((-CreatedJobs_4_6 + -CreatedJobs_4_5 + -CreatedJobs_4_4 + -CreatedJobs_4_3 + -CreatedJobs_4_2 + -CreatedJobs_4_1 + -CreatedJobs_3_6 + -CreatedJobs_3_5 + -CreatedJobs_3_4 + -CreatedJobs_3_3 + -CreatedJobs_3_2 + -CreatedJobs_3_1 + -CreatedJobs_2_6 + -CreatedJobs_2_5 + -CreatedJobs_2_4 + -CreatedJobs_2_3 + -CreatedJobs_2_2 + -CreatedJobs_2_1 + -CreatedJobs_1_6 + -CreatedJobs_1_5 + -Crea... (shortened)
lola: processed formula length: 759
lola: 11199 rewrites
lola: formula mentions 39 of 632 places; total mentions: 39
lola: closed formula file PolyORBLF-COL-S06J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2312 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola: summary: no yes yes unknown no no unknown no unknown no yes yes no yes yes unknown

BK_STOP 1463733997391

--------------------
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="PolyORBLF-PT-S06J04T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/PolyORBLF-PT-S06J04T06.tgz
mv PolyORBLF-PT-S06J04T06 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 PolyORBLF-PT-S06J04T06, 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 r086kn-ebro-146369089000777"
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 ;