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

About the Execution of LoLA for Referendum-PT-0015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4180.220 252380.00 252579.00 757.50 FFFFFFFF?FFTFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
............
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is Referendum-PT-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172500131
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496321181201


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


checking for too many tokens
===========================================================================================
Referendum-PT-0015: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ Referendum-PT-0015 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 77/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 46 places, 31 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 18 transition conflict sets
lola: TASK
lola: reading formula from Referendum-COL-015-LTLCardinality.task
lola: A ((3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)) : A (X (G (((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) U (voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))) : A (G (X (((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) U (ready <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9))))) : A ((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)) : A (X ((F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= ready)) U F ((2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))))) : A ((1 <= ready)) : A (X (F (G (X ((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))) : A (G ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))) : A ((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9)) : A (F (X (X ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))) : A (G (X (((3 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) U (1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))))) : A (X (F ((2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))) : A (G (X ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))) : A ((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)) : A (F (X (G (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))))) : A (F (G ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)
lola: processed formula length: 205
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) U (voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= votin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) U (voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))
lola: processed formula: A (X (G (((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) U (voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= votin... (shortened)
lola: processed formula length: 568
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 29 unused bits
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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) U (ready <= voted... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) U (ready <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9)))))
lola: processed formula: A (G (X (((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) U (ready <= voted... (shortened)
lola: processed formula length: 613
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 815881 markings, 6201196 edges, 163176 markings/sec, 0 secs
lola: 1499289 markings, 11910038 edges, 136682 markings/sec, 5 secs
lola: 2127820 markings, 17353072 edges, 125706 markings/sec, 10 secs
lola: 2690683 markings, 22503993 edges, 112573 markings/sec, 15 secs
lola: 3158483 markings, 27244246 edges, 93560 markings/sec, 20 secs
lola: 3829771 markings, 32852823 edges, 134258 markings/sec, 25 secs
lola: 4437999 markings, 38185278 edges, 121646 markings/sec, 30 secs
lola: 4982993 markings, 43241925 edges, 108999 markings/sec, 35 secs
lola: 5475383 markings, 48073048 edges, 98478 markings/sec, 40 secs
lola: 6067183 markings, 53326405 edges, 118360 markings/sec, 45 secs
lola: 6570999 markings, 58197312 edges, 100763 markings/sec, 50 secs
lola: 7067345 markings, 63016214 edges, 99269 markings/sec, 55 secs
lola: 7559069 markings, 67797033 edges, 98345 markings/sec, 60 secs
lola: 8032277 markings, 72510676 edges, 94642 markings/sec, 65 secs
lola: 8476597 markings, 77090080 edges, 88864 markings/sec, 70 secs
lola: 8903757 markings, 81559845 edges, 85432 markings/sec, 75 secs
lola: 9287157 markings, 85840803 edges, 76680 markings/sec, 80 secs
lola: 9706846 markings, 90315554 edges, 83938 markings/sec, 85 secs
lola: 10373931 markings, 95960768 edges, 133417 markings/sec, 90 secs
lola: 10988320 markings, 101386482 edges, 122878 markings/sec, 95 secs
lola: 11506592 markings, 106409098 edges, 103654 markings/sec, 100 secs
lola: 12068631 markings, 111588825 edges, 112408 markings/sec, 105 secs
lola: 12638879 markings, 116796236 edges, 114050 markings/sec, 110 secs
lola: 13098392 markings, 121525544 edges, 91903 markings/sec, 115 secs
lola: 13651486 markings, 126622598 edges, 110619 markings/sec, 120 secs
lola: 14110289 markings, 131282925 edges, 91761 markings/sec, 125 secs
lola: 14597727 markings, 136069703 edges, 97488 markings/sec, 130 secs
lola: 15040231 markings, 140676638 edges, 88501 markings/sec, 135 secs
lola: 15456683 markings, 145172422 edges, 83290 markings/sec, 140 secs
lola: 15829725 markings, 149422554 edges, 74608 markings/sec, 145 secs
lola: 16351707 markings, 154408150 edges, 104396 markings/sec, 150 secs
lola: 16920759 markings, 159625925 edges, 113810 markings/sec, 155 secs
lola: 17385307 markings, 164383616 edges, 92910 markings/sec, 160 secs
lola: 17938801 markings, 169472361 edges, 110699 markings/sec, 165 secs
lola: 18400787 markings, 174154507 edges, 92397 markings/sec, 170 secs
lola: 18873535 markings, 178880751 edges, 94550 markings/sec, 175 secs
lola: 19319119 markings, 183500729 edges, 89117 markings/sec, 180 secs
lola: 19737371 markings, 187987486 edges, 83650 markings/sec, 185 secs
lola: 20104765 markings, 192228079 edges, 73479 markings/sec, 190 secs
lola: 20595225 markings, 197073586 edges, 98092 markings/sec, 195 secs
lola: 21076215 markings, 201851200 edges, 96198 markings/sec, 200 secs
lola: 21569799 markings, 206715754 edges, 98717 markings/sec, 205 secs
lola: 22017647 markings, 211344800 edges, 89570 markings/sec, 210 secs
lola: 22437165 markings, 215831527 edges, 83904 markings/sec, 215 secs
lola: 22824823 markings, 220147973 edges, 77532 markings/sec, 220 secs
lola: 23219137 markings, 224507994 edges, 78863 markings/sec, 225 secs
lola: 23658529 markings, 229085243 edges, 87878 markings/sec, 230 secs
lola: 24106343 markings, 233677972 edges, 89563 markings/sec, 235 secs
lola: 24515981 markings, 238072566 edges, 81928 markings/sec, 240 secs
lola: 24865903 markings, 242166179 edges, 69984 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)
lola: processed formula length: 205
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-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: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= ready)) U F ((2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= ready)) U F ((2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))))
lola: processed formula: A (X ((F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= ready)) U F ((2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no... (shortened)
lola: processed formula length: 450
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= ready))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= ready)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-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: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (X ((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G (X ((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))))
lola: processed formula: A (X (F (G (X ((2 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))))
lola: processed formula length: 195
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9)
lola: processed formula length: 220
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-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: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))
lola: processed formula: A (F (X (X ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))
lola: processed formula length: 191
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 30 unused bits
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 10 will run for 548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((3 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) U (1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + vo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((3 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) U (1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)))))
lola: processed formula: A (G (X (((3 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) U (1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + vo... (shortened)
lola: processed formula length: 442
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))))
lola: processed formula: A (X (F ((2 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))))
lola: processed formula length: 217
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 12 will run for 822 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: processed formula: A (G (X ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: processed formula length: 384
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 13 will run for 1096 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15)
lola: processed formula length: 205
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-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: ========================================
lola: subprocess 14 will run for 1644 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (G (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15))))))
lola: processed formula: A (F (X (G (F ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no... (shortened)
lola: processed formula length: 437
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 30 unused bits
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: ========================================
lola: subprocess 15 will run for 3288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: processed formula: A (F (G ((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))
lola: processed formula length: 187
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-COL-015-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 30 unused bits
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: RESULT
lola:
SUMMARY: no no unknown no no yes no no no yes no no no no no no
lola: ========================================
FORMULA Referendum-COL-015-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-COL-015-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496321433581

--------------------
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="Referendum-PT-0015"
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/Referendum-PT-0015.tgz
mv Referendum-PT-0015 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 Referendum-PT-0015, 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 r208-smll-149581172500131"
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 ;