About the Execution of LoLA for PolyORBLF-PT-S04J04T10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1748.650 | 499339.00 | 500149.00 | 1305.70 | ?FFTFTFFTF?FTFFF | 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-S04J04T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440870000473
=====================================================================
--------------------
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-S04J04T10-LTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S04J04T10-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494704174016
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-PT-S04J04T10 @ 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: 5904/65536 symbol table entries, 1496 collisions
lola: preprocessing...
lola: finding significant places
lola: 870 places, 5034 transitions, 812 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3097 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: A ((G (F ((2 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8 + Try_Check_Sources_E_9 + Try_Check_Sources_E_10))) U G (F ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10))))) : A (X (F (X (F ((2 <= 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 + QueueJobB_10_0 + QueueJobB_10_1 + QueueJobB_10_2 + QueueJobB_10_3 + QueueJobB_10_4 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 + QueueJobB_9_0 + QueueJobB_9_1 + QueueJobB_9_2 + QueueJobB_9_3 + QueueJobB_9_4)))))) : A ((((3 <= P_1160_10 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 + P_1160_8 + P_1160_9) U (2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10)) U (NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8 + NotifyEventJobCompletedB_9 <= cPollingAbort))) : A ((3 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)) : A (F (((3 <= cIsMonitoring) U (1 <= NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9)))) : A (F ((G ((AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9)) U G ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8 + TryAllocateOneTaskB_9 + TryAllocateOneTaskB_10 <= IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10))))) : A ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10 <= P_1093)) : A ((2 <= MarkerWrite)) : A (G ((3 <= CanInjectEvent))) : A (X (F ((3 <= P_1097)))) : A (G (X (((3 <= P_1155_10 + P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8 + P_1155_9) U (Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 + Idle_9 + Idle_10 <= NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9))))) : A (F (F (X ((NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9 <= SigAbort))))) : A (F (F (G (G ((3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8 + AwakeTasks_9 + AwakeTasks_10)))))) : A (X ((Insert_Source_E_10 + Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 + Insert_Source_E_9 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10))) : A (G (X (((3 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_10_0 + FetchJobE_10_1 + FetchJobE_10_2 + FetchJobE_10_3 + FetchJobE_10_4 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_7_0 + FetchJobE_7_1 + FetchJobE_7_2 + FetchJobE_7_3 + FetchJobE_7_4 + FetchJobE_8_0 + FetchJobE_8_1 + FetchJobE_8_2 + FetchJobE_8_3 + FetchJobE_8_4 + FetchJobE_9_0 + FetchJobE_9_1 + FetchJobE_9_2 + FetchJobE_9_3 + FetchJobE_9_4) U (2 <= Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 + Perform_Work_E_7 + Perform_Work_E_8 + Perform_Work_E_9 + Perform_Work_E_10))))) : A (F (X (F (F ((3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8 + AwakeTasks_9 + AwakeTasks_10))))))
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 ((G (F ((2 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8 + Try_Check_Sources_E_9 + Try_Check_Sources_E_10))) U G (F ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOn... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((2 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8 + Try_Check_Sources_E_9 + Try_Check_Sources_E_10))) U G (F ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10)))))
lola: processed formula: A ((G (F ((2 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8 + Try_Check_Sources_E_9 + Try_Check_Sources_E_10))) U G (F ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOn... (shortened)
lola: processed formula length: 752
lola: 0 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 19878 markings, 29732 edges, 3976 markings/sec, 0 secs
lola: 42461 markings, 64332 edges, 4517 markings/sec, 5 secs
lola: 64231 markings, 97845 edges, 4354 markings/sec, 10 secs
lola: 85068 markings, 129196 edges, 4167 markings/sec, 15 secs
lola: 106972 markings, 163160 edges, 4381 markings/sec, 20 secs
lola: 127907 markings, 194079 edges, 4187 markings/sec, 25 secs
lola: 147505 markings, 223034 edges, 3920 markings/sec, 30 secs
lola: 168348 markings, 254970 edges, 4169 markings/sec, 35 secs
lola: 189456 markings, 287263 edges, 4222 markings/sec, 40 secs
lola: 209929 markings, 318096 edges, 4095 markings/sec, 45 secs
lola: 231655 markings, 351743 edges, 4345 markings/sec, 50 secs
lola: 253281 markings, 384002 edges, 4325 markings/sec, 55 secs
lola: 273599 markings, 414334 edges, 4064 markings/sec, 60 secs
lola: 293284 markings, 443622 edges, 3937 markings/sec, 65 secs
lola: 314487 markings, 475408 edges, 4241 markings/sec, 70 secs
lola: 333839 markings, 504965 edges, 3870 markings/sec, 75 secs
lola: 356164 markings, 539493 edges, 4465 markings/sec, 80 secs
lola: 376076 markings, 569419 edges, 3982 markings/sec, 85 secs
lola: 397298 markings, 601848 edges, 4244 markings/sec, 90 secs
lola: 418828 markings, 634307 edges, 4306 markings/sec, 95 secs
lola: 439991 markings, 666426 edges, 4233 markings/sec, 100 secs
lola: 459769 markings, 696171 edges, 3956 markings/sec, 105 secs
lola: 482314 markings, 731722 edges, 4509 markings/sec, 110 secs
lola: 502665 markings, 762428 edges, 4070 markings/sec, 115 secs
lola: 524249 markings, 794846 edges, 4317 markings/sec, 120 secs
lola: 543243 markings, 821903 edges, 3799 markings/sec, 125 secs
lola: 563419 markings, 853305 edges, 4035 markings/sec, 130 secs
lola: 584293 markings, 884338 edges, 4175 markings/sec, 135 secs
lola: 604040 markings, 913374 edges, 3949 markings/sec, 140 secs
lola: 625778 markings, 946439 edges, 4348 markings/sec, 145 secs
lola: 645946 markings, 977460 edges, 4034 markings/sec, 150 secs
lola: 667030 markings, 1010030 edges, 4217 markings/sec, 155 secs
lola: 688119 markings, 1041539 edges, 4218 markings/sec, 160 secs
lola: 707803 markings, 1070236 edges, 3937 markings/sec, 165 secs
lola: 728524 markings, 1100811 edges, 4144 markings/sec, 170 secs
lola: 750423 markings, 1134452 edges, 4380 markings/sec, 175 secs
lola: 771302 markings, 1165905 edges, 4176 markings/sec, 180 secs
lola: 792390 markings, 1199336 edges, 4218 markings/sec, 185 secs
lola: 812636 markings, 1229826 edges, 4049 markings/sec, 190 secs
lola: 831706 markings, 1257482 edges, 3814 markings/sec, 195 secs
lola: 850476 markings, 1285782 edges, 3754 markings/sec, 200 secs
lola: 871025 markings, 1316950 edges, 4110 markings/sec, 205 secs
lola: 890746 markings, 1346796 edges, 3944 markings/sec, 210 secs
lola: 909747 markings, 1375238 edges, 3800 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 (X (F ((2 <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X (F ((2 <= 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 + QueueJobB_10_0 + QueueJobB_10_1 + QueueJobB_10_2 + QueueJobB_10_3 + QueueJobB_10_4 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 + QueueJobB_9_0 + QueueJobB_9_1 + QueueJobB_9_2 + QueueJobB_9_3 + QueueJobB_9_4))))))
lola: processed formula: A (X (F (X (F ((2 <= 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... (shortened)
lola: processed formula length: 829
lola: 0 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 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_1160_10 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 + P_1160_8 + P_1160_9) U (2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10)) U (NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEvent... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= P_1160_10 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 + P_1160_8 + P_1160_9) U (2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10)) U (NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8 + NotifyEventJobCompletedB_9 <= cPollingAbort)))
lola: processed formula: A ((((3 <= P_1160_10 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 + P_1160_8 + P_1160_9) U (2 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + P_1158_9 + P_1158_10)) U (NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEvent... (shortened)
lola: processed formula length: 551
lola: 0 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 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 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)
lola: processed formula length: 115
lola: 1 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-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 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= cIsMonitoring) U (1 <= NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((3 <= cIsMonitoring) U (1 <= NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9))))
lola: processed formula: A (F (((3 <= cIsMonitoring) U (1 <= NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9))))
lola: processed formula length: 378
lola: 0 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 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: 13394 markings, 16134 edges, 2679 markings/sec, 0 secs
lola: 26441 markings, 31946 edges, 2609 markings/sec, 5 secs
lola: 39782 markings, 48989 edges, 2668 markings/sec, 10 secs
lola: 52340 markings, 66435 edges, 2512 markings/sec, 15 secs
lola: 65126 markings, 83942 edges, 2557 markings/sec, 20 secs
lola: 77666 markings, 102544 edges, 2508 markings/sec, 25 secs
lola: 90566 markings, 120004 edges, 2580 markings/sec, 30 secs
lola: 103207 markings, 137550 edges, 2528 markings/sec, 35 secs
lola: 115164 markings, 155464 edges, 2391 markings/sec, 40 secs
lola: 126695 markings, 171208 edges, 2306 markings/sec, 45 secs
lola: 137933 markings, 188048 edges, 2248 markings/sec, 50 secs
lola: 149740 markings, 204221 edges, 2361 markings/sec, 55 secs
lola: 160707 markings, 220902 edges, 2193 markings/sec, 60 secs
lola: 172141 markings, 237393 edges, 2287 markings/sec, 65 secs
lola: 183822 markings, 254264 edges, 2336 markings/sec, 70 secs
lola: 194890 markings, 272491 edges, 2214 markings/sec, 75 secs
lola: 206634 markings, 288848 edges, 2349 markings/sec, 80 secs
lola: 219157 markings, 305688 edges, 2505 markings/sec, 85 secs
lola: 229987 markings, 322394 edges, 2166 markings/sec, 90 secs
lola: 242240 markings, 339021 edges, 2451 markings/sec, 95 secs
lola: 254539 markings, 355891 edges, 2460 markings/sec, 100 secs
lola: 266352 markings, 373531 edges, 2363 markings/sec, 105 secs
lola: 278306 markings, 389607 edges, 2391 markings/sec, 110 secs
lola: 289577 markings, 406166 edges, 2254 markings/sec, 115 secs
lola: 301125 markings, 422564 edges, 2310 markings/sec, 120 secs
lola: 313438 markings, 438551 edges, 2463 markings/sec, 125 secs
lola: 324415 markings, 455340 edges, 2195 markings/sec, 130 secs
lola: 335560 markings, 471953 edges, 2229 markings/sec, 135 secs
lola: 345983 markings, 490603 edges, 2085 markings/sec, 140 secs
lola: 358668 markings, 507959 edges, 2537 markings/sec, 145 secs
lola: 370780 markings, 526031 edges, 2422 markings/sec, 150 secs
lola: 383494 markings, 543461 edges, 2543 markings/sec, 155 secs
lola: 395927 markings, 560921 edges, 2487 markings/sec, 160 secs
lola: 408582 markings, 578940 edges, 2531 markings/sec, 165 secs
lola: 421241 markings, 597219 edges, 2532 markings/sec, 170 secs
lola: 433021 markings, 617146 edges, 2356 markings/sec, 175 secs
lola: 446192 markings, 635819 edges, 2634 markings/sec, 180 secs
lola: 458960 markings, 654910 edges, 2554 markings/sec, 185 secs
lola: 473251 markings, 673533 edges, 2858 markings/sec, 190 secs
lola: 485744 markings, 692133 edges, 2499 markings/sec, 195 secs
lola: 498766 markings, 711336 edges, 2604 markings/sec, 200 secs
lola: 510618 markings, 731669 edges, 2370 markings/sec, 205 secs
lola: 523546 markings, 749263 edges, 2586 markings/sec, 210 secs
lola: 535974 markings, 767849 edges, 2486 markings/sec, 215 secs
lola: 549990 markings, 786706 edges, 2803 markings/sec, 220 secs
lola: 561525 markings, 804815 edges, 2307 markings/sec, 225 secs
lola: 573757 markings, 822247 edges, 2446 markings/sec, 230 secs
lola: 586666 markings, 839895 edges, 2582 markings/sec, 235 secs
lola: 597336 markings, 858937 edges, 2134 markings/sec, 240 secs
lola: 611018 markings, 877522 edges, 2736 markings/sec, 245 secs
lola: 623601 markings, 896311 edges, 2517 markings/sec, 250 secs
lola: 636263 markings, 914960 edges, 2532 markings/sec, 255 secs
lola: 648790 markings, 931784 edges, 2505 markings/sec, 260 secs
lola: 660545 markings, 948797 edges, 2351 markings/sec, 265 secs
lola: 672906 markings, 968954 edges, 2472 markings/sec, 270 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9)) U G ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8 + TryA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9)) U G ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8 + TryAllocateOneTaskB_9 + TryAllocateOneTaskB_10 <= IdleTasks_9 + IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 + IdleTasks_10)))))
lola: processed formula: A (F ((G ((AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 <= RunB_10 + RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 + RunB_9)) U G ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8 + TryA... (shortened)
lola: processed formula length: 589
lola: 0 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 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: subprocess 6 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10 <= P_1093))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10 <= P_1093)
lola: processed formula length: 190
lola: 1 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-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 7 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= MarkerWrite))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= MarkerWrite)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-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 8 will run for 380 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= CanInjectEvent)))
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 3248 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 434 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((3 <= P_1097))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= P_1097))))
lola: processed formula: A (X (F ((3 <= P_1097))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 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 10 will run for 507 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((3 <= P_1155_10 + P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8 + P_1155_9) U (Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 + Idle_9 + Idle_10 <= NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEv... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((3 <= P_1155_10 + P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8 + P_1155_9) U (Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 + Idle_9 + Idle_10 <= NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9)))))
lola: processed formula: A (G (X (((3 <= P_1155_10 + P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8 + P_1155_9) U (Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 + Idle_9 + Idle_10 <= NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEv... (shortened)
lola: processed formula length: 564
lola: 0 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 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 11 will run for 608 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9 <= SigAbort)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9 <= SigAbort))))
lola: processed formula: A (F (X ((NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9 <= SigAbort))))
lola: processed formula length: 364
lola: 1 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 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 12 will run for 760 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (G ((3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8 + AwakeTasks_9 + AwakeTasks_10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G ((3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8 + AwakeTasks_9 + AwakeTasks_10)))))
lola: processed formula: A (F (G (G ((3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8 + AwakeTasks_9 + AwakeTasks_10)))))
lola: processed formula length: 171
lola: 1 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 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: subprocess 13 will run for 1013 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Insert_Source_E_10 + Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 + Insert_Source_E_9 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEve... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((Insert_Source_E_10 + Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 + Insert_Source_E_9 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10)))
lola: processed formula: A (X ((Insert_Source_E_10 + Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 + Insert_Source_E_9 <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEve... (shortened)
lola: processed formula length: 470
lola: 0 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 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 14 will run for 1520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((3 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((3 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_10_0 + FetchJobE_10_1 + FetchJobE_10_2 + FetchJobE_10_3 + FetchJobE_10_4 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_7_0 + FetchJobE_7_1 + FetchJobE_7_2 + FetchJobE_7_3 + FetchJobE_7_4 + FetchJobE_8_0 + FetchJobE_8_1 + FetchJobE_8_2 + FetchJobE_8_3 + FetchJobE_8_4 + FetchJobE_9_0 + FetchJobE_9_1 + FetchJobE_9_2 + FetchJobE_9_3 + FetchJobE_9_4) U (2 <= Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 + Perform_Work_E_7 + Perform_Work_E_8 + Perform_Work_E_9 + Perform_Work_E_10)))))
lola: processed formula: A (G (X (((3 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + ... (shortened)
lola: processed formula length: 1021
lola: 0 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 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 15 will run for 3041 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (F ((3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8 + AwakeTasks_9 + AwakeTasks_10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8 + AwakeTasks_9 + AwakeTasks_10)))))
lola: processed formula: A (F (X (F ((3 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8 + AwakeTasks_9 + AwakeTasks_10)))))
lola: processed formula length: 171
lola: 1 rewrites
lola: formula mentions 0 of 870 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3252 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: RESULT
lola:
SUMMARY: unknown no yes no unknown no yes no no no no yes no yes no no
lola: ========================================
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494704673355
--------------------
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-S04J04T10"
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-S04J04T10.tgz
mv PolyORBLF-PT-S04J04T10 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-S04J04T10, 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-149440870000473"
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 ;