About the Execution of M4M.struct for FlexibleBarrier-PT-06b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8900.510 | 437278.00 | 405320.00 | 278.30 | FTTTFFT?FFFTFFTF | normal |
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 304K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.5K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 141K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is FlexibleBarrier-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-blw7-152732552900035
=====================================================================
--------------------
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-06b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1528020349978
BK_STOP 1528020787256
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using FlexibleBarrier-PT-06b 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': 18449, 'Memory': 880.4, 'Tool': 'itstools'}, {'Time': 388530, 'Memory': 7466.36, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 21.05967803132961x far from the best tool itstools.
LTLCardinality lola FlexibleBarrier-PT-06b...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
FlexibleBarrier-PT-06b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-06b: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ FlexibleBarrier-PT-06b @ 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: 1163/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 542 places, 621 transitions, 534 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 635 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-06b-LTLCardinality.task
lola: A (X ((X ((p314 <= p508)) U G ((3 <= p400))))) : A (X ((p115 <= p60))) : A ((p244 <= p239)) : A (X ((X ((p526 <= p323)) U (p385 <= p156)))) : A (X (F (G (F ((p196 <= p383)))))) : A ((3 <= p111)) : A ((p1 <= p331)) : A (G (F (F (G ((p450 <= p456)))))) : A (F (G (X (X ((1 <= p87)))))) : A ((2 <= p41)) : A (X (F (G ((p401 <= p473))))) : A (F ((p95 <= p128))) : A (G ((p174 <= p129))) : A (G ((p15 <= p380))) : A ((p204 <= p253)) : A (X ((3 <= p213)))
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 ((X ((p314 <= p508)) U G ((3 <= p400)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((p314 <= p508)) U G ((3 <= p400)))))
lola: processed formula: A (X ((X ((p314 <= p508)) U G ((3 <= p400)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 28 markings, 31 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p115 <= p60)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p115 <= p60)))
lola: processed formula: A (X ((p115 <= p60)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 8 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p244 <= p239))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p244 <= p239)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((p526 <= p323)) U (p385 <= p156))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((p526 <= p323)) U (p385 <= p156))))
lola: processed formula: A (X ((X ((p526 <= p323)) U (p385 <= p156))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (F ((p196 <= p383))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((p196 <= p383)))))
lola: processed formula: A (X (G (F ((p196 <= p383)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 8 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: 244 markings, 306 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p111))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p111)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p1 <= p331))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p331)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (G ((p450 <= p456))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((p450 <= p456))))
lola: processed formula: A (F (G ((p450 <= p456))))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 818929 markings, 1376412 edges, 163786 markings/sec, 0 secs
lola: 1715945 markings, 2890122 edges, 179403 markings/sec, 5 secs
lola: 2544889 markings, 4316932 edges, 165789 markings/sec, 10 secs
lola: 3408033 markings, 5786011 edges, 172629 markings/sec, 15 secs
lola: 4280034 markings, 7265905 edges, 174400 markings/sec, 20 secs
lola: 5141633 markings, 8730914 edges, 172320 markings/sec, 25 secs
lola: 5966907 markings, 10116531 edges, 165055 markings/sec, 30 secs
lola: 6769553 markings, 11472160 edges, 160529 markings/sec, 35 secs
lola: 7514077 markings, 12749537 edges, 148905 markings/sec, 40 secs
lola: 8256649 markings, 14025956 edges, 148514 markings/sec, 45 secs
lola: 9107489 markings, 15458329 edges, 170168 markings/sec, 50 secs
lola: 9960738 markings, 16887848 edges, 170650 markings/sec, 55 secs
lola: 10758461 markings, 18234728 edges, 159545 markings/sec, 60 secs
lola: 11541627 markings, 19556399 edges, 156633 markings/sec, 65 secs
lola: 12342273 markings, 20946952 edges, 160129 markings/sec, 70 secs
lola: 13137165 markings, 22321355 edges, 158978 markings/sec, 75 secs
lola: 13930271 markings, 23698702 edges, 158621 markings/sec, 80 secs
lola: 14676547 markings, 24960611 edges, 149255 markings/sec, 85 secs
lola: 15428245 markings, 26254171 edges, 150340 markings/sec, 90 secs
lola: 16180691 markings, 27555773 edges, 150489 markings/sec, 95 secs
lola: 16943800 markings, 28888197 edges, 152622 markings/sec, 100 secs
lola: 17713486 markings, 30215395 edges, 153937 markings/sec, 105 secs
lola: 18486524 markings, 31551595 edges, 154608 markings/sec, 110 secs
lola: 19247763 markings, 32864337 edges, 152248 markings/sec, 115 secs
lola: 19985167 markings, 34115912 edges, 147481 markings/sec, 120 secs
lola: 20715958 markings, 35354412 edges, 146158 markings/sec, 125 secs
lola: 21448175 markings, 36622965 edges, 146443 markings/sec, 130 secs
lola: 22168422 markings, 37849357 edges, 144049 markings/sec, 135 secs
lola: 22888007 markings, 39089818 edges, 143917 markings/sec, 140 secs
lola: 23607247 markings, 40329945 edges, 143848 markings/sec, 145 secs
lola: 24333587 markings, 41600626 edges, 145268 markings/sec, 150 secs
lola: 25017306 markings, 42791772 edges, 136744 markings/sec, 155 secs
lola: 25723784 markings, 44158324 edges, 141296 markings/sec, 160 secs
lola: 26523074 markings, 45565400 edges, 159858 markings/sec, 165 secs
lola: 27318776 markings, 46933327 edges, 159140 markings/sec, 170 secs
lola: 28057915 markings, 48203280 edges, 147828 markings/sec, 175 secs
lola: 28794925 markings, 49469844 edges, 147402 markings/sec, 180 secs
lola: 29584035 markings, 50836302 edges, 157822 markings/sec, 185 secs
lola: 30355369 markings, 52172370 edges, 154267 markings/sec, 190 secs
lola: 31119327 markings, 53500914 edges, 152792 markings/sec, 195 secs
lola: 31858719 markings, 54811580 edges, 147878 markings/sec, 200 secs
lola: 32612813 markings, 56142978 edges, 150819 markings/sec, 205 secs
lola: 33367749 markings, 57476703 edges, 150987 markings/sec, 210 secs
lola: 34097718 markings, 58751737 edges, 145994 markings/sec, 215 secs
lola: 34837495 markings, 60054612 edges, 147955 markings/sec, 220 secs
lola: 35570278 markings, 61357213 edges, 146557 markings/sec, 225 secs
lola: 36300438 markings, 62647214 edges, 146032 markings/sec, 230 secs
lola: 37020416 markings, 63895513 edges, 143996 markings/sec, 235 secs
lola: 37717823 markings, 65100009 edges, 139481 markings/sec, 240 secs
lola: 38395576 markings, 66275886 edges, 135551 markings/sec, 245 secs
lola: 39048487 markings, 67417838 edges, 130582 markings/sec, 250 secs
lola: 39751431 markings, 68641381 edges, 140589 markings/sec, 255 secs
lola: 40462962 markings, 69897636 edges, 142306 markings/sec, 260 secs
lola: 41190085 markings, 71175528 edges, 145425 markings/sec, 265 secs
lola: 41909679 markings, 72453348 edges, 143919 markings/sec, 270 secs
lola: 42596611 markings, 73691371 edges, 137386 markings/sec, 275 secs
lola: 43166036 markings, 74857222 edges, 113885 markings/sec, 280 secs
lola: 43948067 markings, 76213351 edges, 156406 markings/sec, 285 secs
lola: 44716633 markings, 77547159 edges, 153713 markings/sec, 290 secs
lola: 45486170 markings, 78890597 edges, 153907 markings/sec, 295 secs
lola: 46215702 markings, 80178506 edges, 145906 markings/sec, 300 secs
lola: 46946878 markings, 81471593 edges, 146235 markings/sec, 305 secs
lola: 47704716 markings, 82809089 edges, 151568 markings/sec, 310 secs
lola: 48424117 markings, 84069020 edges, 143880 markings/sec, 315 secs
lola: 49136683 markings, 85323666 edges, 142513 markings/sec, 320 secs
lola: 49810475 markings, 86522912 edges, 134758 markings/sec, 325 secs
lola: 50531006 markings, 87795194 edges, 144106 markings/sec, 330 secs
lola: 51249380 markings, 89043970 edges, 143675 markings/sec, 335 secs
lola: 51947137 markings, 90246304 edges, 139551 markings/sec, 340 secs
lola: 52634185 markings, 91438213 edges, 137410 markings/sec, 345 secs
lola: 53318997 markings, 92634877 edges, 136962 markings/sec, 350 secs
lola: 54022298 markings, 93859940 edges, 140660 markings/sec, 355 secs
lola: 54687894 markings, 95034547 edges, 133119 markings/sec, 360 secs
lola: 55406065 markings, 96292675 edges, 143634 markings/sec, 365 secs
lola: 56119057 markings, 97566845 edges, 142598 markings/sec, 370 secs
lola: 56800755 markings, 98794578 edges, 136340 markings/sec, 375 secs
lola: 57359987 markings, 99938025 edges, 111846 markings/sec, 380 secs
lola: 58125073 markings, 101263837 edges, 153017 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (X ((1 <= p87))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (X ((1 <= p87))))))
lola: processed formula: A (F (G (X (X ((1 <= p87))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 20 markings, 21 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p41))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p41)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-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 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G ((p401 <= p473)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((p401 <= p473)))))
lola: processed formula: A (X (F (G ((p401 <= p473)))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 8 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: 13988 markings, 39714 edges
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p95 <= p128)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p95 <= p128)))
lola: processed formula: A (F ((p95 <= p128)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 9 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 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p174 <= p129)))
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 68 bytes per marking, with 10 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: 22 markings, 21 edges
lola: ========================================
lola: subprocess 13 will run for 1048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p15 <= p380)))
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 68 bytes per marking, with 10 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: 27 markings, 26 edges
lola: ========================================
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p204 <= p253))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p204 <= p253)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-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 15 will run for 3146 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p213)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= p213)))
lola: processed formula: A (X ((3 <= p213)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 8 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: 14 markings, 14 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no no yes unknown no no no yes no no yes no
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-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 stderr -----
----- Finished stdout -----
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-06b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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-06b.tgz
mv FlexibleBarrier-PT-06b 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-structural"
echo " Input is FlexibleBarrier-PT-06b, 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 r251-blw7-152732552900035"
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 '
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 ;