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 416K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 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.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.7K 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 241K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Raft-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r190-qhx2-152732141900085
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528360381699


BK_STOP 1528361141373

--------------------
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-10 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': 30421, 'Memory': 1071, 'Tool': 'itstools'}, {'Time': 32523, 'Memory': 1052.12, 'Tool': 'itstools'}, {'Time': 830667, 'Memory': 15929.64, 'Tool': 'lola'}, {'Time': 832063, 'Memory': 15948.53, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 27.305709871470366x far from the best tool itstools.
LTLCardinality lola Raft-PT-10...

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


checking for too many tokens
===========================================================================================
Raft-PT-10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ Raft-PT-10 @ 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: 1376/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 508 places, 868 transitions, 408 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 857 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-10-LTLCardinality.task
lola: A ((p35 <= p164)) : A (X (F (G (F ((p158 <= p468)))))) : A ((F (G ((3 <= p447))) U ((1 <= p431) U (p345 <= p87)))) : A (X (F (G ((1 <= p48))))) : A (G (G (X (F ((2 <= p234)))))) : A ((F ((p399 <= p25)) U X ((3 <= p488)))) : A ((((1 <= p221) U (3 <= p408)) U ((p277 <= p270) U (p3 <= p410)))) : A ((p92 <= p326)) : A ((X ((p301 <= p204)) U F (F ((2 <= p297))))) : A (F (X (G (F ((p163 <= p70)))))) : A ((X ((3 <= p434)) U F (F ((p497 <= p216))))) : A ((2 <= p388)) : A ((2 <= p206)) : A (F (G (F (G ((p255 <= p205)))))) : A (X ((G ((1 <= p507)) U F ((2 <= p258))))) : A (G (F (G (X ((3 <= p345))))))
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 ((p35 <= p164))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p35 <= p164)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (F ((p158 <= p468))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((p158 <= p468)))))
lola: processed formula: A (X (G (F ((p158 <= p468)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 343914 markings, 1800434 edges, 68783 markings/sec, 0 secs
lola: 679937 markings, 3557274 edges, 67205 markings/sec, 5 secs
lola: 1014266 markings, 5305401 edges, 66866 markings/sec, 10 secs
lola: 1338516 markings, 7050669 edges, 64850 markings/sec, 15 secs
lola: 1675096 markings, 8837352 edges, 67316 markings/sec, 20 secs
lola: 1994467 markings, 10573255 edges, 63874 markings/sec, 25 secs
lola: 2312139 markings, 12278605 edges, 63534 markings/sec, 30 secs
lola: 2631352 markings, 13943878 edges, 63843 markings/sec, 35 secs
lola: 2959364 markings, 15673271 edges, 65602 markings/sec, 40 secs
lola: 3283728 markings, 17379236 edges, 64873 markings/sec, 45 secs
lola: 3607103 markings, 19074799 edges, 64675 markings/sec, 50 secs
lola: 3929147 markings, 20784534 edges, 64409 markings/sec, 55 secs
lola: 4253013 markings, 22489181 edges, 64773 markings/sec, 60 secs
lola: 4567288 markings, 24182901 edges, 62855 markings/sec, 65 secs
lola: 4875160 markings, 25872214 edges, 61574 markings/sec, 70 secs
lola: 5197700 markings, 27621447 edges, 64508 markings/sec, 75 secs
lola: 5509240 markings, 29324710 edges, 62308 markings/sec, 80 secs
lola: 5828609 markings, 31012289 edges, 63874 markings/sec, 85 secs
lola: 6150216 markings, 32690735 edges, 64321 markings/sec, 90 secs
lola: 6464762 markings, 34388413 edges, 62909 markings/sec, 95 secs
lola: 6776340 markings, 36086009 edges, 62316 markings/sec, 100 secs
lola: 7097711 markings, 37779131 edges, 64274 markings/sec, 105 secs
lola: 7410544 markings, 39455047 edges, 62567 markings/sec, 110 secs
lola: 7722406 markings, 41136465 edges, 62372 markings/sec, 115 secs
lola: 8041931 markings, 42833293 edges, 63905 markings/sec, 120 secs
lola: 8375062 markings, 44651302 edges, 66626 markings/sec, 125 secs
lola: 8707317 markings, 46441149 edges, 66451 markings/sec, 130 secs
lola: 9030470 markings, 48137384 edges, 64631 markings/sec, 135 secs
lola: 9358378 markings, 49849190 edges, 65582 markings/sec, 140 secs
lola: 9679025 markings, 51585427 edges, 64129 markings/sec, 145 secs
lola: 10001853 markings, 53317771 edges, 64566 markings/sec, 150 secs
lola: 10328594 markings, 55042177 edges, 65348 markings/sec, 155 secs
lola: 10653376 markings, 56745071 edges, 64956 markings/sec, 160 secs
lola: 10976245 markings, 58429745 edges, 64574 markings/sec, 165 secs
lola: 11295219 markings, 60143239 edges, 63795 markings/sec, 170 secs
lola: 11618973 markings, 61854088 edges, 64751 markings/sec, 175 secs
lola: 11945931 markings, 63573926 edges, 65392 markings/sec, 180 secs
lola: 12262991 markings, 65281492 edges, 63412 markings/sec, 185 secs
lola: 12576029 markings, 66976999 edges, 62608 markings/sec, 190 secs
lola: 12897631 markings, 68676916 edges, 64320 markings/sec, 195 secs
lola: 13208958 markings, 70339505 edges, 62265 markings/sec, 200 secs
lola: 13519306 markings, 72028097 edges, 62070 markings/sec, 205 secs
lola: 13827923 markings, 73710936 edges, 61723 markings/sec, 210 secs
lola: 14141803 markings, 75389243 edges, 62776 markings/sec, 215 secs
lola: 14446055 markings, 77058958 edges, 60850 markings/sec, 220 secs
lola: 14760647 markings, 78756735 edges, 62918 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((3 <= p447))) U ((1 <= p431) U (p345 <= p87))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (G ((3 <= p447))) U ((1 <= p431) U (p345 <= p87))))
lola: processed formula: A ((F (G ((3 <= p447))) U ((1 <= p431) U (p345 <= p87))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 5 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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G ((1 <= p48)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((1 <= p48)))))
lola: processed formula: A (X (F (G ((1 <= p48)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 6 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: 62 markings, 63 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (F ((2 <= p234))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (F ((2 <= p234))))))
lola: processed formula: A (G (G (X (F ((2 <= p234))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 6 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: 61 markings, 61 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((p399 <= p25)) U X ((3 <= p488))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((p399 <= p25)) U X ((3 <= p488))))
lola: processed formula: A ((F ((p399 <= p25)) U X ((3 <= p488))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 5 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: 61 markings, 61 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p221) U (3 <= p408)) U ((p277 <= p270) U (p3 <= p410))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p221) U (3 <= p408)) U ((p277 <= p270) U (p3 <= p410))))
lola: processed formula: A ((((1 <= p221) U (3 <= p408)) U ((p277 <= p270) U (p3 <= p410))))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 5 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 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p92 <= p326))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p92 <= p326)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((p301 <= p204)) U F (F ((2 <= p297)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((p301 <= p204)) U F ((2 <= p297))))
lola: processed formula: A ((X ((p301 <= p204)) U F ((2 <= p297))))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 7 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: 61 markings, 61 edges
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (F ((p163 <= p70))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G (F ((p163 <= p70))))))
lola: processed formula: A (F (X (G (F ((p163 <= p70))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 344658 markings, 1804088 edges, 68932 markings/sec, 0 secs
lola: 679991 markings, 3557548 edges, 67067 markings/sec, 5 secs
lola: 1017237 markings, 5321601 edges, 67449 markings/sec, 10 secs
lola: 1344983 markings, 7085593 edges, 65549 markings/sec, 15 secs
lola: 1679251 markings, 8859879 edges, 66854 markings/sec, 20 secs
lola: 2003044 markings, 10620068 edges, 64759 markings/sec, 25 secs
lola: 2329835 markings, 12371600 edges, 65358 markings/sec, 30 secs
lola: 2659380 markings, 14094682 edges, 65909 markings/sec, 35 secs
lola: 2989837 markings, 15834675 edges, 66091 markings/sec, 40 secs
lola: 3314455 markings, 17537906 edges, 64924 markings/sec, 45 secs
lola: 3639206 markings, 19239598 edges, 64950 markings/sec, 50 secs
lola: 3964875 markings, 20969980 edges, 65134 markings/sec, 55 secs
lola: 4291811 markings, 22693027 edges, 65387 markings/sec, 60 secs
lola: 4605986 markings, 24396606 edges, 62835 markings/sec, 65 secs
lola: 4915202 markings, 26090981 edges, 61843 markings/sec, 70 secs
lola: 5238067 markings, 27841497 edges, 64573 markings/sec, 75 secs
lola: 5551051 markings, 29553365 edges, 62597 markings/sec, 80 secs
lola: 5873172 markings, 31243441 edges, 64424 markings/sec, 85 secs
lola: 6194472 markings, 32925735 edges, 64260 markings/sec, 90 secs
lola: 6509313 markings, 34632223 edges, 62968 markings/sec, 95 secs
lola: 6821429 markings, 36327504 edges, 62423 markings/sec, 100 secs
lola: 7139484 markings, 38007990 edges, 63611 markings/sec, 105 secs
lola: 7455125 markings, 39696967 edges, 63128 markings/sec, 110 secs
lola: 7767551 markings, 41376121 edges, 62485 markings/sec, 115 secs
lola: 8085598 markings, 43076182 edges, 63609 markings/sec, 120 secs
lola: 8423774 markings, 44915232 edges, 67635 markings/sec, 125 secs
lola: 8755773 markings, 46695633 edges, 66400 markings/sec, 130 secs
lola: 9081815 markings, 48405319 edges, 65208 markings/sec, 135 secs
lola: 9411061 markings, 50131126 edges, 65849 markings/sec, 140 secs
lola: 9725301 markings, 51840501 edges, 62848 markings/sec, 145 secs
lola: 10046857 markings, 53553680 edges, 64311 markings/sec, 150 secs
lola: 10367093 markings, 55239725 edges, 64047 markings/sec, 155 secs
lola: 10689189 markings, 56928501 edges, 64419 markings/sec, 160 secs
lola: 11011545 markings, 58621216 edges, 64471 markings/sec, 165 secs
lola: 11329092 markings, 60320078 edges, 63509 markings/sec, 170 secs
lola: 11653121 markings, 62035534 edges, 64806 markings/sec, 175 secs
lola: 11978767 markings, 63747520 edges, 65129 markings/sec, 180 secs
lola: 12294596 markings, 65454742 edges, 63166 markings/sec, 185 secs
lola: 12611619 markings, 67160869 edges, 63405 markings/sec, 190 secs
lola: 12933102 markings, 68858645 edges, 64297 markings/sec, 195 secs
lola: 13245192 markings, 70538523 edges, 62418 markings/sec, 200 secs
lola: 13557580 markings, 72230559 edges, 62478 markings/sec, 205 secs
lola: 13867581 markings, 73915046 edges, 62000 markings/sec, 210 secs
lola: 14177634 markings, 75590592 edges, 62011 markings/sec, 215 secs
lola: 14483055 markings, 77260822 edges, 61084 markings/sec, 220 secs
lola: 14802167 markings, 78980159 edges, 63822 markings/sec, 225 secs
lola: 15115895 markings, 80650770 edges, 62746 markings/sec, 230 secs
lola: 15425109 markings, 82299256 edges, 61843 markings/sec, 235 secs
lola: 15738807 markings, 83963599 edges, 62740 markings/sec, 240 secs
lola: 16054734 markings, 85633442 edges, 63185 markings/sec, 245 secs
lola: 16367710 markings, 87303680 edges, 62595 markings/sec, 250 secs
lola: 16676318 markings, 88961351 edges, 61722 markings/sec, 255 secs
lola: 16990657 markings, 90639236 edges, 62868 markings/sec, 260 secs
lola: 17304612 markings, 92296722 edges, 62791 markings/sec, 265 secs
lola: 17619709 markings, 93953597 edges, 63019 markings/sec, 270 secs
lola: 17922960 markings, 95603278 edges, 60650 markings/sec, 275 secs
lola: 18237127 markings, 97259150 edges, 62833 markings/sec, 280 secs
lola: 18548907 markings, 98908578 edges, 62356 markings/sec, 285 secs
lola: 18855335 markings, 100536900 edges, 61286 markings/sec, 290 secs
lola: 19165429 markings, 102181755 edges, 62019 markings/sec, 295 secs
lola: 19478573 markings, 103836341 edges, 62629 markings/sec, 300 secs
lola: 19790449 markings, 105491368 edges, 62375 markings/sec, 305 secs
lola: 20099372 markings, 107142748 edges, 61785 markings/sec, 310 secs
lola: 20416529 markings, 108810475 edges, 63431 markings/sec, 315 secs
lola: 20729444 markings, 110463521 edges, 62583 markings/sec, 320 secs
lola: 21039362 markings, 112128511 edges, 61984 markings/sec, 325 secs
lola: 21349708 markings, 113792093 edges, 62069 markings/sec, 330 secs
lola: 21650693 markings, 115446112 edges, 60197 markings/sec, 335 secs
lola: 21958301 markings, 117083304 edges, 61522 markings/sec, 340 secs
lola: 22270755 markings, 118747116 edges, 62491 markings/sec, 345 secs
lola: 22589021 markings, 120422369 edges, 63653 markings/sec, 350 secs
lola: 22901765 markings, 122076903 edges, 62549 markings/sec, 355 secs
lola: 23213255 markings, 123730225 edges, 62298 markings/sec, 360 secs
lola: 23520362 markings, 125366145 edges, 61421 markings/sec, 365 secs
lola: 23826321 markings, 126983658 edges, 61192 markings/sec, 370 secs
lola: 24126313 markings, 128615844 edges, 59998 markings/sec, 375 secs
lola: 24422637 markings, 130240536 edges, 59265 markings/sec, 380 secs
lola: 24732478 markings, 131899745 edges, 61968 markings/sec, 385 secs
lola: 25029493 markings, 133520768 edges, 59403 markings/sec, 390 secs
lola: 25331356 markings, 135125720 edges, 60373 markings/sec, 395 secs
lola: 25634192 markings, 136748898 edges, 60567 markings/sec, 400 secs
lola: 25936886 markings, 138371547 edges, 60539 markings/sec, 405 secs
lola: 26235666 markings, 139996583 edges, 59756 markings/sec, 410 secs
lola: 26539893 markings, 141647334 edges, 60845 markings/sec, 415 secs
lola: 26850740 markings, 143307717 edges, 62169 markings/sec, 420 secs
lola: 27160025 markings, 144965814 edges, 61857 markings/sec, 425 secs
lola: 27461813 markings, 146604102 edges, 60358 markings/sec, 430 secs
lola: 27762847 markings, 148233945 edges, 60207 markings/sec, 435 secs
lola: 28065793 markings, 149869549 edges, 60589 markings/sec, 440 secs
lola: 28364303 markings, 151491641 edges, 59702 markings/sec, 445 secs
lola: 28669779 markings, 153130198 edges, 61095 markings/sec, 450 secs
lola: 28972785 markings, 154773363 edges, 60601 markings/sec, 455 secs
lola: 29279361 markings, 156402307 edges, 61315 markings/sec, 460 secs
lola: 29585257 markings, 158033487 edges, 61179 markings/sec, 465 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((3 <= p434)) U F (F ((p497 <= p216)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((3 <= p434)) U F ((p497 <= p216))))
lola: processed formula: A ((X ((3 <= p434)) U F ((p497 <= p216))))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 7 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 566 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p388))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p388)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p206))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p206)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 943 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (G ((p255 <= p205))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((p255 <= p205))))
lola: processed formula: A (F (G ((p255 <= p205))))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 6 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: 55 markings, 62 edges
lola: ========================================
lola: subprocess 14 will run for 1415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((1 <= p507)) U F ((2 <= p258)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((1 <= p507)) U F ((2 <= p258)))))
lola: processed formula: A (X ((G ((1 <= p507)) U F ((2 <= p258)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 6 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: 61 markings, 61 edges
lola: ========================================
lola: subprocess 15 will run for 2830 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (X ((3 <= p345))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((3 <= p345)))))
lola: processed formula: A (F (G (X ((3 <= p345)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 508 places; total mentions: 0
lola: closed formula file Raft-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 6 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: 62 markings, 63 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown yes no no no yes yes no unknown yes no no no no no
FORMULA Raft-PT-10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-10-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="Raft-PT-10"
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-10.tgz
mv Raft-PT-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is Raft-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r190-qhx2-152732141900085"
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 ;