fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r138-smll-149479231600102
Last Updated
June 27, 2017

About the Execution of LoLA for S_PolyORBNT-PT-S05J30

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15951.260 1159991.00 1162169.00 3712.60 T?TTF?TF??TFTTFF 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_PolyORBNT-PT-S05J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231600102
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496320001652


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBNT-PT-S05J30: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_PolyORBNT-PT-S05J30: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_PolyORBNT-PT-S05J30 @ 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: 1889/65536 symbol table entries, 156 collisions
lola: preprocessing...
lola: finding significant places
lola: 489 places, 1400 transitions, 407 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 918 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J30-CTLCardinality.task
lola: (A (X (((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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 <= place_520_1) OR (3 <= place_522_1) OR (NotifyEventEndOfCheckSourcesB_1 <= 0)))) AND 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_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_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_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_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_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_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_7_1 + CreatedJobs_7_2 + CreatedJobs_7_3 + CreatedJobs_7_4 + CreatedJobs_7_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_21_1 + CreatedJobs_21_2 + CreatedJobs_21_3 + CreatedJobs_21_4 + CreatedJobs_21_5 + CreatedJobs_9_1 + CreatedJobs_9_2 + CreatedJobs_9_3 + CreatedJobs_9_4 + CreatedJobs_9_5 + CreatedJobs_22_1 + CreatedJobs_22_2 + CreatedJobs_22_3 + CreatedJobs_22_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_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_24_4 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_28_4 + CreatedJobs_28_3 + CreatedJobs_28_2 + CreatedJobs_28_1 + CreatedJobs_14_4 + CreatedJobs_14_3 + CreatedJobs_14_2 + CreatedJobs_14_1 + CreatedJobs_27_4 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_27_3 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_27_2 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_27_1 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_13_5 + CreatedJobs_26_5 + CreatedJobs_12_5 + CreatedJobs_25_5 + CreatedJobs_27_5 + CreatedJobs_14_5 + CreatedJobs_28_5 + CreatedJobs_11_5 + CreatedJobs_24_5 + CreatedJobs_10_5 + CreatedJobs_23_5 + CreatedJobs_22_5 + CreatedJobs_15_1 + CreatedJobs_15_2 + CreatedJobs_15_3 + CreatedJobs_15_4 + CreatedJobs_15_5 <= FetchJobB_1) AND (1 <= mo3) AND (Check_Sources_B_1 <= Try_Check_Sources_E_1))))) : A (X (NOT(A (G ((place_521_1 <= place_518_1)))))) : A (((1 <= mo1) U (mi1 <= place_460))) : A (G (E (((1 <= cJobCnt) U (place_520_1 <= block))))) : E (G (A (((mo2 <= JobCnt) U (NotifyEventJobQueuedE_1 <= Try_Check_Sources_B_1))))) : A (X (A (F ((3 <= place_518_1))))) : E (G (NOT(E (G ((1 <= NotifyEventJobQueuedE_1)))))) : (E (F (E (G ((place_522_1 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30))))) OR E (G (((place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30) OR (1 <= place_782_1) OR (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_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 <= 0))))) : ((((3 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30) OR A (F ((2 <= place_456)))) AND ((place_787_1 + 1 <= DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5) AND E (G ((place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 <= DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5))))) AND E (((place_521_1 + 1 <= place_460) U (mo2 <= ModifiedSrc_4 + ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_5)))) : A (G (A (F ((2 <= place_518_1))))) : NOT(E ((((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 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30) OR (cJobCnt <= 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_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_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_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_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_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_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_7_1 + CreatedJobs_7_2 + CreatedJobs_7_3 + CreatedJobs_7_4 + CreatedJobs_7_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_21_1 + CreatedJobs_21_2 + CreatedJobs_21_3 + CreatedJobs_21_4 + CreatedJobs_21_5 + CreatedJobs_9_1 + CreatedJobs_9_2 + CreatedJobs_9_3 + CreatedJobs_9_4 + CreatedJobs_9_5 + CreatedJobs_22_1 + CreatedJobs_22_2 + CreatedJobs_22_3 + CreatedJobs_22_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_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_24_4 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_28_4 + CreatedJobs_28_3 + CreatedJobs_28_2 + CreatedJobs_28_1 + CreatedJobs_14_4 + CreatedJobs_14_3 + CreatedJobs_14_2 + CreatedJobs_14_1 + CreatedJobs_27_4 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_27_3 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_27_2 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_27_1 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_13_5 + CreatedJobs_26_5 + CreatedJobs_12_5 + CreatedJobs_25_5 + CreatedJobs_27_5 + CreatedJobs_14_5 + CreatedJobs_28_5 + CreatedJobs_11_5 + CreatedJobs_24_5 + CreatedJobs_10_5 + CreatedJobs_23_5 + CreatedJobs_22_5 + CreatedJobs_15_1 + CreatedJobs_15_2 + CreatedJobs_15_3 + CreatedJobs_15_4 + CreatedJobs_15_5)) U ((1 <= Try_Check_Sources_B_1) AND (cSources <= place_456))))) : NOT(A (F (((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) AND (place_458 <= cJobCnt) AND (3 <= CanInjectEvent))))) : A (G ((E (X ((1 <= block))) OR A (G ((place_462 <= Try_Check_Sources_B_1)))))) : NOT(A (F (A (G ((Check_Sources_B_1 <= 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_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_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_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_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_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_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_7_1 + CreatedJobs_7_2 + CreatedJobs_7_3 + CreatedJobs_7_4 + CreatedJobs_7_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_21_1 + CreatedJobs_21_2 + CreatedJobs_21_3 + CreatedJobs_21_4 + CreatedJobs_21_5 + CreatedJobs_9_1 + CreatedJobs_9_2 + CreatedJobs_9_3 + CreatedJobs_9_4 + CreatedJobs_9_5 + CreatedJobs_22_1 + CreatedJobs_22_2 + CreatedJobs_22_3 + CreatedJobs_22_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_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_24_4 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_28_4 + CreatedJobs_28_3 + CreatedJobs_28_2 + CreatedJobs_28_1 + CreatedJobs_14_4 + CreatedJobs_14_3 + CreatedJobs_14_2 + CreatedJobs_14_1 + CreatedJobs_27_4 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_27_3 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_27_2 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_27_1 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_13_5 + CreatedJobs_26_5 + CreatedJobs_12_5 + CreatedJobs_25_5 + CreatedJobs_27_5 + CreatedJobs_14_5 + CreatedJobs_28_5 + CreatedJobs_11_5 + CreatedJobs_24_5 + CreatedJobs_10_5 + CreatedJobs_23_5 + CreatedJobs_22_5 + CreatedJobs_15_1 + CreatedJobs_15_2 + CreatedJobs_15_3 + CreatedJobs_15_4 + CreatedJobs_15_5)))))) : (NOT(A (F (((2 <= place_518_1) AND (1 <= place_782_1))))) OR (1 <= mo2)) : A (G (((FetchJobB_1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30) OR (3 <= place_522_1) OR (2 <= Check_Sources_E_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: (A (X (((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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 <= place_520_1) OR (3 <= place_522_1) OR (NotifyEventEndOfCheckSourcesB_1 <= 0)))) AND E (F (((CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + C... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 <= place_520_1) OR (3 <= place_522_1) OR (NotifyEventEndOfCheckSourcesB_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((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_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 <= place_520_1) OR (3 <= place_522_1) OR (NotifyEventEndOfCheckSourcesB_1 <= 0)))
lola: processed formula length: 324
lola: 1 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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: 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: 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_17_1 + CreatedJobs_17_2 + CreatedJobs_17_3 + CreatedJobs_17_4 + CreatedJobs_17_5 + CreatedJobs_1_1 +... (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 1628 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 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S05J30-CTLCardinality.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(A (G ((place_521_1 <= place_518_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (place_518_1 + 1 <= place_521_1)))
lola: processed formula length: 46
lola: 5 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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: 605418 markings, 1608011 edges, 2242488049709613056 markings/sec, 0 secs
lola: 1182707 markings, 3212359 edges, 115458 markings/sec, 5 secs
lola: 1741322 markings, 4777415 edges, 111723 markings/sec, 10 secs
lola: 2250909 markings, 6222554 edges, 101917 markings/sec, 15 secs
lola: 2773697 markings, 7704084 edges, 104558 markings/sec, 20 secs
lola: 3298911 markings, 9109473 edges, 105043 markings/sec, 25 secs
lola: 3749137 markings, 10377045 edges, 90045 markings/sec, 30 secs
lola: 4163632 markings, 11575050 edges, 82899 markings/sec, 35 secs
lola: 4647306 markings, 12902036 edges, 96735 markings/sec, 40 secs
lola: 5178560 markings, 14385171 edges, 106251 markings/sec, 45 secs
lola: 5726030 markings, 15905437 edges, 109494 markings/sec, 50 secs
lola: 6249213 markings, 17389084 edges, 104637 markings/sec, 55 secs
lola: 6742650 markings, 18790054 edges, 98687 markings/sec, 60 secs
lola: 7164724 markings, 20008083 edges, 84415 markings/sec, 65 secs
lola: 7703535 markings, 21522344 edges, 107762 markings/sec, 70 secs
lola: 8174741 markings, 22844179 edges, 94241 markings/sec, 75 secs
lola: 8653012 markings, 24165750 edges, 95654 markings/sec, 80 secs
lola: 9095829 markings, 25411719 edges, 88563 markings/sec, 85 secs
lola: 9501456 markings, 26601809 edges, 81125 markings/sec, 90 secs
lola: 9922358 markings, 27816576 edges, 84180 markings/sec, 95 secs
lola: 10367783 markings, 29097389 edges, 89085 markings/sec, 100 secs
lola: 10730937 markings, 30141022 edges, 72631 markings/sec, 105 secs
lola: 11226134 markings, 31574230 edges, 99039 markings/sec, 110 secs
lola: 11649339 markings, 32783288 edges, 84641 markings/sec, 115 secs
lola: 12091428 markings, 34061133 edges, 88418 markings/sec, 120 secs
lola: 12506721 markings, 35249251 edges, 83059 markings/sec, 125 secs
lola: 12919767 markings, 36411345 edges, 82609 markings/sec, 130 secs
lola: 13400418 markings, 37851728 edges, 96130 markings/sec, 135 secs
lola: 13878733 markings, 39225195 edges, 95663 markings/sec, 140 secs
lola: 14314072 markings, 40471698 edges, 87068 markings/sec, 145 secs
lola: 14727944 markings, 41678433 edges, 82774 markings/sec, 150 secs
lola: 15125571 markings, 42863539 edges, 79525 markings/sec, 155 secs
lola: 15487866 markings, 43924770 edges, 72459 markings/sec, 160 secs
lola: 15850813 markings, 45029450 edges, 72589 markings/sec, 165 secs
lola: 16322224 markings, 46433960 edges, 94282 markings/sec, 170 secs
lola: 16746436 markings, 47719633 edges, 84842 markings/sec, 175 secs
lola: 17115420 markings, 48834443 edges, 73797 markings/sec, 180 secs
lola: 17555519 markings, 50180095 edges, 88020 markings/sec, 185 secs
lola: 17954455 markings, 51373831 edges, 79787 markings/sec, 190 secs
lola: 18276068 markings, 52371950 edges, 64323 markings/sec, 195 secs
lola: 18655911 markings, 53552772 edges, 75969 markings/sec, 200 secs
lola: 19055308 markings, 54790906 edges, 79879 markings/sec, 205 secs
lola: 19412789 markings, 55934042 edges, 71496 markings/sec, 210 secs
lola: 19773958 markings, 57115093 edges, 72234 markings/sec, 215 secs
lola: 20085349 markings, 58136528 edges, 62278 markings/sec, 220 secs
lola: 20395175 markings, 59140120 edges, 61965 markings/sec, 225 secs
lola: 20734757 markings, 60294116 edges, 67916 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= mo1) U (mi1 <= place_460)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((1 <= mo1) U (mi1 <= place_460))
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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: 794118 markings, 1353925 edges, 2977435431697645568 markings/sec, 0 secs
lola: 1441755 markings, 2590718 edges, 129527 markings/sec, 5 secs
lola: 2122261 markings, 3781360 edges, 136101 markings/sec, 10 secs
lola: 2726204 markings, 4924817 edges, 120789 markings/sec, 15 secs
lola: 3355383 markings, 6035978 edges, 125836 markings/sec, 20 secs
lola: 3967578 markings, 7192897 edges, 122439 markings/sec, 25 secs
lola: 4625221 markings, 8386588 edges, 131529 markings/sec, 30 secs
lola: 5299971 markings, 9620843 edges, 134950 markings/sec, 35 secs
lola: 5908300 markings, 10803015 edges, 121666 markings/sec, 40 secs
lola: 6573637 markings, 11955229 edges, 133067 markings/sec, 45 secs
lola: 7138374 markings, 13050659 edges, 112947 markings/sec, 50 secs
lola: 7737543 markings, 14136070 edges, 119834 markings/sec, 55 secs
lola: 8305693 markings, 15194435 edges, 113630 markings/sec, 60 secs
lola: 8844531 markings, 16207817 edges, 107768 markings/sec, 65 secs
lola: 9492575 markings, 17381663 edges, 129609 markings/sec, 70 secs
lola: 10060891 markings, 18486484 edges, 113663 markings/sec, 75 secs
lola: 10617903 markings, 19470123 edges, 111402 markings/sec, 80 secs
lola: 11106092 markings, 20423607 edges, 97638 markings/sec, 85 secs
lola: 11662510 markings, 21421211 edges, 111284 markings/sec, 90 secs
lola: 12266693 markings, 22562246 edges, 120837 markings/sec, 95 secs
lola: 12905900 markings, 23798603 edges, 127841 markings/sec, 100 secs
lola: 13621154 markings, 25092771 edges, 143051 markings/sec, 105 secs
lola: 14262496 markings, 26234711 edges, 128268 markings/sec, 110 secs
lola: 14769722 markings, 27288696 edges, 101445 markings/sec, 115 secs
lola: 15371315 markings, 28405821 edges, 120319 markings/sec, 120 secs
lola: 15966322 markings, 29451037 edges, 119001 markings/sec, 125 secs
lola: 16460696 markings, 30483988 edges, 98875 markings/sec, 130 secs
lola: 17004615 markings, 31479784 edges, 108784 markings/sec, 135 secs
lola: 17547509 markings, 32506208 edges, 108579 markings/sec, 140 secs
lola: 18101837 markings, 33590782 edges, 110866 markings/sec, 145 secs
lola: 18705784 markings, 34770393 edges, 120789 markings/sec, 150 secs
lola: 19224542 markings, 35697573 edges, 103752 markings/sec, 155 secs
lola: 19750238 markings, 36722311 edges, 105139 markings/sec, 160 secs
lola: 20351146 markings, 37893089 edges, 120182 markings/sec, 165 secs
lola: 20978486 markings, 39101193 edges, 125468 markings/sec, 170 secs
lola: 21518516 markings, 40122916 edges, 108006 markings/sec, 175 secs
lola: 22087251 markings, 41194721 edges, 113747 markings/sec, 180 secs
lola: 22634099 markings, 42232441 edges, 109370 markings/sec, 185 secs
lola: 23094326 markings, 43187758 edges, 92045 markings/sec, 190 secs
lola: 23556773 markings, 44119868 edges, 92489 markings/sec, 195 secs
lola: 24072836 markings, 45076891 edges, 103213 markings/sec, 200 secs
lola: 24648021 markings, 46207143 edges, 115037 markings/sec, 205 secs
lola: 25136011 markings, 47157950 edges, 97598 markings/sec, 210 secs
lola: 25672804 markings, 48214719 edges, 107359 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((1 <= cJobCnt) U (place_520_1 <= block)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((1 <= cJobCnt) U (place_520_1 <= block)))))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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: 600314 markings, 1630241 edges, 3067840301390364672 markings/sec, 0 secs
lola: 1156972 markings, 3134615 edges, 111332 markings/sec, 5 secs
lola: 1734063 markings, 4695380 edges, 115418 markings/sec, 10 secs
lola: 2278660 markings, 6165021 edges, 108919 markings/sec, 15 secs
lola: 2831519 markings, 7645252 edges, 110572 markings/sec, 20 secs
lola: 3350303 markings, 9059299 edges, 103757 markings/sec, 25 secs
lola: 3873916 markings, 10477382 edges, 104723 markings/sec, 30 secs
lola: 4400855 markings, 11907244 edges, 105388 markings/sec, 35 secs
lola: 4909892 markings, 13294322 edges, 101807 markings/sec, 40 secs
lola: 5452079 markings, 14778218 edges, 108437 markings/sec, 45 secs
lola: 5946258 markings, 16134821 edges, 98836 markings/sec, 50 secs
lola: 6458928 markings, 17541168 edges, 102534 markings/sec, 55 secs
lola: 6966382 markings, 18955043 edges, 101491 markings/sec, 60 secs
lola: 7446607 markings, 20290833 edges, 96045 markings/sec, 65 secs
lola: 7926591 markings, 21645778 edges, 95997 markings/sec, 70 secs
lola: 8373377 markings, 22928268 edges, 89357 markings/sec, 75 secs
lola: 8814111 markings, 24247504 edges, 88147 markings/sec, 80 secs
lola: 9311614 markings, 25823673 edges, 99501 markings/sec, 85 secs
lola: 9793125 markings, 27387105 edges, 96302 markings/sec, 90 secs
lola: 10261252 markings, 28919724 edges, 93625 markings/sec, 95 secs
lola: 10763622 markings, 30505659 edges, 100474 markings/sec, 100 secs
lola: 11211015 markings, 31955577 edges, 89479 markings/sec, 105 secs
lola: 11638607 markings, 33368821 edges, 85518 markings/sec, 110 secs
lola: 12067247 markings, 34748332 edges, 85728 markings/sec, 115 secs
lola: 12466612 markings, 36026233 edges, 79873 markings/sec, 120 secs
lola: 12844260 markings, 37271752 edges, 75530 markings/sec, 125 secs
lola: 13261457 markings, 38619768 edges, 83439 markings/sec, 130 secs
lola: 13730684 markings, 40133788 edges, 93845 markings/sec, 135 secs
lola: 14218244 markings, 41710674 edges, 97512 markings/sec, 140 secs
lola: 14682462 markings, 43244568 edges, 92844 markings/sec, 145 secs
lola: 15124489 markings, 44714659 edges, 88405 markings/sec, 150 secs
lola: 15504160 markings, 45957076 edges, 75934 markings/sec, 155 secs
lola: 15995502 markings, 47529761 edges, 98268 markings/sec, 160 secs
lola: 16430822 markings, 48927040 edges, 87064 markings/sec, 165 secs
lola: 16832707 markings, 50244335 edges, 80377 markings/sec, 170 secs
lola: 17226850 markings, 51542195 edges, 78829 markings/sec, 175 secs
lola: 17581602 markings, 52747036 edges, 70950 markings/sec, 180 secs
lola: 17965969 markings, 54022802 edges, 76873 markings/sec, 185 secs
lola: 18403168 markings, 55478914 edges, 87440 markings/sec, 190 secs
lola: 18754281 markings, 56611627 edges, 70223 markings/sec, 195 secs
lola: 19156635 markings, 57945682 edges, 80471 markings/sec, 200 secs
lola: 19565964 markings, 59283524 edges, 81866 markings/sec, 205 secs
lola: 19945806 markings, 60540199 edges, 75968 markings/sec, 210 secs
lola: 20328261 markings, 61810072 edges, 76491 markings/sec, 215 secs
lola: 20681730 markings, 63012005 edges, 70694 markings/sec, 220 secs
lola: 21071281 markings, 64322648 edges, 77910 markings/sec, 225 secs
lola: 21531028 markings, 65854432 edges, 91949 markings/sec, 230 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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((mo2 <= JobCnt) U (NotifyEventJobQueuedE_1 <= Try_Check_Sources_B_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((mo2 <= JobCnt) U (NotifyEventJobQueuedE_1 <= Try_Check_Sources_B_1)))))
lola: processed formula length: 91
lola: 2 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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: subprocess 5 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((3 <= place_518_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: AX(A(TRUE U (3 <= place_518_1)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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 6 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (G ((1 <= NotifyEventJobQueuedE_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (NotifyEventJobQueuedE_1 <= 0)))))
lola: processed formula length: 60
lola: 5 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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 7 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((place_522_1 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30))))) OR E (G (((place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((place_522_1 <= f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (f2_0 + f2_1 + f2_2 + f2_3 + f2_4 + f2_5 + f2_6 + f2_7 + f2_8 + f2_9 + f2_10 + f2_11 + f2_12 + f2_13 + f2_14 + f2_15 + f2_16 + f2_17 + f2_18 + f2_19 + f2_20 + f2_21 + f2_22 + f2_23 + f2_24 + f2_25 + f2_26 + f2_27 + f2_28 + f2_29 + f2_30 + 1 <= place_522_1))))
lola: processed formula length: 281
lola: 3 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 8 will run for 355 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((3 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30) OR A (F ((2 <= place_456)))) AND ((place_787_1 + 1 <= DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5) AND E (G ((place_482_1_1 + plac... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 355 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30)
lola: processed formula length: 242
lola: 2 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-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: ========================================
lola: subprocess 9 will run for 406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= place_456)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= place_456))
lola: processed formula length: 26
lola: 3 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((2 <= place_518_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (2 <= place_518_1)))))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((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... (shortened)
lola: processed formula length: 3736
lola: 7 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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: 963933 markings, 1352210 edges, 2270754981831245824 markings/sec, 0 secs
lola: 1841703 markings, 2616399 edges, 175554 markings/sec, 5 secs
lola: 2664468 markings, 3859286 edges, 164553 markings/sec, 10 secs
lola: 3455927 markings, 5138589 edges, 158292 markings/sec, 15 secs
lola: 4101595 markings, 6358199 edges, 129134 markings/sec, 20 secs
lola: 4788936 markings, 7490756 edges, 137468 markings/sec, 25 secs
lola: 5597452 markings, 8644118 edges, 161703 markings/sec, 30 secs
lola: 6307811 markings, 9686540 edges, 142072 markings/sec, 35 secs
lola: 7077217 markings, 10866288 edges, 153881 markings/sec, 40 secs
lola: 7740890 markings, 11954686 edges, 132735 markings/sec, 45 secs
lola: 8310172 markings, 13036233 edges, 113856 markings/sec, 50 secs
lola: 8928071 markings, 14089220 edges, 123580 markings/sec, 55 secs
lola: 9642120 markings, 15110394 edges, 142810 markings/sec, 60 secs
lola: 10365220 markings, 16153593 edges, 144620 markings/sec, 65 secs
lola: 11077062 markings, 17223502 edges, 142368 markings/sec, 70 secs
lola: 11717365 markings, 18234075 edges, 128061 markings/sec, 75 secs
lola: 12336945 markings, 19296815 edges, 123916 markings/sec, 80 secs
lola: 12806948 markings, 20328601 edges, 94001 markings/sec, 85 secs
lola: 13483861 markings, 21285599 edges, 135383 markings/sec, 90 secs
lola: 14191040 markings, 22291187 edges, 141436 markings/sec, 95 secs
lola: 14866756 markings, 23275799 edges, 135143 markings/sec, 100 secs
lola: 15514224 markings, 24254176 edges, 129494 markings/sec, 105 secs
lola: 16130959 markings, 25218739 edges, 123347 markings/sec, 110 secs
lola: 16736867 markings, 26244554 edges, 121182 markings/sec, 115 secs
lola: 17209352 markings, 27223287 edges, 94497 markings/sec, 120 secs
lola: 17826406 markings, 28191298 edges, 123411 markings/sec, 125 secs
lola: 18502452 markings, 29148209 edges, 135209 markings/sec, 130 secs
lola: 19166988 markings, 30100938 edges, 132907 markings/sec, 135 secs
lola: 19829755 markings, 31084977 edges, 132553 markings/sec, 140 secs
lola: 20468051 markings, 32064672 edges, 127659 markings/sec, 145 secs
lola: 21061595 markings, 33034585 edges, 118709 markings/sec, 150 secs
lola: 21602428 markings, 34026439 edges, 108167 markings/sec, 155 secs
lola: 22114454 markings, 35019923 edges, 102405 markings/sec, 160 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((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 + Fe... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((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: 591
lola: 5 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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 12 will run for 669 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((1 <= block))) OR A (G ((place_462 <= Try_Check_Sources_B_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(EX((1 <= block))) AND E(TRUE U (Try_Check_Sources_B_1 + 1 <= place_462)))))
lola: processed formula length: 93
lola: 6 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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 892 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((Check_Sources_B_1 <= 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_17_1 + CreatedJobs_17_2 + CreatedJobs_17_3 + CreatedJobs_17_4 + Create... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(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_17_1 + CreatedJobs_17_2 + CreatedJobs_17_3 + CreatedJobs_17_4 + CreatedJobs_17_5 ... (shortened)
lola: processed formula length: 2949
lola: 7 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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: 389409 markings, 1444034 edges, 2977435431697645568 markings/sec, 0 secs
lola: 732873 markings, 2716785 edges, 68693 markings/sec, 5 secs
lola: 1068066 markings, 3955128 edges, 67039 markings/sec, 10 secs
lola: 1411395 markings, 5229615 edges, 68666 markings/sec, 15 secs
lola: 1759131 markings, 6520845 edges, 69547 markings/sec, 20 secs
lola: 2097434 markings, 7769544 edges, 67661 markings/sec, 25 secs
lola: 2420593 markings, 8971638 edges, 64632 markings/sec, 30 secs
lola: 2770291 markings, 10255639 edges, 69940 markings/sec, 35 secs
lola: 3097542 markings, 11472648 edges, 65450 markings/sec, 40 secs
lola: 3417535 markings, 12655268 edges, 63999 markings/sec, 45 secs
lola: 3732584 markings, 13828073 edges, 63010 markings/sec, 50 secs
lola: 4064510 markings, 15059979 edges, 66385 markings/sec, 55 secs
lola: 4396526 markings, 16292511 edges, 66403 markings/sec, 60 secs
lola: 4729898 markings, 17528860 edges, 66674 markings/sec, 65 secs
lola: 5059189 markings, 18763542 edges, 65858 markings/sec, 70 secs
lola: 5422635 markings, 20118166 edges, 72689 markings/sec, 75 secs
lola: 5757748 markings, 21362774 edges, 67023 markings/sec, 80 secs
lola: 6075776 markings, 22560887 edges, 63606 markings/sec, 85 secs
lola: 6417855 markings, 23845323 edges, 68416 markings/sec, 90 secs
lola: 6746796 markings, 25088499 edges, 65788 markings/sec, 95 secs
lola: 7087213 markings, 26375862 edges, 68083 markings/sec, 100 secs
lola: 7402787 markings, 27570408 edges, 63115 markings/sec, 105 secs
lola: 7729878 markings, 28816409 edges, 65418 markings/sec, 110 secs
lola: 8041001 markings, 30013756 edges, 62225 markings/sec, 115 secs
lola: 8346597 markings, 31199465 edges, 61119 markings/sec, 120 secs
lola: 8642664 markings, 32362125 edges, 59213 markings/sec, 125 secs
lola: 8917885 markings, 33517883 edges, 55044 markings/sec, 130 secs
lola: 9521747 markings, 34824658 edges, 120772 markings/sec, 135 secs
lola: 10093226 markings, 36093188 edges, 114296 markings/sec, 140 secs
lola: 10657329 markings, 37345454 edges, 112821 markings/sec, 145 secs
lola: 11166072 markings, 38499159 edges, 101749 markings/sec, 150 secs
lola: 11664958 markings, 39635729 edges, 99777 markings/sec, 155 secs
lola: 12133826 markings, 40716031 edges, 93774 markings/sec, 160 secs
lola: 12600444 markings, 41697703 edges, 93324 markings/sec, 165 secs
lola: 13068443 markings, 42756470 edges, 93600 markings/sec, 170 secs
lola: 13561436 markings, 43873141 edges, 98599 markings/sec, 175 secs
lola: 14109423 markings, 45107179 edges, 109597 markings/sec, 180 secs
lola: 14664412 markings, 46371369 edges, 110998 markings/sec, 185 secs
lola: 15168661 markings, 47529612 edges, 100850 markings/sec, 190 secs
lola: 15604041 markings, 48533732 edges, 87076 markings/sec, 195 secs
lola: 16156351 markings, 49768129 edges, 110462 markings/sec, 200 secs
lola: 16608927 markings, 50798943 edges, 90515 markings/sec, 205 secs
lola: 17082002 markings, 51865160 edges, 94615 markings/sec, 210 secs
lola: 17504962 markings, 52851935 edges, 84592 markings/sec, 215 secs
lola: 17951156 markings, 53854238 edges, 89239 markings/sec, 220 secs
lola: 18435783 markings, 55016222 edges, 96925 markings/sec, 225 secs
lola: 18826597 markings, 55884652 edges, 78163 markings/sec, 230 secs
lola: 19307635 markings, 57017672 edges, 96208 markings/sec, 235 secs
lola: 19722165 markings, 57979357 edges, 82906 markings/sec, 240 secs
lola: 20198287 markings, 59055854 edges, 95224 markings/sec, 245 secs
lola: 20617839 markings, 60038837 edges, 83910 markings/sec, 250 secs
lola: 21082257 markings, 61124009 edges, 92884 markings/sec, 255 secs
lola: 21615334 markings, 62375353 edges, 106615 markings/sec, 260 secs
lola: 22065439 markings, 63462549 edges, 90021 markings/sec, 265 secs
lola: 22502301 markings, 64455923 edges, 87372 markings/sec, 270 secs
lola: 22926527 markings, 65463110 edges, 84845 markings/sec, 275 secs
lola: 23302249 markings, 66360837 edges, 75144 markings/sec, 280 secs
lola: 23733978 markings, 67402734 edges, 86346 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1190 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (((2 <= place_518_1) AND (1 <= place_782_1))))) OR (1 <= mo2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1190 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((place_518_1 <= 1) OR (place_782_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= place_518_1) AND (1 <= place_782_1))))
lola: processed formula length: 58
lola: 5 rewrites
lola: formula mentions 0 of 489 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 15 will run for 2380 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FetchJobB_1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30) OR (3 <= place_522_1) OR (2 <= Check_Sources_E_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 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 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: RESULT
lola:
SUMMARY: yes unknown unknown unknown yes no yes yes no no yes yes no unknown yes no
lola: ========================================
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J30-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496321161643

--------------------
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_PolyORBNT-PT-S05J30"
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_PolyORBNT-PT-S05J30.tgz
mv S_PolyORBNT-PT-S05J30 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_PolyORBNT-PT-S05J30, 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 r138-smll-149479231600102"
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 ;