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 368K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 196K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Raft-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r190-qhx2-152732141800083
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528360238281


BK_STOP 1528360883594

--------------------
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 Raft-PT-09 as instance name.
Using Raft 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': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 21876, 'Memory': 874.02, 'Tool': 'itstools'}, {'Time': 24976, 'Memory': 840.22, 'Tool': 'itstools'}, {'Time': 758975, 'Memory': 14396.72, 'Tool': 'lola'}, {'Time': 759178, 'Memory': 14330.46, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 34.6944139696471x far from the best tool itstools.
LTLCardinality lola Raft-PT-09...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Raft-PT-09: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ Raft-PT-09 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1123/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 413 places, 710 transitions, 332 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-09-LTLCardinality.task
lola: A (X (((p402 <= p262) U X ((3 <= p353))))) : A (F (X (F (X ((3 <= p192)))))) : A (X (X (F (X ((3 <= p240)))))) : A (X (((2 <= p180) U F ((p168 <= p406))))) : A (F ((1 <= p208))) : A (F (X (F ((1 <= p28))))) : A (F ((G ((2 <= p372)) U X ((p291 <= p156))))) : A (F (F ((3 <= p243)))) : A ((X (F ((1 <= p48))) U ((3 <= p7) U (1 <= p43)))) : A (X (X (F ((3 <= p269))))) : A (F (((3 <= p127) U G ((p93 <= p107))))) : A (G ((1 <= p82))) : A ((2 <= p229)) : A (X (((p14 <= p341) U F ((p175 <= p21))))) : A ((G (G ((2 <= p344))) U (p37 <= p184))) : A (F ((p218 <= p80)))
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 (((p402 <= p262) U X ((3 <= p353)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((p402 <= p262) U X ((3 <= p353)))))
lola: processed formula: A (X (((p402 <= p262) U X ((3 <= p353)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 17 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (X ((3 <= p192))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F (X ((3 <= p192))))))
lola: processed formula: A (F (X (F (X ((3 <= p192))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (X ((3 <= p240))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F (X ((3 <= p240))))))
lola: processed formula: A (X (X (F (X ((3 <= p240))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 17 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p180) U F ((p168 <= p406)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((2 <= p180) U F ((p168 <= p406)))))
lola: processed formula: A (X (((2 <= p180) U F ((p168 <= p406)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 2 markings, 1 edges
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p208)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p208)))
lola: processed formula: A (F ((1 <= p208)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: ========================================
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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F ((1 <= p28)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F ((1 <= p28)))))
lola: processed formula: A (F (X (F ((1 <= p28)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((2 <= p372)) U X ((p291 <= p156)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((2 <= p372)) U X ((p291 <= p156)))))
lola: processed formula: A (F ((G ((2 <= p372)) U X ((p291 <= p156)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((3 <= p243))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p243)))
lola: processed formula: A (F ((3 <= p243)))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 19 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((1 <= p48))) U ((3 <= p7) U (1 <= p43))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (F ((1 <= p48))) U ((3 <= p7) U (1 <= p43))))
lola: processed formula: A ((X (F ((1 <= p48))) U ((3 <= p7) U (1 <= p43))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((3 <= p269)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F ((3 <= p269)))))
lola: processed formula: A (X (X (F ((3 <= p269)))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p127) U G ((p93 <= p107)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p127) U G ((p93 <= p107)))))
lola: processed formula: A (F (((3 <= p127) U G ((p93 <= p107)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 28760 markings, 67148 edges, 5752 markings/sec, 0 secs
lola: 60531 markings, 139999 edges, 6354 markings/sec, 5 secs
lola: 92722 markings, 213294 edges, 6438 markings/sec, 10 secs
lola: 127421 markings, 293911 edges, 6940 markings/sec, 15 secs
lola: 159895 markings, 369362 edges, 6495 markings/sec, 20 secs
lola: 193807 markings, 447004 edges, 6782 markings/sec, 25 secs
lola: 227010 markings, 523576 edges, 6641 markings/sec, 30 secs
lola: 260137 markings, 599224 edges, 6625 markings/sec, 35 secs
lola: 292129 markings, 673896 edges, 6398 markings/sec, 40 secs
lola: 326020 markings, 754983 edges, 6778 markings/sec, 45 secs
lola: 358921 markings, 832406 edges, 6580 markings/sec, 50 secs
lola: 394414 markings, 915843 edges, 7099 markings/sec, 55 secs
lola: 428890 markings, 997514 edges, 6895 markings/sec, 60 secs
lola: 463876 markings, 1078906 edges, 6997 markings/sec, 65 secs
lola: 499768 markings, 1164206 edges, 7178 markings/sec, 70 secs
lola: 534976 markings, 1246867 edges, 7042 markings/sec, 75 secs
lola: 571274 markings, 1339669 edges, 7260 markings/sec, 80 secs
lola: 608658 markings, 1427700 edges, 7477 markings/sec, 85 secs
lola: 645152 markings, 1510464 edges, 7299 markings/sec, 90 secs
lola: 682994 markings, 1603144 edges, 7568 markings/sec, 95 secs
lola: 721126 markings, 1696963 edges, 7626 markings/sec, 100 secs
lola: 761614 markings, 1790822 edges, 8098 markings/sec, 105 secs
lola: 799527 markings, 1880687 edges, 7583 markings/sec, 110 secs
lola: 842543 markings, 1978573 edges, 8603 markings/sec, 115 secs
lola: 882467 markings, 2072785 edges, 7985 markings/sec, 120 secs
lola: 920193 markings, 2165891 edges, 7545 markings/sec, 125 secs
lola: 958274 markings, 2256896 edges, 7616 markings/sec, 130 secs
lola: 995457 markings, 2350242 edges, 7437 markings/sec, 135 secs
lola: 1034579 markings, 2445856 edges, 7824 markings/sec, 140 secs
lola: 1075102 markings, 2540387 edges, 8105 markings/sec, 145 secs
lola: 1117290 markings, 2641697 edges, 8438 markings/sec, 150 secs
lola: 1157832 markings, 2738824 edges, 8108 markings/sec, 155 secs
lola: 1200921 markings, 2840605 edges, 8618 markings/sec, 160 secs
lola: 1242985 markings, 2942409 edges, 8413 markings/sec, 165 secs
lola: 1281041 markings, 3040071 edges, 7611 markings/sec, 170 secs
lola: 1326181 markings, 3146483 edges, 9028 markings/sec, 175 secs
lola: 1365064 markings, 3243108 edges, 7777 markings/sec, 180 secs
lola: 1405852 markings, 3340896 edges, 8158 markings/sec, 185 secs
lola: 1452581 markings, 3447671 edges, 9346 markings/sec, 190 secs
lola: 1492737 markings, 3549582 edges, 8031 markings/sec, 195 secs
lola: 1533095 markings, 3651724 edges, 8072 markings/sec, 200 secs
lola: 1573550 markings, 3753500 edges, 8091 markings/sec, 205 secs
lola: 1622401 markings, 3862443 edges, 9770 markings/sec, 210 secs
lola: 1665728 markings, 3967599 edges, 8665 markings/sec, 215 secs
lola: 1708732 markings, 4075987 edges, 8601 markings/sec, 220 secs
lola: 1749585 markings, 4180329 edges, 8171 markings/sec, 225 secs
lola: 1790673 markings, 4284420 edges, 8218 markings/sec, 230 secs
lola: 1831619 markings, 4385759 edges, 8189 markings/sec, 235 secs
lola: 1876739 markings, 4492365 edges, 9024 markings/sec, 240 secs
lola: 1919814 markings, 4597826 edges, 8615 markings/sec, 245 secs
lola: 1959140 markings, 4699871 edges, 7865 markings/sec, 250 secs
lola: 2002707 markings, 4809584 edges, 8713 markings/sec, 255 secs
lola: 2043423 markings, 4915732 edges, 8143 markings/sec, 260 secs
lola: 2086093 markings, 5023925 edges, 8534 markings/sec, 265 secs
lola: 2129572 markings, 5132062 edges, 8696 markings/sec, 270 secs
lola: 2171232 markings, 5239349 edges, 8332 markings/sec, 275 secs
lola: 2216526 markings, 5350011 edges, 9059 markings/sec, 280 secs
lola: 2261298 markings, 5456627 edges, 8954 markings/sec, 285 secs
lola: 2297815 markings, 5551578 edges, 7303 markings/sec, 290 secs
lola: 2344330 markings, 5662283 edges, 9303 markings/sec, 295 secs
lola: 2386464 markings, 5768567 edges, 8427 markings/sec, 300 secs
lola: 2431675 markings, 5877883 edges, 9042 markings/sec, 305 secs
lola: 2478589 markings, 5998053 edges, 9383 markings/sec, 310 secs
lola: 2516590 markings, 6093208 edges, 7600 markings/sec, 315 secs
lola: 2560084 markings, 6198266 edges, 8699 markings/sec, 320 secs
lola: 2601836 markings, 6304642 edges, 8350 markings/sec, 325 secs
lola: 2641025 markings, 6405968 edges, 7838 markings/sec, 330 secs
lola: 2683456 markings, 6508091 edges, 8486 markings/sec, 335 secs
lola: 2720216 markings, 6604206 edges, 7352 markings/sec, 340 secs
lola: 2764114 markings, 6708046 edges, 8780 markings/sec, 345 secs
lola: 2809566 markings, 6822589 edges, 9090 markings/sec, 350 secs
lola: 2849824 markings, 6923032 edges, 8052 markings/sec, 355 secs
lola: 2886733 markings, 7019733 edges, 7382 markings/sec, 360 secs
lola: 2932032 markings, 7133153 edges, 9060 markings/sec, 365 secs
lola: 2971598 markings, 7236454 edges, 7913 markings/sec, 370 secs
lola: 3022495 markings, 7348970 edges, 10179 markings/sec, 375 secs
lola: 3061935 markings, 7450293 edges, 7888 markings/sec, 380 secs
lola: 3098383 markings, 7539588 edges, 7290 markings/sec, 385 secs
lola: 3137673 markings, 7638228 edges, 7858 markings/sec, 390 secs
lola: 3180526 markings, 7745612 edges, 8571 markings/sec, 395 secs
lola: 3227737 markings, 7859434 edges, 9442 markings/sec, 400 secs
lola: 3267752 markings, 7965685 edges, 8003 markings/sec, 405 secs
lola: 3304570 markings, 8063329 edges, 7364 markings/sec, 410 secs
lola: 3336764 markings, 8141529 edges, 6439 markings/sec, 415 secs
lola: 3364806 markings, 8205514 edges, 5608 markings/sec, 420 secs
lola: 3391526 markings, 8266133 edges, 5344 markings/sec, 425 secs
lola: 3419760 markings, 8331218 edges, 5647 markings/sec, 430 secs
lola: 3445989 markings, 8391103 edges, 5246 markings/sec, 435 secs
lola: 3472623 markings, 8451155 edges, 5327 markings/sec, 440 secs
lola: 3500649 markings, 8516661 edges, 5605 markings/sec, 445 secs
lola: 3528976 markings, 8584322 edges, 5665 markings/sec, 450 secs
lola: 3556378 markings, 8647934 edges, 5480 markings/sec, 455 secs
lola: 3582655 markings, 8707540 edges, 5255 markings/sec, 460 secs
lola: 3612467 markings, 8779833 edges, 5962 markings/sec, 465 secs
lola: 3641502 markings, 8847334 edges, 5807 markings/sec, 470 secs
lola: 3668588 markings, 8909549 edges, 5417 markings/sec, 475 secs
lola: 3698367 markings, 8978708 edges, 5956 markings/sec, 480 secs
lola: 3728742 markings, 9049253 edges, 6075 markings/sec, 485 secs
lola: 3758474 markings, 9118483 edges, 5946 markings/sec, 490 secs
lola: 3787991 markings, 9186779 edges, 5903 markings/sec, 495 secs
lola: 3817551 markings, 9256901 edges, 5912 markings/sec, 500 secs
lola: 3849011 markings, 9328618 edges, 6292 markings/sec, 505 secs
lola: 3879320 markings, 9405299 edges, 6062 markings/sec, 510 secs
lola: 3907418 markings, 9473435 edges, 5620 markings/sec, 515 secs
lola: 3936621 markings, 9542924 edges, 5841 markings/sec, 520 secs
lola: 3967093 markings, 9616752 edges, 6094 markings/sec, 525 secs
lola: 3997998 markings, 9690315 edges, 6181 markings/sec, 530 secs
lola: 4029800 markings, 9766485 edges, 6360 markings/sec, 535 secs
lola: 4062672 markings, 9841198 edges, 6574 markings/sec, 540 secs
lola: 4094367 markings, 9915566 edges, 6339 markings/sec, 545 secs
lola: 4126347 markings, 9995599 edges, 6396 markings/sec, 550 secs
lola: 4157253 markings, 10071207 edges, 6181 markings/sec, 555 secs
lola: 4192693 markings, 10152716 edges, 7088 markings/sec, 560 secs
lola: 4227006 markings, 10229229 edges, 6863 markings/sec, 565 secs
lola: 4259910 markings, 10306476 edges, 6581 markings/sec, 570 secs
lola: 4292587 markings, 10385753 edges, 6535 markings/sec, 575 secs
lola: 4325483 markings, 10466320 edges, 6579 markings/sec, 580 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p82)))
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 44 bytes per marking, with 20 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 12 will run for 737 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p229))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p229)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-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: subprocess 13 will run for 982 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p14 <= p341) U F ((p175 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((p14 <= p341) U F ((p175 <= p21)))))
lola: processed formula: A (X (((p14 <= p341) U F ((p175 <= p21)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 14 will run for 1474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((2 <= p344))) U (p37 <= p184)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((2 <= p344))) U (p37 <= p184)))
lola: processed formula: A ((G (G ((2 <= p344))) U (p37 <= p184)))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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 15 will run for 2948 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p218 <= p80)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p218 <= p80)))
lola: processed formula: A (F ((p218 <= p80)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 19 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: RESULT
lola:
SUMMARY: no no no yes no no yes no no no unknown no no no yes yes
FORMULA Raft-PT-09-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-15 TRUE 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="Raft-PT-09"
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/Raft-PT-09.tgz
mv Raft-PT-09 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 Raft-PT-09, 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 r190-qhx2-152732141800083"
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 ;