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 PolyORBNT-PT-S05J60, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926200120
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-0
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-1
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-15
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-2
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-3
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-4
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-5
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-6
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-7
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-8
FORMULA_NAME PolyORBNT-COL-S05J60-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494717014801


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-PT-S05J60 @ 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: 2879/65536 symbol table entries, 182 collisions
lola: preprocessing...
lola: finding significant places
lola: 909 places, 1970 transitions, 767 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1668 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J60-CTLCardinality.task
lola: E ((((FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + FetchJobE_1_23 + FetchJobE_1_24 + FetchJobE_1_25 + FetchJobE_1_26 + FetchJobE_1_27 + FetchJobE_1_28 + FetchJobE_1_29 + FetchJobE_1_30 + FetchJobE_1_31 + FetchJobE_1_32 + FetchJobE_1_33 + FetchJobE_1_34 + FetchJobE_1_35 + FetchJobE_1_36 + FetchJobE_1_37 + FetchJobE_1_38 + FetchJobE_1_39 + FetchJobE_1_40 + FetchJobE_1_41 + FetchJobE_1_42 + FetchJobE_1_43 + FetchJobE_1_44 + FetchJobE_1_45 + FetchJobE_1_46 + FetchJobE_1_47 + FetchJobE_1_48 + FetchJobE_1_49 + FetchJobE_1_50 + FetchJobE_1_51 + FetchJobE_1_52 + FetchJobE_1_53 + FetchJobE_1_54 + FetchJobE_1_55 + FetchJobE_1_56 + FetchJobE_1_57 + FetchJobE_1_58 + FetchJobE_1_59 + FetchJobE_1_60 + 1 <= Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedule_Task_E_1_PerformWork_21 + Schedule_Task_E_1_PerformWork_22 + Schedule_Task_E_1_PerformWork_23 + Schedule_Task_E_1_PerformWork_24 + Schedule_Task_E_1_PerformWork_25 + Schedule_Task_E_1_PerformWork_26 + Schedule_Task_E_1_PerformWork_27 + Schedule_Task_E_1_PerformWork_28 + Schedule_Task_E_1_PerformWork_29 + Schedule_Task_E_1_PerformWork_30 + Schedule_Task_E_1_PerformWork_31 + Schedule_Task_E_1_PerformWork_32 + Schedule_Task_E_1_PerformWork_33 + Schedule_Task_E_1_PerformWork_34 + Schedule_Task_E_1_PerformWork_35 + Schedule_Task_E_1_PerformWork_36 + Schedule_Task_E_1_PerformWork_37 + Schedule_Task_E_1_PerformWork_38 + Schedule_Task_E_1_PerformWork_39 + Schedule_Task_E_1_PerformWork_40 + Schedule_Task_E_1_PerformWork_41 + Schedule_Task_E_1_PerformWork_42 + Schedule_Task_E_1_PerformWork_43 + Schedule_Task_E_1_PerformWork_44 + Schedule_Task_E_1_PerformWork_45 + Schedule_Task_E_1_PerformWork_46 + Schedule_Task_E_1_PerformWork_47 + Schedule_Task_E_1_PerformWork_48 + Schedule_Task_E_1_PerformWork_49 + Schedule_Task_E_1_PerformWork_50 + Schedule_Task_E_1_PerformWork_51 + Schedule_Task_E_1_PerformWork_52 + Schedule_Task_E_1_PerformWork_53 + Schedule_Task_E_1_PerformWork_54 + Schedule_Task_E_1_PerformWork_55 + Schedule_Task_E_1_PerformWork_56 + Schedule_Task_E_1_PerformWork_57 + Schedule_Task_E_1_PerformWork_58 + Schedule_Task_E_1_PerformWork_59 + Schedule_Task_E_1_PerformWork_60 + Schedule_Task_E_1_CheckSource_0 + Schedule_Task_E_1_PerformWork_0 + Schedule_Task_E_1_PerformWork_1 + Schedule_Task_E_1_PerformWork_2 + Schedule_Task_E_1_PerformWork_3 + Schedule_Task_E_1_PerformWork_4 + Schedule_Task_E_1_PerformWork_5 + Schedule_Task_E_1_PerformWork_6 + Schedule_Task_E_1_PerformWork_7 + Schedule_Task_E_1_PerformWork_8 + Schedule_Task_E_1_PerformWork_9) OR (NotifyEventJobQueuedE_1 + 1 <= place_522_1)) U E (F ((1 <= NotifyEventJobQueuedE_1))))) : NOT(NOT(A (G ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60 <= mi2))))) : E ((((mo1 + 1 <= Check_Sources_E_1) OR (3 <= cSources)) U ((place_522_1 + 1 <= cJobCnt) AND (3 <= mo1)))) : E (F (((2 <= Check_Sources_E_1) OR ((place_460 + 1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + QueueJobB_1_23 + QueueJobB_1_24 + QueueJobB_1_25 + QueueJobB_1_26 + QueueJobB_1_27 + QueueJobB_1_28 + QueueJobB_1_29 + QueueJobB_1_30 + QueueJobB_1_31 + QueueJobB_1_32 + QueueJobB_1_33 + QueueJobB_1_34 + QueueJobB_1_35 + QueueJobB_1_36 + QueueJobB_1_37 + QueueJobB_1_38 + QueueJobB_1_39 + QueueJobB_1_40 + QueueJobB_1_41 + QueueJobB_1_42 + QueueJobB_1_43 + QueueJobB_1_44 + QueueJobB_1_45 + QueueJobB_1_46 + QueueJobB_1_47 + QueueJobB_1_48 + QueueJobB_1_49 + QueueJobB_1_50 + QueueJobB_1_51 + QueueJobB_1_52 + QueueJobB_1_53 + QueueJobB_1_54 + QueueJobB_1_55 + QueueJobB_1_56 + QueueJobB_1_57 + QueueJobB_1_58 + QueueJobB_1_59 + QueueJobB_1_60) AND (2 <= place_462))))) : E (G ((NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + NotifyEventJobQueuedB_1_47 + NotifyEventJobQueuedB_1_46 + NotifyEventJobQueuedB_1_45 + NotifyEventJobQueuedB_1_44 + NotifyEventJobQueuedB_1_43 + NotifyEventJobQueuedB_1_42 + NotifyEventJobQueuedB_1_41 + NotifyEventJobQueuedB_1_40 + NotifyEventJobQueuedB_1_39 + NotifyEventJobQueuedB_1_38 + NotifyEventJobQueuedB_1_37 + NotifyEventJobQueuedB_1_36 + NotifyEventJobQueuedB_1_35 + NotifyEventJobQueuedB_1_34 + NotifyEventJobQueuedB_1_33 + NotifyEventJobQueuedB_1_32 + NotifyEventJobQueuedB_1_31 + NotifyEventJobQueuedB_1_30 + NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + NotifyEventJobQueuedB_1_22 + NotifyEventJobQueuedB_1_21 + NotifyEventJobQueuedB_1_20 + NotifyEventJobQueuedB_1_19 + NotifyEventJobQueuedB_1_18 + NotifyEventJobQueuedB_1_17 + NotifyEventJobQueuedB_1_16 + NotifyEventJobQueuedB_1_15 + NotifyEventJobQueuedB_1_14 + NotifyEventJobQueuedB_1_13 + NotifyEventJobQueuedB_1_12 + NotifyEventJobQueuedB_1_11 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQueuedB_1_60 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_9 <= mo1))) : A (X (A (G ((3 <= cJobCnt))))) : A (F (E (F (((3 <= Perform_Work_E_1) OR (3 <= NotifyEventJobQueuedE_1)))))) : E (G (A (((place_518_1 <= DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) U (1 <= cSources))))) : A (G (NOT(A (X ((3 <= mo2)))))) : NOT((E (G ((NotifyEventJobQueuedE_1 <= 1))) AND (A (F ((Try_Check_Sources_E_1 <= place_522_1))) AND A (X ((1 <= CanInjectEvent)))))) : (A ((((place_521_1 <= place_460) OR (mo1 <= mo3)) U ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40 + Perform_Work_B_1_41 + Perform_Work_B_1_42 + Perform_Work_B_1_43 + Perform_Work_B_1_44 + Perform_Work_B_1_45 + Perform_Work_B_1_46 + Perform_Work_B_1_47 + Perform_Work_B_1_48 + Perform_Work_B_1_49 + Perform_Work_B_1_50 + Perform_Work_B_1_51 + Perform_Work_B_1_52 + Perform_Work_B_1_53 + Perform_Work_B_1_54 + Perform_Work_B_1_55 + Perform_Work_B_1_56 + Perform_Work_B_1_57 + Perform_Work_B_1_58 + Perform_Work_B_1_59 + Perform_Work_B_1_60 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_41 + f3_42 + f3_43 + f3_44 + f3_45 + f3_46 + f3_47 + f3_48 + f3_49 + f3_50 + f3_51 + f3_52 + f3_53 + f3_54 + f3_55 + f3_56 + f3_57 + f3_58 + f3_59 + f3_60 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9) AND (mi1 <= mo2)))) AND (mi3 <= Try_Check_Sources_E_1)) : (E (F (A (G ((mi3 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_41 + f3_42 + f3_43 + f3_44 + f3_45 + f3_46 + f3_47 + f3_48 + f3_49 + f3_50 + f3_51 + f3_52 + f3_53 + f3_54 + f3_55 + f3_56 + f3_57 + f3_58 + f3_59 + f3_60 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9))))) AND A (X (E (F ((CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_52_1 + CreatedJobs_52_2 + CreatedJobs_52_3 + CreatedJobs_52_4 + CreatedJobs_52_5 + CreatedJobs_17_1 + CreatedJobs_17_2 + CreatedJobs_17_3 + CreatedJobs_17_4 + CreatedJobs_17_5 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_53_1 + CreatedJobs_53_2 + CreatedJobs_53_3 + CreatedJobs_53_4 + CreatedJobs_53_5 + CreatedJobs_40_1 + CreatedJobs_40_2 + CreatedJobs_40_3 + CreatedJobs_40_4 + CreatedJobs_40_5 + CreatedJobs_18_1 + CreatedJobs_18_2 + CreatedJobs_18_3 + CreatedJobs_18_4 + CreatedJobs_18_5 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_54_1 + CreatedJobs_54_2 + CreatedJobs_54_3 + CreatedJobs_54_4 + CreatedJobs_54_5 + CreatedJobs_41_1 + CreatedJobs_41_2 + CreatedJobs_41_3 + CreatedJobs_41_4 + CreatedJobs_41_5 + CreatedJobs_19_1 + CreatedJobs_19_2 + CreatedJobs_19_3 + CreatedJobs_19_4 + CreatedJobs_19_5 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_55_1 + CreatedJobs_55_2 + CreatedJobs_55_3 + CreatedJobs_55_4 + CreatedJobs_55_5 + CreatedJobs_42_1 + CreatedJobs_42_2 + CreatedJobs_42_3 + CreatedJobs_42_4 + CreatedJobs_42_5 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_56_1 + CreatedJobs_56_2 + CreatedJobs_56_3 + CreatedJobs_56_4 + CreatedJobs_56_5 + CreatedJobs_43_1 + CreatedJobs_43_2 + CreatedJobs_43_3 + CreatedJobs_43_4 + CreatedJobs_43_5 + CreatedJobs_30_1 + CreatedJobs_30_2 + CreatedJobs_30_3 + CreatedJobs_30_4 + CreatedJobs_30_5 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_57_1 + CreatedJobs_57_2 + CreatedJobs_57_3 + CreatedJobs_57_4 + CreatedJobs_57_5 + CreatedJobs_44_1 + CreatedJobs_44_2 + CreatedJobs_44_3 + CreatedJobs_44_4 + CreatedJobs_44_5 + CreatedJobs_31_1 + CreatedJobs_31_2 + CreatedJobs_31_3 + CreatedJobs_31_4 + CreatedJobs_31_5 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_58_1 + CreatedJobs_58_2 + CreatedJobs_58_3 + CreatedJobs_58_4 + CreatedJobs_58_5 + CreatedJobs_45_1 + CreatedJobs_45_2 + CreatedJobs_45_3 + CreatedJobs_45_4 + CreatedJobs_45_5 + CreatedJobs_32_1 + CreatedJobs_32_2 + CreatedJobs_32_3 + CreatedJobs_32_4 + CreatedJobs_32_5 + CreatedJobs_7_1 + CreatedJobs_7_2 + CreatedJobs_7_3 + CreatedJobs_7_4 + CreatedJobs_7_5 + CreatedJobs_59_1 + CreatedJobs_59_2 + CreatedJobs_59_3 + CreatedJobs_59_4 + CreatedJobs_59_5 + CreatedJobs_46_1 + CreatedJobs_46_2 + CreatedJobs_46_3 + CreatedJobs_46_4 + CreatedJobs_46_5 + CreatedJobs_33_1 + CreatedJobs_33_2 + CreatedJobs_33_3 + CreatedJobs_33_4 + CreatedJobs_33_5 + CreatedJobs_20_1 + CreatedJobs_20_2 + CreatedJobs_20_3 + CreatedJobs_20_4 + CreatedJobs_20_5 + CreatedJobs_8_1 + CreatedJobs_8_2 + CreatedJobs_8_3 + CreatedJobs_8_4 + CreatedJobs_8_5 + CreatedJobs_47_1 + CreatedJobs_47_2 + CreatedJobs_47_3 + CreatedJobs_47_4 + CreatedJobs_47_5 + CreatedJobs_34_1 + CreatedJobs_34_2 + CreatedJobs_34_3 + CreatedJobs_34_4 + CreatedJobs_34_5 + CreatedJobs_21_1 + CreatedJobs_21_2 + CreatedJobs_21_3 + CreatedJobs_21_4 + CreatedJobs_21_5 + CreatedJobs_15_4 + CreatedJobs_15_3 + CreatedJobs_15_2 + CreatedJobs_15_1 + CreatedJobs_9_1 + CreatedJobs_9_2 + CreatedJobs_9_3 + CreatedJobs_9_4 + CreatedJobs_9_5 + CreatedJobs_48_1 + CreatedJobs_48_2 + CreatedJobs_48_3 + CreatedJobs_48_4 + CreatedJobs_35_1 + CreatedJobs_35_2 + CreatedJobs_35_3 + CreatedJobs_35_4 + CreatedJobs_22_1 + CreatedJobs_22_2 + CreatedJobs_22_3 + CreatedJobs_22_4 + CreatedJobs_49_1 + CreatedJobs_49_2 + CreatedJobs_49_3 + CreatedJobs_49_4 + CreatedJobs_36_1 + CreatedJobs_36_2 + CreatedJobs_36_3 + CreatedJobs_36_4 + CreatedJobs_23_1 + CreatedJobs_23_2 + CreatedJobs_23_3 + CreatedJobs_23_4 + CreatedJobs_10_1 + CreatedJobs_10_2 + CreatedJobs_10_3 + CreatedJobs_10_4 + CreatedJobs_37_1 + CreatedJobs_37_2 + CreatedJobs_37_3 + CreatedJobs_37_4 + CreatedJobs_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_24_4 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_60_1 + CreatedJobs_60_2 + CreatedJobs_60_3 + CreatedJobs_60_4 + CreatedJobs_28_4 + CreatedJobs_38_1 + CreatedJobs_38_2 + CreatedJobs_38_3 + CreatedJobs_38_4 + CreatedJobs_28_3 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_28_2 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_28_1 + CreatedJobs_39_1 + CreatedJobs_39_2 + CreatedJobs_39_3 + CreatedJobs_39_4 + CreatedJobs_50_4 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_50_3 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_50_2 + CreatedJobs_50_1 + CreatedJobs_14_4 + CreatedJobs_14_3 + CreatedJobs_14_2 + CreatedJobs_14_1 + CreatedJobs_27_4 + CreatedJobs_27_3 + CreatedJobs_27_2 + CreatedJobs_27_1 + CreatedJobs_27_5 + CreatedJobs_14_5 + CreatedJobs_13_5 + CreatedJobs_26_5 + CreatedJobs_39_5 + CreatedJobs_50_5 + CreatedJobs_12_5 + CreatedJobs_25_5 + CreatedJobs_38_5 + CreatedJobs_28_5 + CreatedJobs_60_5 + CreatedJobs_11_5 + CreatedJobs_24_5 + CreatedJobs_37_5 + CreatedJobs_10_5 + CreatedJobs_23_5 + CreatedJobs_36_5 + CreatedJobs_49_5 + CreatedJobs_22_5 + CreatedJobs_35_5 + CreatedJobs_48_5 + CreatedJobs_15_5 + CreatedJobs_51_1 + CreatedJobs_51_2 + CreatedJobs_51_3 + CreatedJobs_51_4 + CreatedJobs_51_5 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_41 + f3_42 + f3_43 + f3_44 + f3_45 + f3_46 + f3_47 + f3_48 + f3_49 + f3_50 + f3_51 + f3_52 + f3_53 + f3_54 + f3_55 + f3_56 + f3_57 + f3_58 + f3_59 + f3_60 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)))))) : A (F ((A (X ((1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + FetchJobE_1_23 + FetchJobE_1_24 + FetchJobE_1_25 + FetchJobE_1_26 + FetchJobE_1_27 + FetchJobE_1_28 + FetchJobE_1_29 + FetchJobE_1_30 + FetchJobE_1_31 + FetchJobE_1_32 + FetchJobE_1_33 + FetchJobE_1_34 + FetchJobE_1_35 + FetchJobE_1_36 + FetchJobE_1_37 + FetchJobE_1_38 + FetchJobE_1_39 + FetchJobE_1_40 + FetchJobE_1_41 + FetchJobE_1_42 + FetchJobE_1_43 + FetchJobE_1_44 + FetchJobE_1_45 + FetchJobE_1_46 + FetchJobE_1_47 + FetchJobE_1_48 + FetchJobE_1_49 + FetchJobE_1_50 + FetchJobE_1_51 + FetchJobE_1_52 + FetchJobE_1_53 + FetchJobE_1_54 + FetchJobE_1_55 + FetchJobE_1_56 + FetchJobE_1_57 + FetchJobE_1_58 + FetchJobE_1_59 + FetchJobE_1_60))) AND E (G ((1 <= CanInjectEvent)))))) : ((A (((cSources <= place_787_1) U (Schedule_Task_B_1 <= place_523_1))) AND (3 <= cSources)) OR (A (F ((2 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))) OR (E (F ((1 <= place_458))) AND (((NotifyEventJobQueuedE_1 <= NotifyEventEndOfCheckSourcesE_1) OR (3 <= place_523_1)) AND (1 <= JobCnt))))) : NOT(A (G ((Try_Check_Sources_B_1 <= mi1)))) : A (X ((E (G ((FetchJobB_1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5))) AND A (F ((Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedule_Task_E_1_PerformWork_21 + Schedule_Task_E_1_PerformWork_22 + Schedule_Task_E_1_PerformWork_23 + Schedule_Task_E_1_PerformWork_24 + Schedule_Task_E_1_PerformWork_25 + Schedule_Task_E_1_PerformWork_26 + Schedule_Task_E_1_PerformWork_27 + Schedule_Task_E_1_PerformWork_28 + Schedule_Task_E_1_PerformWork_29 + Schedule_Task_E_1_PerformWork_30 + Schedule_Task_E_1_PerformWork_31 + Schedule_Task_E_1_PerformWork_32 + Schedule_Task_E_1_PerformWork_33 + Schedule_Task_E_1_PerformWork_34 + Schedule_Task_E_1_PerformWork_35 + Schedule_Task_E_1_PerformWork_36 + Schedule_Task_E_1_PerformWork_37 + Schedule_Task_E_1_PerformWork_38 + Schedule_Task_E_1_PerformWork_39 + Schedule_Task_E_1_PerformWork_40 + Schedule_Task_E_1_PerformWork_41 + Schedule_Task_E_1_PerformWork_42 + Schedule_Task_E_1_PerformWork_43 + Schedule_Task_E_1_PerformWork_44 + Schedule_Task_E_1_PerformWork_45 + Schedule_Task_E_1_PerformWork_46 + Schedule_Task_E_1_PerformWork_47 + Schedule_Task_E_1_PerformWork_48 + Schedule_Task_E_1_PerformWork_49 + Schedule_Task_E_1_PerformWork_50 + Schedule_Task_E_1_PerformWork_51 + Schedule_Task_E_1_PerformWork_52 + Schedule_Task_E_1_PerformWork_53 + Schedule_Task_E_1_PerformWork_54 + Schedule_Task_E_1_PerformWork_55 + Schedule_Task_E_1_PerformWork_56 + Schedule_Task_E_1_PerformWork_57 + Schedule_Task_E_1_PerformWork_58 + Schedule_Task_E_1_PerformWork_59 + Schedule_Task_E_1_PerformWork_60 + Schedule_Task_E_1_CheckSource_0 + Schedule_Task_E_1_PerformWork_0 + Schedule_Task_E_1_PerformWork_1 + Schedule_Task_E_1_PerformWork_2 + Schedule_Task_E_1_PerformWork_3 + Schedule_Task_E_1_PerformWork_4 + Schedule_Task_E_1_PerformWork_5 + Schedule_Task_E_1_PerformWork_6 + Schedule_Task_E_1_PerformWork_7 + Schedule_Task_E_1_PerformWork_8 + Schedule_Task_E_1_PerformWork_9 <= place_518_1))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + FetchJobE_1_2... (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_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + FetchJobE_1_23 ... (shortened)
lola: processed formula length: 3287
lola: 2 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 +... (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 3068 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 PolyORBNT-COL-S05J60-CTLCardinality.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: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((mo1 + 1 <= Check_Sources_E_1) OR (3 <= cSources)) U ((place_522_1 + 1 <= cJobCnt) AND (3 <= mo1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((mo1 + 1 <= Check_Sources_E_1) OR (3 <= cSources)) U ((place_522_1 + 1 <= cJobCnt) AND (3 <= mo1)))
lola: processed formula length: 103
lola: 1 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= Check_Sources_E_1) OR ((place_460 + 1 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 ... (shortened)
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 3068 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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J60-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J60-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 23280 markings, 53342 edges, 4656 markings/sec, 0 secs
lola: sara is running 5 secs || 46358 markings, 106680 edges, 4616 markings/sec, 5 secs
lola: sara is running 10 secs || 69540 markings, 159443 edges, 4636 markings/sec, 10 secs
lola: sara is running 15 secs || 92778 markings, 208772 edges, 4648 markings/sec, 15 secs
lola: sara is running 20 secs || 116180 markings, 257184 edges, 4680 markings/sec, 20 secs
lola: sara is running 25 secs || 139569 markings, 305502 edges, 4678 markings/sec, 25 secs
lola: sara is running 30 secs || 162912 markings, 353722 edges, 4669 markings/sec, 30 secs
lola: sara is running 35 secs || 186283 markings, 401989 edges, 4674 markings/sec, 35 secs
lola: sara is running 40 secs || 209623 markings, 450245 edges, 4668 markings/sec, 40 secs
lola: sara is running 45 secs || 233016 markings, 498571 edges, 4679 markings/sec, 45 secs
lola: sara is running 50 secs || 256386 markings, 546867 edges, 4674 markings/sec, 50 secs
lola: sara is running 55 secs || 279801 markings, 595294 edges, 4683 markings/sec, 55 secs
lola: sara is running 60 secs || 303190 markings, 643621 edges, 4678 markings/sec, 60 secs
lola: sara is running 65 secs || 326518 markings, 692589 edges, 4666 markings/sec, 65 secs
lola: sara is running 70 secs || 349811 markings, 741008 edges, 4659 markings/sec, 70 secs
lola: sara is running 75 secs || 373184 markings, 789315 edges, 4675 markings/sec, 75 secs
lola: sara is running 80 secs || 396558 markings, 837637 edges, 4675 markings/sec, 80 secs
lola: sara is running 85 secs || 419976 markings, 886005 edges, 4684 markings/sec, 85 secs
lola: sara is running 90 secs || 443353 markings, 934302 edges, 4675 markings/sec, 90 secs
lola: sara is running 95 secs || 466622 markings, 982385 edges, 4654 markings/sec, 95 secs
lola: sara is running 100 secs || 489901 markings, 1030497 edges, 4656 markings/sec, 100 secs
lola: sara is running 105 secs || 513166 markings, 1078586 edges, 4653 markings/sec, 105 secs
lola: sara is running 110 secs || 536470 markings, 1127783 edges, 4661 markings/sec, 110 secs
lola: sara is running 115 secs || 559838 markings, 1176090 edges, 4674 markings/sec, 115 secs
lola: sara is running 120 secs || 583258 markings, 1224450 edges, 4684 markings/sec, 120 secs
lola: sara is running 125 secs || 606578 markings, 1272616 edges, 4664 markings/sec, 125 secs
lola: sara is running 130 secs || 629786 markings, 1321356 edges, 4642 markings/sec, 130 secs
lola: sara is running 135 secs || 653102 markings, 1369833 edges, 4663 markings/sec, 135 secs
lola: sara is running 140 secs || 676479 markings, 1418103 edges, 4675 markings/sec, 140 secs
lola: sara is running 145 secs || 699826 markings, 1466357 edges, 4669 markings/sec, 145 secs
lola: sara is running 150 secs || 723078 markings, 1515440 edges, 4650 markings/sec, 150 secs
lola: sara is running 155 secs || 746420 markings, 1563679 edges, 4668 markings/sec, 155 secs
lola: sara is running 160 secs || 769747 markings, 1611872 edges, 4665 markings/sec, 160 secs
lola: sara is running 165 secs || 793232 markings, 1661407 edges, 4697 markings/sec, 165 secs
lola: sara is running 170 secs || 816653 markings, 1709808 edges, 4684 markings/sec, 170 secs
lola: sara is running 175 secs || 839736 markings, 1758515 edges, 4617 markings/sec, 175 secs
lola: sara is running 180 secs || 863040 markings, 1806659 edges, 4661 markings/sec, 180 secs
lola: sara is running 185 secs || 886288 markings, 1854729 edges, 4650 markings/sec, 185 secs
lola: sara is running 190 secs || 909663 markings, 1904008 edges, 4675 markings/sec, 190 secs
lola: sara is running 195 secs || 932806 markings, 1952602 edges, 4629 markings/sec, 195 secs
lola: sara is running 200 secs || 955984 markings, 2000748 edges, 4636 markings/sec, 200 secs
lola: sara is running 205 secs || 979352 markings, 2050056 edges, 4674 markings/sec, 205 secs
lola: sara is running 210 secs || 1002922 markings, 2098758 edges, 4714 markings/sec, 210 secs
lola: sara is running 215 secs || 1026471 markings, 2148423 edges, 4710 markings/sec, 215 secs
lola: sara is running 220 secs || 1049941 markings, 2197889 edges, 4694 markings/sec, 220 secs
lola: sara is running 225 secs || 1073389 markings, 2247375 edges, 4690 markings/sec, 225 secs
lola: sara is running 230 secs || 1096902 markings, 2295931 edges, 4703 markings/sec, 230 secs
lola: sara is running 235 secs || 1120315 markings, 2345284 edges, 4683 markings/sec, 235 secs
lola: sara is running 240 secs || 1143742 markings, 2394696 edges, 4685 markings/sec, 240 secs
lola: sara is running 245 secs || 1167172 markings, 2444097 edges, 4686 markings/sec, 245 secs
lola: sara is running 250 secs || 1190608 markings, 2493553 edges, 4687 markings/sec, 250 secs
lola: sara is running 255 secs || 1213888 markings, 2543632 edges, 4656 markings/sec, 255 secs
lola: sara is running 260 secs || 1237264 markings, 2592959 edges, 4675 markings/sec, 260 secs
lola: sara is running 265 secs || 1260610 markings, 2642165 edges, 4669 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + NotifyEventJobQueuedB_1_47 + NotifyEventJobQu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (mo1 + 1 <= NotifyEventJobQueuedB_1_59 + NotifyEventJobQueuedB_1_58 + NotifyEventJobQueuedB_1_57 + NotifyEventJobQueuedB_1_56 + NotifyEventJobQueuedB_1_55 + NotifyEventJobQueuedB_1_54 + NotifyEventJobQueuedB_1_53 + NotifyEventJobQueuedB_1_52 + NotifyEventJobQueuedB_1_51 + NotifyEventJobQueuedB_1_50 + NotifyEventJobQueuedB_1_49 + NotifyEventJobQueuedB_1_48 + NotifyEventJobQueuedB_1_47 ... (shortened)
lola: processed formula length: 1784
lola: 2 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((3 <= cJobCnt)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(E(TRUE U (cJobCnt <= 2))))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: 399118 markings, 1031325 edges, 2026545065526034432 markings/sec, 0 secs
lola: 773579 markings, 1982485 edges, 74892 markings/sec, 5 secs
lola: 1155499 markings, 2892465 edges, 76384 markings/sec, 10 secs
lola: 1524679 markings, 3789501 edges, 73836 markings/sec, 15 secs
lola: 1839694 markings, 4594226 edges, 63003 markings/sec, 20 secs
lola: 2100801 markings, 5384589 edges, 52221 markings/sec, 25 secs
lola: 2317083 markings, 6086145 edges, 43256 markings/sec, 30 secs
lola: 2526243 markings, 6746999 edges, 41832 markings/sec, 35 secs
lola: 2733830 markings, 7402638 edges, 41517 markings/sec, 40 secs
lola: 2934916 markings, 8037257 edges, 40217 markings/sec, 45 secs
lola: 3162051 markings, 8746565 edges, 45427 markings/sec, 50 secs
lola: 3456362 markings, 9508116 edges, 58862 markings/sec, 55 secs
lola: 3757815 markings, 10299539 edges, 60291 markings/sec, 60 secs
lola: 4045922 markings, 11023513 edges, 57621 markings/sec, 65 secs
lola: 4345054 markings, 11775011 edges, 59826 markings/sec, 70 secs
lola: 4626107 markings, 12494297 edges, 56211 markings/sec, 75 secs
lola: 4918354 markings, 13256228 edges, 58449 markings/sec, 80 secs
lola: 5184955 markings, 13971310 edges, 53320 markings/sec, 85 secs
lola: 5420230 markings, 14642788 edges, 47055 markings/sec, 90 secs
lola: 5611961 markings, 15359289 edges, 38346 markings/sec, 95 secs
lola: 5810805 markings, 15978053 edges, 39769 markings/sec, 100 secs
lola: 6006709 markings, 16613015 edges, 39181 markings/sec, 105 secs
lola: 6250912 markings, 17314476 edges, 48841 markings/sec, 110 secs
lola: 6522069 markings, 18018173 edges, 54231 markings/sec, 115 secs
lola: 6800102 markings, 18733490 edges, 55607 markings/sec, 120 secs
lola: 7080682 markings, 19397439 edges, 56116 markings/sec, 125 secs
lola: 7379821 markings, 20119509 edges, 59828 markings/sec, 130 secs
lola: 7668891 markings, 20831279 edges, 57814 markings/sec, 135 secs
lola: 7926353 markings, 21492694 edges, 51492 markings/sec, 140 secs
lola: 8149429 markings, 22170540 edges, 44615 markings/sec, 145 secs
lola: 8339704 markings, 22800123 edges, 38055 markings/sec, 150 secs
lola: 8536002 markings, 23404854 edges, 39260 markings/sec, 155 secs
lola: 8723586 markings, 24017274 edges, 37517 markings/sec, 160 secs
lola: 8910411 markings, 24588758 edges, 37365 markings/sec, 165 secs
lola: 9035634 markings, 25024493 edges, 25045 markings/sec, 170 secs
lola: 9195092 markings, 25512533 edges, 31892 markings/sec, 175 secs
lola: 9388154 markings, 26009464 edges, 38612 markings/sec, 180 secs
lola: 9559996 markings, 26453072 edges, 34368 markings/sec, 185 secs
lola: 9734900 markings, 26911365 edges, 34981 markings/sec, 190 secs
lola: 9928644 markings, 27409205 edges, 38749 markings/sec, 195 secs
lola: 10123224 markings, 27893903 edges, 38916 markings/sec, 200 secs
lola: 10308001 markings, 28359584 edges, 36955 markings/sec, 205 secs
lola: 10511516 markings, 28876209 edges, 40703 markings/sec, 210 secs
lola: 10685592 markings, 29322268 edges, 34815 markings/sec, 215 secs
lola: 10887780 markings, 29845383 edges, 40438 markings/sec, 220 secs
lola: 11052702 markings, 30283412 edges, 32984 markings/sec, 225 secs
lola: 11225547 markings, 30747661 edges, 34569 markings/sec, 230 secs
lola: 11368863 markings, 31176912 edges, 28663 markings/sec, 235 secs
lola: 11533725 markings, 31666304 edges, 32972 markings/sec, 240 secs
lola: 11659538 markings, 32135827 edges, 25163 markings/sec, 245 secs
lola: 11787330 markings, 32543424 edges, 25558 markings/sec, 250 secs
lola: 11929035 markings, 32989428 edges, 28341 markings/sec, 255 secs
lola: 12052383 markings, 33391048 edges, 24670 markings/sec, 260 secs
lola: 12211514 markings, 33888792 edges, 31826 markings/sec, 265 secs
lola: 12443896 markings, 34490489 edges, 46476 markings/sec, 270 secs
lola: 12657480 markings, 35049603 edges, 42717 markings/sec, 275 secs
lola: 12860044 markings, 35578470 edges, 40513 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (((3 <= Perform_Work_E_1) OR (3 <= NotifyEventJobQueuedE_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U ((3 <= Perform_Work_E_1) OR (3 <= NotifyEventJobQueuedE_1))))
lola: processed formula length: 80
lola: 2 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: 269823 markings, 488328 edges, 3689320832170983424 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((place_518_1 <= DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) U (1 <= cSources)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: NOT(A(TRUE U NOT(A((place_518_1 <= DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) U (1 <= cSources)))))
lola: processed formula length: 125
lola: 2 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((3 <= mo2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((mo2 <= 2)))))
lola: processed formula length: 34
lola: 5 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((NotifyEventJobQueuedE_1 <= 1))) AND (A (F ((Try_Check_Sources_E_1 <= place_522_1))) AND A (X ((1 <= CanInjectEvent))))))
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: A (F ((2 <= NotifyEventJobQueuedE_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= NotifyEventJobQueuedE_1))
lola: processed formula length: 40
lola: 12 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((place_522_1 + 1 <= Try_Check_Sources_E_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (Try_Check_Sources_E_1 <= place_522_1)))
lola: processed formula length: 53
lola: 13 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 11 will run for 594 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((CanInjectEvent <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((CanInjectEvent <= 0))
lola: processed formula length: 25
lola: 12 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 0 significant temporal operators and needs 0 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: subprocess 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A ((((place_521_1 <= place_460) OR (mo1 <= mo3)) U ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Per... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((place_521_1 <= place_460) OR (mo1 <= mo3)) U ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perf... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((place_521_1 <= place_460) OR (mo1 <= mo3)) U ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perfor... (shortened)
lola: processed formula length: 1880
lola: 1 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: 496110 markings, 784020 edges, 99215 markings/sec, 0 secs
lola: 962841 markings, 1546695 edges, 93346 markings/sec, 5 secs
lola: 1412715 markings, 2274725 edges, 89975 markings/sec, 10 secs
lola: 1845177 markings, 2991233 edges, 86492 markings/sec, 15 secs
lola: 2253806 markings, 3685339 edges, 81726 markings/sec, 20 secs
lola: 2670021 markings, 4395867 edges, 83243 markings/sec, 25 secs
lola: 3065217 markings, 5087315 edges, 79039 markings/sec, 30 secs
lola: 3449269 markings, 5786715 edges, 76810 markings/sec, 35 secs
lola: 3800444 markings, 6451087 edges, 70235 markings/sec, 40 secs
lola: 4106541 markings, 7076337 edges, 61219 markings/sec, 45 secs
lola: 4383494 markings, 7740537 edges, 55391 markings/sec, 50 secs
lola: 4758974 markings, 8475472 edges, 75096 markings/sec, 55 secs
lola: 5181945 markings, 9171394 edges, 84594 markings/sec, 60 secs
lola: 5600065 markings, 9885726 edges, 83624 markings/sec, 65 secs
lola: 6038616 markings, 10624468 edges, 87710 markings/sec, 70 secs
lola: 6429671 markings, 11273930 edges, 78211 markings/sec, 75 secs
lola: 6827392 markings, 11938103 edges, 79544 markings/sec, 80 secs
lola: 7184187 markings, 12559342 edges, 71359 markings/sec, 85 secs
lola: 7600278 markings, 13254272 edges, 83218 markings/sec, 90 secs
lola: 7967053 markings, 13892417 edges, 73355 markings/sec, 95 secs
lola: 8361145 markings, 14558851 edges, 78818 markings/sec, 100 secs
lola: 8725411 markings, 15184946 edges, 72853 markings/sec, 105 secs
lola: 9132021 markings, 15796199 edges, 81322 markings/sec, 110 secs
lola: 9501604 markings, 16349817 edges, 73917 markings/sec, 115 secs
lola: 9919943 markings, 16989005 edges, 83668 markings/sec, 120 secs
lola: 10306815 markings, 17584964 edges, 77374 markings/sec, 125 secs
lola: 10686241 markings, 18181722 edges, 75885 markings/sec, 130 secs
lola: 11052031 markings, 18777403 edges, 73158 markings/sec, 135 secs
lola: 11386930 markings, 19339695 edges, 66980 markings/sec, 140 secs
lola: 11705834 markings, 19905860 edges, 63781 markings/sec, 145 secs
lola: 12001077 markings, 20504665 edges, 59049 markings/sec, 150 secs
lola: 12258367 markings, 21106035 edges, 51458 markings/sec, 155 secs
lola: 12524789 markings, 21663726 edges, 53284 markings/sec, 160 secs
lola: 12807156 markings, 22261957 edges, 56473 markings/sec, 165 secs
lola: 13106698 markings, 22911595 edges, 59908 markings/sec, 170 secs
lola: 13361117 markings, 23465443 edges, 50884 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (mi3 <= Try_Check_Sources_E_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (mi3 <= Try_Check_Sources_E_1)
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 11 will run for 557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================lola:
========================================
lola: ...considering subproblem: (E (F (A (G ((mi3 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_41 + f3_42 + f3_43 + f3_44 + f3_45 + f3_46 + f3_47 + f3_48 + f3_49 + f3_50 + f3_51 + f3_52 + f3_53 + f3_54 + f3_55 + f3_56 + f3_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((mi3 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_41 + f3_42 + f3_43 + f3_44 + f3_45 + f3_46 + f3_47 + f3_48 + f3_49 + f3_50 + f3_51 + f3_52 + f3_53 + f3_54 + f3_55 + f3_56 + f3_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_41 + f3_42 + f3_43 + f3_44 + f3_45 + f3_46 + f3_47 + f3_48 + f3_49 + f3_50 + f3_51 + f3_52 + f3_53 + f3_54 + f3_55 + f3_56 + f... (shortened)
lola: processed formula length: 513
lola: 3 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 697 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_52_1 + CreatedJobs_52_2 + CreatedJobs_52_3 + CreatedJobs_52_4 + CreatedJobs_52_5 + CreatedJobs_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_52_1 + CreatedJobs_52_2 + CreatedJobs_52_3 + CreatedJobs_52_4 + CreatedJobs_52_5 + CreatedJobs_... (shortened)
lola: processed formula length: 6237
lola: 2 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: 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 12 will run for 697 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_1_7 + FetchJobE_1_8 + FetchJobE_1_9 + FetchJobE_1_10 + FetchJobE_1_11 + FetchJobE_1_12 + FetchJobE_1_13 + FetchJobE_1_14 + FetchJobE_1_15 + FetchJobE_1_16 + FetchJobE_1_17 + FetchJobE_1_18 + FetchJobE_1_19 + FetchJobE_1_20 + FetchJobE_1_21 + FetchJobE_1_22 + ... (shortened)
lola: processed formula length: 1088
lola: 4 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 2 significant temporal operators and needs 9 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 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((cSources <= place_787_1) U (Schedule_Task_B_1 <= place_523_1))) AND (3 <= cSources)) OR (A (F ((2 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))) OR (E (F ((1 <= place_458))) AND (((NotifyEventJobQueuedE_1 <= NotifyEventEndOfCheckSourcesE_1) OR (3 <= place_523_1)) AND (1 <= JobCnt)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((cSources <= place_787_1) U (Schedule_Task_B_1 <= place_523_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((cSources <= place_787_1) U (Schedule_Task_B_1 <= place_523_1))
lola: processed formula length: 65
lola: 1 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 14 will run for 1394 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))
lola: processed formula length: 94
lola: 1 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 15 will run for 2789 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= place_458)))
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 3068 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 14 will run for 1394 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((Try_Check_Sources_B_1 <= mi1))))
lola: 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 3068 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 PolyORBNT-COL-S05J60-CTLCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2789 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((E (G ((FetchJobB_1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5))) AND A (F ((Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_P... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2789 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((FetchJobB_1 <= TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + 1 <= FetchJobB_1))))
lola: processed formula length: 97
lola: 4 rewrites
lola: formula mentions 0 of 909 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J60-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no unknown yes unknown yes yes no no unknown yes no unknown yes unknown
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J60-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494717765597

--------------------
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="PolyORBNT-PT-S05J60"
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/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 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 PolyORBNT-PT-S05J60, 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 r058-smll-149440926200120"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;