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 544K
-rw-r--r-- 1 mcc users 3.2K 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.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 384K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is FlexibleBarrier-PT-22a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r250-blw7-152732552300065
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528011733972


BK_STOP 1528012382396

--------------------
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 FlexibleBarrier-PT-22a as instance name.
Using FlexibleBarrier 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': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 5908, 'Memory': 428.64, 'Tool': 'itstools'}, {'Time': 1136597, 'Memory': 15918.58, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 192.38270142180096x far from the best tool itstools.
LTLCardinality lola FlexibleBarrier-PT-22a...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-22a: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ FlexibleBarrier-PT-22a @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1525/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 267 places, 1258 transitions, 243 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 862 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-22a-LTLCardinality.task
lola: A (F ((F ((p213 <= p53)) U (p100 <= p133)))) : A (G ((F ((1 <= p223)) U F ((p125 <= p245))))) : A (X (G (F (G ((3 <= p38)))))) : A (((3 <= p134) U F (X ((p70 <= p223))))) : A ((3 <= p5)) : A ((X (F ((p257 <= p122))) U G (X ((p156 <= p206))))) : A (X (X ((p210 <= p136)))) : A ((p83 <= p205)) : A ((2 <= p136)) : A (F (X (G ((p137 <= p135))))) : A ((G (X ((2 <= p200))) U X ((p216 <= p63)))) : A ((X (F ((1 <= p202))) U X (X ((p92 <= p213))))) : A ((G ((2 <= p259)) U X ((p39 <= p247)))) : A ((X ((1 <= p82)) U X ((3 <= p126)))) : A (X ((p222 <= p174))) : A (X ((G ((1 <= p7)) U (2 <= p184))))
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 (F ((F ((p213 <= p53)) U (p100 <= p133))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((p213 <= p53)) U (p100 <= p133))))
lola: processed formula: A (F ((F ((p213 <= p53)) U (p100 <= p133))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 12 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((1 <= p223)) U F ((p125 <= p245)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((1 <= p223)) U F ((p125 <= p245)))))
lola: processed formula: A (G ((F ((1 <= p223)) U F ((p125 <= p245)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 90716 markings, 164631 edges, 18143 markings/sec, 0 secs
lola: 179027 markings, 330229 edges, 17662 markings/sec, 5 secs
lola: 252030 markings, 451299 edges, 14601 markings/sec, 10 secs
lola: 323767 markings, 570553 edges, 14347 markings/sec, 15 secs
lola: 395624 markings, 694899 edges, 14371 markings/sec, 20 secs
lola: 465870 markings, 814711 edges, 14049 markings/sec, 25 secs
lola: 539160 markings, 941312 edges, 14658 markings/sec, 30 secs
lola: 613516 markings, 1069370 edges, 14871 markings/sec, 35 secs
lola: 686110 markings, 1196211 edges, 14519 markings/sec, 40 secs
lola: 759265 markings, 1320498 edges, 14631 markings/sec, 45 secs
lola: 827015 markings, 1434338 edges, 13550 markings/sec, 50 secs
lola: 897554 markings, 1550793 edges, 14108 markings/sec, 55 secs
lola: 972863 markings, 1678100 edges, 15062 markings/sec, 60 secs
lola: 1044532 markings, 1798185 edges, 14334 markings/sec, 65 secs
lola: 1115888 markings, 1917395 edges, 14271 markings/sec, 70 secs
lola: 1185887 markings, 2033840 edges, 14000 markings/sec, 75 secs
lola: 1255839 markings, 2147107 edges, 13990 markings/sec, 80 secs
lola: 1322898 markings, 2262853 edges, 13412 markings/sec, 85 secs
lola: 1393764 markings, 2386245 edges, 14173 markings/sec, 90 secs
lola: 1462747 markings, 2506280 edges, 13797 markings/sec, 95 secs
lola: 1532782 markings, 2632120 edges, 14007 markings/sec, 100 secs
lola: 1604635 markings, 2781935 edges, 14371 markings/sec, 105 secs
lola: 1668329 markings, 2894712 edges, 12739 markings/sec, 110 secs
lola: 1734802 markings, 3007067 edges, 13295 markings/sec, 115 secs
lola: 1794476 markings, 3113112 edges, 11935 markings/sec, 120 secs
lola: 1855976 markings, 3219138 edges, 12300 markings/sec, 125 secs
lola: 1923761 markings, 3335100 edges, 13557 markings/sec, 130 secs
lola: 1994409 markings, 3463220 edges, 14130 markings/sec, 135 secs
lola: 2064868 markings, 3583901 edges, 14092 markings/sec, 140 secs
lola: 2135830 markings, 3707073 edges, 14192 markings/sec, 145 secs
lola: 2208077 markings, 3838871 edges, 14449 markings/sec, 150 secs
lola: 2279051 markings, 3986701 edges, 14195 markings/sec, 155 secs
lola: 2347895 markings, 4102457 edges, 13769 markings/sec, 160 secs
lola: 2416377 markings, 4216885 edges, 13696 markings/sec, 165 secs
lola: 2488375 markings, 4339846 edges, 14400 markings/sec, 170 secs
lola: 2559505 markings, 4458787 edges, 14226 markings/sec, 175 secs
lola: 2632087 markings, 4587578 edges, 14516 markings/sec, 180 secs
lola: 2708142 markings, 4727356 edges, 15211 markings/sec, 185 secs
lola: 2778962 markings, 4849787 edges, 14164 markings/sec, 190 secs
lola: 2848332 markings, 4969872 edges, 13874 markings/sec, 195 secs
lola: 2919150 markings, 5093092 edges, 14164 markings/sec, 200 secs
lola: 2990726 markings, 5220024 edges, 14315 markings/sec, 205 secs
lola: 3062778 markings, 5347160 edges, 14410 markings/sec, 210 secs
lola: 3128940 markings, 5460615 edges, 13232 markings/sec, 215 secs
lola: 3191023 markings, 5569197 edges, 12417 markings/sec, 220 secs
lola: 3255540 markings, 5688423 edges, 12903 markings/sec, 225 secs
lola: 3317532 markings, 5795156 edges, 12398 markings/sec, 230 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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (G ((3 <= p38))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((3 <= p38)))))
lola: processed formula: A (X (F (G ((3 <= p38)))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 11 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p134) U F (X ((p70 <= p223)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= p134) U F (X ((p70 <= p223)))))
lola: processed formula: A (((3 <= p134) U F (X ((p70 <= p223)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 11 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 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p5)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p257 <= p122))) U G (X ((p156 <= p206)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (F ((p257 <= p122))) U G (X ((p156 <= p206)))))
lola: processed formula: A ((X (F ((p257 <= p122))) U G (X ((p156 <= p206)))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 10 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: 9 markings, 12 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p210 <= p136))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((p210 <= p136))))
lola: processed formula: A (X (X ((p210 <= p136))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 10 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p83 <= p205))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p83 <= p205)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-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 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p136))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p136)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-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 9 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G ((p137 <= p135)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G ((p137 <= p135)))))
lola: processed formula: A (F (X (G ((p137 <= p135)))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 529811 markings, 2830304 edges, 105962 markings/sec, 0 secs
lola: 1192932 markings, 5702437 edges, 132624 markings/sec, 5 secs
lola: 1844625 markings, 8402378 edges, 130339 markings/sec, 10 secs
lola: 2495906 markings, 11273669 edges, 130256 markings/sec, 15 secs
lola: 3082526 markings, 13767757 edges, 117324 markings/sec, 20 secs
lola: 3745777 markings, 16545886 edges, 132650 markings/sec, 25 secs
lola: 4298394 markings, 19065615 edges, 110523 markings/sec, 30 secs
lola: 4956094 markings, 21781947 edges, 131540 markings/sec, 35 secs
lola: 5496982 markings, 24194697 edges, 108178 markings/sec, 40 secs
lola: 6057698 markings, 26558220 edges, 112143 markings/sec, 45 secs
lola: 6583695 markings, 28861297 edges, 105199 markings/sec, 50 secs
lola: 7189263 markings, 31300260 edges, 121114 markings/sec, 55 secs
lola: 7798719 markings, 34030090 edges, 121891 markings/sec, 60 secs
lola: 8390185 markings, 36684235 edges, 118293 markings/sec, 65 secs
lola: 8970468 markings, 39173649 edges, 116057 markings/sec, 70 secs
lola: 9569499 markings, 41649903 edges, 119806 markings/sec, 75 secs
lola: 10210946 markings, 44087031 edges, 128289 markings/sec, 80 secs
lola: 10809294 markings, 46637870 edges, 119670 markings/sec, 85 secs
lola: 11348254 markings, 49017454 edges, 107792 markings/sec, 90 secs
lola: 11924670 markings, 51363099 edges, 115283 markings/sec, 95 secs
lola: 12552096 markings, 53854712 edges, 125485 markings/sec, 100 secs
lola: 13144733 markings, 56051310 edges, 118527 markings/sec, 105 secs
lola: 13779401 markings, 58507346 edges, 126934 markings/sec, 110 secs
lola: 14404001 markings, 60965438 edges, 124920 markings/sec, 115 secs
lola: 15054247 markings, 63477730 edges, 130049 markings/sec, 120 secs
lola: 15706327 markings, 66011823 edges, 130416 markings/sec, 125 secs
lola: 16305501 markings, 68418719 edges, 119835 markings/sec, 130 secs
lola: 16932909 markings, 70840041 edges, 125482 markings/sec, 135 secs
lola: 17532997 markings, 73209025 edges, 120018 markings/sec, 140 secs
lola: 18226572 markings, 75938731 edges, 138715 markings/sec, 145 secs
lola: 18869968 markings, 78638241 edges, 128679 markings/sec, 150 secs
lola: 19460075 markings, 81376146 edges, 118021 markings/sec, 155 secs
lola: 20094939 markings, 84031333 edges, 126973 markings/sec, 160 secs
lola: 20743036 markings, 86541298 edges, 129619 markings/sec, 165 secs
lola: 21392645 markings, 89270322 edges, 129922 markings/sec, 170 secs
lola: 21995868 markings, 91721371 edges, 120645 markings/sec, 175 secs
lola: 22566576 markings, 94437129 edges, 114142 markings/sec, 180 secs
lola: 23267040 markings, 97047179 edges, 140093 markings/sec, 185 secs
lola: 23897604 markings, 99683523 edges, 126113 markings/sec, 190 secs
lola: 24559205 markings, 102246866 edges, 132320 markings/sec, 195 secs
lola: 25208349 markings, 104828294 edges, 129829 markings/sec, 200 secs
lola: 25901220 markings, 107453506 edges, 138574 markings/sec, 205 secs
lola: 26583307 markings, 110072855 edges, 136417 markings/sec, 210 secs
lola: 27249106 markings, 112685690 edges, 133160 markings/sec, 215 secs
lola: 27868886 markings, 115360753 edges, 123956 markings/sec, 220 secs
lola: 28523745 markings, 117945074 edges, 130972 markings/sec, 225 secs
lola: 29185335 markings, 120612775 edges, 132318 markings/sec, 230 secs
lola: 29834374 markings, 123205982 edges, 129808 markings/sec, 235 secs
lola: 30501525 markings, 125728141 edges, 133430 markings/sec, 240 secs
lola: 31134779 markings, 128237351 edges, 126651 markings/sec, 245 secs
lola: 31780450 markings, 130803230 edges, 129134 markings/sec, 250 secs
lola: 32436965 markings, 133585301 edges, 131303 markings/sec, 255 secs
lola: 33049119 markings, 136444021 edges, 122431 markings/sec, 260 secs
lola: 33719489 markings, 139171873 edges, 134074 markings/sec, 265 secs
lola: 34379464 markings, 141848373 edges, 131995 markings/sec, 270 secs
lola: 35018899 markings, 144556007 edges, 127887 markings/sec, 275 secs
lola: 35585397 markings, 147244554 edges, 113300 markings/sec, 280 secs
lola: 36236666 markings, 149880003 edges, 130254 markings/sec, 285 secs
lola: 36903814 markings, 152513203 edges, 133430 markings/sec, 290 secs
lola: 37592421 markings, 155081473 edges, 137721 markings/sec, 295 secs
lola: 38230272 markings, 157614908 edges, 127570 markings/sec, 300 secs
lola: 38874885 markings, 160174602 edges, 128923 markings/sec, 305 secs
lola: 39522243 markings, 162765833 edges, 129472 markings/sec, 310 secs
lola: 40171245 markings, 165287435 edges, 129800 markings/sec, 315 secs
lola: 40834881 markings, 167806224 edges, 132727 markings/sec, 320 secs
lola: 41470865 markings, 170371317 edges, 127197 markings/sec, 325 secs
lola: 42110009 markings, 172874257 edges, 127829 markings/sec, 330 secs
lola: 42747729 markings, 175390395 edges, 127544 markings/sec, 335 secs
lola: 43399665 markings, 177915653 edges, 130387 markings/sec, 340 secs
lola: 44094841 markings, 180582841 edges, 139035 markings/sec, 345 secs
lola: 44793918 markings, 183140307 edges, 139815 markings/sec, 350 secs
lola: 45506967 markings, 185593650 edges, 142610 markings/sec, 355 secs
lola: 46132396 markings, 187998048 edges, 125086 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 489 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((2 <= p200))) U X ((p216 <= p63))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((2 <= p200))) U X ((p216 <= p63))))
lola: processed formula: A ((G (X ((2 <= p200))) U X ((p216 <= p63))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 10 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 11 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((1 <= p202))) U X (X ((p92 <= p213)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((1 <= p202)) U X ((p92 <= p213)))))
lola: processed formula: A (X ((F ((1 <= p202)) U X ((p92 <= p213)))))
lola: processed formula length: 45
lola: 1 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 10 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: 46 markings, 47 edges
lola: ========================================
lola: subprocess 12 will run for 733 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((2 <= p259)) U X ((p39 <= p247))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((2 <= p259)) U X ((p39 <= p247))))
lola: processed formula: A ((G ((2 <= p259)) U X ((p39 <= p247))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 10 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 13 will run for 978 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= p82)) U X ((3 <= p126))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((1 <= p82) U (3 <= p126))))
lola: processed formula: A (X (((1 <= p82) U (3 <= p126))))
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 11 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 14 will run for 1467 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p222 <= p174)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p222 <= p174)))
lola: processed formula: A (X ((p222 <= p174)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 11 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 15 will run for 2935 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((1 <= p7)) U (2 <= p184))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((1 <= p7)) U (2 <= p184))))
lola: processed formula: A (X ((G ((1 <= p7)) U (2 <= p184))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 267 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-22a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 10 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: 6 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown no yes no no yes yes no unknown no yes yes no yes no
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22a-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="FlexibleBarrier-PT-22a"
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/FlexibleBarrier-PT-22a.tgz
mv FlexibleBarrier-PT-22a 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 FlexibleBarrier-PT-22a, 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 r250-blw7-152732552300065"
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 ;