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 DrinkVendingMachine-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264100232
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494682893810


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ DrinkVendingMachine-PT-10 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 111280/65536 symbol table entries, 66439 collisions
lola: preprocessing...
lola: finding significant places
lola: 120 places, 111160 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48320 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-COL-10-ReachabilityCardinality.task
lola: E (F ((3 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1))) : A (G ((3 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9))) : E (F ((((wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 + 1 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10) OR ((2 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9) AND (theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40))) AND ((theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9) OR (wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 + 1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9))))) : A (G ((2 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9))) : A (G (((theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10)))) : A (G ((2 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9))) : A (G ((((2 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10) OR (1 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10) OR (3 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)) AND ((productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9) OR (theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9) OR (wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10))))) : E (F (((wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 + 1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9) AND ((wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 + 1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9) OR (wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 + 1 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10))))) : E (F (((productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1 + 1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9) AND ((theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1) OR (3 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40)) AND (theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40)))) : E (F (((ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40 + 1 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1) OR (theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10 <= 2) OR ((theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= 2) AND (theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10 + 1 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1))))) : A (G ((((2 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1) AND (2 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9)) OR (ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40 <= 1) OR (wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 <= 0) OR ((1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9) AND (theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9))))) : A (G (((1 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9) AND (ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40 + 1 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9)))) : A (G ((((1 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10) OR (optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9) OR (2 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9) OR (2 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9)) AND ((theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9) OR (2 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9) OR (theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10 <= 0))))) : E (F ((2 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready_37 + ready_38 + ready_39 + ready_40))) : E (F ((((2 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9) OR (3 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9)) AND (wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 + 1 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10) AND ((1 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9) OR (2 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1))))) : E (F ((wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9)))
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 + ... (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 8 bytes per marking, with 4 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 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9)))
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10))))
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9)))
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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10) OR (1 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10) OR (3 <= productSlots_10 + productSlots_9 + productSlot... (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 8 bytes per marking, with 4 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: sara is running 5 secs || 267 markings, 366 edges, 53 markings/sec, 5 secs
lola: sara is running 10 secs || 1006 markings, 1845 edges, 148 markings/sec, 10 secs
lola: sara is running 15 secs || 1813 markings, 3540 edges, 161 markings/sec, 15 secs
lola: sara is running 20 secs || 2518 markings, 5340 edges, 141 markings/sec, 20 secs
lola: sara is running 25 secs || 3195 markings, 7404 edges, 135 markings/sec, 25 secs
lola: sara is running 30 secs || 3915 markings, 9713 edges, 144 markings/sec, 30 secs
lola: sara is running 35 secs || 4624 markings, 12392 edges, 142 markings/sec, 35 secs
lola: sara is running 40 secs || 5325 markings, 15011 edges, 140 markings/sec, 40 secs
lola: sara is running 45 secs || 6023 markings, 17797 edges, 140 markings/sec, 45 secs
lola: sara is running 50 secs || 6700 markings, 20306 edges, 135 markings/sec, 50 secs
lola: sara is running 55 secs || 7342 markings, 22893 edges, 128 markings/sec, 55 secs
lola: sara is running 60 secs || 8053 markings, 25913 edges, 142 markings/sec, 60 secs
lola: sara is running 65 secs || 8676 markings, 28734 edges, 125 markings/sec, 65 secs
lola: sara is running 70 secs || 9349 markings, 31772 edges, 135 markings/sec, 70 secs
lola: sara is running 75 secs || 9989 markings, 34726 edges, 128 markings/sec, 75 secs
lola: sara is running 80 secs || 10624 markings, 37451 edges, 127 markings/sec, 80 secs
lola: sara is running 85 secs || 11240 markings, 40238 edges, 123 markings/sec, 85 secs
lola: sara is running 90 secs || 11836 markings, 42913 edges, 119 markings/sec, 90 secs
lola: sara is running 95 secs || 12541 markings, 45983 edges, 141 markings/sec, 95 secs
lola: sara is running 100 secs || 13195 markings, 48871 edges, 131 markings/sec, 100 secs
lola: sara is running 105 secs || 13777 markings, 51852 edges, 116 markings/sec, 105 secs
lola: sara is running 110 secs || 14406 markings, 55153 edges, 126 markings/sec, 110 secs
lola: sara is running 115 secs || 15033 markings, 58534 edges, 125 markings/sec, 115 secs
lola: sara is running 120 secs || 15638 markings, 61621 edges, 121 markings/sec, 120 secs
lola: sara is running 125 secs || 16254 markings, 65009 edges, 123 markings/sec, 125 secs
lola: sara is running 130 secs || 16861 markings, 68202 edges, 121 markings/sec, 130 secs
lola: sara is running 135 secs || 17432 markings, 71400 edges, 114 markings/sec, 135 secs
lola: sara is running 140 secs || 17988 markings, 73934 edges, 111 markings/sec, 140 secs
lola: sara is running 145 secs || 18575 markings, 76827 edges, 117 markings/sec, 145 secs
lola: sara is running 150 secs || 19204 markings, 79934 edges, 126 markings/sec, 150 secs
lola: sara is running 155 secs || 19981 markings, 83220 edges, 155 markings/sec, 155 secs
lola: sara is running 160 secs || 20942 markings, 84990 edges, 192 markings/sec, 160 secs
lola: sara is running 165 secs || 21856 markings, 86787 edges, 183 markings/sec, 165 secs
lola: sara is running 170 secs || 22738 markings, 88549 edges, 176 markings/sec, 170 secs
lola: sara is running 175 secs || 23610 markings, 90406 edges, 174 markings/sec, 175 secs
lola: sara is running 180 secs || 24344 markings, 91958 edges, 147 markings/sec, 180 secs
lola: sara is running 185 secs || 25109 markings, 93758 edges, 153 markings/sec, 185 secs
lola: sara is running 190 secs || 25775 markings, 95532 edges, 133 markings/sec, 190 secs
lola: sara is running 195 secs || 26529 markings, 97288 edges, 151 markings/sec, 195 secs
lola: sara is running 200 secs || 27297 markings, 98969 edges, 154 markings/sec, 200 secs
lola: sara is running 205 secs || 28026 markings, 101055 edges, 146 markings/sec, 205 secs
lola: sara is running 210 secs || 28704 markings, 102969 edges, 136 markings/sec, 210 secs
lola: sara is running 215 secs || 29392 markings, 105164 edges, 138 markings/sec, 215 secs
lola: sara is running 220 secs || 30039 markings, 107286 edges, 129 markings/sec, 220 secs
lola: sara is running 225 secs || 30770 markings, 109977 edges, 146 markings/sec, 225 secs
lola: sara is running 230 secs || 31494 markings, 112562 edges, 145 markings/sec, 230 secs
lola: sara is running 235 secs || 32084 markings, 114729 edges, 118 markings/sec, 235 secs
lola: sara is running 240 secs || 32758 markings, 116479 edges, 135 markings/sec, 240 secs
lola: sara is running 245 secs || 33433 markings, 118327 edges, 135 markings/sec, 245 secs
lola: sara is running 250 secs || 34084 markings, 119949 edges, 130 markings/sec, 250 secs
lola: sara is running 255 secs || 34701 markings, 121745 edges, 123 markings/sec, 255 secs
lola: sara is running 260 secs || 35357 markings, 123580 edges, 131 markings/sec, 260 secs
lola: sara is running 265 secs || 35988 markings, 125373 edges, 126 markings/sec, 265 secs
lola: sara is running 270 secs || 36637 markings, 127103 edges, 130 markings/sec, 270 secs
lola: sara is running 275 secs || 37249 markings, 129116 edges, 122 markings/sec, 275 secs
lola: sara is running 280 secs || 37873 markings, 131757 edges, 125 markings/sec, 280 secs
lola: sara is running 285 secs || 38530 markings, 133595 edges, 131 markings/sec, 285 secs
lola: sara is running 290 secs || 39178 markings, 135311 edges, 130 markings/sec, 290 secs
lola: sara is running 295 secs || 39916 markings, 136888 edges, 148 markings/sec, 295 secs
lola: sara is running 300 secs || 40611 markings, 138754 edges, 139 markings/sec, 300 secs
lola: sara is running 305 secs || 41276 markings, 140687 edges, 133 markings/sec, 305 secs
lola: sara is running 310 secs || 41957 markings, 142874 edges, 136 markings/sec, 310 secs
lola: sara is running 315 secs || 42684 markings, 145606 edges, 145 markings/sec, 315 secs
lola: sara is running 320 secs || 43493 markings, 148261 edges, 162 markings/sec, 320 secs
lola: sara is running 325 secs || 44274 markings, 151340 edges, 156 markings/sec, 325 secs
lola: sara is running 330 secs || 44984 markings, 153994 edges, 142 markings/sec, 330 secs
lola: sara is running 335 secs || 45670 markings, 156506 edges, 137 markings/sec, 335 secs
lola: sara is running 340 secs || 46453 markings, 158176 edges, 157 markings/sec, 340 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 + 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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1 + 1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9) AND ((theProducts_1 + theProducts_2 + theProducts_3 + th... (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 8 bytes per marking, with 4 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 443 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + ready... (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 8 bytes per marking, with 4 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1) AND (2 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9)) OR (ready_9 + ready_8 + ready_7 + ready_6 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 617 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_... (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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10) OR (optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 ... (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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1023 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= ready_9 + ready_8 + ready_7 + ready_6 + ready_5 + ready_4 + ready_3 + ready_2 + ready_1 + ready_10 + ready_11 + ready_12 + ready_13 + ready_14 + ready_15 + ready_16 + ready_17 + ready_18 + ready_19 + ready_20 + ready_21 + ready_22 + ready_23 + ready_24 + ready_25 + ready_26 + ready_27 + ready_28 + ready_29 + ready_30 + ready_31 + ready_32 + ready_33 + ready_34 + ready_35 + ready_36 + r... (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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9) OR (3 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9)) AND (wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + ... (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 8 bytes per marking, with 4 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-COL-10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: sara is running 5 secs || 5 markings, 4 edges, 1 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3050 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((wait_10 + wait_11 + wait_12 + wait_13 + wait_14 + wait_15 + wait_16 + wait_17 + wait_18 + wait_19 + wait_20 + wait_21 + wait_22 + wait_23 + wait_24 + wait_25 + wait_26 + wait_27 + wait_28 + wait_29 + wait_30 + wait_31 + wait_32 + wait_33 + wait_34 + wait_35 + wait_36 + wait_37 + wait_38 + wait_39 + wait_40 + wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + wait_9 <= p... (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 8 bytes per marking, with 4 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 DrinkVendingMachine-COL-10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-COL-10-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no no unknown yes yes yes no no no yes yes yes
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DrinkVendingMachine-COL-10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494683392683

--------------------
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="DrinkVendingMachine-PT-10"
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/DrinkVendingMachine-PT-10.tgz
mv DrinkVendingMachine-PT-10 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 DrinkVendingMachine-PT-10, 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 r028-blw3-149440264100232"
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 ;