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 272K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 112K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DNAwalker-PT-09ringLR, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-152732260600243
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527401224842


BK_STOP 1527401594989

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DNAwalker-PT-09ringLR as instance name.
Using DNAwalker as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 117, 'Memory': 111.91, 'Tool': 'lola'}, {'Time': 194, 'Memory': 112.84, 'Tool': 'lola'}, {'Time': 35539, 'Memory': 1134.9, 'Tool': 'itstools'}, {'Time': 36034, 'Memory': 1120.01, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola DNAwalker-PT-09ringLR...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DNAwalker-PT-09ringLR: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DNAwalker-PT-09ringLR: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ DNAwalker-PT-09ringLR @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 287/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 27 places, 260 transitions, 27 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 163 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-09ringLR-LTLCardinality.task
lola: A (X (G (((A15 <= A14) U (A19 <= A1))))) : A (F ((1 <= A9))) : A (G (F (G ((A12 <= A20))))) : A ((X (X ((B11 <= A9))) U G (X ((A2 <= A12))))) : A ((F ((2 <= A3)) U (3 <= A18))) : A (F (F (F (X ((A18 <= A9)))))) : A ((A9 <= B21)) : A ((B20 <= A7)) : A (G ((1 <= B2))) : A (G (X (F (X ((A8 <= A19)))))) : A (F (G (G (F ((2 <= A3)))))) : A ((A14 <= A13)) : A ((X (X ((2 <= B11))) U G (X ((2 <= A4))))) : A (G ((F ((A21 <= A19)) U F ((1 <= A17))))) : A (X (G (X (X ((A7 <= A1)))))) : A (F (F (G (G ((B21 <= A21))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((A15 <= A14) U (A19 <= A1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (((A15 <= A14) U (A19 <= A1)))))
lola: processed formula: A (X (G (((A15 <= A14) U (A19 <= A1)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 741783 markings, 4035158 edges, 148357 markings/sec, 0 secs
lola: 1353618 markings, 8302538 edges, 122367 markings/sec, 5 secs
lola: 1986946 markings, 12254518 edges, 126666 markings/sec, 10 secs
lola: 2484704 markings, 16151901 edges, 99552 markings/sec, 15 secs
lola: 2980983 markings, 20218297 edges, 99256 markings/sec, 20 secs
lola: 3467973 markings, 24285677 edges, 97398 markings/sec, 25 secs
lola: 3892281 markings, 28401856 edges, 84862 markings/sec, 30 secs
lola: 4545961 markings, 32364291 edges, 130736 markings/sec, 35 secs
lola: 5093702 markings, 36321171 edges, 109548 markings/sec, 40 secs
lola: 5601248 markings, 40347580 edges, 101509 markings/sec, 45 secs
lola: 6096531 markings, 44355688 edges, 99057 markings/sec, 50 secs
lola: 6530698 markings, 48442033 edges, 86833 markings/sec, 55 secs
lola: 7120905 markings, 52372987 edges, 118041 markings/sec, 60 secs
lola: 7638080 markings, 55982670 edges, 103435 markings/sec, 65 secs
lola: 8113313 markings, 59850517 edges, 95047 markings/sec, 70 secs
lola: 8539305 markings, 63514780 edges, 85198 markings/sec, 75 secs
lola: 8948034 markings, 67078501 edges, 81746 markings/sec, 80 secs
lola: 9339980 markings, 70913255 edges, 78389 markings/sec, 85 secs
lola: 9756499 markings, 74503315 edges, 83304 markings/sec, 90 secs
lola: 10121147 markings, 78063185 edges, 72930 markings/sec, 95 secs
lola: 10460579 markings, 81596113 edges, 67886 markings/sec, 100 secs
lola: 10865013 markings, 85497797 edges, 80887 markings/sec, 105 secs
lola: 11260983 markings, 89007166 edges, 79194 markings/sec, 110 secs
lola: 11621296 markings, 92716730 edges, 72063 markings/sec, 115 secs
lola: 11944332 markings, 96303941 edges, 64607 markings/sec, 120 secs
lola: 12298304 markings, 100043218 edges, 70794 markings/sec, 125 secs
lola: 12603761 markings, 103816458 edges, 61091 markings/sec, 130 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: 12617412 markings, 103937632 edges
lola: ========================================
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= A9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= A9)))
lola: processed formula: A (F ((1 <= A9)))
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G ((A12 <= A20)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((A12 <= A20))))
lola: processed formula: A (F (G ((A12 <= A20))))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 18 markings, 19 edges
lola: ========================================
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((B11 <= A9))) U G (X ((A2 <= A12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((B11 <= A9))) U G (X ((A2 <= A12)))))
lola: processed formula: A ((X (X ((B11 <= A9))) U G (X ((A2 <= A12)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 10 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1033838 markings, 3998194 edges, 206768 markings/sec, 0 secs
lola: 1921945 markings, 8315512 edges, 177621 markings/sec, 5 secs
lola: 2689747 markings, 12721492 edges, 153560 markings/sec, 10 secs
lola: 3415118 markings, 17197146 edges, 145074 markings/sec, 15 secs
lola: 4050340 markings, 21770631 edges, 127044 markings/sec, 20 secs
lola: 4758123 markings, 26236805 edges, 141557 markings/sec, 25 secs
lola: 5350955 markings, 30834497 edges, 118566 markings/sec, 30 secs
lola: 5952710 markings, 35415378 edges, 120351 markings/sec, 35 secs
lola: 6653003 markings, 39997628 edges, 140059 markings/sec, 40 secs
lola: 7229776 markings, 44543236 edges, 115355 markings/sec, 45 secs
lola: 7783280 markings, 49263239 edges, 110701 markings/sec, 50 secs
lola: 8295610 markings, 54334762 edges, 102466 markings/sec, 55 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: 8311618 markings, 54516825 edges
lola: lola: ========================================subprocess 4 will run for 278 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= A3)) U (3 <= A18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= A3)) U (3 <= A18)))
lola: processed formula: A ((F ((2 <= A3)) U (3 <= A18)))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (X ((A18 <= A9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((A18 <= A9))))
lola: processed formula: A (F (X ((A18 <= A9))))
lola: processed formula length: 23
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 7559 markings, 9746 edges
lola: ========================================
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A9 <= B21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A9 <= B21)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-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: ========================================
lola: subprocess 7 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((B20 <= A7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (B20 <= A7)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-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: ========================================
lola: subprocess 8 will run for 418 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= B2)))
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 108 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 477 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F (X ((A8 <= A19))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (F (X ((A8 <= A19))))))
lola: processed formula: A (G (X (F (X ((A8 <= A19))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 6820 markings, 9008 edges
lola: ========================================
lola: subprocess 10 will run for 557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (F ((2 <= A3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G (F ((2 <= A3))))))
lola: processed formula: A (F (G (G (F ((2 <= A3))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 668 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A14 <= A13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A14 <= A13)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-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: ========================================
lola: subprocess 12 will run for 836 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((2 <= B11))) U G (X ((2 <= A4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((2 <= B11))) U G (X ((2 <= A4)))))
lola: processed formula: A ((X (X ((2 <= B11))) U G (X ((2 <= A4)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 10 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 bytes per marking, with 28 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 13 will run for 1114 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((A21 <= A19)) U F ((1 <= A17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((A21 <= A19)) U F ((1 <= A17)))))
lola: processed formula: A (G ((F ((A21 <= A19)) U F ((1 <= A17)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 184582 markings, 810457 edges, 36916 markings/sec, 0 secs
lola: 363061 markings, 1647628 edges, 35696 markings/sec, 5 secs
lola: 536466 markings, 2439185 edges, 34681 markings/sec, 10 secs
lola: 709117 markings, 3323720 edges, 34530 markings/sec, 15 secs
lola: 879017 markings, 4281008 edges, 33980 markings/sec, 20 secs
lola: 1058005 markings, 5151754 edges, 35798 markings/sec, 25 secs
lola: 1226374 markings, 5999360 edges, 33674 markings/sec, 30 secs
lola: 1391586 markings, 6871814 edges, 33042 markings/sec, 35 secs
lola: 1542792 markings, 7766705 edges, 30241 markings/sec, 40 secs
lola: 1707327 markings, 8687026 edges, 32907 markings/sec, 45 secs
lola: 1866393 markings, 9700589 edges, 31813 markings/sec, 50 secs
lola: 2037295 markings, 10657874 edges, 34180 markings/sec, 55 secs
lola: 2201299 markings, 11626851 edges, 32801 markings/sec, 60 secs
lola: 2358009 markings, 12571042 edges, 31342 markings/sec, 65 secs
lola: 2509966 markings, 13456105 edges, 30391 markings/sec, 70 secs
lola: 2663964 markings, 14463226 edges, 30800 markings/sec, 75 secs
lola: 2814423 markings, 15471788 edges, 30092 markings/sec, 80 secs
lola: 2979226 markings, 16476292 edges, 32961 markings/sec, 85 secs
lola: 3135917 markings, 17486338 edges, 31338 markings/sec, 90 secs
lola: 3289925 markings, 18469199 edges, 30802 markings/sec, 95 secs
lola: 3442819 markings, 19513415 edges, 30579 markings/sec, 100 secs
lola: 3581646 markings, 20377753 edges, 27765 markings/sec, 105 secs
lola: 3730808 markings, 21475679 edges, 29832 markings/sec, 110 secs
lola: 3877757 markings, 22519694 edges, 29390 markings/sec, 115 secs
lola: 4029476 markings, 23691741 edges, 30344 markings/sec, 120 secs
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: 4130540 markings, 24413619 edges
lola: ========================================
lola: subprocess 14 will run for 1608 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (X ((A7 <= A1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (X ((A7 <= A1))))))
lola: processed formula: A (X (G (X (X ((A7 <= A1))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 15 will run for 3216 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (G ((B21 <= A21))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G ((B21 <= A21)))))
lola: processed formula: A (F (G (G ((B21 <= A21)))))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-09ringLR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 53992 markings, 195437 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no yes yes yes no no no yes no yes no no
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-09ringLR-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- 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="DNAwalker-PT-09ringLR"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-full"
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/DNAwalker-PT-09ringLR.tgz
mv DNAwalker-PT-09ringLR 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 irma4mcc-full"
echo " Input is DNAwalker-PT-09ringLR, 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 r210-smll-152732260600243"
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 ;