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 268K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 15K 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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 8.0K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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.8K 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 12 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 108K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DNAwalker-PT-04track28LL, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265300233
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527445602441


BK_STOP 1527445751171

--------------------
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-04track28LL 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': 28573, 'Memory': 865.4, 'Tool': 'itstools'}, {'Time': 30200, 'Memory': 887.67, 'Tool': 'itstools'}, {'Time': 212002, 'Memory': 1841.2, 'Tool': 'lola'}, {'Time': 214105, 'Memory': 1850.39, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 7.419661918594477x far from the best tool itstools.
LTLCardinality lola DNAwalker-PT-04track28LL...

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


checking for too many tokens
===========================================================================================
DNAwalker-PT-04track28LL: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ DNAwalker-PT-04track28LL @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 284/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 34 places, 250 transitions, 34 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 164 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-04track28LL-LTLCardinality.task
lola: A ((A18 <= A10)) : A (F ((G ((2 <= A3)) U G ((A12 <= A5))))) : A ((X (X ((2 <= A1))) U ((2 <= A20) U (2 <= B26)))) : A (F (F (F (X ((3 <= A1)))))) : A (F (X (F (X ((1 <= A1)))))) : A (X ((1 <= A20))) : A (G ((2 <= A24))) : A ((G (G ((A25 <= A17))) U G (X ((A16 <= B26))))) : A (G (F (((1 <= B9) U (B26 <= A7))))) : A (F (G (((2 <= A20) U (2 <= A3))))) : A ((A14 <= A6)) : A (X (((1 <= A25) U F ((A6 <= A14))))) : A (G (G (X (G ((1 <= A23)))))) : A ((F (G ((3 <= A9))) U F (X ((A8 <= A6))))) : A (X (X (G (X ((2 <= B27)))))) : A ((3 <= A25))
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 ((A18 <= A10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A18 <= A10)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((2 <= A3)) U G ((A12 <= A5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((2 <= A3)) U G ((A12 <= A5)))))
lola: processed formula: A (F ((G ((2 <= A3)) U G ((A12 <= A5)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 12 markings, 13 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((2 <= A1))) U ((2 <= A20) U (2 <= B26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((2 <= A1))) U ((2 <= A20) U (2 <= B26))))
lola: processed formula: A ((X (X ((2 <= A1))) U ((2 <= A20) U (2 <= B26))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (X ((3 <= A1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((3 <= A1))))
lola: processed formula: A (F (X ((3 <= A1))))
lola: processed formula length: 21
lola: 2 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (X ((1 <= A1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F (X ((1 <= A1))))))
lola: processed formula: A (F (X (F (X ((1 <= A1))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= A20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((1 <= A20)))
lola: processed formula: A (X ((1 <= A20)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= A24)))
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 136 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((A25 <= A17))) U G (X ((A16 <= B26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((A25 <= A17))) U G (X ((A16 <= B26)))))
lola: processed formula: A ((G (G ((A25 <= A17))) U G (X ((A16 <= B26)))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((1 <= B9) U (B26 <= A7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((1 <= B9) U (B26 <= A7)))))
lola: processed formula: A (G (F (((1 <= B9) U (B26 <= A7)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 254660 markings, 827186 edges, 50932 markings/sec, 0 secs
lola: 506988 markings, 1647572 edges, 50466 markings/sec, 5 secs
lola: 776418 markings, 2441073 edges, 53886 markings/sec, 10 secs
lola: 1031141 markings, 3152158 edges, 50945 markings/sec, 15 secs
lola: 1276203 markings, 3923246 edges, 49012 markings/sec, 20 secs
lola: 1515008 markings, 4788831 edges, 47761 markings/sec, 25 secs
lola: 1746902 markings, 5589471 edges, 46379 markings/sec, 30 secs
lola: 1979725 markings, 6373058 edges, 46565 markings/sec, 35 secs
lola: 2207072 markings, 7155587 edges, 45469 markings/sec, 40 secs
lola: 2446249 markings, 7943382 edges, 47835 markings/sec, 45 secs
lola: 2678533 markings, 8719257 edges, 46457 markings/sec, 50 secs
lola: 2909955 markings, 9504559 edges, 46284 markings/sec, 55 secs
lola: 3140610 markings, 10276737 edges, 46131 markings/sec, 60 secs
lola: 3360689 markings, 11047261 edges, 44016 markings/sec, 65 secs
lola: 3592477 markings, 11831803 edges, 46358 markings/sec, 70 secs
lola: 3813383 markings, 12631414 edges, 44181 markings/sec, 75 secs
lola: 4035162 markings, 13411214 edges, 44356 markings/sec, 80 secs
lola: 4257796 markings, 14195701 edges, 44527 markings/sec, 85 secs
lola: 4480428 markings, 14984202 edges, 44526 markings/sec, 90 secs
lola: 4701738 markings, 15775934 edges, 44262 markings/sec, 95 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: 4816941 markings, 16192966 edges
lola: ========================================
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((2 <= A20) U (2 <= A3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((2 <= A20) U (2 <= A3)))))
lola: processed formula: A (F (G (((2 <= A20) U (2 <= A3)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 12 markings, 13 edges
lola: ========================================
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A14 <= A6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A14 <= A6)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-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 11 will run for 687 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= A25) U F ((A6 <= A14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((1 <= A25) U F ((A6 <= A14)))))
lola: processed formula: A (X (((1 <= A25) U F ((A6 <= A14)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (G ((1 <= A23))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (G ((1 <= A23))))))
lola: processed formula: A (G (G (X (G ((1 <= A23))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 40 markings, 53 edges
lola: ========================================
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((3 <= A9))) U F (X ((A8 <= A6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (G ((3 <= A9))) U F (X ((A8 <= A6)))))
lola: processed formula: A ((F (G ((3 <= A9))) U F (X ((A8 <= A6)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (X ((2 <= B27))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (G (X ((2 <= B27))))))
lola: processed formula: A (X (X (G (X ((2 <= B27))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 140 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 15 will run for 3436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= A25))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= A25)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 34 places; total mentions: 0
lola: closed formula file DNAwalker-PT-04track28LL-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: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no no yes yes no yes no no
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-04track28LL-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-04track28LL"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-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-04track28LL.tgz
mv DNAwalker-PT-04track28LL 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 mcc4mcc-full"
echo " Input is DNAwalker-PT-04track28LL, 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 r214-smll-152732265300233"
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 ;