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 184K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-25, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-smll-152708748300206
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527169416264


BK_STOP 1527169973124

--------------------
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-25 as instance name.
Using TCPcondis as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 383, 'Memory': 106.08, 'Tool': 'lola'}, {'Time': 574, 'Memory': 105.8, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola TCPcondis-PT-25...

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


checking for too many tokens
===========================================================================================
TCPcondis-PT-25: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ TCPcondis-PT-25 @ 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: 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-25-CTLCardinality.task
lola: A (X (A (F (((xCLOSED <= ESTAB) AND (ESTAB <= LISTEN)))))) : A ((E (F ((2 <= CLOSED))) U A (G ((xFIN <= xSYNACK))))) : ((xFIN <= 0) AND NOT(E (G ((TIMEWAIT <= ESTAB))))) : NOT(NOT(NOT(E (G ((FINWAIT1 <= xSYNSENT)))))) : A (F ((A (X ((CLOSED <= xCLOSEWAIT))) OR ((xCLOSED <= TIMEWAIT) OR (1 <= xSYNACK) OR (3 <= xFIN))))) : A (F ((A (X ((2 <= ESTAB))) AND A (G ((FINWAIT1 <= xSYNRCVD)))))) : (NOT(A (F ((3 <= LASTACK)))) AND ((A (F ((xCLOSED <= xCLOSEWAIT))) OR (((xESTAB <= SYNACK) AND (LISTEN <= xFINWAIT2)) OR (1 <= CLOSED))) OR ((xFINWAIT2 <= xTIMEWAIT) OR (1 <= CLOSEWAIT)))) : (A (F (A (G ((FINWAIT2 <= FINWAIT1))))) OR A (F (A (G ((2 <= SYNACK)))))) : NOT((E (G ((xCLOSEWAIT <= 1))) OR (ESTAB + 1 <= xCLOSING))) : E (F (A (G (((1 <= xSYNSENT) AND (FINACK <= xTIMEWAIT)))))) : ((((3 <= xSYNSENT) AND (FIN <= 0)) OR ((xFINWAIT1 <= xSYNACK) AND (FINACK <= SYNRCVD))) AND A (F (E (X ((1 <= xSYNACK)))))) : NOT(E (F (((CLOSED <= xFINWAIT2) AND (xSYN <= xLISTEN) AND (1 <= xFINWAIT1))))) : A (F ((((CLOSING <= CLOSED) AND (2 <= xSYNACK) AND ((2 <= LISTEN) OR (2 <= SYN))) AND E (X ((1 <= xSYNSENT)))))) : (A (F (A (F ((3 <= FINWAIT1))))) OR A (G (((1 <= SYNRCVD) OR ((1 <= LISTEN) AND (1 <= SYNACK)))))) : ((1 <= FINACK) OR A (F (E (X ((3 <= xCLOSEWAIT)))))) : (E (F (A (X ((1 <= xCLOSED))))) AND NOT(E (G (((xFIN <= CLOSING) AND (xCLOSEWAIT <= xCLOSED))))))
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 (A (F (((xCLOSED <= ESTAB) AND (ESTAB <= LISTEN))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((xCLOSED <= ESTAB) AND (ESTAB <= LISTEN))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 377 markings, 377 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= CLOSED))) U A (G ((xFIN <= xSYNACK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (2 <= CLOSED)) U NOT(E(TRUE U (xSYNACK + 1 <= xFIN))))
lola: processed formula length: 65
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 725 markings, 1943 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((xFIN <= 0) AND NOT(E (G ((TIMEWAIT <= ESTAB)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (xFIN <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (xFIN <= 0)
lola: processed formula length: 11
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.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 (F ((ESTAB + 1 <= TIMEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((ESTAB + 1 <= TIMEWAIT)))
lola: processed formula: A (F ((ESTAB + 1 <= TIMEWAIT)))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.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: 255 markings, 261 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(NOT(E (G ((FINWAIT1 <= xSYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((xSYNSENT + 1 <= FINWAIT1)))
lola: processed formula: A (F ((xSYNSENT + 1 <= FINWAIT1)))
lola: processed formula length: 34
lola: 9 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.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: 235 markings, 235 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((CLOSED <= xCLOSEWAIT))) OR ((xCLOSED <= TIMEWAIT) OR (1 <= xSYNACK) OR (3 <= xFIN)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((CLOSED <= xCLOSEWAIT)) OR ((xCLOSED <= TIMEWAIT) OR (1 <= xSYNACK) OR (3 <= xFIN))))
lola: processed formula length: 100
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1574550 markings, 5313698 edges, 3689348869717491712 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1773565 markings, 6011930 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((2 <= ESTAB))) AND A (G ((FINWAIT1 <= xSYNRCVD))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((2 <= ESTAB)) AND NOT(E(TRUE U (xSYNRCVD + 1 <= FINWAIT1)))))
lola: processed formula length: 74
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 258 markings, 258 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F ((3 <= LASTACK)))) AND ((A (F ((xCLOSED <= xCLOSEWAIT))) OR (((xESTAB <= SYNACK) AND (LISTEN <= xFINWAIT2)) OR (1 <= CLOSED))) OR ((xFINWAIT2 <= xTIMEWAIT) OR (1 <= CLOSEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((LASTACK <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= LASTACK)))
lola: processed formula length: 29
lola: 6 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 258 markings, 258 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((xCLOSED <= xCLOSEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((xCLOSED <= xCLOSEWAIT)))
lola: processed formula: A (F ((xCLOSED <= xCLOSEWAIT)))
lola: processed formula length: 31
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.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: 374 markings, 374 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((xESTAB <= SYNACK) AND (LISTEN <= xFINWAIT2)) OR (1 <= CLOSED)) OR ((xFINWAIT2 <= xTIMEWAIT) OR (1 <= CLOSEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((xESTAB <= SYNACK) AND (LISTEN <= xFINWAIT2)) OR (1 <= CLOSED)) OR ((xFINWAIT2 <= xTIMEWAIT) OR (1 <= CLOSEWAIT)))
lola: processed formula length: 119
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
lola: processed formula with 5 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((FINWAIT2 <= FINWAIT1))))) OR A (F (A (G ((2 <= SYNACK))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((FINWAIT2 <= FINWAIT1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((FINWAIT2 <= FINWAIT1)))))
lola: processed formula: A (F (A (G ((FINWAIT2 <= FINWAIT1)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.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: 236 markings, 237 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((2 <= SYNACK)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((2 <= SYNACK)))))
lola: processed formula: A (F (A (G ((2 <= SYNACK)))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.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: 95 markings, 96 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((xCLOSEWAIT <= 1))) OR (ESTAB + 1 <= xCLOSING)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= xCLOSEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= xCLOSEWAIT)))
lola: processed formula: A (F ((2 <= xCLOSEWAIT)))
lola: processed formula length: 25
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.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: 90 markings, 90 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= xSYNSENT) AND (FINACK <= xTIMEWAIT))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((xSYNSENT <= 0) OR (xTIMEWAIT + 1 <= FINACK)))))
lola: processed formula length: 72
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1059333 markings, 4600809 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1951372 markings, 8691953 edges, 178408 markings/sec, 5 secs
lola: 2781290 markings, 12549741 edges, 165984 markings/sec, 10 secs
lola: 3573268 markings, 16270819 edges, 158396 markings/sec, 15 secs
lola: 4339738 markings, 19912589 edges, 153294 markings/sec, 20 secs
lola: 5082201 markings, 23465481 edges, 148493 markings/sec, 25 secs
lola: 5810931 markings, 26955960 edges, 145746 markings/sec, 30 secs
lola: 6524138 markings, 30398720 edges, 142641 markings/sec, 35 secs
lola: 7229820 markings, 33813678 edges, 141136 markings/sec, 40 secs
lola: 7918416 markings, 37156298 edges, 137719 markings/sec, 45 secs
lola: 8602454 markings, 40484007 edges, 136808 markings/sec, 50 secs
lola: 9276863 markings, 43766362 edges, 134882 markings/sec, 55 secs
lola: 9941306 markings, 47025858 edges, 132889 markings/sec, 60 secs
lola: 10599143 markings, 50265480 edges, 131567 markings/sec, 65 secs
lola: 11262725 markings, 53498298 edges, 132716 markings/sec, 70 secs
lola: 11906107 markings, 56682997 edges, 128676 markings/sec, 75 secs
lola: 12546491 markings, 59850146 edges, 128077 markings/sec, 80 secs
lola: 13182531 markings, 62999838 edges, 127208 markings/sec, 85 secs
lola: 13810938 markings, 66120001 edges, 125681 markings/sec, 90 secs
lola: 14441540 markings, 69234362 edges, 126120 markings/sec, 95 secs
lola: 15064950 markings, 72334932 edges, 124682 markings/sec, 100 secs
lola: 15686488 markings, 75426515 edges, 124308 markings/sec, 105 secs
lola: 16308711 markings, 78516152 edges, 124445 markings/sec, 110 secs
lola: 16924750 markings, 81566691 edges, 123208 markings/sec, 115 secs
lola: 17526889 markings, 84583893 edges, 120428 markings/sec, 120 secs
lola: 18130890 markings, 87609898 edges, 120800 markings/sec, 125 secs
lola: 18736141 markings, 90624897 edges, 121050 markings/sec, 130 secs
lola: 19331307 markings, 93615357 edges, 119033 markings/sec, 135 secs
lola: 19922351 markings, 96590268 edges, 118209 markings/sec, 140 secs
lola: 20513492 markings, 99545926 edges, 118228 markings/sec, 145 secs
lola: 21101460 markings, 102493151 edges, 117594 markings/sec, 150 secs
lola: 21687984 markings, 105443079 edges, 117305 markings/sec, 155 secs
lola: 22267462 markings, 108377972 edges, 115896 markings/sec, 160 secs
lola: 22845192 markings, 111295836 edges, 115546 markings/sec, 165 secs
lola: 23421240 markings, 114212540 edges, 115210 markings/sec, 170 secs
lola: 23993385 markings, 117112108 edges, 114429 markings/sec, 175 secs
lola: 24569373 markings, 120020531 edges, 115198 markings/sec, 180 secs
lola: 25145703 markings, 122922871 edges, 115266 markings/sec, 185 secs
lola: 25715259 markings, 125807968 edges, 113911 markings/sec, 190 secs
lola: 26284970 markings, 128677401 edges, 113942 markings/sec, 195 secs
lola: 26853444 markings, 131545892 edges, 113695 markings/sec, 200 secs
lola: 27415354 markings, 134391177 edges, 112382 markings/sec, 205 secs
lola: 27977090 markings, 137226406 edges, 112347 markings/sec, 210 secs
lola: 28541891 markings, 140073780 edges, 112960 markings/sec, 215 secs
lola: 29089180 markings, 142886364 edges, 109458 markings/sec, 220 secs
lola: 29643311 markings, 145707982 edges, 110826 markings/sec, 225 secs
lola: 30200549 markings, 148530092 edges, 111448 markings/sec, 230 secs
lola: 30750771 markings, 151332351 edges, 110044 markings/sec, 235 secs
lola: 31303254 markings, 154138023 edges, 110497 markings/sec, 240 secs
lola: 31856966 markings, 156943795 edges, 110742 markings/sec, 245 secs
lola: 32402696 markings, 159720287 edges, 109146 markings/sec, 250 secs
lola: 32954787 markings, 162518903 edges, 110418 markings/sec, 255 secs
lola: 33493548 markings, 165286073 edges, 107752 markings/sec, 260 secs
lola: 34034906 markings, 168048334 edges, 108272 markings/sec, 265 secs
lola: 34583288 markings, 170822973 edges, 109676 markings/sec, 270 secs
lola: 35118411 markings, 173570423 edges, 107025 markings/sec, 275 secs
lola: 35666047 markings, 176331395 edges, 109527 markings/sec, 280 secs
lola: 36203602 markings, 179071397 edges, 107511 markings/sec, 285 secs
lola: 36744456 markings, 181815920 edges, 108171 markings/sec, 290 secs
lola: 37286435 markings, 184552306 edges, 108396 markings/sec, 295 secs
lola: 37819019 markings, 187276219 edges, 106517 markings/sec, 300 secs
lola: 38347888 markings, 189997866 edges, 105774 markings/sec, 305 secs
lola: 38881255 markings, 192727617 edges, 106673 markings/sec, 310 secs
lola: 39407659 markings, 195434779 edges, 105281 markings/sec, 315 secs
lola: 39931733 markings, 198134440 edges, 104815 markings/sec, 320 secs
lola: 40455682 markings, 200826112 edges, 104790 markings/sec, 325 secs
lola: 40988897 markings, 203539266 edges, 106643 markings/sec, 330 secs
lola: 41518802 markings, 206241152 edges, 105981 markings/sec, 335 secs
lola: 42042563 markings, 208926364 edges, 104752 markings/sec, 340 secs
lola: 42564468 markings, 211604802 edges, 104381 markings/sec, 345 secs
lola: 43085576 markings, 214270134 edges, 104222 markings/sec, 350 secs
lola: 43601355 markings, 216938324 edges, 103156 markings/sec, 355 secs
lola: 44123864 markings, 219624283 edges, 104502 markings/sec, 360 secs
lola: 44643929 markings, 222304804 edges, 104013 markings/sec, 365 secs
lola: 45162304 markings, 224978026 edges, 103675 markings/sec, 370 secs
lola: 45668499 markings, 227617065 edges, 101239 markings/sec, 375 secs
lola: 46185136 markings, 230272389 edges, 103327 markings/sec, 380 secs
lola: 46701172 markings, 232929431 edges, 103207 markings/sec, 385 secs
lola: 47224337 markings, 235592700 edges, 104633 markings/sec, 390 secs
lola: 47741426 markings, 238242031 edges, 103418 markings/sec, 395 secs
lola: 48258783 markings, 240892952 edges, 103471 markings/sec, 400 secs
lola: 48767434 markings, 243525446 edges, 101730 markings/sec, 405 secs
lola: 49271609 markings, 246149646 edges, 100835 markings/sec, 410 secs
lola: 49775272 markings, 248759973 edges, 100733 markings/sec, 415 secs
lola: 50288162 markings, 251397184 edges, 102578 markings/sec, 420 secs
lola: 50801785 markings, 254034954 edges, 102725 markings/sec, 425 secs
lola: 51312779 markings, 256666501 edges, 102199 markings/sec, 430 secs
lola: 51818490 markings, 259282845 edges, 101142 markings/sec, 435 secs
lola: 52326529 markings, 261898799 edges, 101608 markings/sec, 440 secs
lola: 52827314 markings, 264499645 edges, 100157 markings/sec, 445 secs
lola: 53334397 markings, 267113652 edges, 101417 markings/sec, 450 secs
lola: 53838607 markings, 269714310 edges, 100842 markings/sec, 455 secs
lola: 54341925 markings, 272315345 edges, 100664 markings/sec, 460 secs
lola: 54847058 markings, 274919079 edges, 101027 markings/sec, 465 secs
lola: 55343994 markings, 277487850 edges, 99387 markings/sec, 470 secs
lola: 55846272 markings, 280080745 edges, 100456 markings/sec, 475 secs
lola: 56348729 markings, 282683470 edges, 100491 markings/sec, 480 secs
lola: 56851390 markings, 285271578 edges, 100532 markings/sec, 485 secs
lola: 57345830 markings, 287852999 edges, 98888 markings/sec, 490 secs
lola: 57842711 markings, 290427464 edges, 99376 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((3 <= xSYNSENT) AND (FIN <= 0)) OR ((xFINWAIT1 <= xSYNACK) AND (FINACK <= SYNRCVD))) AND A (F (E (X ((1 <= xSYNACK))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= xSYNSENT) AND (FIN <= 0)) OR ((xFINWAIT1 <= xSYNACK) AND (FINACK <= SYNRCVD)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= xSYNSENT) AND (FIN <= 0)) OR ((xFINWAIT1 <= xSYNACK) AND (FINACK <= SYNRCVD)))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
lola: processed formula with 4 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 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((1 <= xSYNACK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((1 <= xSYNACK)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 26926 markings, 61350 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((CLOSED <= xFINWAIT2) AND (xSYN <= xLISTEN) AND (1 <= xFINWAIT1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 12 will run for 757 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((CLOSING <= CLOSED) AND (2 <= xSYNACK) AND ((2 <= LISTEN) OR (2 <= SYN))) AND E (X ((1 <= xSYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((CLOSING <= CLOSED) AND (2 <= xSYNACK) AND ((2 <= LISTEN) OR (2 <= SYN))) AND EX((1 <= xSYNSENT))))
lola: processed formula length: 111
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 258 markings, 258 edges
lola: ========================================
lola: subprocess 13 will run for 1010 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (F ((3 <= FINWAIT1))))) OR A (G (((1 <= SYNRCVD) OR ((1 <= LISTEN) AND (1 <= SYNACK))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1010 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= FINWAIT1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= FINWAIT1)))
lola: processed formula: A (F ((3 <= FINWAIT1)))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.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: 376 markings, 376 edges
lola: ========================================
lola: subprocess 14 will run for 1515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= SYNRCVD) OR ((1 <= LISTEN) AND (1 <= SYNACK)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to TCPcondis-PT-25-CTLCardinality-14.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= FINACK) OR A (F (E (X ((3 <= xCLOSEWAIT))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= FINACK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= FINACK)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.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 3030 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((3 <= xCLOSEWAIT)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((3 <= xCLOSEWAIT)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 258 markings, 258 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3030 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((1 <= xCLOSED))))) AND NOT(E (G (((xFIN <= CLOSING) AND (xCLOSEWAIT <= xCLOSED))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3030 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= xCLOSED)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((1 <= xCLOSED)))
lola: processed formula length: 28
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no yes no no unknown yes no no no no unknown
FORMULA TCPcondis-PT-25-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-25"
export BK_EXAMINATION="CTLCardinality"
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-25.tgz
mv TCPcondis-PT-25 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-25, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-smll-152708748300206"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;