About the Execution of LoLA for PolyORBLF-PT-S06J04T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
11453.950 | 222411.00 | 222583.00 | 637.40 | ?FTFTTTFFFTFFFTT | normal |
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-3254
Executing tool lola
Input is PolyORBLF-PT-S06J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440870100518
=====================================================================
--------------------
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-LTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494725564505
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-PT-S06J04T06 @ 3540 seconds
----- Start make result stdout -----
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-LTLCardinality.task
lola: A (F (F (X (F ((IsMonitoring <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6)))))) : A (X (F (F (G ((2 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6)))))) : A (((3 <= P_1099) U X (X ((3 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6))))) : A ((X ((cPollingAbort <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_4_5 + P_2579_4_6 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_5_5 + P_2579_5_6 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_6_5 + P_2579_6_6 + P_2579_2_6 + P_2579_2_5 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_1_5 + P_2579_1_6 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4 + P_2579_3_5 + P_2579_3_6)) U G (F ((3 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4))))) : A (F ((1 <= cSources))) : A (F (X ((2 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6)))) : A (((1 <= Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6) U G (X ((1 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6))))) : A (F (X (((2 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6) U (2 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6))))) : A (X ((X ((P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_1_5 + P_1119_1_6 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_2_5 + P_1119_2_6 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_3_5 + P_1119_3_6 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_4_5 + P_1119_4_6 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_5_5 + P_1119_5_6 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_6_5 + P_1119_6_6 <= P_1727)) U (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6)))) : A (((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_4_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_1_5 + DisablePollingB_1_6 + DisablePollingB_3_6 + DisablePollingB_3_5 + DisablePollingB_3_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_2_5 + DisablePollingB_2_6 + DisablePollingB_4_6 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6) U (P_1716 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4))) : A (X (X ((PollingAbort <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6)))) : A ((2 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6)) : A (X ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 <= BlockedTasks))) : A ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6)) : A (F ((G ((Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1)) U (P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6)))) : A ((G (G ((P_1717 <= Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6))) U (1 <= P_1097)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (F ((IsMonitoring <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((IsMonitoring <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6)))))
lola: processed formula: A (F (X (F ((IsMonitoring <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6)))))
lola: processed formula length: 199
lola: 1 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 145727 markings, 322090 edges, 29145 markings/sec, 0 secs
lola: 314870 markings, 727128 edges, 33829 markings/sec, 5 secs
lola: 484700 markings, 1135390 edges, 33966 markings/sec, 10 secs
lola: 655270 markings, 1555269 edges, 34114 markings/sec, 15 secs
lola: 893587 markings, 2348388 edges, 47663 markings/sec, 20 secs
lola: 1136207 markings, 3187877 edges, 48524 markings/sec, 25 secs
lola: 1378827 markings, 4037369 edges, 48524 markings/sec, 30 secs
lola: 1622058 markings, 4874009 edges, 48646 markings/sec, 35 secs
lola: 1860190 markings, 5713743 edges, 47626 markings/sec, 40 secs
lola: 2101712 markings, 6541787 edges, 48304 markings/sec, 45 secs
lola: 2338943 markings, 7367963 edges, 47446 markings/sec, 50 secs
lola: 2576669 markings, 8234326 edges, 47545 markings/sec, 55 secs
lola: 2811210 markings, 9064899 edges, 46908 markings/sec, 60 secs
lola: 3040518 markings, 9947570 edges, 45862 markings/sec, 65 secs
lola: 3290337 markings, 10800834 edges, 49964 markings/sec, 70 secs
lola: 3532466 markings, 11637020 edges, 48426 markings/sec, 75 secs
lola: 3777701 markings, 12500623 edges, 49047 markings/sec, 80 secs
lola: 4019475 markings, 13330992 edges, 48355 markings/sec, 85 secs
lola: 4260119 markings, 14178202 edges, 48129 markings/sec, 90 secs
lola: 4500407 markings, 15006363 edges, 48058 markings/sec, 95 secs
lola: 4735962 markings, 15841367 edges, 47111 markings/sec, 100 secs
lola: 4975078 markings, 16689824 edges, 47823 markings/sec, 105 secs
lola: 5210423 markings, 17540173 edges, 47069 markings/sec, 110 secs
lola: 5442592 markings, 18422674 edges, 46434 markings/sec, 115 secs
lola: 5686658 markings, 19288381 edges, 48813 markings/sec, 120 secs
lola: 5928931 markings, 20140022 edges, 48455 markings/sec, 125 secs
lola: 6165044 markings, 20970193 edges, 47223 markings/sec, 130 secs
lola: 6401570 markings, 21824409 edges, 47305 markings/sec, 135 secs
lola: 6639431 markings, 22705527 edges, 47572 markings/sec, 140 secs
lola: 6880533 markings, 23566717 edges, 48220 markings/sec, 145 secs
lola: 7115624 markings, 24394277 edges, 47018 markings/sec, 150 secs
lola: 7356340 markings, 25238322 edges, 48143 markings/sec, 155 secs
lola: 7592128 markings, 26083220 edges, 47158 markings/sec, 160 secs
lola: 7827942 markings, 26962954 edges, 47163 markings/sec, 165 secs
lola: 8065941 markings, 27778201 edges, 47600 markings/sec, 170 secs
lola: 8305032 markings, 28628834 edges, 47818 markings/sec, 175 secs
lola: 8538488 markings, 29447258 edges, 46691 markings/sec, 180 secs
lola: 8770666 markings, 30254543 edges, 46436 markings/sec, 185 secs
lola: 9000405 markings, 31054285 edges, 45948 markings/sec, 190 secs
lola: 9229628 markings, 31875159 edges, 45845 markings/sec, 195 secs
lola: 9458436 markings, 32690901 edges, 45762 markings/sec, 200 secs
lola: 9689085 markings, 33556499 edges, 46130 markings/sec, 205 secs
lola: 9922801 markings, 34368360 edges, 46743 markings/sec, 210 secs
lola: 10154455 markings, 35171013 edges, 46331 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (G ((2 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((2 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6)))))
lola: processed formula: A (X (F (G ((2 <= RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6)))))
lola: processed formula length: 74
lola: 1 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= P_1099) U X (X ((3 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= P_1099) U X (X ((3 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6)))))
lola: processed formula: A (((3 <= P_1099) U X (X ((3 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6)))))
lola: processed formula length: 142
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((cPollingAbort <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_4_5 + P_2579_4_6 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_5_5 + P_2579_5_6 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_6_5 + P_2579_6_6 + P_2579_2_6 + P_2579_2_5 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_1_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((cPollingAbort <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_4_5 + P_2579_4_6 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_5_5 + P_2579_5_6 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_6_5 + P_2579_6_6 + P_2579_2_6 + P_2579_2_5 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_1_5 + P_2579_1_6 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4 + P_2579_3_5 + P_2579_3_6)) U G (F ((3 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4)))))
lola: processed formula: A ((X ((cPollingAbort <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_4_5 + P_2579_4_6 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_5_5 + P_2579_5_6 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_6_5 + P_2579_6_6 + P_2579_2_6 + P_2579_2_5 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_1_5 ... (shortened)
lola: processed formula length: 989
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= cSources)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((1 <= cSources)))
lola: processed formula: A (F ((1 <= cSources)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((2 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((2 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6))))
lola: processed formula: A (F (X ((2 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6) U G (X ((1 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6) U G (X ((1 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)))))
lola: processed formula: A (((1 <= Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6) U G (X ((1 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)))))
lola: processed formula length: 205
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((2 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6) U (2 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((2 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6) U (2 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)))))
lola: processed formula: A (F (X (((2 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6) U (2 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)))))
lola: processed formula length: 181
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_1_5 + P_1119_1_6 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_2_5 + P_1119_2_6 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_3_5 + P_1119_3_6 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_4_5 + P_1119_4_6 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_5_5 + P_1119_5_6 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_1_5 + P_1119_1_6 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_2_5 + P_1119_2_6 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_3_5 + P_1119_3_6 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_4_5 + P_1119_4_6 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_5_5 + P_1119_5_6 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_6_5 + P_1119_6_6 <= P_1727)) U (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6))))
lola: processed formula: A (X ((X ((P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_1_5 + P_1119_1_6 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_2_5 + P_1119_2_6 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_3_5 + P_1119_3_6 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_4_5 + P_1119_4_6 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_5_5 + P_1119_5_6 +... (shortened)
lola: processed formula length: 681
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_4_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_1_1 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_4_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_1_5 + DisablePollingB_1_6 + DisablePollingB_3_6 + DisablePollingB_3_5 + DisablePollingB_3_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_2_5 + DisablePollingB_2_6 + DisablePollingB_4_6 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6) U (P_1716 <= P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4)))
lola: processed formula: A (((DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_5_3 + DisablePollingB_5_4 + DisablePollingB_5_5 + DisablePollingB_5_6 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_6_3 + DisablePollingB_6_4 + DisablePollingB_6_5 + DisablePollingB_6_6 + DisablePollingB_4_5 + DisablePollingB_4_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_1_1 +... (shortened)
lola: processed formula length: 1039
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((PollingAbort <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((PollingAbort <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6))))
lola: processed formula: A (X (X ((PollingAbort <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6))))
lola: processed formula length: 93
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6)
lola: processed formula length: 160
lola: 1 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 829 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 <= BlockedTasks)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 <= BlockedTasks)))
lola: processed formula: A (X ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 <= BlockedTasks)))
lola: processed formula length: 167
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 13 will run for 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6)
lola: processed formula length: 312
lola: 1 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePolli... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_5_5 + DisablePollingE_5_6 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_6_5 + DisablePollingE_6_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1)) U (P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6))))
lola: processed formula: A (F ((G ((Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePolli... (shortened)
lola: processed formula length: 1175
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 3318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((P_1717 <= Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6))) U (1 <= P_1097)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (G ((P_1717 <= Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6))) U (1 <= P_1097)))
lola: processed formula: A ((G (G ((P_1717 <= Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6))) U (1 <= P_1097)))
lola: processed formula length: 159
lola: 0 rewrites
lola: formula mentions 0 of 632 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2316 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no no yes no no no yes yes yes no yes yes yes no
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494725786916
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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-3254"
echo " Executing tool lola"
echo " Input is PolyORBLF-PT-S06J04T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-smll-149440870100518"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
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 ;