About the Execution of LoLA for S_PolyORBLF-PT-S02J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15952.850 | 1505862.00 | 2299146.00 | 4987.00 | ?F??FFF??TTTFT?F | 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 S_PolyORBLF-PT-S02J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681600426
=====================================================================
--------------------
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-S02J04T06-CTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S02J04T06-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496445707749
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBLF-PT-S02J04T06: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_PolyORBLF-PT-S02J04T06: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PolyORBLF-PT-S02J04T06 @ 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: 1396/65536 symbol table entries, 7 collisions
lola: preprocessing...
lola: finding significant places
lola: 476 places, 920 transitions, 430 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1243 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: A (X (E (F ((2 <= MarkerWrite))))) : A (G ((NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6))) : A (G (((P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + 1 <= PlaceSources_1 + PlaceSources_2) OR (P_1716 <= cSources) OR (cIdleTasks <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) OR (FetchJobB_5 + FetchJobB_4 + FetchJobB_3 + FetchJobB_2 + FetchJobB_1 + FetchJobB_6 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) OR (1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6)))) : E (G (NOT(E (G ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 <= cIsMonitoring)))))) : NOT(A (((P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4) U ((NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 <= 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) AND (1 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4))))) : NOT(NOT(E (G (((ModifiedSrc_1 + ModifiedSrc_2 <= cBlockedTasks) OR (1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6)))))) : E (G ((((3 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6) AND (Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)) OR (JobCnt <= 0) OR ((2 <= AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0) AND (1 <= 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))))) : (E ((((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_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4) AND (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_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6)) U (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6))) AND E (((MarkerWrite <= 2) U (Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 <= 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)))) : A (G (E (((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6) U (DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_2_2 + DisablePollingB_2_1 + DisablePollingB_4_2 <= MarkerRead))))) : (NOT((((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 <= NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6) AND (2 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6) AND (Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 + 1 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6)) OR A (G ((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1 <= 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_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4))))) AND A (G (((DataOnSrc_1 + DataOnSrc_2 <= 1) OR (RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 <= 2))))) : E (F (NOT(E (G ((P_1097 <= PollingAbort)))))) : E (F ((3 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6))) : ((A (G ((NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 <= P_1726))) AND ((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 <= 1) AND (TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 <= 0) AND (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 <= 1))) AND A ((((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) OR (1 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6)) U (P_1727 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)))) : (A (G (A (X ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6))))) AND (Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= NoSigAbort)) : (NOT(A (G (((1 <= cJobCnt) OR (Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= 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))))) OR (2 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2)) : A (X (E (F ((3 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6)))))
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 (X (E (F ((2 <= MarkerWrite)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (2 <= MarkerWrite)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 956881 markings, 1319862 edges, 2865133787937767424 markings/sec, 0 secs
lola: 1761601 markings, 2575749 edges, 160944 markings/sec, 5 secs
lola: 2506258 markings, 3826075 edges, 148931 markings/sec, 10 secs
lola: 3220641 markings, 5068228 edges, 142877 markings/sec, 15 secs
lola: 3932520 markings, 6304170 edges, 142376 markings/sec, 20 secs
lola: 4612061 markings, 7540558 edges, 135908 markings/sec, 25 secs
lola: 5290232 markings, 8793127 edges, 135634 markings/sec, 30 secs
lola: 5953259 markings, 10070848 edges, 132605 markings/sec, 35 secs
lola: 6602457 markings, 11316037 edges, 129840 markings/sec, 40 secs
lola: 7232246 markings, 12572994 edges, 125958 markings/sec, 45 secs
lola: 7864312 markings, 13843478 edges, 126413 markings/sec, 50 secs
lola: 8490870 markings, 15128946 edges, 125312 markings/sec, 55 secs
lola: 9111853 markings, 16404274 edges, 124197 markings/sec, 60 secs
lola: 9733667 markings, 17636054 edges, 124363 markings/sec, 65 secs
lola: 10350133 markings, 18946823 edges, 123293 markings/sec, 70 secs
lola: 10958896 markings, 20171858 edges, 121753 markings/sec, 75 secs
lola: 11552499 markings, 21492699 edges, 118721 markings/sec, 80 secs
lola: 12172753 markings, 22781445 edges, 124051 markings/sec, 85 secs
lola: 12789796 markings, 24064540 edges, 123409 markings/sec, 90 secs
lola: 13423511 markings, 25392030 edges, 126743 markings/sec, 95 secs
lola: 14020684 markings, 26824179 edges, 119435 markings/sec, 100 secs
lola: 14622795 markings, 28164732 edges, 120422 markings/sec, 105 secs
lola: 15255801 markings, 29505473 edges, 126601 markings/sec, 110 secs
lola: 15864068 markings, 30890088 edges, 121653 markings/sec, 115 secs
lola: 16477466 markings, 32216452 edges, 122680 markings/sec, 120 secs
lola: 17086769 markings, 33612022 edges, 121861 markings/sec, 125 secs
lola: 17722338 markings, 34908728 edges, 127114 markings/sec, 130 secs
lola: 18332547 markings, 36301669 edges, 122042 markings/sec, 135 secs
lola: 18913026 markings, 37670254 edges, 116096 markings/sec, 140 secs
lola: 19510326 markings, 39112478 edges, 119460 markings/sec, 145 secs
lola: 20127043 markings, 40615565 edges, 123343 markings/sec, 150 secs
lola: 20741720 markings, 42018007 edges, 122935 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + 1 <= PlaceSources_1 + PlaceSources_2) OR (P_1716 <= cSources) OR (cIdleTasks <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) OR (FetchJobB_5 + FetchJobB_4 + FetchJobB_3 + FetchJobB_2 + FetchJobB_1 + FetchJobB_6 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T06-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 158647 markings, 181505 edges, 31729 markings/sec, 0 secs
lola: sara is running 5 secs || 320488 markings, 368540 edges, 32368 markings/sec, 5 secs
lola: sara is running 10 secs || 478856 markings, 552074 edges, 31674 markings/sec, 10 secs
lola: sara is running 15 secs || 639163 markings, 738336 edges, 32061 markings/sec, 15 secs
lola: sara is running 20 secs || 798925 markings, 925808 edges, 31952 markings/sec, 20 secs
lola: sara is running 25 secs || 957989 markings, 1113753 edges, 31813 markings/sec, 25 secs
lola: sara is running 30 secs || 1116545 markings, 1301842 edges, 31711 markings/sec, 30 secs
lola: sara is running 35 secs || 1273988 markings, 1488481 edges, 31489 markings/sec, 35 secs
lola: sara is running 40 secs || 1431361 markings, 1675632 edges, 31475 markings/sec, 40 secs
lola: sara is running 45 secs || 1581531 markings, 1855315 edges, 30034 markings/sec, 45 secs
lola: sara is running 50 secs || 1732283 markings, 2035658 edges, 30150 markings/sec, 50 secs
lola: sara is running 55 secs || 1882357 markings, 2215788 edges, 30015 markings/sec, 55 secs
lola: sara is running 60 secs || 2032646 markings, 2395009 edges, 30058 markings/sec, 60 secs
lola: sara is running 65 secs || 2181862 markings, 2576209 edges, 29843 markings/sec, 65 secs
lola: sara is running 70 secs || 2330634 markings, 2757196 edges, 29754 markings/sec, 70 secs
lola: sara is running 75 secs || 2479416 markings, 2937550 edges, 29756 markings/sec, 75 secs
lola: sara is running 80 secs || 2627806 markings, 3116609 edges, 29678 markings/sec, 80 secs
lola: sara is running 85 secs || 2775898 markings, 3295580 edges, 29618 markings/sec, 85 secs
lola: sara is running 90 secs || 2923190 markings, 3474524 edges, 29458 markings/sec, 90 secs
lola: sara is running 95 secs || 3070055 markings, 3652005 edges, 29373 markings/sec, 95 secs
lola: sara is running 100 secs || 3218068 markings, 3831894 edges, 29603 markings/sec, 100 secs
lola: sara is running 105 secs || 3365372 markings, 4011025 edges, 29461 markings/sec, 105 secs
lola: sara is running 110 secs || 3512002 markings, 4189292 edges, 29326 markings/sec, 110 secs
lola: sara is running 115 secs || 3658290 markings, 4368185 edges, 29258 markings/sec, 115 secs
lola: sara is running 120 secs || 3804838 markings, 4547138 edges, 29310 markings/sec, 120 secs
lola: sara is running 125 secs || 3951787 markings, 4725488 edges, 29390 markings/sec, 125 secs
lola: sara is running 130 secs || 4098583 markings, 4901656 edges, 29359 markings/sec, 130 secs
lola: sara is running 135 secs || 4244626 markings, 5081358 edges, 29209 markings/sec, 135 secs
lola: sara is running 140 secs || 4390458 markings, 5259842 edges, 29166 markings/sec, 140 secs
lola: sara is running 145 secs || 4536140 markings, 5438210 edges, 29136 markings/sec, 145 secs
lola: sara is running 150 secs || 4680943 markings, 5615002 edges, 28961 markings/sec, 150 secs
lola: sara is running 155 secs || 4825745 markings, 5793838 edges, 28960 markings/sec, 155 secs
lola: sara is running 160 secs || 4969865 markings, 5971217 edges, 28824 markings/sec, 160 secs
lola: sara is running 165 secs || 5113777 markings, 6148943 edges, 28782 markings/sec, 165 secs
lola: sara is running 170 secs || 5258247 markings, 6328191 edges, 28894 markings/sec, 170 secs
lola: sara is running 175 secs || 5403235 markings, 6506446 edges, 28998 markings/sec, 175 secs
lola: sara is running 180 secs || 5546394 markings, 6684353 edges, 28632 markings/sec, 180 secs
lola: sara is running 185 secs || 5689779 markings, 6861236 edges, 28677 markings/sec, 185 secs
lola: sara is running 190 secs || 5833572 markings, 7039369 edges, 28759 markings/sec, 190 secs
lola: sara is running 195 secs || 5978515 markings, 7220067 edges, 28989 markings/sec, 195 secs
lola: sara is running 200 secs || 6121933 markings, 7401325 edges, 28684 markings/sec, 200 secs
lola: sara is running 205 secs || 6264999 markings, 7580593 edges, 28613 markings/sec, 205 secs
lola: sara is running 210 secs || 6408832 markings, 7760498 edges, 28767 markings/sec, 210 secs
lola: sara is running 215 secs || 6553857 markings, 7944632 edges, 29005 markings/sec, 215 secs
lola: sara is running 220 secs || 6697228 markings, 8126172 edges, 28674 markings/sec, 220 secs
lola: sara is running 225 secs || 6841559 markings, 8308291 edges, 28866 markings/sec, 225 secs
lola: sara is running 230 secs || 6985530 markings, 8490535 edges, 28794 markings/sec, 230 secs
lola: sara is running 235 secs || 7129236 markings, 8674661 edges, 28741 markings/sec, 235 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (G ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 <= cIsMonitoring))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (cIsMonitoring + 1 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6)))))
lola: processed formula length: 194
lola: 5 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 877168 markings, 1618834 edges, 173787 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (((P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueu... (shortened)
lola: processed formula length: 1637
lola: 7 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G (((ModifiedSrc_1 + ModifiedSrc_2 <= cBlockedTasks) OR (1 <= NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((cBlockedTasks + 1 <= ModifiedSrc_1 + ModifiedSrc_2) AND (NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 <= 0))))
lola: processed formula length: 252
lola: 8 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((3 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6) AND (Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)) OR (JobCnt <= 0) OR ((2 <= AvailableJobId_4 + Ava... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 <= 2) OR (P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6 + 1 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6)) AND (1 <= JobCnt) AND ((AvailableJobId_4... (shortened)
lola: processed formula length: 975
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((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_... (shortened)
lola: processed formula length: 2143
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((MarkerWrite <= 2) U (Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 <= 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)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((MarkerWrite <= 2) U (Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 <= 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))
lola: processed formula length: 234
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6) U (DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + DisablePollingB_3_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6) U (DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + DisablePoll... (shortened)
lola: processed formula length: 537
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 779734 markings, 1662284 edges, 2977824658813878272 markings/sec, 0 secs
lola: 1479501 markings, 3190406 edges, 139953 markings/sec, 5 secs
lola: 2154906 markings, 4679035 edges, 135081 markings/sec, 10 secs
lola: 2806391 markings, 6128552 edges, 130297 markings/sec, 15 secs
lola: 3463150 markings, 7599880 edges, 131352 markings/sec, 20 secs
lola: 4118580 markings, 9076886 edges, 131086 markings/sec, 25 secs
lola: 4783728 markings, 10588528 edges, 133030 markings/sec, 30 secs
lola: 5447782 markings, 12100916 edges, 132811 markings/sec, 35 secs
lola: 6113471 markings, 13637080 edges, 133138 markings/sec, 40 secs
lola: 6786418 markings, 15226616 edges, 134589 markings/sec, 45 secs
lola: 7454233 markings, 16800785 edges, 133563 markings/sec, 50 secs
lola: 8106016 markings, 18353856 edges, 130357 markings/sec, 55 secs
lola: 8772249 markings, 19974343 edges, 133247 markings/sec, 60 secs
lola: 9431235 markings, 21578901 edges, 131797 markings/sec, 65 secs
lola: 10048474 markings, 23104269 edges, 123448 markings/sec, 70 secs
lola: 10677101 markings, 24672781 edges, 125725 markings/sec, 75 secs
lola: 11311327 markings, 26322719 edges, 126845 markings/sec, 80 secs
lola: 11930812 markings, 27901507 edges, 123897 markings/sec, 85 secs
lola: 12545607 markings, 29484408 edges, 122959 markings/sec, 90 secs
lola: 13156829 markings, 31039987 edges, 122244 markings/sec, 95 secs
lola: 13764152 markings, 32701721 edges, 121465 markings/sec, 100 secs
lola: 14357832 markings, 34197400 edges, 118736 markings/sec, 105 secs
lola: 14968413 markings, 35826738 edges, 122116 markings/sec, 110 secs
lola: 15564778 markings, 37477545 edges, 119273 markings/sec, 115 secs
lola: 16145314 markings, 39147724 edges, 116107 markings/sec, 120 secs
lola: 16725535 markings, 40707601 edges, 116044 markings/sec, 125 secs
lola: 17288637 markings, 42169056 edges, 112620 markings/sec, 130 secs
lola: 17843470 markings, 43602439 edges, 110967 markings/sec, 135 secs
lola: 18384100 markings, 44997667 edges, 108126 markings/sec, 140 secs
lola: 18900843 markings, 46271096 edges, 103349 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 <= NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6) AND (2 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePolling... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6 + 1 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + E... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6 + 1 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + E... (shortened)
lola: processed formula length: 620
lola: 6 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: processed formula with 3 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: subprocess 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((DataOnSrc_1 + DataOnSrc_2 <= 1) OR (RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: ========================================SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (G ((P_1097 <= PollingAbort))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (PollingAbort + 1 <= P_1097)))
lola: processed formula length: 48
lola: 5 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 515971 markings, 1596093 edges, 2865133787937767424 markings/sec, 0 secs
lola: 986806 markings, 3074844 edges, 94167 markings/sec, 5 secs
lola: 1440964 markings, 4510331 edges, 90832 markings/sec, 10 secs
lola: 1885991 markings, 5923590 edges, 89005 markings/sec, 15 secs
lola: 2324518 markings, 7321872 edges, 87705 markings/sec, 20 secs
lola: 2757786 markings, 8704215 edges, 86654 markings/sec, 25 secs
lola: 3199823 markings, 10115259 edges, 88407 markings/sec, 30 secs
lola: 3636414 markings, 11513924 edges, 87318 markings/sec, 35 secs
lola: 4067825 markings, 12899406 edges, 86282 markings/sec, 40 secs
lola: 4499075 markings, 14285510 edges, 86250 markings/sec, 45 secs
lola: 4942449 markings, 15721404 edges, 88675 markings/sec, 50 secs
lola: 5379526 markings, 17151532 edges, 87415 markings/sec, 55 secs
lola: 5816382 markings, 18591394 edges, 87371 markings/sec, 60 secs
lola: 6253855 markings, 20019284 edges, 87495 markings/sec, 65 secs
lola: 6688658 markings, 21476196 edges, 86961 markings/sec, 70 secs
lola: 7123273 markings, 22930861 edges, 86923 markings/sec, 75 secs
lola: 7549373 markings, 24343774 edges, 85220 markings/sec, 80 secs
lola: 7981766 markings, 25800455 edges, 86479 markings/sec, 85 secs
lola: 8416175 markings, 27252467 edges, 86882 markings/sec, 90 secs
lola: 8849968 markings, 28709671 edges, 86759 markings/sec, 95 secs
lola: 9282925 markings, 30156255 edges, 86591 markings/sec, 100 secs
lola: 9716406 markings, 31623136 edges, 86696 markings/sec, 105 secs
lola: 10151652 markings, 33104786 edges, 87049 markings/sec, 110 secs
lola: 10583233 markings, 34581797 edges, 86316 markings/sec, 115 secs
lola: 11022971 markings, 36125300 edges, 87948 markings/sec, 120 secs
lola: 11413161 markings, 37490239 edges, 78038 markings/sec, 125 secs
lola: 11835382 markings, 38926244 edges, 84444 markings/sec, 130 secs
lola: 12255794 markings, 40373922 edges, 84082 markings/sec, 135 secs
lola: 12673410 markings, 41803348 edges, 83523 markings/sec, 140 secs
lola: 13104049 markings, 43315810 edges, 86128 markings/sec, 145 secs
lola: 13522128 markings, 44784082 edges, 83616 markings/sec, 150 secs
lola: 13920378 markings, 46202394 edges, 79650 markings/sec, 155 secs
lola: 14342235 markings, 47731341 edges, 84371 markings/sec, 160 secs
lola: 14740969 markings, 49159801 edges, 79747 markings/sec, 165 secs
lola: 15145206 markings, 50618019 edges, 80847 markings/sec, 170 secs
lola: 15545939 markings, 52035894 edges, 80147 markings/sec, 175 secs
lola: 15943631 markings, 53471512 edges, 79538 markings/sec, 180 secs
lola: 16338354 markings, 54868568 edges, 78945 markings/sec, 185 secs
lola: 16726958 markings, 56277991 edges, 77721 markings/sec, 190 secs
lola: 17128080 markings, 57671275 edges, 80224 markings/sec, 195 secs
lola: 17513683 markings, 58993988 edges, 77121 markings/sec, 200 secs
lola: 17891801 markings, 60316001 edges, 75624 markings/sec, 205 secs
lola: 18253592 markings, 61562282 edges, 72358 markings/sec, 210 secs
lola: 18597909 markings, 62739291 edges, 68863 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 549 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T06-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 157566 markings, 187211 edges, 31513 markings/sec, 0 secs
lola: sara is running 5 secs || 312166 markings, 373099 edges, 30920 markings/sec, 5 secs
lola: sara is running 10 secs || 465839 markings, 557842 edges, 30735 markings/sec, 10 secs
lola: sara is running 15 secs || 618537 markings, 742599 edges, 30540 markings/sec, 15 secs
lola: sara is running 20 secs || 770410 markings, 926670 edges, 30375 markings/sec, 20 secs
lola: sara is running 25 secs || 921604 markings, 1109707 edges, 30239 markings/sec, 25 secs
lola: sara is running 30 secs || 1072482 markings, 1292152 edges, 30176 markings/sec, 30 secs
lola: sara is running 35 secs || 1223446 markings, 1474591 edges, 30193 markings/sec, 35 secs
lola: sara is running 40 secs || 1373685 markings, 1656644 edges, 30048 markings/sec, 40 secs
lola: sara is running 45 secs || 1523572 markings, 1838240 edges, 29977 markings/sec, 45 secs
lola: sara is running 50 secs || 1673352 markings, 2019729 edges, 29956 markings/sec, 50 secs
lola: sara is running 55 secs || 1822897 markings, 2201161 edges, 29909 markings/sec, 55 secs
lola: sara is running 60 secs || 1971993 markings, 2382461 edges, 29819 markings/sec, 60 secs
lola: sara is running 65 secs || 2121155 markings, 2563473 edges, 29832 markings/sec, 65 secs
lola: sara is running 70 secs || 2270371 markings, 2744503 edges, 29843 markings/sec, 70 secs
lola: sara is running 75 secs || 2419573 markings, 2925335 edges, 29840 markings/sec, 75 secs
lola: sara is running 80 secs || 2570038 markings, 3106652 edges, 30093 markings/sec, 80 secs
lola: sara is running 85 secs || 2721194 markings, 3290141 edges, 30231 markings/sec, 85 secs
lola: sara is running 90 secs || 2873167 markings, 3472081 edges, 30395 markings/sec, 90 secs
lola: sara is running 95 secs || 3024703 markings, 3652323 edges, 30307 markings/sec, 95 secs
lola: sara is running 100 secs || 3172307 markings, 3829583 edges, 29521 markings/sec, 100 secs
lola: sara is running 105 secs || 3320210 markings, 4005476 edges, 29581 markings/sec, 105 secs
lola: sara is running 110 secs || 3468018 markings, 4181276 edges, 29562 markings/sec, 110 secs
lola: sara is running 115 secs || 3617015 markings, 4358052 edges, 29799 markings/sec, 115 secs
lola: sara is running 120 secs || 3768137 markings, 4536575 edges, 30224 markings/sec, 120 secs
lola: sara is running 125 secs || 3918323 markings, 4713455 edges, 30037 markings/sec, 125 secs
lola: sara is running 130 secs || 4069495 markings, 4892821 edges, 30234 markings/sec, 130 secs
lola: sara is running 135 secs || 4220032 markings, 5071993 edges, 30107 markings/sec, 135 secs
lola: sara is running 140 secs || 4370095 markings, 5249345 edges, 30013 markings/sec, 140 secs
lola: sara is running 145 secs || 4520741 markings, 5426411 edges, 30129 markings/sec, 145 secs
lola: sara is running 150 secs || 4668490 markings, 5601526 edges, 29550 markings/sec, 150 secs
lola: sara is running 155 secs || 4817829 markings, 5778119 edges, 29868 markings/sec, 155 secs
lola: sara is running 160 secs || 4966515 markings, 5955409 edges, 29737 markings/sec, 160 secs
lola: sara is running 165 secs || 5114254 markings, 6130982 edges, 29548 markings/sec, 165 secs
lola: sara is running 170 secs || 5262591 markings, 6308040 edges, 29667 markings/sec, 170 secs
lola: sara is running 175 secs || 5409434 markings, 6484087 edges, 29369 markings/sec, 175 secs
lola: sara is running 180 secs || 5557561 markings, 6662181 edges, 29625 markings/sec, 180 secs
lola: sara is running 185 secs || 5703867 markings, 6839432 edges, 29261 markings/sec, 185 secs
lola: sara is running 190 secs || 5850707 markings, 7017339 edges, 29368 markings/sec, 190 secs
lola: sara is running 195 secs || 5998575 markings, 7194004 edges, 29574 markings/sec, 195 secs
lola: sara is running 200 secs || 6145555 markings, 7373853 edges, 29396 markings/sec, 200 secs
lola: sara is running 205 secs || 6293573 markings, 7554761 edges, 29604 markings/sec, 205 secs
lola: sara is running 210 secs || 6441313 markings, 7731732 edges, 29548 markings/sec, 210 secs
lola: sara is running 215 secs || 6587005 markings, 7909813 edges, 29138 markings/sec, 215 secs
lola: sara is running 220 secs || 6730997 markings, 8085570 edges, 28798 markings/sec, 220 secs
lola: sara is running 225 secs || 6877226 markings, 8263122 edges, 29246 markings/sec, 225 secs
lola: sara is running 230 secs || 7024487 markings, 8445943 edges, 29452 markings/sec, 230 secs
lola: sara is running 235 secs || 7171224 markings, 8623925 edges, 29347 markings/sec, 235 secs
lola: sara is running 240 secs || 7312780 markings, 8797476 edges, 28311 markings/sec, 240 secs
lola: sara is running 245 secs || 7460214 markings, 8984203 edges, 29487 markings/sec, 245 secs
lola: sara is running 250 secs || 7607542 markings, 9166138 edges, 29466 markings/sec, 250 secs
lola: sara is running 255 secs || 7747733 markings, 9335800 edges, 28038 markings/sec, 255 secs
lola: sara is running 260 secs || 7893012 markings, 9514929 edges, 29056 markings/sec, 260 secs
lola: sara is running 265 secs || 8036137 markings, 9690198 edges, 28625 markings/sec, 265 secs
lola: sara is running 270 secs || 8181364 markings, 9868636 edges, 29045 markings/sec, 270 secs
lola: sara is running 275 secs || 8325666 markings, 10044105 edges, 28860 markings/sec, 275 secs
lola: sara is running 280 secs || 8470019 markings, 10222833 edges, 28871 markings/sec, 280 secs
lola: sara is running 285 secs || 8614726 markings, 10399030 edges, 28941 markings/sec, 285 secs
lola: sara is running 290 secs || 8758567 markings, 10576748 edges, 28768 markings/sec, 290 secs
lola: sara is running 295 secs || 8903109 markings, 10757971 edges, 28908 markings/sec, 295 secs
lola: sara is running 300 secs || 9048260 markings, 10934623 edges, 29030 markings/sec, 300 secs
lola: sara is running 305 secs || 9193453 markings, 11118190 edges, 29039 markings/sec, 305 secs
lola: sara is running 310 secs || 9334819 markings, 11292372 edges, 28273 markings/sec, 310 secs
lola: sara is running 315 secs || 9478529 markings, 11465077 edges, 28742 markings/sec, 315 secs
lola: sara is running 320 secs || 9619645 markings, 11636659 edges, 28223 markings/sec, 320 secs
lola: sara is running 325 secs || 9763893 markings, 11816054 edges, 28850 markings/sec, 325 secs
lola: sara is running 330 secs || 9907603 markings, 11994887 edges, 28742 markings/sec, 330 secs
lola: sara is running 335 secs || 10048801 markings, 12166547 edges, 28240 markings/sec, 335 secs
lola: sara is running 340 secs || 10192211 markings, 12343146 edges, 28682 markings/sec, 340 secs
lola: sara is running 345 secs || 10333002 markings, 12519937 edges, 28158 markings/sec, 345 secs
lola: sara is running 350 secs || 10476963 markings, 12701837 edges, 28792 markings/sec, 350 secs
lola: sara is running 355 secs || 10621387 markings, 12882231 edges, 28885 markings/sec, 355 secs
lola: sara is running 360 secs || 10764325 markings, 13059322 edges, 28588 markings/sec, 360 secs
lola: sara is running 365 secs || 10906152 markings, 13234800 edges, 28365 markings/sec, 365 secs
lola: sara is running 370 secs || 11052048 markings, 13421596 edges, 29179 markings/sec, 370 secs
lola: sara is running 375 secs || 11197153 markings, 13611936 edges, 29021 markings/sec, 375 secs
lola: sara is running 380 secs || 11338809 markings, 13788750 edges, 28331 markings/sec, 380 secs
lola: sara is running 385 secs || 11480668 markings, 13965921 edges, 28372 markings/sec, 385 secs
lola: sara is running 390 secs || 11624733 markings, 14148809 edges, 28813 markings/sec, 390 secs
lola: sara is running 395 secs || 11768627 markings, 14333162 edges, 28779 markings/sec, 395 secs
lola: sara is running 400 secs || 11913079 markings, 14514517 edges, 28890 markings/sec, 400 secs
lola: sara is running 405 secs || 12054309 markings, 14695431 edges, 28246 markings/sec, 405 secs
lola: sara is running 410 secs || 12197006 markings, 14872746 edges, 28539 markings/sec, 410 secs
lola: sara is running 415 secs || 12339859 markings, 15055025 edges, 28571 markings/sec, 415 secs
lola: sara is running 420 secs || 12482701 markings, 15235615 edges, 28568 markings/sec, 420 secs
lola: sara is running 425 secs || 12625280 markings, 15412636 edges, 28516 markings/sec, 425 secs
lola: sara is running 430 secs || 12769541 markings, 15598924 edges, 28852 markings/sec, 430 secs
lola: sara is running 435 secs || 12911921 markings, 15779147 edges, 28476 markings/sec, 435 secs
lola: sara is running 440 secs || 13052563 markings, 15958158 edges, 28128 markings/sec, 440 secs
lola: sara is running 445 secs || 13194889 markings, 16136747 edges, 28465 markings/sec, 445 secs
lola: sara is running 450 secs || 13336746 markings, 16317526 edges, 28371 markings/sec, 450 secs
lola: sara is running 455 secs || 13481490 markings, 16502514 edges, 28949 markings/sec, 455 secs
lola: sara is running 460 secs || 13624250 markings, 16680671 edges, 28552 markings/sec, 460 secs
lola: sara is running 465 secs || 13767102 markings, 16861393 edges, 28570 markings/sec, 465 secs
lola: sara is running 470 secs || 13913716 markings, 17049301 edges, 29323 markings/sec, 470 secs
lola: sara is running 475 secs || 14056888 markings, 17237088 edges, 28634 markings/sec, 475 secs
lola: sara is running 480 secs || 14201935 markings, 17424068 edges, 29009 markings/sec, 480 secs
lola: sara is running 485 secs || 14342920 markings, 17601168 edges, 28197 markings/sec, 485 secs
lola: sara is running 490 secs || 14488539 markings, 17786488 edges, 29124 markings/sec, 490 secs
lola: sara is running 495 secs || 14631642 markings, 17971295 edges, 28621 markings/sec, 495 secs
lola: sara is running 500 secs || 14776502 markings, 18149538 edges, 28972 markings/sec, 500 secs
lola: sara is running 505 secs || 14921049 markings, 18334246 edges, 28909 markings/sec, 505 secs
lola: sara is running 510 secs || 15062341 markings, 18511758 edges, 28258 markings/sec, 510 secs
lola: sara is running 515 secs || 15204643 markings, 18691154 edges, 28460 markings/sec, 515 secs
lola: sara is running 520 secs || 15347757 markings, 18875002 edges, 28623 markings/sec, 520 secs
lola: sara is running 525 secs || 15490237 markings, 19063583 edges, 28496 markings/sec, 525 secs
lola: sara is running 530 secs || 15634723 markings, 19267242 edges, 28897 markings/sec, 530 secs
lola: sara is running 535 secs || 15774664 markings, 19453062 edges, 27988 markings/sec, 535 secs
lola: sara is running 540 secs || 15911173 markings, 19624095 edges, 27302 markings/sec, 540 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 549 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 <= P_1726))) AND ((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 <= 1) AND (TryAl... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 549 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 <= P_1726)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 13 will run for 732 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (X ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6))))) AND (Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= NoSigAbort))
lola: ========================================
lola: lola: SUBTASK========================================
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 732 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6)))))
lola: processed formula length: 264
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1099 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((1 <= cJobCnt) OR (Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= 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))))) OR (2 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1099 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cJobCnt <= 0) AND (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 + 1 <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S02J04T06-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T06-CTLCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 2196 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2)
lola: processed formula length: 160
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2196 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (3 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6)))
lola: processed formula length: 84
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 921128 markings, 1265304 edges, 2316539058328698880 markings/sec, 0 secs
lola: 1693029 markings, 2461954 edges, 154380 markings/sec, 5 secs
lola: 2421713 markings, 3682702 edges, 145737 markings/sec, 10 secs
lola: 3130237 markings, 4904506 edges, 141705 markings/sec, 15 secs
lola: 3842065 markings, 6150521 edges, 142366 markings/sec, 20 secs
lola: 4530762 markings, 7390377 edges, 137739 markings/sec, 25 secs
lola: 5184881 markings, 8601124 edges, 130824 markings/sec, 30 secs
lola: 5848893 markings, 9869417 edges, 132802 markings/sec, 35 secs
lola: 6512968 markings, 11140256 edges, 132815 markings/sec, 40 secs
lola: 7152053 markings, 12422210 edges, 127817 markings/sec, 45 secs
lola: 7797279 markings, 13692779 edges, 129045 markings/sec, 50 secs
lola: 8437467 markings, 14989606 edges, 128038 markings/sec, 55 secs
lola: 9059568 markings, 16294283 edges, 124420 markings/sec, 60 secs
lola: 9688024 markings, 17534526 edges, 125691 markings/sec, 65 secs
lola: 10302601 markings, 18857273 edges, 122915 markings/sec, 70 secs
lola: 10922370 markings, 20099377 edges, 123954 markings/sec, 75 secs
lola: 11523074 markings, 21434790 edges, 120141 markings/sec, 80 secs
lola: 12153727 markings, 22743284 edges, 126131 markings/sec, 85 secs
lola: 12779266 markings, 24042869 edges, 125108 markings/sec, 90 secs
lola: 13423445 markings, 25391924 edges, 128836 markings/sec, 95 secs
lola: 14021463 markings, 26825585 edges, 119604 markings/sec, 100 secs
lola: 14631100 markings, 28188453 edges, 121927 markings/sec, 105 secs
lola: 15266847 markings, 29524788 edges, 127149 markings/sec, 110 secs
lola: 15871920 markings, 30908056 edges, 121015 markings/sec, 115 secs
lola: 16494013 markings, 32250776 edges, 124419 markings/sec, 120 secs
lola: 17114829 markings, 33665821 edges, 124163 markings/sec, 125 secs
lola: 17759373 markings, 34988050 edges, 128909 markings/sec, 130 secs
lola: 18362400 markings, 36367054 edges, 120605 markings/sec, 135 secs
lola: 18952790 markings, 37759343 edges, 118078 markings/sec, 140 secs
lola: 19561687 markings, 39241292 edges, 121779 markings/sec, 145 secs
lola: 20174746 markings, 40751001 edges, 122612 markings/sec, 150 secs
lola: 20803219 markings, 42154044 edges, 125695 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no unknown yes yes yes no yes unknown no unknown unknown no no no unknown
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J04T06-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496447213611
--------------------
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="S_PolyORBLF-PT-S02J04T06"
export BK_EXAMINATION="CTLCardinality"
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/S_PolyORBLF-PT-S02J04T06.tgz
mv S_PolyORBLF-PT-S02J04T06 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 S_PolyORBLF-PT-S02J04T06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-149441681600426"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;