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

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

=== Now, execution of the tool begins

BK_START 1463746371333

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ PolyORBNT-PT-S10J30
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-2 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-10 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-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: 12714/65536 symbol table entries, 4655 collisions
lola: preprocessing...
lola: finding significant places
lola: 664 places, 12050 transitions, 572 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2298 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J30-CTLCardinality.task
lola: read: !(AG ((2 <= mi1 OR place_522_1 <= place_522_1))) : EG (!(!((FetchJobE_1_24 + FetchJobE_1_18 + FetchJobE_1_4 + FetchJobE_1_25 + FetchJobE_1_12 + FetchJobE_1_26 + FetchJobE_1_13 + FetchJobE_1_17 + FetchJobE_1_3 + FetchJobE_1_20 + FetchJobE_1_27 + FetchJobE_1_10 + FetchJobE_1_2 + FetchJobE_1_30 + FetchJobE_1_19 + FetchJobE_1_28 + FetchJobE_1_29 + FetchJobE_1_11 + FetchJobE_1_1 + FetchJobE_1_15 + Fetc... (shortened)
lola: formula length: 15254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((FetchJobE_1_30 + FetchJobE_1_29 + FetchJobE_1_28 + FetchJobE_1_27 + FetchJobE_1_26 + FetchJobE_1_25 + FetchJobE_1_24 + FetchJobE_1_23 + FetchJobE_1_22 + FetchJobE_1_21 + FetchJobE_1_20 + FetchJobE_1_19 + FetchJobE_1_18 + FetchJobE_1_17 + FetchJobE_1_16 + FetchJobE_1_15 + FetchJobE_1_14 + FetchJobE_1_13 + FetchJobE_1_12 + FetchJobE_1_11 + FetchJobE_1_10 + FetchJobE_1_9 + FetchJobE_1_8 + FetchJ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((FetchJobE_1_30 + FetchJobE_1_29 + FetchJobE_1_28 + FetchJobE_1_27 + FetchJobE_1_26 + FetchJobE_1_25 + FetchJobE_1_24 + FetchJobE_1_23 + FetchJobE_1_22 + FetchJobE_1_21 + FetchJobE_1_20 + FetchJobE_1_19 + FetchJobE_1_18 + FetchJobE_1_17 + FetchJobE_1_16 + FetchJobE_1_15 + FetchJobE_1_14 + FetchJobE_1_13 + FetchJobE_1_12 + FetchJobE_1_11 + FetchJobE_1_10 + FetchJobE_1_9 + FetchJobE_1_8... (shortened)
lola: processed formula length: 579
lola: 84989 rewrites
lola: formula mentions 33 of 664 places; total mentions: 33
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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: AG ((AF (-place_482_1_9 + -place_482_1_8 + -place_482_1_7 + -place_482_1_6 + -place_482_1_5 + -place_482_1_4 + -place_482_1_3 + -place_482_1_2 + -place_482_1_1 + -place_482_1_10 <= -2) OR EF (-mo3 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((A(TRUE U -place_482_1_9 + -place_482_1_8 + -place_482_1_7 + -place_482_1_6 + -place_482_1_5 + -place_482_1_4 + -place_482_1_3 + -place_482_1_2 + -place_482_1_1 + -place_482_1_10 <= -2) OR E(TRUE U -mo3 <= -3)))))
lola: processed formula length: 226
lola: 84991 rewrites
lola: formula mentions 11 of 664 places; total mentions: 11
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-QueueJobE_1 <= -3 OR (FetchJobB_1 + -block > 0 AND -CreatedJobs_19_10 + -CreatedJobs_9_10 + -CreatedJobs_15_9 + -CreatedJobs_15_8 + -CreatedJobs_15_7 + -CreatedJobs_15_6 + -CreatedJobs_15_5 + -CreatedJobs_15_4 + -CreatedJobs_15_3 + -CreatedJobs_15_2 + -CreatedJobs_15_1 + -CreatedJobs_16_10 + -CreatedJobs_23_9 + -CreatedJobs_10_10 + -CreatedJobs_22_10 + -CreatedJobs_24_9 + -CreatedJobs_11_9 +... (shortened)
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 2288 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 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((EF (mo2 + -Check_Sources_B_1 <= 0) AND -FetchJobB_1 + place_462 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((E(TRUE U mo2 + -Check_Sources_B_1 <= 0) AND -FetchJobB_1 + place_462 <= 0))))
lola: processed formula length: 91
lola: 84990 rewrites
lola: formula mentions 4 of 664 places; total mentions: 4
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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 5 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((ModifiedSrc_9 + ModifiedSrc_8 + ModifiedSrc_7 + ModifiedSrc_6 + ModifiedSrc_5 + ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + ModifiedSrc_10 + -mi2 <= 0 AND (-cJobCnt <= -1 AND (place_782_1 + -block <= 0 AND mi2 + -QueueJobB_1_30 + -QueueJobB_1_29 + -QueueJobB_1_28 + -QueueJobB_1_27 + -QueueJobB_1_26 + -QueueJobB_1_25 + -QueueJobB_1_24 + -QueueJobB_1_23 + -QueueJobB_1_22 + -... (shortened)
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 2288 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 6 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (((-FetchJobB_1 <= -2 OR (-place_787_1 <= -3 OR -f1_30 + -f1_29 + -f1_28 + -f1_27 + -f1_26 + -f1_25 + -f1_24 + -f1_23 + -f1_22 + -f1_21 + -f1_20 + -f1_19 + -f1_18 + -f1_17 + -f1_16 + -f1_15 + -f1_14 + -f1_13 + -f1_12 + -f1_11 + -f1_10 + -f1_9 + -f1_8 + -f1_7 + -f1_6 + -f1_5 + -f1_4 + -f1_3 + -f1_2 + -f1_1 + -f1_0 > -2)) AND -Try_Check_Sources_B_1 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((-FetchJobB_1 <= -2 OR (-place_787_1 <= -3 OR -f1_30 + -f1_29 + -f1_28 + -f1_27 + -f1_26 + -f1_25 + -f1_24 + -f1_23 + -f1_22 + -f1_21 + -f1_20 + -f1_19 + -f1_18 + -f1_17 + -f1_16 + -f1_15 + -f1_14 + -f1_13 + -f1_12 + -f1_11 + -f1_10 + -f1_9 + -f1_8 + -f1_7 + -f1_6 + -f1_5 + -f1_4 + -f1_3 + -f1_2 + -f1_1 + -f1_0 > -2)) AND -Try_Check_Sources_B_1 <= -2))
lola: processed formula length: 364
lola: 84989 rewrites
lola: formula mentions 34 of 664 places; total mentions: 34
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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 7 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((AF (-place_482_1_9 + -place_482_1_8 + -place_482_1_7 + -place_482_1_6 + -place_482_1_5 + -place_482_1_4 + -place_482_1_3 + -place_482_1_2 + -place_482_1_1 + -place_482_1_10 <= -3) OR (-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 + -DataOnSrc_6 + -DataOnSrc_7 + -DataOnSrc_8 + -DataOnSrc_9 + -DataOnSrc_10 <= -2 AND (Perform_Work_B_1_30 + Perform_Work_B_1_29 + Perform... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (A(TRUE U -place_482_1_9 + -place_482_1_8 + -place_482_1_7 + -place_482_1_6 + -place_482_1_5 + -place_482_1_4 + -place_482_1_3 + -place_482_1_2 + -place_482_1_1 + -place_482_1_10 <= -3) OR (-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 + -DataOnSrc_6 + -DataOnSrc_7 + -DataOnSrc_8 + -DataOnSrc_9 + -DataOnSrc_10 <= -2 AND (Perform_Work_B_1_30 + Perform_Work_B_1_29... (shortened)
lola: processed formula length: 1112
lola: 84990 rewrites
lola: formula mentions 56 of 664 places; total mentions: 56
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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 8 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((Schedule_Task_B_1 + -Perform_Work_E_1 > 0 OR (-CanInjectEvent <= -3 OR FetchJobB_1 + -Try_Check_Sources_B_1 <= 0)) U AX (-NotifyEventJobQueuedB_1_9 + -NotifyEventJobQueuedB_1_8 + -NotifyEventJobQueuedB_1_7 + -NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJob... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((Schedule_Task_B_1 + -Perform_Work_E_1 > 0 OR (-CanInjectEvent <= -3 OR FetchJobB_1 + -Try_Check_Sources_B_1 <= 0)) U AX(-NotifyEventJobQueuedB_1_9 + -NotifyEventJobQueuedB_1_8 + -NotifyEventJobQueuedB_1_7 + -NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQ... (shortened)
lola: processed formula length: 1048
lola: 84990 rewrites
lola: formula mentions 36 of 664 places; total mentions: 36
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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 9 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-ModifiedSrc_9 + -ModifiedSrc_8 + -ModifiedSrc_7 + -ModifiedSrc_6 + -ModifiedSrc_5 + -ModifiedSrc_4 + -ModifiedSrc_3 + -ModifiedSrc_2 + -ModifiedSrc_1 + -ModifiedSrc_10 + place_523_1 > 0 OR (FetchJobE_1_30 + FetchJobE_1_29 + FetchJobE_1_28 + FetchJobE_1_27 + FetchJobE_1_26 + FetchJobE_1_25 + FetchJobE_1_24 + FetchJobE_1_23 + FetchJobE_1_22 + FetchJobE_1_21 + FetchJobE_1_20 + FetchJobE_1_19 + Fet... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-ModifiedSrc_9 + -ModifiedSrc_8 + -ModifiedSrc_7 + -ModifiedSrc_6 + -ModifiedSrc_5 + -ModifiedSrc_4 + -ModifiedSrc_3 + -ModifiedSrc_2 + -ModifiedSrc_1 + -ModifiedSrc_10 + place_523_1 > 0 OR (FetchJobE_1_30 + FetchJobE_1_29 + FetchJobE_1_28 + FetchJobE_1_27 + FetchJobE_1_26 + FetchJobE_1_25 + FetchJobE_1_24 + FetchJobE_1_23 + FetchJobE_1_22 + FetchJobE_1_21 + FetchJobE_1_20 + FetchJobE_1_19 + Fetc... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 4 atomic propositions
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 + -DataOnSrc_6 + -DataOnSrc_7 + -DataOnSrc_8 + -DataOnSrc_9 + -DataOnSrc_10 <= -2 OR (f2_30 + f2_29 + f2_28 + f2_27 + f2_26 + f2_25 + f2_24 + f2_23 + f2_22 + f2_21 + f2_20 + f2_19 + f2_18 + f2_17 + f2_16 + f2_15 + f2_14 + f2_13 + f2_12 + f2_11 + f2_10 + f2_9 + f2_8 + f2_7 + f2_6 + f2_5 + f2_4 + f2_3 + f2_2 + f2_1 + f2_0 + -p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file PolyORBNT-COL-S10J30-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 657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-QueueJobB_1_30 + -QueueJobB_1_29 + -QueueJobB_1_28 + -QueueJobB_1_27 + -QueueJobB_1_26 + -QueueJobB_1_25 + -QueueJobB_1_24 + -QueueJobB_1_23 + -QueueJobB_1_22 + -QueueJobB_1_21 + -QueueJobB_1_20 + -QueueJobB_1_19 + -QueueJobB_1_18 + -QueueJobB_1_17 + -QueueJobB_1_16 + -QueueJobB_1_15 + -QueueJobB_1_14 + -QueueJobB_1_13 + -QueueJobB_1_12 + -QueueJobB_1_11 + -QueueJobB_1_10 + -QueueJobB_1_9 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -QueueJobB_1_30 + -QueueJobB_1_29 + -QueueJobB_1_28 + -QueueJobB_1_27 + -QueueJobB_1_26 + -QueueJobB_1_25 + -QueueJobB_1_24 + -QueueJobB_1_23 + -QueueJobB_1_22 + -QueueJobB_1_21 + -QueueJobB_1_20 + -QueueJobB_1_19 + -QueueJobB_1_18 + -QueueJobB_1_17 + -QueueJobB_1_16 + -QueueJobB_1_15 + -QueueJobB_1_14 + -QueueJobB_1_13 + -QueueJobB_1_12 + -QueueJobB_1_11 + -QueueJobB_1_10 + -QueueJobB_1_... (shortened)
lola: processed formula length: 561
lola: 84989 rewrites
lola: formula mentions 31 of 664 places; total mentions: 31
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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 12 will run for 821 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-place_458 <= -1 U -NotifyEventEndOfCheckSourcesB_1 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-place_458 <= -1 U -NotifyEventEndOfCheckSourcesB_1 <= -2)
lola: processed formula length: 60
lola: 84989 rewrites
lola: formula mentions 2 of 664 places; total mentions: 2
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((-mo3 <= -1 AND (-mo2 <= -2 AND -place_458 > -2))) OR AG (((-cJobCnt <= -3 AND -NotifyEventJobQueuedB_1_9 + -NotifyEventJobQueuedB_1_8 + -NotifyEventJobQueuedB_1_7 + -NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_1_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-mo3 <= -1 AND (-mo2 <= -2 AND -place_458 > -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 2288 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 11 will run for 657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-cJobCnt <= -3 AND -NotifyEventJobQueuedB_1_9 + -NotifyEventJobQueuedB_1_8 + -NotifyEventJobQueuedB_1_7 + -NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_1_30 + -NotifyEventJobQueuedB_1_10 + -NotifyEventJobQueuedB_1_... (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 2288 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: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Perform_Work_B_1_30 + Perform_Work_B_1_29 + Perform_Work_B_1_28 + Perform_Work_B_1_27 + Perform_Work_B_1_26 + Perform_Work_B_1_25 + Perform_Work_B_1_24 + Perform_Work_B_1_23 + Perform_Work_B_1_22 + Perform_Work_B_1_21 + Perform_Work_B_1_20 + Perform_Work_B_1_19 + Perform_Work_B_1_18 + Perform_Work_B_1_17 + Perform_Work_B_1_16 + Perform_Work_B_1_15 + Perform_Work_B_1_14 + Perform_Work_B_1_13 + ... (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 2288 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 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG ((-Perform_Work_E_1 > -3 OR place_500_1 + -place_520_1 > 0)) AND A(-mo1 + Check_Sources_B_1 > 0 R -FetchJobE_1_30 + -FetchJobE_1_29 + -FetchJobE_1_28 + -FetchJobE_1_27 + -FetchJobE_1_26 + -FetchJobE_1_25 + -FetchJobE_1_24 + -FetchJobE_1_23 + -FetchJobE_1_22 + -FetchJobE_1_21 + -FetchJobE_1_20 + -FetchJobE_1_19 + -FetchJobE_1_18 + -FetchJobE_1_17 + -FetchJobE_1_16 + -FetchJobE_1_15 + -FetchJobE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-Perform_Work_E_1 > -3 OR place_500_1 + -place_520_1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-Perform_Work_E_1 > -3 OR place_500_1 + -place_520_1 > 0))))
lola: processed formula length: 74
lola: 84989 rewrites
lola: formula mentions 3 of 664 places; total mentions: 3
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 912 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-mo1 + Check_Sources_B_1 > 0 R -FetchJobE_1_30 + -FetchJobE_1_29 + -FetchJobE_1_28 + -FetchJobE_1_27 + -FetchJobE_1_26 + -FetchJobE_1_25 + -FetchJobE_1_24 + -FetchJobE_1_23 + -FetchJobE_1_22 + -FetchJobE_1_21 + -FetchJobE_1_20 + -FetchJobE_1_19 + -FetchJobE_1_18 + -FetchJobE_1_17 + -FetchJobE_1_16 + -FetchJobE_1_15 + -FetchJobE_1_14 + -FetchJobE_1_13 + -FetchJobE_1_12 + -FetchJobE_1_11 + -FetchJ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(-mo1 + Check_Sources_B_1 > 0) U !(-FetchJobE_1_30 + -FetchJobE_1_29 + -FetchJobE_1_28 + -FetchJobE_1_27 + -FetchJobE_1_26 + -FetchJobE_1_25 + -FetchJobE_1_24 + -FetchJobE_1_23 + -FetchJobE_1_22 + -FetchJobE_1_21 + -FetchJobE_1_20 + -FetchJobE_1_19 + -FetchJobE_1_18 + -FetchJobE_1_17 + -FetchJobE_1_16 + -FetchJobE_1_15 + -FetchJobE_1_14 + -FetchJobE_1_13 + -FetchJobE_1_12 + -FetchJobE_1_11 + ... (shortened)
lola: processed formula length: 593
lola: 84989 rewrites
lola: formula mentions 33 of 664 places; total mentions: 33
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 13 will run for 736 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EX (-place_482_1_9 + -place_482_1_8 + -place_482_1_7 + -place_482_1_6 + -place_482_1_5 + -place_482_1_4 + -place_482_1_3 + -place_482_1_2 + -place_482_1_1 + -place_482_1_10 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(EX(-place_482_1_9 + -place_482_1_8 + -place_482_1_7 + -place_482_1_6 + -place_482_1_5 + -place_482_1_4 + -place_482_1_3 + -place_482_1_2 + -place_482_1_1 + -place_482_1_10 > -3))))
lola: processed formula length: 193
lola: 84990 rewrites
lola: formula mentions 10 of 664 places; total mentions: 10
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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 14 will run for 736 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (mi3 + -Check_Sources_E_1 <= 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 !(mi3 + -Check_Sources_E_1 <= 0))))
lola: processed formula length: 55
lola: 84990 rewrites
lola: formula mentions 2 of 664 places; total mentions: 2
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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 1472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG ((-place_782_1 + FetchJobB_1 <= 0 AND NotifyEventJobQueuedB_1_9 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_30 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQue... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !((-place_782_1 + FetchJobB_1 <= 0 AND NotifyEventJobQueuedB_1_9 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_30 + NotifyEventJobQueuedB_1_10 + Not... (shortened)
lola: processed formula length: 976
lola: 84990 rewrites
lola: formula mentions 34 of 664 places; total mentions: 34
lola: closed formula file PolyORBNT-COL-S10J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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: no yes unknown yes yes yes no yes yes no unknown no unknown unknown yes unknown

BK_STOP 1463749348611

--------------------
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="PolyORBNT-PT-S10J30"
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/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 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 PolyORBNT-PT-S10J30, 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-146369089200966"
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 ;