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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.050 402150.00 272684.00 2903.50 FTTFFFFF?FTFFFFF 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-structural
Input is TCPcondis-PT-30, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732267100679
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527514451910


BK_STOP 1527514854060

--------------------
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 TCPcondis-PT-30 as instance name.
Using TCPcondis 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': 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': 273, 'Memory': 104.39, 'Tool': 'lola'}, {'Time': 461, 'Memory': 105.59, 'Tool': 'lola'}, {'Time': 8743, 'Memory': 371.39, 'Tool': 'itstools'}, {'Time': 9767, 'Memory': 374.21, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality 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 LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ TCPcondis-PT-30 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 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-LTLCardinality.task
lola: A (G (X (G (G ((1 <= xTIMEWAIT)))))) : A ((F (X ((2 <= SYN))) U (xFIN <= xLASTACK))) : A (((LISTEN <= xLISTEN) U ((3 <= FIN) U (SYN <= FIN)))) : A (X (F ((2 <= xLISTEN)))) : A (X (G (X (X ((SYN <= SYNACK)))))) : A ((1 <= SYNACK)) : A (X (F (X (X ((2 <= SYN)))))) : A (X (F (G ((1 <= xSYNACK))))) : A (G ((X ((FINWAIT2 <= LASTACK)) U F ((xSYN <= xCLOSED))))) : A ((F (G ((2 <= xCLOSEWAIT))) U F ((1 <= FINWAIT2)))) : A ((xCLOSEWAIT <= xSYNRCVD)) : A ((1 <= xSYNACK)) : A (X (X ((xSYN <= FINWAIT1)))) : A ((3 <= FINACK)) : A ((2 <= xLASTACK)) : A (X (F (((3 <= xFINWAIT2) U (xLISTEN <= xFINWAIT2)))))
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 (G (X (G (G ((1 <= xTIMEWAIT))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (G ((1 <= xTIMEWAIT))))))
lola: processed formula: A (G (X (G (G ((1 <= xTIMEWAIT))))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLCardinality.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: 308 markings, 308 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((2 <= SYN))) U (xFIN <= xLASTACK)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((2 <= SYN))) U (xFIN <= xLASTACK)))
lola: processed formula: A ((F (X ((2 <= SYN))) U (xFIN <= xLASTACK)))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLCardinality.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: 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((LISTEN <= xLISTEN) U ((3 <= FIN) U (SYN <= FIN))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((LISTEN <= xLISTEN) U ((3 <= FIN) U (SYN <= FIN))))
lola: processed formula: A (((LISTEN <= xLISTEN) U ((3 <= FIN) U (SYN <= FIN))))
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-LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= xLISTEN))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((2 <= xLISTEN))))
lola: processed formula: A (X (F ((2 <= xLISTEN))))
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-LTLCardinality.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: 337 markings, 337 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (X ((SYN <= SYNACK))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (X ((SYN <= SYNACK))))))
lola: processed formula: A (X (G (X (X ((SYN <= SYNACK))))))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLCardinality.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: 310 markings, 310 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= SYNACK))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= SYNACK)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-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 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X (X ((2 <= SYN))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X (X ((2 <= SYN))))))
lola: processed formula: A (X (F (X (X ((2 <= SYN))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLCardinality.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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G ((1 <= xSYNACK)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((1 <= xSYNACK)))))
lola: processed formula: A (X (F (G ((1 <= xSYNACK)))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLCardinality.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: 309 markings, 310 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((FINWAIT2 <= LASTACK)) U F ((xSYN <= xCLOSED)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((X ((FINWAIT2 <= LASTACK)) U F ((xSYN <= xCLOSED)))))
lola: processed formula: A (G ((X ((FINWAIT2 <= LASTACK)) U F ((xSYN <= xCLOSED)))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLCardinality.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: 2485256 markings, 5697483 edges, 497051 markings/sec, 0 secs
lola: 4720887 markings, 11174686 edges, 447126 markings/sec, 5 secs
lola: 6679326 markings, 16387237 edges, 391688 markings/sec, 10 secs
lola: 8511407 markings, 21348156 edges, 366416 markings/sec, 15 secs
lola: 10334236 markings, 26283161 edges, 364566 markings/sec, 20 secs
lola: 12244502 markings, 31405580 edges, 382053 markings/sec, 25 secs
lola: 14039896 markings, 36212235 edges, 359079 markings/sec, 30 secs
lola: 15779652 markings, 40907962 edges, 347951 markings/sec, 35 secs
lola: 17438402 markings, 45535804 edges, 331750 markings/sec, 40 secs
lola: 19103985 markings, 50320788 edges, 333117 markings/sec, 45 secs
lola: 20651515 markings, 54842492 edges, 309506 markings/sec, 50 secs
lola: 22162414 markings, 59283061 edges, 302180 markings/sec, 55 secs
lola: 23629927 markings, 63640024 edges, 293503 markings/sec, 60 secs
lola: 25275371 markings, 68073910 edges, 329089 markings/sec, 65 secs
lola: 26861535 markings, 72149171 edges, 317233 markings/sec, 70 secs
lola: 28473408 markings, 76232760 edges, 322375 markings/sec, 75 secs
lola: 29952856 markings, 80041562 edges, 295890 markings/sec, 80 secs
lola: 31564636 markings, 84188743 edges, 322356 markings/sec, 85 secs
lola: 33214063 markings, 88419368 edges, 329885 markings/sec, 90 secs
lola: 34760190 markings, 92572107 edges, 309225 markings/sec, 95 secs
lola: 36102876 markings, 96334384 edges, 268537 markings/sec, 100 secs
lola: 37389065 markings, 99969031 edges, 257238 markings/sec, 105 secs
lola: 38994475 markings, 104407908 edges, 321082 markings/sec, 110 secs
lola: 40473579 markings, 108590621 edges, 295821 markings/sec, 115 secs
lola: 42112980 markings, 113303194 edges, 327880 markings/sec, 120 secs
lola: 43695734 markings, 117771554 edges, 316551 markings/sec, 125 secs
lola: 45262021 markings, 122432698 edges, 313257 markings/sec, 130 secs
lola: 46711041 markings, 126858242 edges, 289804 markings/sec, 135 secs
lola: 48376967 markings, 131593026 edges, 333185 markings/sec, 140 secs
lola: 50304295 markings, 136523514 edges, 385466 markings/sec, 145 secs
lola: 52244120 markings, 141529179 edges, 387965 markings/sec, 150 secs
lola: 54079681 markings, 146247075 edges, 367112 markings/sec, 155 secs
lola: 55872240 markings, 151196080 edges, 358512 markings/sec, 160 secs
lola: 57521383 markings, 155982878 edges, 329829 markings/sec, 165 secs
lola: 59109371 markings, 160646234 edges, 317598 markings/sec, 170 secs
lola: 60687343 markings, 165288605 edges, 315594 markings/sec, 175 secs
lola: 62288462 markings, 170060117 edges, 320224 markings/sec, 180 secs
lola: 63872324 markings, 174653785 edges, 316772 markings/sec, 185 secs
lola: 65400888 markings, 179117188 edges, 305713 markings/sec, 190 secs
lola: 66885738 markings, 183486630 edges, 296970 markings/sec, 195 secs
lola: 68453923 markings, 188158962 edges, 313637 markings/sec, 200 secs
lola: 70115915 markings, 192968963 edges, 332398 markings/sec, 205 secs
lola: 71681556 markings, 197542643 edges, 313128 markings/sec, 210 secs
lola: 73218603 markings, 202065407 edges, 307409 markings/sec, 215 secs
lola: 74718008 markings, 206485889 edges, 299881 markings/sec, 220 secs
lola: 76116665 markings, 210399848 edges, 279731 markings/sec, 225 secs
lola: 77460784 markings, 214197526 edges, 268824 markings/sec, 230 secs
lola: 78891812 markings, 218161518 edges, 286206 markings/sec, 235 secs
lola: 80173562 markings, 221796773 edges, 256350 markings/sec, 240 secs
lola: 81610791 markings, 225773035 edges, 287446 markings/sec, 245 secs
lola: 82917344 markings, 229460963 edges, 261311 markings/sec, 250 secs
lola: 84240847 markings, 233121415 edges, 264701 markings/sec, 255 secs
lola: 84246510 markings, 233136925 edges, 1133 markings/sec, 260 secs
lola: 84251066 markings, 233149583 edges, 911 markings/sec, 265 secs
lola: 84253267 markings, 233155597 edges, 440 markings/sec, 270 secs
lola: 84254458 markings, 233158902 edges, 238 markings/sec, 275 secs
lola: 84257648 markings, 233168094 edges, 638 markings/sec, 280 secs
lola: 84257664 markings, 233168143 edges, 3 markings/sec, 285 secs
lola: 84259273 markings, 233172303 edges, 322 markings/sec, 290 secs
lola: 84259286 markings, 233172338 edges, 3 markings/sec, 295 secs
lola: 84259301 markings, 233172378 edges, 3 markings/sec, 300 secs
lola: 84261454 markings, 233178533 edges, 431 markings/sec, 305 secs
lola: 84261458 markings, 233178545 edges, 1 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 454 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((2 <= xCLOSEWAIT))) U F ((1 <= FINWAIT2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (G ((2 <= xCLOSEWAIT))) U F ((1 <= FINWAIT2))))
lola: processed formula: A ((F (G ((2 <= xCLOSEWAIT))) U F ((1 <= FINWAIT2))))
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-LTLCardinality.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: 373 markings, 373 edges
lola: ========================================
lola: subprocess 10 will run for 530 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((xCLOSEWAIT <= xSYNRCVD))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (xCLOSEWAIT <= xSYNRCVD)
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-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 11 will run for 636 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= xSYNACK))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= xSYNACK)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 795 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((xSYN <= FINWAIT1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((xSYN <= FINWAIT1))))
lola: processed formula: A (X (X ((xSYN <= FINWAIT1))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-LTLCardinality.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: 309 markings, 309 edges
lola: ========================================
lola: subprocess 13 will run for 1061 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= FINACK))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= FINACK)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-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 14 will run for 1591 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= xLASTACK))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= xLASTACK)
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-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 15 will run for 3183 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((3 <= xFINWAIT2) U (xLISTEN <= xFINWAIT2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (((3 <= xFINWAIT2) U (xLISTEN <= xFINWAIT2)))))
lola: processed formula: A (X (F (((3 <= xFINWAIT2) U (xLISTEN <= xFINWAIT2)))))
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-LTLCardinality.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: 454 markings, 454 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no no no no unknown no yes no no no no no
FORMULA TCPcondis-PT-30-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-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="TCPcondis-PT-30"
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/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-structural"
echo " Input is TCPcondis-PT-30, 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 r215-smll-152732267100679"
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 ;