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 200K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 8.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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-40, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-smll-152708748300227
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527178528044


BK_STOP 1527179185327

--------------------
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-40 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': 671163, 'Memory': 10519.04, 'Tool': 'lola'}, {'Time': 672403, 'Memory': 10546.57, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola TCPcondis-PT-40...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
TCPcondis-PT-40: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ TCPcondis-PT-40 @ 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-40-CTLCardinality.task
lola: E (F (((CLOSED <= xTIMEWAIT) AND ((xCLOSED <= xESTAB) OR ((2 <= xSYNSENT)))))) : E (((xFINWAIT1 + 1 <= xFINWAIT2) U A (F ((1 <= xSYNRCVD))))) : A (X (E (G (((FINWAIT2 <= CLOSED) AND (SYNACK <= ESTAB)))))) : (E (X (E (F ((3 <= CLOSING))))) AND E ((((LISTEN <= SYNACK) OR (1 <= xTIMEWAIT)) U ((xSYN <= xCLOSED) OR (LASTACK <= CLOSED))))) : E (G (E (G ((xSYNRCVD <= 2))))) : A (F ((E (X ((xCLOSING <= LASTACK))) AND E (F ((3 <= xFIN)))))) : (E (F (E (G ((3 <= CLOSING))))) OR (((xSYNSENT <= 1) OR (xCLOSING + 1 <= SYNACK) OR (LISTEN <= 0)) AND A (G ((CLOSEWAIT <= 2))))) : A (G (((xSYNSENT + 1 <= xSYNACK) OR (xSYNRCVD + 1 <= FIN) OR (xESTAB <= 2) OR (xFIN <= 0)))) : ((E (F ((2 <= xCLOSING))) AND ((1 <= LASTACK) OR (TIMEWAIT + 1 <= LISTEN) OR (LASTACK <= xFIN))) AND (E (X ((2 <= xFIN))) OR E (F (((xLISTEN <= xESTAB) AND (2 <= LISTEN)))))) : E (G (((xFIN <= LASTACK) OR ((3 <= LASTACK) AND (xSYNACK <= xSYNRCVD)) OR ((FINACK <= xCLOSEWAIT) AND (xCLOSED <= xLASTACK) AND (xLASTACK <= xCLOSEWAIT))))) : A (X ((A (F ((3 <= FIN))) OR A (G ((3 <= xCLOSING)))))) : (A (G ((((CLOSING <= FINWAIT2) OR (3 <= xCLOSED)) AND ((1 <= CLOSED) OR (3 <= SYN))))) AND NOT((A (X ((1 <= xSYNSENT))) OR ((1 <= xFINACK) AND (xFINWAIT2 <= FINWAIT1) AND (SYNSENT + 1 <= SYN))))) : (E (((xFINACK <= FINWAIT1) U (xESTAB <= LASTACK))) AND E (F (((3 <= xCLOSEWAIT) OR (2 <= xFINACK))))) : E (((((FINWAIT2 <= xCLOSING) AND (2 <= CLOSING)) OR (TIMEWAIT + 1 <= LISTEN)) U E (G ((xCLOSEWAIT <= SYN))))) : A ((((xLASTACK <= LISTEN) AND (xLASTACK <= xSYN) AND ((3 <= FIN) OR (SYNRCVD <= CLOSING))) U (1 <= SYNACK))) : (A (F (A (G ((LISTEN <= SYNSENT))))) OR E (G ((3 <= ESTAB))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CLOSED <= xTIMEWAIT) AND ((xCLOSED <= xESTAB) OR ((2 <= xSYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((xFINWAIT1 + 1 <= xFINWAIT2) U A (F ((1 <= xSYNRCVD)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((xFINWAIT1 + 1 <= xFINWAIT2) U A(TRUE U (1 <= xSYNRCVD)))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 564 markings, 565 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((FINWAIT2 <= CLOSED) AND (SYNACK <= ESTAB))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U ((CLOSED + 1 <= FINWAIT2) OR (ESTAB + 1 <= SYNACK)))))
lola: processed formula length: 71
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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: 1065 markings, 1068 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((3 <= CLOSING))))) AND E ((((LISTEN <= SYNACK) OR (1 <= xTIMEWAIT)) U ((xSYN <= xCLOSED) OR (LASTACK <= CLOSED)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((3 <= CLOSING)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (3 <= CLOSING)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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: 1112751 markings, 3737311 edges, 222550 markings/sec, 0 secs
lola: 2053642 markings, 7202821 edges, 188178 markings/sec, 5 secs
lola: 2886479 markings, 10357102 edges, 166567 markings/sec, 10 secs
lola: 3657665 markings, 13321311 edges, 154237 markings/sec, 15 secs
lola: 4401423 markings, 16221967 edges, 148752 markings/sec, 20 secs
lola: 5109134 markings, 19014314 edges, 141542 markings/sec, 25 secs
lola: 5784769 markings, 21701406 edges, 135127 markings/sec, 30 secs
lola: 6448505 markings, 24361729 edges, 132747 markings/sec, 35 secs
lola: 7098469 markings, 26987951 edges, 129993 markings/sec, 40 secs
lola: 7758078 markings, 29657438 edges, 131922 markings/sec, 45 secs
lola: 8410834 markings, 32323509 edges, 130551 markings/sec, 50 secs
lola: 9062038 markings, 34981037 edges, 130241 markings/sec, 55 secs
lola: 9695894 markings, 37600108 edges, 126771 markings/sec, 60 secs
lola: 10315513 markings, 40159940 edges, 123924 markings/sec, 65 secs
lola: 10927929 markings, 42676093 edges, 122483 markings/sec, 70 secs
lola: 11532629 markings, 45169400 edges, 120940 markings/sec, 75 secs
lola: 12131746 markings, 47654709 edges, 119823 markings/sec, 80 secs
lola: 12721716 markings, 50124477 edges, 117994 markings/sec, 85 secs
lola: 13320664 markings, 52638546 edges, 119790 markings/sec, 90 secs
lola: 13762503 markings, 54485398 edges, 88368 markings/sec, 95 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13762503 markings, 54485398 edges
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((LISTEN <= SYNACK) OR (1 <= xTIMEWAIT)) U ((xSYN <= xCLOSED) OR (LASTACK <= CLOSED))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((LISTEN <= SYNACK) OR (1 <= xTIMEWAIT)) U ((xSYN <= xCLOSED) OR (LASTACK <= CLOSED)))
lola: processed formula length: 90
lola: 1 rewrites
lola: lola: formula mentions 0 of 30 places; total mentions: 0
========================================
lola: closed formula file TCPcondis-PT-40-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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((xSYNRCVD <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (3 <= xSYNRCVD))))
lola: processed formula length: 40
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 519 markings, 1557 edges
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((xCLOSING <= LASTACK))) AND E (F ((3 <= xFIN))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX((xCLOSING <= LASTACK)) AND E(TRUE U (3 <= xFIN))))
lola: processed formula length: 63
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 176 markings, 176 edges
lola: ========================================
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((3 <= CLOSING))))) OR (((xSYNSENT <= 1) OR (xCLOSING + 1 <= SYNACK) OR (LISTEN <= 0)) AND A (G ((CLOSEWAIT <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((3 <= CLOSING)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (CLOSING <= 2))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 286408 markings, 1015833 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((xSYNSENT + 1 <= xSYNACK) OR (xSYNRCVD + 1 <= FIN) OR (xESTAB <= 2) OR (xFIN <= 0))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((2 <= xCLOSING))) AND ((1 <= LASTACK) OR (TIMEWAIT + 1 <= LISTEN) OR (LASTACK <= xFIN))) AND (E (X ((2 <= xFIN))) OR E (F (((xLISTEN <= xESTAB) AND (2 <= LISTEN))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= xCLOSING)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 491 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= LASTACK) OR (TIMEWAIT + 1 <= LISTEN) OR (LASTACK <= xFIN))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= LASTACK) OR (TIMEWAIT + 1 <= LISTEN) OR (LASTACK <= xFIN))
lola: processed formula length: 67
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: processed formula with 3 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 10 will run for 573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= xFIN)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= xFIN))
lola: processed formula length: 15
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((xLISTEN <= xESTAB) AND (2 <= LISTEN))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-11.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 491 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((xFIN <= LASTACK) OR ((3 <= LASTACK) AND (xSYNACK <= xSYNRCVD)) OR ((FINACK <= xCLOSEWAIT) AND (xCLOSED <= xLASTACK) AND (xLASTACK <= xCLOSEWAIT)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((LASTACK + 1 <= xFIN) AND ((LASTACK <= 2) OR (xSYNRCVD + 1 <= xSYNACK)) AND ((xCLOSEWAIT + 1 <= FINACK) OR (xLASTACK + 1 <= xCLOSED) OR (xCLOSEWAIT + 1 <= xLASTACK)))))
lola: processed formula length: 185
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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: 1461 markings, 1462 edges
lola: ========================================
lola: subprocess 10 will run for 573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (F ((3 <= FIN))) OR A (G ((3 <= xCLOSING))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((A(TRUE U (3 <= FIN)) OR NOT(E(TRUE U (xCLOSING <= 2)))))
lola: processed formula length: 60
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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: 407 markings, 408 edges
lola: ========================================
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((((CLOSING <= FINWAIT2) OR (3 <= xCLOSED)) AND ((1 <= CLOSED) OR (3 <= SYN))))) AND NOT((A (X ((1 <= xSYNSENT))) OR ((1 <= xFINACK) AND (xFINWAIT2 <= FINWAIT1) AND (SYNSENT + 1 <= SYN)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((CLOSING <= FINWAIT2) OR (3 <= xCLOSED)) AND ((1 <= CLOSED) OR (3 <= SYN)))))
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: 41 markings, 40 edges
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-11.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((xFINACK <= FINWAIT1) U (xESTAB <= LASTACK))) AND E (F (((3 <= xCLOSEWAIT) OR (2 <= xFINACK)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((xFINACK <= FINWAIT1) U (xESTAB <= LASTACK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((xFINACK <= FINWAIT1) U (xESTAB <= LASTACK))
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1146 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= xCLOSEWAIT) OR (2 <= xFINACK))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
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 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: lola: SUBRESULT
lola: result: yesstate equation: calling and running sara

lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1146 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((FINWAIT2 <= xCLOSING) AND (2 <= CLOSING)) OR (TIMEWAIT + 1 <= LISTEN)) U E (G ((xCLOSEWAIT <= SYN)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((FINWAIT2 <= xCLOSING) AND (2 <= CLOSING)) OR (TIMEWAIT + 1 <= LISTEN)) U NOT(A(TRUE U (SYN + 1 <= xCLOSEWAIT))))
lola: processed formula length: 118
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 408 markings, 409 edges
lola: ========================================
lola: subprocess 14 will run for 1719 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((xLASTACK <= LISTEN) AND (xLASTACK <= xSYN) AND ((3 <= FIN) OR (SYNRCVD <= CLOSING))) U (1 <= SYNACK)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((xLASTACK <= LISTEN) AND (xLASTACK <= xSYN) AND ((3 <= FIN) OR (SYNRCVD <= CLOSING))) U (1 <= SYNACK)))
lola: processed formula: A ((((xLASTACK <= LISTEN) AND (xLASTACK <= xSYN) AND ((3 <= FIN) OR (SYNRCVD <= CLOSING))) U (1 <= SYNACK)))
lola: processed formula length: 109
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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
sara: try reading problem file TCPcondis-PT-40-CTLCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: 1959567 markings, 6262099 edges, 391913 markings/sec, 0 secs
lola: 3438211 markings, 11574831 edges, 295729 markings/sec, 5 secs
lola: 4842085 markings, 16627659 edges, 280775 markings/sec, 10 secs
lola: 6247725 markings, 21679920 edges, 281128 markings/sec, 15 secs
lola: 7627305 markings, 26648527 edges, 275916 markings/sec, 20 secs
lola: 8964281 markings, 31454655 edges, 267395 markings/sec, 25 secs
lola: 10304764 markings, 36279072 edges, 268097 markings/sec, 30 secs
lola: 11603498 markings, 40970042 edges, 259747 markings/sec, 35 secs
lola: 12922245 markings, 45700675 edges, 263749 markings/sec, 40 secs
lola: 14251360 markings, 50489645 edges, 265823 markings/sec, 45 secs
lola: 15578884 markings, 55269866 edges, 265505 markings/sec, 50 secs
lola: 16931548 markings, 60142647 edges, 270533 markings/sec, 55 secs
lola: 18245634 markings, 64882015 edges, 262817 markings/sec, 60 secs
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: 18774925 markings, 66807778 edges
lola: ========================================
lola: subprocess 15 will run for 3371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((LISTEN <= SYNSENT))))) OR E (G ((3 <= ESTAB))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((LISTEN <= SYNSENT)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((LISTEN <= SYNSENT)))))
lola: processed formula: A (F (A (G ((LISTEN <= SYNSENT)))))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-40-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: 1647710 markings, 3456397 edges, 329542 markings/sec, 0 secs
lola: 3052972 markings, 6514761 edges, 281052 markings/sec, 5 secs
lola: 4336279 markings, 9342114 edges, 256661 markings/sec, 10 secs
lola: 5625662 markings, 12195536 edges, 257877 markings/sec, 15 secs
lola: 6883321 markings, 14991333 edges, 251532 markings/sec, 20 secs
lola: 8114012 markings, 17737902 edges, 246138 markings/sec, 25 secs
lola: 9318829 markings, 20439838 edges, 240963 markings/sec, 30 secs
lola: 10507832 markings, 23108355 edges, 237801 markings/sec, 35 secs
lola: 11682741 markings, 25750248 edges, 234982 markings/sec, 40 secs
lola: 12844051 markings, 28368888 edges, 232262 markings/sec, 45 secs
lola: 13989372 markings, 30953435 edges, 229064 markings/sec, 50 secs
lola: 15123239 markings, 33515865 edges, 226773 markings/sec, 55 secs
lola: 16248057 markings, 36061608 edges, 224964 markings/sec, 60 secs
lola: 17360014 markings, 38582893 edges, 222391 markings/sec, 65 secs
lola: 18456753 markings, 41071217 edges, 219348 markings/sec, 70 secs
lola: 19545903 markings, 43541214 edges, 217830 markings/sec, 75 secs
lola: 20627586 markings, 45998921 edges, 216337 markings/sec, 80 secs
lola: 21701473 markings, 48443026 edges, 214777 markings/sec, 85 secs
lola: 22766259 markings, 50862216 edges, 212957 markings/sec, 90 secs
lola: 23818186 markings, 53265054 edges, 210385 markings/sec, 95 secs
lola: 24864911 markings, 55653498 edges, 209345 markings/sec, 100 secs
lola: 25906406 markings, 58033759 edges, 208299 markings/sec, 105 secs
lola: 26947107 markings, 60408143 edges, 208140 markings/sec, 110 secs
lola: 27972497 markings, 62754457 edges, 205078 markings/sec, 115 secs
lola: 29001846 markings, 65110913 edges, 205870 markings/sec, 120 secs
lola: 30020781 markings, 67444251 edges, 203787 markings/sec, 125 secs
lola: 31030605 markings, 69758481 edges, 201965 markings/sec, 130 secs
lola: 32041264 markings, 72078140 edges, 202132 markings/sec, 135 secs
lola: 33051072 markings, 74389264 edges, 201962 markings/sec, 140 secs
lola: 34054478 markings, 76686745 edges, 200681 markings/sec, 145 secs
lola: 35057462 markings, 78981108 edges, 200597 markings/sec, 150 secs
lola: 36050898 markings, 81262870 edges, 198687 markings/sec, 155 secs
lola: 37044338 markings, 83547034 edges, 198688 markings/sec, 160 secs
lola: 38039593 markings, 85830318 edges, 199051 markings/sec, 165 secs
lola: 39023069 markings, 88090475 edges, 196695 markings/sec, 170 secs
lola: 40007505 markings, 90352768 edges, 196887 markings/sec, 175 secs
lola: 40982205 markings, 92592276 edges, 194940 markings/sec, 180 secs
lola: 41955161 markings, 94829901 edges, 194591 markings/sec, 185 secs
lola: 42927473 markings, 97065451 edges, 194462 markings/sec, 190 secs
lola: 43892981 markings, 99290387 edges, 193102 markings/sec, 195 secs
lola: 44857427 markings, 101513044 edges, 192889 markings/sec, 200 secs
lola: 45814231 markings, 103721439 edges, 191361 markings/sec, 205 secs
lola: 46772849 markings, 105928274 edges, 191724 markings/sec, 210 secs
lola: 47723371 markings, 108125472 edges, 190104 markings/sec, 215 secs
lola: 48679471 markings, 110330795 edges, 191220 markings/sec, 220 secs
lola: 49634641 markings, 112533828 edges, 191034 markings/sec, 225 secs
lola: 50583761 markings, 114723745 edges, 189824 markings/sec, 230 secs
lola: 51531358 markings, 116909422 edges, 189519 markings/sec, 235 secs
lola: 52477946 markings, 119094681 edges, 189318 markings/sec, 240 secs
lola: 53416765 markings, 121266170 edges, 187764 markings/sec, 245 secs
lola: 54350488 markings, 123424633 edges, 186745 markings/sec, 250 secs
lola: 55291021 markings, 125595298 edges, 188107 markings/sec, 255 secs
lola: 56226889 markings, 127757138 edges, 187174 markings/sec, 260 secs
lola: 57161362 markings, 129915455 edges, 186895 markings/sec, 265 secs
lola: 58092213 markings, 132071991 edges, 186170 markings/sec, 270 secs
lola: 59020687 markings, 134220069 edges, 185695 markings/sec, 275 secs
lola: 59952950 markings, 136371156 edges, 186453 markings/sec, 280 secs
lola: 60878035 markings, 138510618 edges, 185017 markings/sec, 285 secs
lola: 61799644 markings, 140645293 edges, 184322 markings/sec, 290 secs
lola: 62728486 markings, 142789568 edges, 185768 markings/sec, 295 secs
lola: 63653445 markings, 144930685 edges, 184992 markings/sec, 300 secs
lola: 64566974 markings, 147052791 edges, 182706 markings/sec, 305 secs
lola: 65487586 markings, 149182982 edges, 184122 markings/sec, 310 secs
lola: 66400477 markings, 151301764 edges, 182578 markings/sec, 315 secs
lola: 67313995 markings, 153414736 edges, 182704 markings/sec, 320 secs
lola: 68223167 markings, 155525747 edges, 181834 markings/sec, 325 secs
lola: 69131370 markings, 157635453 edges, 181641 markings/sec, 330 secs
lola: 70039076 markings, 159745755 edges, 181541 markings/sec, 335 secs
lola: 70944095 markings, 161844930 edges, 181004 markings/sec, 340 secs
lola: 71849727 markings, 163943207 edges, 181126 markings/sec, 345 secs
lola: 72748917 markings, 166032697 edges, 179838 markings/sec, 350 secs
lola: 73658644 markings, 168137496 edges, 181945 markings/sec, 355 secs
lola: 74562585 markings, 170233887 edges, 180788 markings/sec, 360 secs
lola: 75465029 markings, 172327979 edges, 180489 markings/sec, 365 secs
lola: 76367102 markings, 174416363 edges, 180415 markings/sec, 370 secs
lola: 77263526 markings, 176496166 edges, 179285 markings/sec, 375 secs
lola: 78152376 markings, 178565178 edges, 177770 markings/sec, 380 secs
lola: 79047482 markings, 180643178 edges, 179021 markings/sec, 385 secs
lola: 79939962 markings, 182717789 edges, 178496 markings/sec, 390 secs
lola: 80826803 markings, 184779567 edges, 177368 markings/sec, 395 secs
lola: 81711088 markings, 186835277 edges, 176857 markings/sec, 400 secs
lola: 82589165 markings, 188880306 edges, 175615 markings/sec, 405 secs
lola: 83472834 markings, 190935762 edges, 176734 markings/sec, 410 secs
lola: 84352989 markings, 192985338 edges, 176031 markings/sec, 415 secs
lola: 85228427 markings, 195023815 edges, 175088 markings/sec, 420 secs
lola: 86080192 markings, 197006241 edges, 170353 markings/sec, 425 secs
lola: 86930112 markings, 198985941 edges, 169984 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 1: unexpected character, last read: '\ufffd'
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes yes no yes yes no no yes yes yes unknown
FORMULA TCPcondis-PT-40-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-40-CTLCardinality-15 CANNOT_COMPUTE 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-40"
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-40.tgz
mv TCPcondis-PT-40 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-40, 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-152708748300227"
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 ;