fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r214-smll-152732265900680
Last Updated
June 26, 2018

About the Execution of M4M.full for TCPcondis-PT-30

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11742.960 341147.00 302882.00 1660.40 TFFF?FFFFFFFFFFF 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 192K
-rw-r--r-- 1 mcc users 3.9K 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.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.0K 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 9.9K 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.0K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 24K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is TCPcondis-PT-30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265900680
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527500854499


BK_STOP 1527501195646

--------------------
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 TCPcondis-PT-30 as instance name.
Using TCPcondis as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLFireability', '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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 1358287, 'Memory': 15945.24, 'Tool': 'itstools'}, {'Time': 1408541, 'Memory': 15946.76, 'Tool': 'lola'}, {'Time': 1476947, 'Memory': 15953.04, 'Tool': 'lola'}, {'Time': 1650156, 'Memory': 15947.76, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.03699807183607x far from the best tool itstools.
LTLFireability lola TCPcondis-PT-30...

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


checking for too many tokens
===========================================================================================
TCPcondis-PT-30: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLFireability @ TCPcondis-PT-30 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 62/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 32 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48 transition conflict sets
lola: TASK
lola: reading formula from TCPcondis-PT-30-LTLFireability.task
lola: A (FIREABLE(xAOPEN)) : A ((F (F (F (FIREABLE(raf)))) U X (F (FIREABLE(rs))))) : A ((G (G (X (FIREABLE(raf1)))) U X (F (FIREABLE(xrf))))) : A (X (X (FIREABLE(SEND)))) : A ((X ((FIREABLE(xCLOSE2) U FIREABLE(xCLOSE2))) U G (X (F (FIREABLE(xras)))))) : A (((FIREABLE(xrs) U G (FIREABLE(xCLOSE3))) U FIREABLE(xCLOSE3))) : A (F (X ((G (FIREABLE(xrs1)) U G (FIREABLE(xrf1)))))) : A ((FIREABLE(xAOPEN) U F (F (F (FIREABLE(xrs)))))) : A (FIREABLE(xraf2)) : A (((FIREABLE(ras) U FIREABLE(xrs1)) U FIREABLE(xrf1))) : A (G (G (X (F (F (FIREABLE(SEND))))))) : A (FIREABLE(rs)) : A (G (G (FIREABLE(ras)))) : A (G (F ((FIREABLE(CLOSE3) U G (FIREABLE(xrs1)))))) : A (X (F (G (X (G (FIREABLE(ras))))))) : A (G (FIREABLE(rf2)))
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 (FIREABLE(xAOPEN))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(xAOPEN)
lola: processed formula length: 16
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F (F (FIREABLE(raf)))) U X (F (FIREABLE(rs)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (FIREABLE(raf)) U X (F (FIREABLE(rs)))))
lola: processed formula: A ((F (FIREABLE(raf)) U X (F (FIREABLE(rs)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 742 markings, 742 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G (X (FIREABLE(raf1)))) U X (F (FIREABLE(xrf)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G (X (FIREABLE(raf1)))) U X (F (FIREABLE(xrf)))))
lola: processed formula: A ((G (G (X (FIREABLE(raf1)))) U X (F (FIREABLE(xrf)))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 308 markings, 308 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (FIREABLE(SEND))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (FIREABLE(SEND))))
lola: processed formula: A (X (X (FIREABLE(SEND))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 308 markings, 308 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((FIREABLE(xCLOSE2) U FIREABLE(xCLOSE2))) U G (X (F (FIREABLE(xras))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((FIREABLE(xCLOSE2) U FIREABLE(xCLOSE2))) U G (X (F (FIREABLE(xras))))))
lola: processed formula: A ((X ((FIREABLE(xCLOSE2) U FIREABLE(xCLOSE2))) U G (X (F (FIREABLE(xras))))))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1596652 markings, 5070498 edges, 319330 markings/sec, 0 secs
lola: 3026272 markings, 10142413 edges, 285924 markings/sec, 5 secs
lola: 4556000 markings, 15535045 edges, 305946 markings/sec, 10 secs
lola: 5947208 markings, 20655550 edges, 278242 markings/sec, 15 secs
lola: 7295867 markings, 25741879 edges, 269732 markings/sec, 20 secs
lola: 8569024 markings, 30538582 edges, 254631 markings/sec, 25 secs
lola: 9901335 markings, 35547720 edges, 266462 markings/sec, 30 secs
lola: 11219855 markings, 40527472 edges, 263704 markings/sec, 35 secs
lola: 12509026 markings, 45377284 edges, 257834 markings/sec, 40 secs
lola: 13835946 markings, 50149411 edges, 265384 markings/sec, 45 secs
lola: 15043336 markings, 54861236 edges, 241478 markings/sec, 50 secs
lola: 16133340 markings, 59185381 edges, 218001 markings/sec, 55 secs
lola: 17241433 markings, 63556378 edges, 221619 markings/sec, 60 secs
lola: 18404969 markings, 68124567 edges, 232707 markings/sec, 65 secs
lola: 19577840 markings, 72768357 edges, 234574 markings/sec, 70 secs
lola: 20733916 markings, 77328519 edges, 231215 markings/sec, 75 secs
lola: 21907393 markings, 81940941 edges, 234695 markings/sec, 80 secs
lola: 23050723 markings, 86465705 edges, 228666 markings/sec, 85 secs
lola: 24191199 markings, 90962202 edges, 228095 markings/sec, 90 secs
lola: 25358492 markings, 95544711 edges, 233459 markings/sec, 95 secs
lola: 26490148 markings, 100032092 edges, 226331 markings/sec, 100 secs
lola: 27616235 markings, 104463146 edges, 225217 markings/sec, 105 secs
lola: 28775597 markings, 109024119 edges, 231872 markings/sec, 110 secs
lola: 29918551 markings, 113553670 edges, 228591 markings/sec, 115 secs
lola: 30957842 markings, 117635596 edges, 207858 markings/sec, 120 secs
lola: 32044925 markings, 121946181 edges, 217417 markings/sec, 125 secs
lola: 33210449 markings, 126381179 edges, 233105 markings/sec, 130 secs
lola: 34345103 markings, 130515851 edges, 226931 markings/sec, 135 secs
lola: 35431476 markings, 134724691 edges, 217275 markings/sec, 140 secs
lola: 36389513 markings, 138665224 edges, 191607 markings/sec, 145 secs
lola: 37420222 markings, 142846628 edges, 206142 markings/sec, 150 secs
lola: 38335538 markings, 146622497 edges, 183063 markings/sec, 155 secs
lola: 39324341 markings, 150633685 edges, 197761 markings/sec, 160 secs
lola: 40220653 markings, 154333935 edges, 179262 markings/sec, 165 secs
lola: 41197775 markings, 158296271 edges, 195424 markings/sec, 170 secs
lola: 42105838 markings, 162030978 edges, 181613 markings/sec, 175 secs
lola: 43075351 markings, 165980464 edges, 193903 markings/sec, 180 secs
lola: 43985068 markings, 169704070 edges, 181943 markings/sec, 185 secs
lola: 44938166 markings, 173609272 edges, 190620 markings/sec, 190 secs
lola: 45862157 markings, 177378579 edges, 184798 markings/sec, 195 secs
lola: 46814871 markings, 181270248 edges, 190543 markings/sec, 200 secs
lola: 47737053 markings, 185048331 edges, 184436 markings/sec, 205 secs
lola: 48699968 markings, 188983308 edges, 192583 markings/sec, 210 secs
lola: 49626763 markings, 192777383 edges, 185359 markings/sec, 215 secs
lola: 50586488 markings, 196696088 edges, 191945 markings/sec, 220 secs
lola: 51514694 markings, 200497662 edges, 185641 markings/sec, 225 secs
lola: 52478445 markings, 204426588 edges, 192750 markings/sec, 230 secs
lola: 53406755 markings, 208244716 edges, 185662 markings/sec, 235 secs
lola: 54377322 markings, 212191143 edges, 194113 markings/sec, 240 secs
lola: 55392566 markings, 216351689 edges, 203049 markings/sec, 245 secs
lola: 56450834 markings, 220674433 edges, 211654 markings/sec, 250 secs
lola: 57450380 markings, 224786723 edges, 199909 markings/sec, 255 secs
lola: 58530902 markings, 229174718 edges, 216104 markings/sec, 260 secs
lola: 59511825 markings, 233239506 edges, 196185 markings/sec, 265 secs
lola: 60585200 markings, 237595569 edges, 214675 markings/sec, 270 secs
lola: 61584251 markings, 241738935 edges, 199810 markings/sec, 275 secs
lola: 62648805 markings, 246072186 edges, 212911 markings/sec, 280 secs
lola: 63689751 markings, 250310482 edges, 208189 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(xrs) U G (FIREABLE(xCLOSE3))) U FIREABLE(xCLOSE3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((FIREABLE(xrs) U G (FIREABLE(xCLOSE3))) U FIREABLE(xCLOSE3)))
lola: processed formula: A (((FIREABLE(xrs) U G (FIREABLE(xCLOSE3))) U FIREABLE(xCLOSE3)))
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 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: 625 markings, 625 edges
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((G (FIREABLE(xrs1)) U G (FIREABLE(xrf1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((G (FIREABLE(xrs1)) U G (FIREABLE(xrf1))))))
lola: processed formula: A (F (X ((G (FIREABLE(xrs1)) U G (FIREABLE(xrf1))))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 308 markings, 308 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(xAOPEN) U F (F (F (FIREABLE(xrs))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(xAOPEN) U F (FIREABLE(xrs))))
lola: processed formula: A ((FIREABLE(xAOPEN) U F (FIREABLE(xrs))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 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: 518 markings, 518 edges
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(xraf2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(xraf2)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: processed formula with 0 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 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(ras) U FIREABLE(xrs1)) U FIREABLE(xrf1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((FIREABLE(ras) U FIREABLE(xrs1)) U FIREABLE(xrf1)))
lola: processed formula: A (((FIREABLE(ras) U FIREABLE(xrs1)) U FIREABLE(xrf1)))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 308 markings, 308 edges
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (F (F (FIREABLE(SEND)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (F (FIREABLE(SEND))))))
lola: processed formula: A (G (G (X (F (FIREABLE(SEND))))))
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 308 markings, 308 edges
lola: ========================================
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(rs))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(rs)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: processed formula with 0 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 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (FIREABLE(ras))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (FIREABLE(ras))))
lola: processed formula: A (G (G (FIREABLE(ras))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 106 markings, 106 edges
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(CLOSE3) U G (FIREABLE(xrs1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(CLOSE3) U G (FIREABLE(xrs1))))))
lola: processed formula: A (G (F ((FIREABLE(CLOSE3) U G (FIREABLE(xrs1))))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 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: 350 markings, 350 edges
lola: ========================================
lola: subprocess 14 will run for 1622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (X (G (FIREABLE(ras)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G (X (G (FIREABLE(ras)))))))
lola: processed formula: A (X (F (G (X (G (FIREABLE(ras)))))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 309 markings, 310 edges
lola: ========================================
lola: subprocess 15 will run for 3245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(rf2)))
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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no unknown no no no no no no no no no no no
FORMULA TCPcondis-PT-30-LTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLFireability-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="TCPcondis-PT-30"
export BK_EXAMINATION="LTLFireability"
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/TCPcondis-PT-30.tgz
mv TCPcondis-PT-30 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 TCPcondis-PT-30, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r214-smll-152732265900680"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;