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)
.................
/home/mcc/execution
total 215M
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13M May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 34M May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.7K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2M May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5M May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 6.5M May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 134M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DrinkVendingMachine-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r232-blw3-152732474200107
=====================================================================

--------------------
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-PT-10-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527871237033

info: Time: 3600 - MCC
===========================================================================================
prep: translating DrinkVendingMachine-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating DrinkVendingMachine-PT-10 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ DrinkVendingMachine-PT-10 @ 3566 seconds
lola: LoLA will run for 3566 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: Size of bit vector: 120
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-PT-10-LTLCardinality.task
lola: A ((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 (F (F (X ((optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_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))))) : A (X ((G ((theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)) U X ((1 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1))))) : A (((3 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9) U F (G ((1 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9))))) : A (G ((3 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1))) : A (X (X (((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 <= 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) U (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 <= theProducts_1 + theProducts_2 + theProducts_3 + theProducts_4 + theProducts_5 + theProducts_6 + theProducts_7 + theProducts_8 + theProducts_9 + theProducts_10))))) : A ((F (G ((1 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9))) U F (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))))) : A ((1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9)) : A (F ((ready_10 <= wait_26))) : A (G ((theOptions_2 <= wait_26))) : A (G (F ((optionSlots_5 <= ready_29)))) : A (F ((wait_14 <= wait_6))) : A (F (G (X (X ((wait_26 <= wait_40)))))) : A (G ((wait_24 <= theProducts_9))) : A (F ((X ((ready_14 <= optionSlots_8)) U F ((theOptions_8 <= wait_4))))) : A (F ((ready_10 <= optionSlots_9)))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 213 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (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)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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)
lola: processed formula length: 395
lola: 19 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_9)
lola: processed formula length: 165
lola: 19 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((1 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)) OR (G ((theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= productSlots_10 + productSlots_9 + productSlots_8 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((1 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)) OR (G ((theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9 <= productSlots_10 + productSlots_9 + productSlots_8 + p... (shortened)
lola: processed formula length: 709
lola: 19 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2083 markings, 2182 edges, 417 markings/sec, 0 secs
lola: 4255 markings, 4504 edges, 434 markings/sec, 5 secs
lola: 6471 markings, 7684 edges, 443 markings/sec, 10 secs
lola: 8973 markings, 14636 edges, 500 markings/sec, 15 secs
lola: 11344 markings, 24945 edges, 474 markings/sec, 20 secs
lola: 13327 markings, 27106 edges, 397 markings/sec, 25 secs
lola: 15317 markings, 29548 edges, 398 markings/sec, 30 secs
lola: 17066 markings, 32617 edges, 350 markings/sec, 35 secs
lola: 18852 markings, 37226 edges, 357 markings/sec, 40 secs
lola: 20712 markings, 45063 edges, 372 markings/sec, 45 secs
lola: 22618 markings, 56185 edges, 381 markings/sec, 50 secs
lola: 24333 markings, 57990 edges, 343 markings/sec, 55 secs
lola: 26324 markings, 60192 edges, 398 markings/sec, 60 secs
lola: 28254 markings, 62738 edges, 386 markings/sec, 65 secs
lola: 30052 markings, 65347 edges, 360 markings/sec, 70 secs
lola: 31772 markings, 69024 edges, 344 markings/sec, 75 secs
lola: 33665 markings, 74140 edges, 379 markings/sec, 80 secs
lola: 35704 markings, 81172 edges, 408 markings/sec, 85 secs
lola: 37961 markings, 104370 edges, 451 markings/sec, 90 secs
lola: 40036 markings, 121919 edges, 415 markings/sec, 95 secs
lola: 41788 markings, 123801 edges, 350 markings/sec, 100 secs
lola: 43601 markings, 125864 edges, 363 markings/sec, 105 secs
lola: 45402 markings, 128259 edges, 360 markings/sec, 110 secs
lola: 47342 markings, 131282 edges, 388 markings/sec, 115 secs
lola: 48985 markings, 134895 edges, 329 markings/sec, 120 secs
lola: 50971 markings, 140346 edges, 397 markings/sec, 125 secs
lola: 52922 markings, 147083 edges, 390 markings/sec, 130 secs
lola: 54745 markings, 163125 edges, 365 markings/sec, 135 secs
lola: 57386 markings, 233570 edges, 528 markings/sec, 140 secs
lola: 59324 markings, 235588 edges, 388 markings/sec, 145 secs
lola: 60919 markings, 237384 edges, 319 markings/sec, 150 secs
lola: 62458 markings, 239303 edges, 308 markings/sec, 155 secs
lola: 64119 markings, 242103 edges, 332 markings/sec, 160 secs
lola: 65803 markings, 246109 edges, 337 markings/sec, 165 secs
lola: 67429 markings, 251737 edges, 325 markings/sec, 170 secs
lola: 69970 markings, 279691 edges, 508 markings/sec, 175 secs
lola: 71805 markings, 305505 edges, 367 markings/sec, 180 secs
lola: 73405 markings, 308132 edges, 320 markings/sec, 185 secs
lola: 74989 markings, 311293 edges, 317 markings/sec, 190 secs
lola: 76582 markings, 316885 edges, 319 markings/sec, 195 secs
lola: 78303 markings, 328599 edges, 344 markings/sec, 200 secs
lola: 80208 markings, 351245 edges, 381 markings/sec, 205 secs
lola: 81777 markings, 353771 edges, 314 markings/sec, 210 secs
lola: 83454 markings, 356828 edges, 335 markings/sec, 215 secs
lola: 84977 markings, 361363 edges, 305 markings/sec, 220 secs
lola: 86614 markings, 368640 edges, 327 markings/sec, 225 secs
lola: 88334 markings, 392671 edges, 344 markings/sec, 230 secs
lola: 90326 markings, 430923 edges, 398 markings/sec, 235 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((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 LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((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: processed formula length: 1431
lola: 19 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1701 markings, 1770 edges, 340 markings/sec, 0 secs
lola: 3420 markings, 3920 edges, 344 markings/sec, 5 secs
lola: 5208 markings, 7465 edges, 358 markings/sec, 10 secs
lola: 7056 markings, 15515 edges, 370 markings/sec, 15 secs
lola: 9102 markings, 36615 edges, 409 markings/sec, 20 secs
lola: 10831 markings, 38620 edges, 346 markings/sec, 25 secs
lola: 12502 markings, 41442 edges, 334 markings/sec, 30 secs
lola: 14407 markings, 47129 edges, 381 markings/sec, 35 secs
lola: 16459 markings, 71673 edges, 410 markings/sec, 40 secs
lola: 18306 markings, 73782 edges, 369 markings/sec, 45 secs
lola: 20188 markings, 76835 edges, 376 markings/sec, 50 secs
lola: 21976 markings, 82048 edges, 358 markings/sec, 55 secs
lola: 23996 markings, 107185 edges, 404 markings/sec, 60 secs
lola: 25701 markings, 109114 edges, 341 markings/sec, 65 secs
lola: 27373 markings, 111606 edges, 334 markings/sec, 70 secs
lola: 29128 markings, 116215 edges, 351 markings/sec, 75 secs
lola: 31071 markings, 142471 edges, 389 markings/sec, 80 secs
lola: 32725 markings, 144313 edges, 331 markings/sec, 85 secs
lola: 34459 markings, 146763 edges, 347 markings/sec, 90 secs
lola: 36425 markings, 152034 edges, 393 markings/sec, 95 secs
lola: 38456 markings, 178359 edges, 406 markings/sec, 100 secs
lola: 40169 markings, 180359 edges, 343 markings/sec, 105 secs
lola: 41992 markings, 183478 edges, 365 markings/sec, 110 secs
lola: 43961 markings, 190844 edges, 394 markings/sec, 115 secs
lola: 46021 markings, 214773 edges, 412 markings/sec, 120 secs
lola: 47770 markings, 217094 edges, 350 markings/sec, 125 secs
lola: 49592 markings, 221181 edges, 364 markings/sec, 130 secs
lola: 51643 markings, 249230 edges, 410 markings/sec, 135 secs
lola: 53405 markings, 251320 edges, 352 markings/sec, 140 secs
lola: 55119 markings, 254155 edges, 343 markings/sec, 145 secs
lola: 56974 markings, 260790 edges, 371 markings/sec, 150 secs
lola: 59196 markings, 286280 edges, 444 markings/sec, 155 secs
lola: 61226 markings, 289303 edges, 406 markings/sec, 160 secs
lola: 62955 markings, 294987 edges, 346 markings/sec, 165 secs
lola: 64899 markings, 321229 edges, 389 markings/sec, 170 secs
lola: 66687 markings, 323290 edges, 358 markings/sec, 175 secs
lola: 68467 markings, 326401 edges, 356 markings/sec, 180 secs
lola: 70278 markings, 331492 edges, 362 markings/sec, 185 secs
lola: 72368 markings, 356155 edges, 418 markings/sec, 190 secs
lola: 74604 markings, 358802 edges, 447 markings/sec, 195 secs
lola: 77035 markings, 363658 edges, 486 markings/sec, 200 secs
lola: 79085 markings, 373686 edges, 410 markings/sec, 205 secs
lola: 81219 markings, 392865 edges, 427 markings/sec, 210 secs
lola: 83378 markings, 396834 edges, 432 markings/sec, 215 secs
lola: 85708 markings, 413332 edges, 466 markings/sec, 220 secs
lola: 87561 markings, 415507 edges, 371 markings/sec, 225 secs
lola: 89361 markings, 418477 edges, 360 markings/sec, 230 secs
lola: 91188 markings, 424100 edges, 365 markings/sec, 235 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((optionSlots_10 + optionSlots_1 + optionSlots_2 + optionSlots_3 + optionSlots_4 + optionSlots_5 + optionSlots_6 + optionSlots_7 + optionSlots_8 + optionSlots_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_... (shortened)
lola: processed formula length: 604
lola: 19 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 105 markings, 105 edges
lola:
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((theOptions_2 <= wait_26)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((theOptions_2 <= wait_26)))
lola: processed formula length: 33
lola: 21 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (wait_26 + 1 <= theOptions_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-PT-10-LTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-PT-10-LTLCardinality-5-0.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: 2 markings, 1 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((wait_24 <= theProducts_9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((wait_24 <= theProducts_9)))
lola: processed formula length: 34
lola: 21 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (theProducts_9 + 1 <= wait_24)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-PT-10-LTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DrinkVendingMachine-PT-10-LTLCardinality-6-0.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: 2 markings, 1 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((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 invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((3 <= productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1)))
lola: processed formula length: 183
lola: 21 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (productSlots_10 + productSlots_9 + productSlots_8 + productSlots_7 + productSlots_6 + productSlots_5 + productSlots_4 + productSlots_3 + productSlots_2 + productSlots_1 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DrinkVendingMachine-PT-10-LTLCardinality-7-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((wait_14 <= wait_6)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (wait_6 + 1 <= wait_14)
lola: processed formula length: 23
lola: 21 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 1 markings, 0 edges, 0 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((ready_10 <= wait_26)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (wait_26 + 1 <= ready_10)
lola: processed formula length: 25
lola: 21 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 1 markings, 0 edges, 0 markings/sec, 5 secs
lola: 1 markings, 0 edges, 0 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((theOptions_8 <= wait_4)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (wait_4 + 1 <= theOptions_8)
lola: processed formula length: 28
lola: 21 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((ready_10 <= optionSlots_9)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (optionSlots_9 + 1 <= ready_10)
lola: processed formula length: 31
lola: 21 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 721 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((wait_26 <= wait_40))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((wait_26 <= wait_40))))
lola: processed formula length: 32
lola: 19 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 2026 markings, 3726 edges, 405 markings/sec, 0 secs
lola: 4053 markings, 7619 edges, 405 markings/sec, 5 secs
lola: 5919 markings, 11500 edges, 373 markings/sec, 10 secs
lola: 7756 markings, 15480 edges, 367 markings/sec, 15 secs
lola: 9644 markings, 20336 edges, 378 markings/sec, 20 secs
lola: 11522 markings, 26462 edges, 376 markings/sec, 25 secs
lola: 13459 markings, 33634 edges, 387 markings/sec, 30 secs
lola: 15252 markings, 42631 edges, 359 markings/sec, 35 secs
lola: 17373 markings, 75012 edges, 424 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17460 markings, 76868 edges
lola:
FORMULA DrinkVendingMachine-PT-10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 946 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((optionSlots_5 <= ready_29))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((optionSlots_5 <= ready_29))))
lola: processed formula length: 39
lola: 19 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 2016 markings, 3742 edges, 403 markings/sec, 0 secs
lola: 4175 markings, 8042 edges, 432 markings/sec, 5 secs
lola: 5995 markings, 12073 edges, 364 markings/sec, 10 secs
lola: 7986 markings, 17588 edges, 398 markings/sec, 15 secs
lola: 9946 markings, 24529 edges, 392 markings/sec, 20 secs
lola: 11907 markings, 34004 edges, 392 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13687 markings, 60074 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= 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 LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= theOptions_10 + theOptions_1 + theOptions_2 + theOptions_3 + theOptions_4 + theOptions_5 + theOptions_6 + theOptions_7 + theOptions_8 + theOptions_9))))
lola: processed formula length: 167
lola: 19 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 17 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2805 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((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 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((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 + ... (shortened)
lola: processed formula length: 1058
lola: 19 rewrites
lola: closed formula file DrinkVendingMachine-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1740 markings, 1819 edges, 348 markings/sec, 0 secs
lola: 3553 markings, 3987 edges, 363 markings/sec, 5 secs
lola: 5441 markings, 7541 edges, 378 markings/sec, 10 secs
lola: 7304 markings, 13874 edges, 373 markings/sec, 15 secs
lola: 9200 markings, 22691 edges, 379 markings/sec, 20 secs
lola: 10846 markings, 24447 edges, 329 markings/sec, 25 secs
lola: 12415 markings, 26327 edges, 314 markings/sec, 30 secs
lola: 14083 markings, 28480 edges, 334 markings/sec, 35 secs
lola: 15815 markings, 32087 edges, 346 markings/sec, 40 secs
lola: 17739 markings, 37971 edges, 385 markings/sec, 45 secs
lola: 19485 markings, 48325 edges, 349 markings/sec, 50 secs
lola: 21394 markings, 54891 edges, 382 markings/sec, 55 secs
lola: 23435 markings, 57092 edges, 408 markings/sec, 60 secs
lola: 25179 markings, 59173 edges, 349 markings/sec, 65 secs
lola: 27100 markings, 61687 edges, 384 markings/sec, 70 secs
lola: 28867 markings, 64763 edges, 353 markings/sec, 75 secs
lola: 30704 markings, 69077 edges, 367 markings/sec, 80 secs
lola: 32505 markings, 74231 edges, 360 markings/sec, 85 secs
lola: 34649 markings, 84104 edges, 429 markings/sec, 90 secs
lola: 36971 markings, 118759 edges, 464 markings/sec, 95 secs
lola: 39113 markings, 121084 edges, 428 markings/sec, 100 secs
lola: 41108 markings, 123864 edges, 399 markings/sec, 105 secs
lola: 43202 markings, 129241 edges, 419 markings/sec, 110 secs
lola: 45313 markings, 140811 edges, 422 markings/sec, 115 secs
lola: 47253 markings, 142901 edges, 388 markings/sec, 120 secs
lola: 49254 markings, 145283 edges, 400 markings/sec, 125 secs
lola: 51449 markings, 148915 edges, 439 markings/sec, 130 secs
lola: 53487 markings, 154298 edges, 408 markings/sec, 135 secs
lola: 55798 markings, 168083 edges, 462 markings/sec, 140 secs
lola: 57559 markings, 173371 edges, 352 markings/sec, 145 secs
lola: 59417 markings, 175414 edges, 372 markings/sec, 150 secs
lola: 61168 markings, 177457 edges, 350 markings/sec, 155 secs
lola: 62915 markings, 179848 edges, 349 markings/sec, 160 secs
lola: 64540 markings, 182464 edges, 325 markings/sec, 165 secs
lola: 66152 markings, 186111 edges, 322 markings/sec, 170 secs
lola: 68003 markings, 191350 edges, 370 markings/sec, 175 secs
lola: 69799 markings, 197734 edges, 359 markings/sec, 180 secs
lola: 71914 markings, 220930 edges, 423 markings/sec, 185 secs
lola: 74509 markings, 268922 edges, 519 markings/sec, 190 secs
lola: 76950 markings, 272447 edges, 488 markings/sec, 195 secs
lola: 79866 markings, 282669 edges, 583 markings/sec, 200 secs
lola: 82016 markings, 285123 edges, 430 markings/sec, 205 secs
lola: 84296 markings, 289315 edges, 456 markings/sec, 210 secs
lola: 86301 markings, 296105 edges, 401 markings/sec, 215 secs
lola: 88173 markings, 304540 edges, 374 markings/sec, 220 secs
lola: 89976 markings, 306503 edges, 361 markings/sec, 225 secs
lola: 91670 markings, 308639 edges, 339 markings/sec, 230 secs
lola: 93377 markings, 311236 edges, 341 markings/sec, 235 secs
lola: 95230 markings, 315857 edges, 371 markings/sec, 240 secs
lola: 97104 markings, 323440 edges, 375 markings/sec, 245 secs
lola: 98929 markings, 335856 edges, 365 markings/sec, 250 secs
lola: 100475 markings, 337516 edges, 309 markings/sec, 255 secs
lola: 102093 markings, 339285 edges, 324 markings/sec, 260 secs
lola: 103669 markings, 341354 edges, 315 markings/sec, 265 secs
lola: 105261 markings, 343485 edges, 318 markings/sec, 270 secs
lola: 106805 markings, 346227 edges, 309 markings/sec, 275 secs
lola: 108360 markings, 349985 edges, 311 markings/sec, 280 secs
lola: 109971 markings, 354738 edges, 322 markings/sec, 285 secs
lola: 111594 markings, 360678 edges, 325 markings/sec, 290 secs
lola: 113346 markings, 378381 edges, 350 markings/sec, 295 secs
lola: 115550 markings, 442741 edges, 441 markings/sec, 300 secs
lola: 117411 markings, 445614 edges, 372 markings/sec, 305 secs
lola: 119236 markings, 448918 edges, 365 markings/sec, 310 secs
lola: 120623 markings, 452979 edges, 277 markings/sec, 315 secs
lola: 120767 markings, 453598 edges, 29 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: Cannot launch process for handling subproblem

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: Cannot launch process for handling subproblem

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: Cannot launch process for handling subproblem

FORMULA DrinkVendingMachine-PT-10-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no unknown no no unknown unknown no yes no no yes no no yes yes
lola:
preliminary result: yes no unknown no no unknown unknown no yes no no yes no no yes yes

BK_STOP 1527872328384

--------------------
content from stderr:

Segmentation fault

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="LTLCardinality"
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
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is DrinkVendingMachine-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r232-blw3-152732474200107"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;