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

About the Execution of LoLA for PolyORBNT-PT-S10J30

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1939.200 1526970.00 3055557.00 3470.50 TTTF?FFT???FFFTT 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 PolyORBNT-PT-S10J30, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926200151
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494734684201


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ PolyORBNT-PT-S10J30 @ 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: 12714/65536 symbol table entries, 4655 collisions
lola: preprocessing...
lola: finding significant places
lola: 664 places, 12050 transitions, 572 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2298 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J30-ReachabilityCardinality.task
lola: E (F (((((3 <= Try_Check_Sources_E_1) OR (cSources <= JobCnt)) AND (3 <= 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_30 + 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)) OR (((place_782_1 <= place_518_1) OR (3 <= place_460)) AND (3 <= place_521_1))))) : E (F (((QueueJobE_1 <= 2) AND (place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9 + 1 <= 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_30 + 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) AND (((Schedule_Task_B_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) AND (1 <= cJobCnt)) OR (cJobCnt <= 2))))) : E (F ((2 <= mo3))) : A (G (((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 + 1 <= Try_Check_Sources_B_1) OR (mo2 <= 1) OR (place_523_1 <= 1)))) : E (F (((2 <= CanInjectEvent) AND (CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_29_6 + CreatedJobs_29_7 + CreatedJobs_29_8 + CreatedJobs_29_9 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_16_6 + CreatedJobs_16_7 + CreatedJobs_16_8 + CreatedJobs_16_9 + CreatedJobs_20_10 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_0_7 + CreatedJobs_0_8 + CreatedJobs_0_9 + CreatedJobs_17_1 + CreatedJobs_17_2 + CreatedJobs_17_3 + CreatedJobs_17_4 + CreatedJobs_17_5 + CreatedJobs_17_6 + CreatedJobs_17_7 + CreatedJobs_17_8 + CreatedJobs_17_9 + CreatedJobs_3_10 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_1_7 + CreatedJobs_1_8 + CreatedJobs_1_9 + CreatedJobs_13_10 + CreatedJobs_25_10 + CreatedJobs_18_1 + CreatedJobs_18_2 + CreatedJobs_18_3 + CreatedJobs_18_4 + CreatedJobs_18_5 + CreatedJobs_18_6 + CreatedJobs_18_7 + CreatedJobs_18_8 + CreatedJobs_18_9 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_2_7 + CreatedJobs_2_8 + CreatedJobs_2_9 + CreatedJobs_8_10 + CreatedJobs_18_10 + CreatedJobs_19_1 + CreatedJobs_19_2 + CreatedJobs_19_3 + CreatedJobs_19_4 + CreatedJobs_19_5 + CreatedJobs_19_6 + CreatedJobs_19_7 + CreatedJobs_19_8 + CreatedJobs_19_9 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_3_7 + CreatedJobs_3_8 + CreatedJobs_3_9 + CreatedJobs_2_10 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6 + CreatedJobs_4_7 + CreatedJobs_4_8 + CreatedJobs_4_9 + CreatedJobs_30_1 + CreatedJobs_30_2 + CreatedJobs_30_3 + CreatedJobs_30_4 + CreatedJobs_30_5 + CreatedJobs_30_6 + CreatedJobs_30_7 + CreatedJobs_30_8 + CreatedJobs_30_9 + CreatedJobs_12_10 + CreatedJobs_24_10 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_5_6 + CreatedJobs_5_7 + CreatedJobs_5_8 + CreatedJobs_5_9 + CreatedJobs_7_10 + CreatedJobs_17_10 + CreatedJobs_29_10 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_6_6 + CreatedJobs_6_7 + CreatedJobs_6_8 + CreatedJobs_6_9 + CreatedJobs_30_10 + CreatedJobs_1_10 + CreatedJobs_7_1 + CreatedJobs_7_2 + CreatedJobs_7_3 + CreatedJobs_7_4 + CreatedJobs_7_5 + CreatedJobs_7_6 + CreatedJobs_7_7 + CreatedJobs_7_8 + CreatedJobs_7_9 + CreatedJobs_20_1 + CreatedJobs_20_2 + CreatedJobs_20_3 + CreatedJobs_20_4 + CreatedJobs_20_5 + CreatedJobs_20_6 + CreatedJobs_20_7 + CreatedJobs_20_8 + CreatedJobs_20_9 + CreatedJobs_11_10 + CreatedJobs_23_10 + CreatedJobs_8_1 + CreatedJobs_8_2 + CreatedJobs_8_3 + CreatedJobs_8_4 + CreatedJobs_8_5 + CreatedJobs_8_6 + CreatedJobs_8_7 + CreatedJobs_8_8 + CreatedJobs_8_9 + CreatedJobs_21_1 + CreatedJobs_21_2 + CreatedJobs_21_3 + CreatedJobs_21_4 + CreatedJobs_21_5 + CreatedJobs_21_6 + CreatedJobs_21_7 + CreatedJobs_21_8 + CreatedJobs_21_9 + CreatedJobs_6_10 + CreatedJobs_28_10 + CreatedJobs_9_1 + CreatedJobs_9_2 + CreatedJobs_9_3 + CreatedJobs_9_4 + CreatedJobs_9_5 + CreatedJobs_9_6 + CreatedJobs_9_7 + CreatedJobs_9_8 + CreatedJobs_9_9 + CreatedJobs_22_1 + CreatedJobs_22_2 + CreatedJobs_22_3 + CreatedJobs_22_4 + CreatedJobs_22_5 + CreatedJobs_22_6 + CreatedJobs_22_7 + CreatedJobs_22_8 + CreatedJobs_22_9 + CreatedJobs_0_10 + CreatedJobs_23_1 + CreatedJobs_23_2 + CreatedJobs_23_3 + CreatedJobs_23_4 + CreatedJobs_23_5 + CreatedJobs_23_6 + CreatedJobs_23_7 + CreatedJobs_23_8 + CreatedJobs_10_1 + CreatedJobs_10_2 + CreatedJobs_10_3 + CreatedJobs_10_4 + CreatedJobs_10_5 + CreatedJobs_10_6 + CreatedJobs_10_7 + CreatedJobs_10_8 + CreatedJobs_10_9 + CreatedJobs_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_24_4 + CreatedJobs_24_5 + CreatedJobs_24_6 + CreatedJobs_24_7 + CreatedJobs_24_8 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_11_5 + CreatedJobs_11_6 + CreatedJobs_11_7 + CreatedJobs_11_8 + CreatedJobs_5_10 + CreatedJobs_28_8 + CreatedJobs_28_7 + CreatedJobs_28_6 + CreatedJobs_28_5 + CreatedJobs_28_4 + CreatedJobs_28_3 + CreatedJobs_15_10 + CreatedJobs_27_10 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_25_5 + CreatedJobs_25_6 + CreatedJobs_25_7 + CreatedJobs_25_8 + CreatedJobs_28_2 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_12_5 + CreatedJobs_12_6 + CreatedJobs_12_7 + CreatedJobs_12_8 + CreatedJobs_28_1 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_26_5 + CreatedJobs_26_6 + CreatedJobs_26_7 + CreatedJobs_26_8 + CreatedJobs_26_9 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_13_5 + CreatedJobs_13_6 + CreatedJobs_13_7 + CreatedJobs_13_8 + CreatedJobs_14_8 + CreatedJobs_14_7 + CreatedJobs_14_6 + CreatedJobs_14_5 + CreatedJobs_14_4 + CreatedJobs_14_3 + CreatedJobs_14_2 + CreatedJobs_14_1 + CreatedJobs_27_8 + CreatedJobs_27_7 + CreatedJobs_27_6 + CreatedJobs_27_5 + CreatedJobs_27_4 + CreatedJobs_27_3 + CreatedJobs_27_1 + CreatedJobs_27_2 + CreatedJobs_27_9 + CreatedJobs_21_10 + CreatedJobs_13_9 + CreatedJobs_14_9 + CreatedJobs_4_10 + CreatedJobs_14_10 + CreatedJobs_26_10 + CreatedJobs_12_9 + CreatedJobs_25_9 + CreatedJobs_28_9 + CreatedJobs_11_9 + CreatedJobs_24_9 + CreatedJobs_22_10 + CreatedJobs_10_10 + CreatedJobs_23_9 + CreatedJobs_16_10 + CreatedJobs_15_1 + CreatedJobs_15_2 + CreatedJobs_15_3 + CreatedJobs_15_4 + CreatedJobs_15_5 + CreatedJobs_15_6 + CreatedJobs_15_7 + CreatedJobs_15_8 + CreatedJobs_15_9 + CreatedJobs_9_10 + CreatedJobs_19_10 <= place_520_1) AND (place_520_1 + 1 <= place_787_1) AND (2 <= CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_29_6 + CreatedJobs_29_7 + CreatedJobs_29_8 + CreatedJobs_29_9 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_16_6 + CreatedJobs_16_7 + CreatedJobs_16_8 + CreatedJobs_16_9 + CreatedJobs_20_10 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_0_7 + CreatedJobs_0_8 + CreatedJobs_0_9 + CreatedJobs_17_1 + CreatedJobs_17_2 + CreatedJobs_17_3 + CreatedJobs_17_4 + CreatedJobs_17_5 + CreatedJobs_17_6 + CreatedJobs_17_7 + CreatedJobs_17_8 + CreatedJobs_17_9 + CreatedJobs_3_10 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_1_7 + CreatedJobs_1_8 + CreatedJobs_1_9 + CreatedJobs_13_10 + CreatedJobs_25_10 + CreatedJobs_18_1 + CreatedJobs_18_2 + CreatedJobs_18_3 + CreatedJobs_18_4 + CreatedJobs_18_5 + CreatedJobs_18_6 + CreatedJobs_18_7 + CreatedJobs_18_8 + CreatedJobs_18_9 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_2_7 + CreatedJobs_2_8 + CreatedJobs_2_9 + CreatedJobs_8_10 + CreatedJobs_18_10 + CreatedJobs_19_1 + CreatedJobs_19_2 + CreatedJobs_19_3 + CreatedJobs_19_4 + CreatedJobs_19_5 + CreatedJobs_19_6 + CreatedJobs_19_7 + CreatedJobs_19_8 + CreatedJobs_19_9 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_3_7 + CreatedJobs_3_8 + CreatedJobs_3_9 + CreatedJobs_2_10 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6 + CreatedJobs_4_7 + CreatedJobs_4_8 + CreatedJobs_4_9 + CreatedJobs_30_1 + CreatedJobs_30_2 + CreatedJobs_30_3 + CreatedJobs_30_4 + CreatedJobs_30_5 + CreatedJobs_30_6 + CreatedJobs_30_7 + CreatedJobs_30_8 + CreatedJobs_30_9 + CreatedJobs_12_10 + CreatedJobs_24_10 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_5_6 + CreatedJobs_5_7 + CreatedJobs_5_8 + CreatedJobs_5_9 + CreatedJobs_7_10 + CreatedJobs_17_10 + CreatedJobs_29_10 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_6_6 + CreatedJobs_6_7 + CreatedJobs_6_8 + CreatedJobs_6_9 + CreatedJobs_30_10 + CreatedJobs_1_10 + CreatedJobs_7_1 + CreatedJobs_7_2 + CreatedJobs_7_3 + CreatedJobs_7_4 + CreatedJobs_7_5 + CreatedJobs_7_6 + CreatedJobs_7_7 + CreatedJobs_7_8 + CreatedJobs_7_9 + CreatedJobs_20_1 + CreatedJobs_20_2 + CreatedJobs_20_3 + CreatedJobs_20_4 + CreatedJobs_20_5 + CreatedJobs_20_6 + CreatedJobs_20_7 + CreatedJobs_20_8 + CreatedJobs_20_9 + CreatedJobs_11_10 + CreatedJobs_23_10 + CreatedJobs_8_1 + CreatedJobs_8_2 + CreatedJobs_8_3 + CreatedJobs_8_4 + CreatedJobs_8_5 + CreatedJobs_8_6 + CreatedJobs_8_7 + CreatedJobs_8_8 + CreatedJobs_8_9 + CreatedJobs_21_1 + CreatedJobs_21_2 + CreatedJobs_21_3 + CreatedJobs_21_4 + CreatedJobs_21_5 + CreatedJobs_21_6 + CreatedJobs_21_7 + CreatedJobs_21_8 + CreatedJobs_21_9 + CreatedJobs_6_10 + CreatedJobs_28_10 + CreatedJobs_9_1 + CreatedJobs_9_2 + CreatedJobs_9_3 + CreatedJobs_9_4 + CreatedJobs_9_5 + CreatedJobs_9_6 + CreatedJobs_9_7 + CreatedJobs_9_8 + CreatedJobs_9_9 + CreatedJobs_22_1 + CreatedJobs_22_2 + CreatedJobs_22_3 + CreatedJobs_22_4 + CreatedJobs_22_5 + CreatedJobs_22_6 + CreatedJobs_22_7 + CreatedJobs_22_8 + CreatedJobs_22_9 + CreatedJobs_0_10 + CreatedJobs_23_1 + CreatedJobs_23_2 + CreatedJobs_23_3 + CreatedJobs_23_4 + CreatedJobs_23_5 + CreatedJobs_23_6 + CreatedJobs_23_7 + CreatedJobs_23_8 + CreatedJobs_10_1 + CreatedJobs_10_2 + CreatedJobs_10_3 + CreatedJobs_10_4 + CreatedJobs_10_5 + CreatedJobs_10_6 + CreatedJobs_10_7 + CreatedJobs_10_8 + CreatedJobs_10_9 + CreatedJobs_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_24_4 + CreatedJobs_24_5 + CreatedJobs_24_6 + CreatedJobs_24_7 + CreatedJobs_24_8 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_11_5 + CreatedJobs_11_6 + CreatedJobs_11_7 + CreatedJobs_11_8 + CreatedJobs_5_10 + CreatedJobs_28_8 + CreatedJobs_28_7 + CreatedJobs_28_6 + CreatedJobs_28_5 + CreatedJobs_28_4 + CreatedJobs_28_3 + CreatedJobs_15_10 + CreatedJobs_27_10 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_25_5 + CreatedJobs_25_6 + CreatedJobs_25_7 + CreatedJobs_25_8 + CreatedJobs_28_2 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_12_5 + CreatedJobs_12_6 + CreatedJobs_12_7 + CreatedJobs_12_8 + CreatedJobs_28_1 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_26_5 + CreatedJobs_26_6 + CreatedJobs_26_7 + CreatedJobs_26_8 + CreatedJobs_26_9 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_13_5 + CreatedJobs_13_6 + CreatedJobs_13_7 + CreatedJobs_13_8 + CreatedJobs_14_8 + CreatedJobs_14_7 + CreatedJobs_14_6 + CreatedJobs_14_5 + CreatedJobs_14_4 + CreatedJobs_14_3 + CreatedJobs_14_2 + CreatedJobs_14_1 + CreatedJobs_27_8 + CreatedJobs_27_7 + CreatedJobs_27_6 + CreatedJobs_27_5 + CreatedJobs_27_4 + CreatedJobs_27_3 + CreatedJobs_27_1 + CreatedJobs_27_2 + CreatedJobs_27_9 + CreatedJobs_21_10 + CreatedJobs_13_9 + CreatedJobs_14_9 + CreatedJobs_4_10 + CreatedJobs_14_10 + CreatedJobs_26_10 + CreatedJobs_12_9 + CreatedJobs_25_9 + CreatedJobs_28_9 + CreatedJobs_11_9 + CreatedJobs_24_9 + CreatedJobs_22_10 + CreatedJobs_10_10 + CreatedJobs_23_9 + CreatedJobs_16_10 + CreatedJobs_15_1 + CreatedJobs_15_2 + CreatedJobs_15_3 + CreatedJobs_15_4 + CreatedJobs_15_5 + CreatedJobs_15_6 + CreatedJobs_15_7 + CreatedJobs_15_8 + CreatedJobs_15_9 + CreatedJobs_9_10 + CreatedJobs_19_10)))) : A (G (((place_518_1 <= 1) AND (CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_29_6 + CreatedJobs_29_7 + CreatedJobs_29_8 + CreatedJobs_29_9 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_16_6 + CreatedJobs_16_7 + CreatedJobs_16_8 + CreatedJobs_16_9 + CreatedJobs_20_10 + CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_0_7 + CreatedJobs_0_8 + CreatedJobs_0_9 + CreatedJobs_17_1 + CreatedJobs_17_2 + CreatedJobs_17_3 + CreatedJobs_17_4 + CreatedJobs_17_5 + CreatedJobs_17_6 + CreatedJobs_17_7 + CreatedJobs_17_8 + CreatedJobs_17_9 + CreatedJobs_3_10 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_1_7 + CreatedJobs_1_8 + CreatedJobs_1_9 + CreatedJobs_13_10 + CreatedJobs_25_10 + CreatedJobs_18_1 + CreatedJobs_18_2 + CreatedJobs_18_3 + CreatedJobs_18_4 + CreatedJobs_18_5 + CreatedJobs_18_6 + CreatedJobs_18_7 + CreatedJobs_18_8 + CreatedJobs_18_9 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_2_7 + CreatedJobs_2_8 + CreatedJobs_2_9 + CreatedJobs_8_10 + CreatedJobs_18_10 + CreatedJobs_19_1 + CreatedJobs_19_2 + CreatedJobs_19_3 + CreatedJobs_19_4 + CreatedJobs_19_5 + CreatedJobs_19_6 + CreatedJobs_19_7 + CreatedJobs_19_8 + CreatedJobs_19_9 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_3_7 + CreatedJobs_3_8 + CreatedJobs_3_9 + CreatedJobs_2_10 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6 + CreatedJobs_4_7 + CreatedJobs_4_8 + CreatedJobs_4_9 + CreatedJobs_30_1 + CreatedJobs_30_2 + CreatedJobs_30_3 + CreatedJobs_30_4 + CreatedJobs_30_5 + CreatedJobs_30_6 + CreatedJobs_30_7 + CreatedJobs_30_8 + CreatedJobs_30_9 + CreatedJobs_12_10 + CreatedJobs_24_10 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_5_6 + CreatedJobs_5_7 + CreatedJobs_5_8 + CreatedJobs_5_9 + CreatedJobs_7_10 + CreatedJobs_17_10 + CreatedJobs_29_10 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_6_6 + CreatedJobs_6_7 + CreatedJobs_6_8 + CreatedJobs_6_9 + CreatedJobs_30_10 + CreatedJobs_1_10 + CreatedJobs_7_1 + CreatedJobs_7_2 + CreatedJobs_7_3 + CreatedJobs_7_4 + CreatedJobs_7_5 + CreatedJobs_7_6 + CreatedJobs_7_7 + CreatedJobs_7_8 + CreatedJobs_7_9 + CreatedJobs_20_1 + CreatedJobs_20_2 + CreatedJobs_20_3 + CreatedJobs_20_4 + CreatedJobs_20_5 + CreatedJobs_20_6 + CreatedJobs_20_7 + CreatedJobs_20_8 + CreatedJobs_20_9 + CreatedJobs_11_10 + CreatedJobs_23_10 + CreatedJobs_8_1 + CreatedJobs_8_2 + CreatedJobs_8_3 + CreatedJobs_8_4 + CreatedJobs_8_5 + CreatedJobs_8_6 + CreatedJobs_8_7 + CreatedJobs_8_8 + CreatedJobs_8_9 + CreatedJobs_21_1 + CreatedJobs_21_2 + CreatedJobs_21_3 + CreatedJobs_21_4 + CreatedJobs_21_5 + CreatedJobs_21_6 + CreatedJobs_21_7 + CreatedJobs_21_8 + CreatedJobs_21_9 + CreatedJobs_6_10 + CreatedJobs_28_10 + CreatedJobs_9_1 + CreatedJobs_9_2 + CreatedJobs_9_3 + CreatedJobs_9_4 + CreatedJobs_9_5 + CreatedJobs_9_6 + CreatedJobs_9_7 + CreatedJobs_9_8 + CreatedJobs_9_9 + CreatedJobs_22_1 + CreatedJobs_22_2 + CreatedJobs_22_3 + CreatedJobs_22_4 + CreatedJobs_22_5 + CreatedJobs_22_6 + CreatedJobs_22_7 + CreatedJobs_22_8 + CreatedJobs_22_9 + CreatedJobs_0_10 + CreatedJobs_23_1 + CreatedJobs_23_2 + CreatedJobs_23_3 + CreatedJobs_23_4 + CreatedJobs_23_5 + CreatedJobs_23_6 + CreatedJobs_23_7 + CreatedJobs_23_8 + CreatedJobs_10_1 + CreatedJobs_10_2 + CreatedJobs_10_3 + CreatedJobs_10_4 + CreatedJobs_10_5 + CreatedJobs_10_6 + CreatedJobs_10_7 + CreatedJobs_10_8 + CreatedJobs_10_9 + CreatedJobs_24_1 + CreatedJobs_24_2 + CreatedJobs_24_3 + CreatedJobs_24_4 + CreatedJobs_24_5 + CreatedJobs_24_6 + CreatedJobs_24_7 + CreatedJobs_24_8 + CreatedJobs_11_1 + CreatedJobs_11_2 + CreatedJobs_11_3 + CreatedJobs_11_4 + CreatedJobs_11_5 + CreatedJobs_11_6 + CreatedJobs_11_7 + CreatedJobs_11_8 + CreatedJobs_5_10 + CreatedJobs_28_8 + CreatedJobs_28_7 + CreatedJobs_28_6 + CreatedJobs_28_5 + CreatedJobs_28_4 + CreatedJobs_28_3 + CreatedJobs_15_10 + CreatedJobs_27_10 + CreatedJobs_25_1 + CreatedJobs_25_2 + CreatedJobs_25_3 + CreatedJobs_25_4 + CreatedJobs_25_5 + CreatedJobs_25_6 + CreatedJobs_25_7 + CreatedJobs_25_8 + CreatedJobs_28_2 + CreatedJobs_12_1 + CreatedJobs_12_2 + CreatedJobs_12_3 + CreatedJobs_12_4 + CreatedJobs_12_5 + CreatedJobs_12_6 + CreatedJobs_12_7 + CreatedJobs_12_8 + CreatedJobs_28_1 + CreatedJobs_26_1 + CreatedJobs_26_2 + CreatedJobs_26_3 + CreatedJobs_26_4 + CreatedJobs_26_5 + CreatedJobs_26_6 + CreatedJobs_26_7 + CreatedJobs_26_8 + CreatedJobs_26_9 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_13_5 + CreatedJobs_13_6 + CreatedJobs_13_7 + CreatedJobs_13_8 + CreatedJobs_14_8 + CreatedJobs_14_7 + CreatedJobs_14_6 + CreatedJobs_14_5 + CreatedJobs_14_4 + CreatedJobs_14_3 + CreatedJobs_14_2 + CreatedJobs_14_1 + CreatedJobs_27_8 + CreatedJobs_27_7 + CreatedJobs_27_6 + CreatedJobs_27_5 + CreatedJobs_27_4 + CreatedJobs_27_3 + CreatedJobs_27_1 + CreatedJobs_27_2 + CreatedJobs_27_9 + CreatedJobs_21_10 + CreatedJobs_13_9 + CreatedJobs_14_9 + CreatedJobs_4_10 + CreatedJobs_14_10 + CreatedJobs_26_10 + CreatedJobs_12_9 + CreatedJobs_25_9 + CreatedJobs_28_9 + CreatedJobs_11_9 + CreatedJobs_24_9 + CreatedJobs_22_10 + CreatedJobs_10_10 + CreatedJobs_23_9 + CreatedJobs_16_10 + CreatedJobs_15_1 + CreatedJobs_15_2 + CreatedJobs_15_3 + CreatedJobs_15_4 + CreatedJobs_15_5 + CreatedJobs_15_6 + CreatedJobs_15_7 + CreatedJobs_15_8 + CreatedJobs_15_9 + CreatedJobs_9_10 + CreatedJobs_19_10 <= cSources)))) : A (G (((3 <= place_500_1) OR (3 <= Try_Check_Sources_B_1) OR (place_460 <= QueueJobE_1) OR (TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + TheSour_6 + TheSour_7 + TheSour_8 + TheSour_9 + TheSour_10 <= 2)))) : A (G (((Perform_Work_E_1 <= Check_Sources_B_1) AND (1 <= DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1)))) : E (F ((mi1 <= mo3))) : E (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + TheSour_6 + TheSour_7 + TheSour_8 + TheSour_9 + TheSour_10 <= place_522_1))) : E (F (((2 <= QueueJobE_1) OR (((3 <= 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) OR (1 <= Check_Sources_E_1)) AND (place_522_1 <= 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_30 + 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))))) : A (G (((mi1 + 1 <= place_521_1) OR (Check_Sources_B_1 + 1 <= 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) OR (((place_460 <= 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 (3 <= place_456)) AND (Try_Check_Sources_E_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))))) : E (F ((((1 <= cJobCnt) OR (mi1 <= place_518_1) OR (mo3 <= mo1)) AND (2 <= mo2)))) : A (G (((3 <= place_500_1) OR (((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 <= DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1) OR (mi3 <= Try_Check_Sources_B_1)) AND (Check_Sources_E_1 <= Try_Check_Sources_E_1))))) : A (G (((mi3 <= Perform_Work_E_1) OR ((place_522_1 + 1 <= 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_30 + 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) AND (NotifyEventEndOfCheckSourcesB_1 + 1 <= Perform_Work_E_1))))) : E (F ((Check_Sources_E_1 + 1 <= mo3)))
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 (F (((((3 <= Try_Check_Sources_E_1) OR (cSources <= JobCnt)) AND (3 <= 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 + NotifyE... (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 2288 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 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((QueueJobE_1 <= 2) AND (place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9 + 1 <= NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + ... (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 2288 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= mo3)))
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 2288 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-S10J30-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 10888 markings, 12733 edges, 2178 markings/sec, 0 secs
lola: sara is running 5 secs || 24040 markings, 29575 edges, 2630 markings/sec, 5 secs
lola: sara is running 10 secs || 37722 markings, 46639 edges, 2736 markings/sec, 10 secs
lola: sara is running 15 secs || 49978 markings, 64180 edges, 2451 markings/sec, 15 secs
lola: sara is running 20 secs || 57709 markings, 76686 edges, 1546 markings/sec, 20 secs
lola: sara is running 25 secs || 65404 markings, 90164 edges, 1539 markings/sec, 25 secs
lola: sara is running 30 secs || 75653 markings, 103395 edges, 2050 markings/sec, 30 secs
lola: sara is running 35 secs || 87763 markings, 119013 edges, 2422 markings/sec, 35 secs
lola: sara is running 40 secs || 100975 markings, 135379 edges, 2642 markings/sec, 40 secs
lola: sara is running 45 secs || 113990 markings, 152775 edges, 2603 markings/sec, 45 secs
lola: sara is running 50 secs || 121378 markings, 164965 edges, 1478 markings/sec, 50 secs
lola: sara is running 55 secs || 128555 markings, 176950 edges, 1435 markings/sec, 55 secs
lola: sara is running 60 secs || 137195 markings, 190363 edges, 1728 markings/sec, 60 secs
lola: sara is running 65 secs || 148060 markings, 204311 edges, 2173 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 161147 markings, 220310 edges, 2617 markings/sec, 70 secs
lola: sara is running 75 secs || 174172 markings, 236776 edges, 2605 markings/sec, 75 secs
lola: sara is running 80 secs || 184272 markings, 252100 edges, 2020 markings/sec, 80 secs
lola: sara is running 85 secs || 191571 markings, 264004 edges, 1460 markings/sec, 85 secs
lola: sara is running 90 secs || 198843 markings, 277664 edges, 1454 markings/sec, 90 secs
lola: sara is running 95 secs || 209163 markings, 289851 edges, 2064 markings/sec, 95 secs
lola: sara is running 100 secs || 221786 markings, 306109 edges, 2525 markings/sec, 100 secs
lola: sara is running 105 secs || 235054 markings, 322699 edges, 2654 markings/sec, 105 secs
lola: sara is running 110 secs || 246208 markings, 339057 edges, 2231 markings/sec, 110 secs
lola: sara is running 115 secs || 253588 markings, 351151 edges, 1476 markings/sec, 115 secs
lola: sara is running 120 secs || 261194 markings, 364998 edges, 1521 markings/sec, 120 secs
lola: sara is running 125 secs || 271445 markings, 377257 edges, 2050 markings/sec, 125 secs
lola: sara is running 130 secs || 284268 markings, 393671 edges, 2565 markings/sec, 130 secs
lola: sara is running 135 secs || 297459 markings, 410230 edges, 2638 markings/sec, 135 secs
lola: sara is running 140 secs || 308266 markings, 426285 edges, 2161 markings/sec, 140 secs
lola: sara is running 145 secs || 315683 markings, 438429 edges, 1483 markings/sec, 145 secs
lola: sara is running 150 secs || 323431 markings, 452248 edges, 1550 markings/sec, 150 secs
lola: sara is running 155 secs || 333719 markings, 464690 edges, 2058 markings/sec, 155 secs
lola: sara is running 160 secs || 346805 markings, 481304 edges, 2617 markings/sec, 160 secs
lola: sara is running 165 secs || 360036 markings, 497987 edges, 2646 markings/sec, 165 secs
lola: sara is running 170 secs || 370475 markings, 513728 edges, 2088 markings/sec, 170 secs
lola: sara is running 175 secs || 377928 markings, 525943 edges, 1491 markings/sec, 175 secs
lola: sara is running 180 secs || 385889 markings, 539740 edges, 1592 markings/sec, 180 secs
lola: sara is running 185 secs || 396385 markings, 553200 edges, 2099 markings/sec, 185 secs
lola: sara is running 190 secs || 409702 markings, 569577 edges, 2663 markings/sec, 190 secs
lola: sara is running 195 secs || 422936 markings, 586681 edges, 2647 markings/sec, 195 secs
lola: sara is running 200 secs || 431486 markings, 600615 edges, 1710 markings/sec, 200 secs
lola: sara is running 205 secs || 438933 markings, 613281 edges, 1489 markings/sec, 205 secs
lola: sara is running 210 secs || 448304 markings, 626645 edges, 1874 markings/sec, 210 secs
lola: sara is running 215 secs || 460267 markings, 642155 edges, 2393 markings/sec, 215 secs
lola: sara is running 220 secs || 473577 markings, 658772 edges, 2662 markings/sec, 220 secs
lola: sara is running 225 secs || 485090 markings, 675465 edges, 2303 markings/sec, 225 secs
lola: sara is running 230 secs || 492582 markings, 687795 edges, 1498 markings/sec, 230 secs
lola: sara is running 235 secs || 501070 markings, 702228 edges, 1698 markings/sec, 235 secs
lola: sara is running 240 secs || 512449 markings, 716786 edges, 2276 markings/sec, 240 secs
lola: sara is running 245 secs || 526248 markings, 733831 edges, 2760 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((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 + 1 <= Try_Check_Sources_B_1) OR (mo2 <= 1) OR (place_523_1 <= 1))))
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 2288 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-S10J30-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 10541 markings, 12291 edges, 2108 markings/sec, 0 secs
lola: sara is running 5 secs || 23484 markings, 28927 edges, 2589 markings/sec, 5 secs
lola: sara is running 10 secs || 37050 markings, 45785 edges, 2713 markings/sec, 10 secs
lola: sara is running 15 secs || 49482 markings, 63372 edges, 2486 markings/sec, 15 secs
lola: sara is running 20 secs || 57180 markings, 75780 edges, 1540 markings/sec, 20 secs
lola: sara is running 25 secs || 64757 markings, 88883 edges, 1515 markings/sec, 25 secs
lola: sara is running 30 secs || 74989 markings, 102586 edges, 2046 markings/sec, 30 secs
lola: sara is running 35 secs || 87824 markings, 119963 edges, 2567 markings/sec, 35 secs
lola: sara is running 40 secs || 101112 markings, 136923 edges, 2658 markings/sec, 40 secs
lola: sara is running 45 secs || 113781 markings, 154672 edges, 2534 markings/sec, 45 secs
lola: sara is running 50 secs || 121243 markings, 167432 edges, 1492 markings/sec, 50 secs
lola: sara is running 55 secs || 128436 markings, 179682 edges, 1439 markings/sec, 55 secs
lola: sara is running 60 secs || 137044 markings, 193490 edges, 1722 markings/sec, 60 secs
lola: sara is running 65 secs || 148283 markings, 208594 edges, 2248 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 160958 markings, 224527 edges, 2535 markings/sec, 70 secs
lola: sara is running 75 secs || 173436 markings, 240801 edges, 2496 markings/sec, 75 secs
lola: sara is running 80 secs || 183634 markings, 256974 edges, 2040 markings/sec, 80 secs
lola: sara is running 85 secs || 190932 markings, 268977 edges, 1460 markings/sec, 85 secs
lola: sara is running 90 secs || 198032 markings, 281949 edges, 1420 markings/sec, 90 secs
lola: sara is running 95 secs || 208045 markings, 295032 edges, 2003 markings/sec, 95 secs
lola: sara is running 100 secs || 220483 markings, 312064 edges, 2488 markings/sec, 100 secs
lola: sara is running 105 secs || 233369 markings, 328616 edges, 2577 markings/sec, 105 secs
lola: sara is running 110 secs || 245062 markings, 346293 edges, 2339 markings/sec, 110 secs
lola: sara is running 115 secs || 252392 markings, 358404 edges, 1466 markings/sec, 115 secs
lola: sara is running 120 secs || 259747 markings, 371778 edges, 1471 markings/sec, 120 secs
lola: sara is running 125 secs || 269773 markings, 384885 edges, 2005 markings/sec, 125 secs
lola: sara is running 130 secs || 282207 markings, 401908 edges, 2487 markings/sec, 130 secs
lola: sara is running 135 secs || 295082 markings, 418447 edges, 2575 markings/sec, 135 secs
lola: sara is running 140 secs || 306758 markings, 436099 edges, 2335 markings/sec, 140 secs
lola: sara is running 145 secs || 314089 markings, 448213 edges, 1466 markings/sec, 145 secs
lola: sara is running 150 secs || 321445 markings, 461576 edges, 1471 markings/sec, 150 secs
lola: sara is running 155 secs || 331504 markings, 474741 edges, 2012 markings/sec, 155 secs
lola: sara is running 160 secs || 343894 markings, 490715 edges, 2478 markings/sec, 160 secs
lola: sara is running 165 secs || 357058 markings, 507161 edges, 2633 markings/sec, 165 secs
lola: sara is running 170 secs || 368769 markings, 523993 edges, 2342 markings/sec, 170 secs
lola: sara is running 175 secs || 376198 markings, 536073 edges, 1486 markings/sec, 175 secs
lola: sara is running 180 secs || 383588 markings, 549353 edges, 1478 markings/sec, 180 secs
lola: sara is running 185 secs || 393834 markings, 562325 edges, 2049 markings/sec, 185 secs
lola: sara is running 190 secs || 406487 markings, 578622 edges, 2531 markings/sec, 190 secs
lola: sara is running 195 secs || 419653 markings, 595257 edges, 2633 markings/sec, 195 secs
lola: sara is running 200 secs || 429587 markings, 610509 edges, 1987 markings/sec, 200 secs
lola: sara is running 205 secs || 437027 markings, 622875 edges, 1488 markings/sec, 205 secs
lola: sara is running 210 secs || 445637 markings, 636469 edges, 1722 markings/sec, 210 secs
lola: sara is running 215 secs || 457103 markings, 652012 edges, 2293 markings/sec, 215 secs
lola: sara is running 220 secs || 469964 markings, 668449 edges, 2572 markings/sec, 220 secs
lola: sara is running 225 secs || 482731 markings, 686646 edges, 2553 markings/sec, 225 secs
lola: sara is running 230 secs || 490168 markings, 699295 edges, 1487 markings/sec, 230 secs
lola: sara is running 235 secs || 497532 markings, 712514 edges, 1473 markings/sec, 235 secs
lola: sara is running 240 secs || 507449 markings, 725904 edges, 1983 markings/sec, 240 secs
lola: sara is running 245 secs || 519957 markings, 743068 edges, 2502 markings/sec, 245 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 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= CanInjectEvent) AND (CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_29_6 + CreatedJobs_29_7 + CreatedJobs_29_8 + CreatedJobs_29_9 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_16_6 + CreatedJobs_16_7 + CreatedJobs_16_8 + CreatedJobs_16_9 + CreatedJobs_20_10 + Crea... (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 2288 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 10539 markings, 12289 edges, 2108 markings/sec, 0 secs
lola: sara is running 5 secs || 22944 markings, 28231 edges, 2481 markings/sec, 5 secs
lola: sara is running 10 secs || 36052 markings, 44497 edges, 2622 markings/sec, 10 secs
lola: sara is running 15 secs || 48681 markings, 62059 edges, 2526 markings/sec, 15 secs
lola: sara is running 20 secs || 55966 markings, 73813 edges, 1457 markings/sec, 20 secs
lola: sara is running 25 secs || 63295 markings, 86170 edges, 1466 markings/sec, 25 secs
lola: sara is running 30 secs || 72326 markings, 99446 edges, 1806 markings/sec, 30 secs
lola: sara is running 35 secs || 83455 markings, 113746 edges, 2226 markings/sec, 35 secs
lola: sara is running 40 secs || 96488 markings, 129759 edges, 2607 markings/sec, 40 secs
lola: sara is running 45 secs || 109520 markings, 146351 edges, 2606 markings/sec, 45 secs
lola: sara is running 50 secs || 118999 markings, 161090 edges, 1896 markings/sec, 50 secs
lola: sara is running 55 secs || 126307 markings, 173088 edges, 1462 markings/sec, 55 secs
lola: sara is running 60 secs || 134206 markings, 186932 edges, 1580 markings/sec, 60 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 65 secs || 144921 markings, 199841 edges, 2143 markings/sec, 65 secs
lola: sara is running 70 secs || 158269 markings, 216756 edges, 2670 markings/sec, 70 secs
lola: sara is running 75 secs || 171874 markings, 233789 edges, 2721 markings/sec, 75 secs
lola: sara is running 80 secs || 183313 markings, 250523 edges, 2288 markings/sec, 80 secs
lola: sara is running 85 secs || 190919 markings, 262871 edges, 1521 markings/sec, 85 secs
lola: sara is running 90 secs || 198458 markings, 276447 edges, 1508 markings/sec, 90 secs
lola: sara is running 95 secs || 209124 markings, 289812 edges, 2133 markings/sec, 95 secs
lola: sara is running 100 secs || 222464 markings, 306900 edges, 2668 markings/sec, 100 secs
lola: sara is running 105 secs || 235913 markings, 323792 edges, 2690 markings/sec, 105 secs
lola: sara is running 110 secs || 247018 markings, 340385 edges, 2221 markings/sec, 110 secs
lola: sara is running 115 secs || 254796 markings, 353178 edges, 1556 markings/sec, 115 secs
lola: sara is running 120 secs || 263374 markings, 367498 edges, 1716 markings/sec, 120 secs
lola: sara is running 125 secs || 274588 markings, 381783 edges, 2243 markings/sec, 125 secs
lola: sara is running 130 secs || 288562 markings, 398961 edges, 2795 markings/sec, 130 secs
lola: sara is running 135 secs || 302455 markings, 416852 edges, 2779 markings/sec, 135 secs
lola: sara is running 140 secs || 311512 markings, 431514 edges, 1811 markings/sec, 140 secs
lola: sara is running 145 secs || 319362 markings, 444734 edges, 1570 markings/sec, 145 secs
lola: sara is running 150 secs || 329082 markings, 458773 edges, 1944 markings/sec, 150 secs
lola: sara is running 155 secs || 341374 markings, 474645 edges, 2458 markings/sec, 155 secs
lola: sara is running 160 secs || 355338 markings, 491961 edges, 2793 markings/sec, 160 secs
lola: sara is running 165 secs || 368253 markings, 510150 edges, 2583 markings/sec, 165 secs
lola: sara is running 170 secs || 376128 markings, 522899 edges, 1575 markings/sec, 170 secs
lola: sara is running 175 secs || 383863 markings, 537094 edges, 1547 markings/sec, 175 secs
lola: sara is running 180 secs || 394734 markings, 550599 edges, 2174 markings/sec, 180 secs
lola: sara is running 185 secs || 408495 markings, 568066 edges, 2752 markings/sec, 185 secs
lola: sara is running 190 secs || 422473 markings, 586033 edges, 2796 markings/sec, 190 secs
lola: sara is running 195 secs || 431692 markings, 600901 edges, 1844 markings/sec, 195 secs
lola: sara is running 200 secs || 439477 markings, 614292 edges, 1557 markings/sec, 200 secs
lola: sara is running 205 secs || 449666 markings, 628308 edges, 2038 markings/sec, 205 secs
lola: sara is running 210 secs || 462690 markings, 645109 edges, 2605 markings/sec, 210 secs
lola: sara is running 215 secs || 476487 markings, 662535 edges, 2759 markings/sec, 215 secs
lola: sara is running 220 secs || 487010 markings, 678562 edges, 2105 markings/sec, 220 secs
lola: sara is running 225 secs || 494725 markings, 691439 edges, 1543 markings/sec, 225 secs
lola: sara is running 230 secs || 503606 markings, 705161 edges, 1776 markings/sec, 230 secs
lola: sara is running 235 secs || 515504 markings, 720543 edges, 2380 markings/sec, 235 secs
lola: sara is running 240 secs || 529355 markings, 737724 edges, 2770 markings/sec, 240 secs
lola: sara is running 245 secs || 541912 markings, 755572 edges, 2511 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((place_518_1 <= 1) AND (CreatedJobs_29_1 + CreatedJobs_29_2 + CreatedJobs_29_3 + CreatedJobs_29_4 + CreatedJobs_29_5 + CreatedJobs_29_6 + CreatedJobs_29_7 + CreatedJobs_29_8 + CreatedJobs_29_9 + CreatedJobs_16_1 + CreatedJobs_16_2 + CreatedJobs_16_3 + CreatedJobs_16_4 + CreatedJobs_16_5 + CreatedJobs_16_6 + CreatedJobs_16_7 + CreatedJobs_16_8 + CreatedJobs_16_9 + CreatedJobs_20_10 + Created... (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 2288 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= place_500_1) OR (3 <= Try_Check_Sources_B_1) OR (place_460 <= QueueJobE_1) OR (TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + TheSour_6 + TheSour_7 + TheSour_8 + TheSour_9 + TheSour_10 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Perform_Work_E_1 <= Check_Sources_B_1) AND (1 <= DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1))))
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 2288 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality-7.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 8 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((mi1 <= mo3)))
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 2288 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-S10J30-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 397 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + TheSour_6 + TheSour_7 + TheSour_8 + TheSour_9 + TheSour_10 <= place_522_1)))
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 2288 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-S10J30-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= QueueJobE_1) OR (((3 <= 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_Tas... (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 2288 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 556 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((mi1 + 1 <= place_521_1) OR (Check_Sources_B_1 + 1 <= 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_1... (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 2288 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 12 will run for 695 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= cJobCnt) OR (mi1 <= place_518_1) OR (mo3 <= mo1)) AND (2 <= mo2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2288 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 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 10483 markings, 12217 edges, 2097 markings/sec, 0 secs
lola: sara is running 5 secs || 23604 markings, 29047 edges, 2624 markings/sec, 5 secs
lola: sara is running 10 secs || 37538 markings, 46401 edges, 2787 markings/sec, 10 secs
lola: sara is running 15 secs || 49949 markings, 64126 edges, 2482 markings/sec, 15 secs
lola: sara is running 20 secs || 57706 markings, 76683 edges, 1551 markings/sec, 20 secs
lola: sara is running 25 secs || 65428 markings, 90216 edges, 1544 markings/sec, 25 secs
lola: sara is running 30 secs || 76003 markings, 103823 edges, 2115 markings/sec, 30 secs
lola: sara is running 35 secs || 88882 markings, 120381 edges, 2576 markings/sec, 35 secs
lola: sara is running 40 secs || 102728 markings, 137581 edges, 2769 markings/sec, 40 secs
lola: sara is running 45 secs || 115595 markings, 155694 edges, 2573 markings/sec, 45 secs
lola: sara is running 50 secs || 123344 markings, 168166 edges, 1550 markings/sec, 50 secs
lola: sara is running 55 secs || 131023 markings, 181445 edges, 1536 markings/sec, 55 secs
lola: sara is running 60 secs || 141295 markings, 195198 edges, 2054 markings/sec, 60 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 65 secs || 153916 markings, 211440 edges, 2524 markings/sec, 65 secs
lola: sara is running 70 secs || 167775 markings, 228576 edges, 2772 markings/sec, 70 secs
lola: sara is running 75 secs || 181150 markings, 247078 edges, 2675 markings/sec, 75 secs
lola: sara is running 80 secs || 188849 markings, 259520 edges, 1540 markings/sec, 80 secs
lola: sara is running 85 secs || 196580 markings, 272661 edges, 1546 markings/sec, 85 secs
lola: sara is running 90 secs || 206557 markings, 286585 edges, 1995 markings/sec, 90 secs
lola: sara is running 95 secs || 219239 markings, 302930 edges, 2536 markings/sec, 95 secs
lola: sara is running 100 secs || 233258 markings, 320394 edges, 2804 markings/sec, 100 secs
lola: sara is running 105 secs || 245657 markings, 338167 edges, 2480 markings/sec, 105 secs
lola: sara is running 110 secs || 253498 markings, 350971 edges, 1568 markings/sec, 110 secs
lola: sara is running 115 secs || 261616 markings, 365477 edges, 1624 markings/sec, 115 secs
lola: sara is running 120 secs || 272396 markings, 378662 edges, 2156 markings/sec, 120 secs
lola: sara is running 125 secs || 286210 markings, 396090 edges, 2763 markings/sec, 125 secs
lola: sara is running 130 secs || 300197 markings, 413798 edges, 2797 markings/sec, 130 secs
lola: sara is running 135 secs || 310254 markings, 429466 edges, 2011 markings/sec, 135 secs
lola: sara is running 140 secs || 318032 markings, 442425 edges, 1556 markings/sec, 140 secs
lola: sara is running 145 secs || 327271 markings, 456658 edges, 1848 markings/sec, 145 secs
lola: sara is running 150 secs || 339133 markings, 471928 edges, 2372 markings/sec, 150 secs
lola: sara is running 155 secs || 353241 markings, 489320 edges, 2822 markings/sec, 155 secs
lola: sara is running 160 secs || 367161 markings, 508395 edges, 2784 markings/sec, 160 secs
lola: sara is running 165 secs || 375081 markings, 521200 edges, 1584 markings/sec, 165 secs
lola: sara is running 170 secs || 382918 markings, 534875 edges, 1567 markings/sec, 170 secs
lola: sara is running 175 secs || 393364 markings, 548701 edges, 2089 markings/sec, 175 secs
lola: sara is running 180 secs || 406717 markings, 565869 edges, 2671 markings/sec, 180 secs
lola: sara is running 185 secs || 420772 markings, 583709 edges, 2811 markings/sec, 185 secs
lola: sara is running 190 secs || 430788 markings, 599437 edges, 2003 markings/sec, 190 secs
lola: sara is running 195 secs || 438592 markings, 612667 edges, 1561 markings/sec, 195 secs
lola: sara is running 200 secs || 448438 markings, 626794 edges, 1969 markings/sec, 200 secs
lola: sara is running 205 secs || 461135 markings, 643242 edges, 2539 markings/sec, 205 secs
lola: sara is running 210 secs || 475199 markings, 660854 edges, 2813 markings/sec, 210 secs
lola: sara is running 215 secs || 486406 markings, 677610 edges, 2241 markings/sec, 215 secs
lola: sara is running 220 secs || 494245 markings, 690643 edges, 1568 markings/sec, 220 secs
lola: sara is running 225 secs || 503447 markings, 704965 edges, 1840 markings/sec, 225 secs
lola: sara is running 230 secs || 515512 markings, 720551 edges, 2413 markings/sec, 230 secs
lola: sara is running 235 secs || 529622 markings, 738065 edges, 2822 markings/sec, 235 secs
lola: sara is running 240 secs || 542088 markings, 755882 edges, 2493 markings/sec, 240 secs
lola: sara is running 245 secs || 549959 markings, 768792 edges, 1574 markings/sec, 245 secs
lola: sara is running 250 secs || 558496 markings, 783267 edges, 1707 markings/sec, 250 secs
lola: sara is running 255 secs || 570095 markings, 798168 edges, 2320 markings/sec, 255 secs
lola: sara is running 260 secs || 584098 markings, 815631 edges, 2801 markings/sec, 260 secs
lola: sara is running 265 secs || 596572 markings, 833465 edges, 2495 markings/sec, 265 secs
lola: sara is running 270 secs || 604350 markings, 846391 edges, 1556 markings/sec, 270 secs
lola: sara is running 275 secs || 613366 markings, 860745 edges, 1803 markings/sec, 275 secs
lola: sara is running 280 secs || 625478 markings, 876385 edges, 2422 markings/sec, 280 secs
lola: sara is running 285 secs || 639472 markings, 893921 edges, 2799 markings/sec, 285 secs
lola: sara is running 290 secs || 650894 markings, 910897 edges, 2284 markings/sec, 290 secs
lola: sara is running 295 secs || 658709 markings, 923969 edges, 1563 markings/sec, 295 secs
lola: sara is running 300 secs || 668154 markings, 938195 edges, 1889 markings/sec, 300 secs
lola: sara is running 305 secs || 680767 markings, 954521 edges, 2523 markings/sec, 305 secs
lola: sara is running 310 secs || 694750 markings, 972167 edges, 2797 markings/sec, 310 secs
lola: sara is running 315 secs || 705249 markings, 988310 edges, 2100 markings/sec, 315 secs
lola: sara is running 320 secs || 713080 markings, 1001620 edges, 1566 markings/sec, 320 secs
lola: sara is running 325 secs || 722999 markings, 1015853 edges, 1984 markings/sec, 325 secs
lola: sara is running 330 secs || 736332 markings, 1033137 edges, 2667 markings/sec, 330 secs
lola: sara is running 335 secs || 750339 markings, 1051600 edges, 2801 markings/sec, 335 secs
lola: sara is running 340 secs || 758491 markings, 1065368 edges, 1630 markings/sec, 340 secs
lola: sara is running 345 secs || 767011 markings, 1079841 edges, 1704 markings/sec, 345 secs
lola: sara is running 350 secs || 778850 markings, 1095117 edges, 2368 markings/sec, 350 secs
lola: sara is running 355 secs || 792827 markings, 1112691 edges, 2795 markings/sec, 355 secs
lola: sara is running 360 secs || 803595 markings, 1128861 edges, 2154 markings/sec, 360 secs
lola: sara is running 365 secs || 811058 markings, 1141547 edges, 1493 markings/sec, 365 secs
lola: sara is running 370 secs || 820422 markings, 1155205 edges, 1873 markings/sec, 370 secs
lola: sara is running 375 secs || 832926 markings, 1171479 edges, 2501 markings/sec, 375 secs
lola: sara is running 380 secs || 846368 markings, 1188783 edges, 2688 markings/sec, 380 secs
lola: sara is running 385 secs || 855127 markings, 1203094 edges, 1752 markings/sec, 385 secs
lola: sara is running 390 secs || 862599 markings, 1216710 edges, 1494 markings/sec, 390 secs
lola: sara is running 395 secs || 873332 markings, 1230965 edges, 2147 markings/sec, 395 secs
lola: sara is running 400 secs || 886785 markings, 1247800 edges, 2691 markings/sec, 400 secs
lola: sara is running 405 secs || 898104 markings, 1264470 edges, 2264 markings/sec, 405 secs
lola: sara is running 410 secs || 905635 markings, 1277273 edges, 1506 markings/sec, 410 secs
lola: sara is running 415 secs || 915143 markings, 1291085 edges, 1902 markings/sec, 415 secs
lola: sara is running 420 secs || 928062 markings, 1307877 edges, 2584 markings/sec, 420 secs
lola: sara is running 425 secs || 941202 markings, 1326036 edges, 2628 markings/sec, 425 secs
lola: sara is running 430 secs || 948688 markings, 1338502 edges, 1497 markings/sec, 430 secs
lola: sara is running 435 secs || 957370 markings, 1352397 edges, 1736 markings/sec, 435 secs
lola: sara is running 440 secs || 969413 markings, 1368111 edges, 2409 markings/sec, 440 secs
lola: sara is running 445 secs || 982862 markings, 1385371 edges, 2690 markings/sec, 445 secs
lola: sara is running 450 secs || 991808 markings, 1399994 edges, 1789 markings/sec, 450 secs
lola: sara is running 455 secs || 999646 markings, 1414012 edges, 1568 markings/sec, 455 secs
lola: sara is running 460 secs || 1010981 markings, 1428726 edges, 2267 markings/sec, 460 secs
lola: sara is running 465 secs || 1024373 markings, 1445824 edges, 2678 markings/sec, 465 secs
lola: sara is running 470 secs || 1033690 markings, 1460809 edges, 1863 markings/sec, 470 secs
lola: sara is running 475 secs || 1041601 markings, 1474731 edges, 1582 markings/sec, 475 secs
lola: sara is running 480 secs || 1053064 markings, 1489625 edges, 2293 markings/sec, 480 secs
lola: sara is running 485 secs || 1066448 markings, 1506780 edges, 2677 markings/sec, 485 secs
lola: sara is running 490 secs || 1075529 markings, 1521543 edges, 1816 markings/sec, 490 secs
lola: sara is running 495 secs || 1083572 markings, 1535440 edges, 1609 markings/sec, 495 secs
lola: sara is running 500 secs || 1095452 markings, 1550899 edges, 2376 markings/sec, 500 secs
lola: sara is running 505 secs || 1109401 markings, 1568982 edges, 2790 markings/sec, 505 secs
lola: sara is running 510 secs || 1118149 markings, 1583640 edges, 1750 markings/sec, 510 secs
lola: sara is running 515 secs || 1127164 markings, 1598162 edges, 1803 markings/sec, 515 secs
lola: sara is running 520 secs || 1140143 markings, 1615203 edges, 2596 markings/sec, 520 secs
lola: sara is running 525 secs || 1152525 markings, 1633071 edges, 2476 markings/sec, 525 secs
lola: sara is running 530 secs || 1160306 markings, 1646905 edges, 1556 markings/sec, 530 secs
lola: sara is running 535 secs || 1171676 markings, 1662593 edges, 2274 markings/sec, 535 secs
lola: sara is running 540 secs || 1185628 markings, 1680583 edges, 2790 markings/sec, 540 secs
lola: sara is running 545 secs || 1194634 markings, 1695597 edges, 1801 markings/sec, 545 secs
lola: sara is running 550 secs || 1203871 markings, 1710104 edges, 1847 markings/sec, 550 secs
lola: sara is running 555 secs || 1217097 markings, 1727502 edges, 2645 markings/sec, 555 secs
lola: sara is running 560 secs || 1228963 markings, 1744944 edges, 2373 markings/sec, 560 secs
lola: sara is running 565 secs || 1236763 markings, 1759482 edges, 1560 markings/sec, 565 secs
lola: sara is running 570 secs || 1248807 markings, 1775162 edges, 2409 markings/sec, 570 secs
lola: sara is running 575 secs || 1262312 markings, 1793899 edges, 2701 markings/sec, 575 secs
lola: sara is running 580 secs || 1270175 markings, 1807574 edges, 1573 markings/sec, 580 secs
lola: sara is running 585 secs || 1281307 markings, 1823538 edges, 2226 markings/sec, 585 secs
lola: sara is running 590 secs || 1295278 markings, 1841896 edges, 2794 markings/sec, 590 secs
lola: sara is running 595 secs || 1303551 markings, 1856297 edges, 1655 markings/sec, 595 secs
lola: sara is running 600 secs || 1313724 markings, 1871815 edges, 2035 markings/sec, 600 secs
lola: sara is running 605 secs || 1327741 markings, 1889822 edges, 2803 markings/sec, 605 secs
lola: sara is running 610 secs || 1336925 markings, 1905117 edges, 1837 markings/sec, 610 secs
lola: sara is running 615 secs || 1346370 markings, 1920109 edges, 1889 markings/sec, 615 secs
lola: sara is running 620 secs || 1360321 markings, 1938414 edges, 2790 markings/sec, 620 secs
lola: sara is running 625 secs || 1369295 markings, 1953655 edges, 1795 markings/sec, 625 secs
lola: sara is running 630 secs || 1379645 markings, 1969504 edges, 2070 markings/sec, 630 secs
lola: sara is running 635 secs || 1393672 markings, 1988074 edges, 2805 markings/sec, 635 secs
lola: sara is running 640 secs || 1401776 markings, 2002523 edges, 1621 markings/sec, 640 secs
lola: sara is running 645 secs || 1413060 markings, 2018779 edges, 2257 markings/sec, 645 secs
lola: sara is running 650 secs || 1426411 markings, 2037440 edges, 2670 markings/sec, 650 secs
lola: sara is running 655 secs || 1434271 markings, 2052040 edges, 1572 markings/sec, 655 secs
lola: sara is running 660 secs || 1446603 markings, 2068337 edges, 2466 markings/sec, 660 secs
lola: sara is running 665 secs || 1457894 markings, 2085412 edges, 2258 markings/sec, 665 secs
lola: sara is running 670 secs || 1466996 markings, 2100211 edges, 1820 markings/sec, 670 secs
lola: sara is running 675 secs || 1480699 markings, 2118648 edges, 2741 markings/sec, 675 secs
lola: sara is running 680 secs || 1489438 markings, 2133937 edges, 1748 markings/sec, 680 secs
lola: sara is running 685 secs || 1500923 markings, 2150514 edges, 2297 markings/sec, 685 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 695 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= place_500_1) OR (((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 + Que... (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 2288 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1042 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((mi3 <= Perform_Work_E_1) OR ((place_522_1 + 1 <= 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... (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 2288 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2085 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Check_Sources_E_1 + 1 <= mo3)))
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 2288 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-S10J30-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 9302 markings, 38242 edges, 1860 markings/sec, 0 secs
lola: sara is running 5 secs || 19424 markings, 83150 edges, 2024 markings/sec, 5 secs
lola: sara is running 10 secs || 30471 markings, 128170 edges, 2209 markings/sec, 10 secs
lola: sara is running 15 secs || 41655 markings, 174779 edges, 2237 markings/sec, 15 secs
lola: sara is running 20 secs || 51730 markings, 215873 edges, 2015 markings/sec, 20 secs
lola: sara is running 25 secs || 62731 markings, 260641 edges, 2200 markings/sec, 25 secs
lola: sara is running 30 secs || 73782 markings, 306859 edges, 2210 markings/sec, 30 secs
lola: sara is running 35 secs || 83989 markings, 348228 edges, 2041 markings/sec, 35 secs
lola: sara is running 40 secs || 94924 markings, 392693 edges, 2187 markings/sec, 40 secs
lola: sara is running 45 secs || 106102 markings, 439595 edges, 2236 markings/sec, 45 secs
lola: sara is running 50 secs || 116289 markings, 480917 edges, 2037 markings/sec, 50 secs
lola: sara is running 55 secs || 127167 markings, 525168 edges, 2176 markings/sec, 55 secs
lola: sara is running 60 secs || 138353 markings, 571990 edges, 2237 markings/sec, 60 secs
lola: sara is running 65 secs || 148588 markings, 613606 edges, 2047 markings/sec, 65 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes unknown unknown unknown no no no yes yes yes no unknown no no yes
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494736211171

--------------------
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-S10J30"
export BK_EXAMINATION="ReachabilityCardinality"
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-S10J30.tgz
mv PolyORBNT-PT-S10J30 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-S10J30, examination is ReachabilityCardinality"
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-149440926200151"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;