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

About the Execution of Irma.struct for TCPcondis-PT-40

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.180 867788.00 698502.00 4402.10 TFTTTTTFTTFFTTT? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 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 irma4mcc-structural
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 r175-smll-152708746300227
=====================================================================


--------------------
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 1527163798612


BK_STOP 1527164666400

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using TCPcondis-PT-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': 'itstools'}].
CTLCardinality lola TCPcondis-PT-40...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
CTLCardinality @ TCPcondis-PT-40 @ 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-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: 1060798 markings, 3552491 edges, 212160 markings/sec, 0 secs
lola: 1908737 markings, 6663490 edges, 169588 markings/sec, 5 secs
lola: 2701626 markings, 9648224 edges, 158578 markings/sec, 10 secs
lola: 3504214 markings, 12730318 edges, 160518 markings/sec, 15 secs
lola: 4291597 markings, 15789451 edges, 157477 markings/sec, 20 secs
lola: 5054558 markings, 18797194 edges, 152592 markings/sec, 25 secs
lola: 5793559 markings, 21736915 edges, 147800 markings/sec, 30 secs
lola: 6516579 markings, 24638198 edges, 144604 markings/sec, 35 secs
lola: 7225919 markings, 27500755 edges, 141868 markings/sec, 40 secs
lola: 7922323 markings, 30330608 edges, 139281 markings/sec, 45 secs
lola: 8611323 markings, 33139582 edges, 137800 markings/sec, 50 secs
lola: 9289839 markings, 35919693 edges, 135703 markings/sec, 55 secs
lola: 9846720 markings, 38223019 edges, 111376 markings/sec, 60 secs
lola: 10352671 markings, 40314449 edges, 101190 markings/sec, 65 secs
lola: 10866085 markings, 42426731 edges, 102683 markings/sec, 70 secs
lola: 11379332 markings, 44538209 edges, 102649 markings/sec, 75 secs
lola: 11888375 markings, 46642282 edges, 101809 markings/sec, 80 secs
lola: 12386663 markings, 48723564 edges, 99658 markings/sec, 85 secs
lola: 12880684 markings, 50792687 edges, 98804 markings/sec, 90 secs
lola: 13372849 markings, 52856947 edges, 98433 markings/sec, 95 secs
lola: 13762503 markings, 54485398 edges, 77931 markings/sec, 100 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: ================================================================================

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: 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 381 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
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: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 9 will run for 490 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 572 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 686 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 490 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 572 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 686 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 686 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 858 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 858 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 1144 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-13.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1144 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 1716 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
lola: 1952114 markings, 6235735 edges, 390423 markings/sec, 0 secs
lola: 3437959 markings, 11573956 edges, 297169 markings/sec, 5 secs
lola: 4848541 markings, 16650414 edges, 282116 markings/sec, 10 secs
lola: 6208762 markings, 21540035 edges, 272044 markings/sec, 15 secs
lola: 7533016 markings, 26307609 edges, 264851 markings/sec, 20 secs
lola: 8851958 markings, 31050089 edges, 263788 markings/sec, 25 secs
lola: 10176523 markings, 35830408 edges, 264913 markings/sec, 30 secs
lola: 11502571 markings, 40598344 edges, 265210 markings/sec, 35 secs
lola: 12812403 markings, 45316315 edges, 261966 markings/sec, 40 secs
lola: 14112369 markings, 49986171 edges, 259993 markings/sec, 45 secs
lola: 15394738 markings, 54619444 edges, 256474 markings/sec, 50 secs
lola: 16666157 markings, 59187704 edges, 254284 markings/sec, 55 secs
lola: 17915546 markings, 63690551 edges, 249878 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 3363 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 3363 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: 1503903 markings, 3147102 edges, 300781 markings/sec, 0 secs
lola: 2794383 markings, 5950478 edges, 258096 markings/sec, 5 secs
lola: 3981250 markings, 8558570 edges, 237373 markings/sec, 10 secs
lola: 5070647 markings, 10963094 edges, 217879 markings/sec, 15 secs
lola: 6147203 markings, 13353225 edges, 215311 markings/sec, 20 secs
lola: 7196313 markings, 15689569 edges, 209822 markings/sec, 25 secs
lola: 8208535 markings, 17948721 edges, 202444 markings/sec, 30 secs
lola: 9201234 markings, 20174575 edges, 198540 markings/sec, 35 secs
lola: 10184920 markings, 22383177 edges, 196737 markings/sec, 40 secs
lola: 11151007 markings, 24553906 edges, 193217 markings/sec, 45 secs
lola: 12100004 markings, 26692068 edges, 189799 markings/sec, 50 secs
lola: 13051741 markings, 28834363 edges, 190347 markings/sec, 55 secs
lola: 13984595 markings, 30942673 edges, 186571 markings/sec, 60 secs
lola: 14923316 markings, 33063463 edges, 187744 markings/sec, 65 secs
lola: 15844986 markings, 35149172 edges, 184334 markings/sec, 70 secs
lola: 16766320 markings, 37237395 edges, 184267 markings/sec, 75 secs
lola: 17662611 markings, 39268456 edges, 179258 markings/sec, 80 secs
lola: 18548438 markings, 41278227 edges, 177165 markings/sec, 85 secs
lola: 19427271 markings, 43270586 edges, 175767 markings/sec, 90 secs
lola: 20296286 markings, 45247616 edges, 173803 markings/sec, 95 secs
lola: 21166662 markings, 47225428 edges, 174075 markings/sec, 100 secs
lola: 22039720 markings, 49208642 edges, 174612 markings/sec, 105 secs
lola: 22900909 markings, 51169021 edges, 172238 markings/sec, 110 secs
lola: 23772914 markings, 53161888 edges, 174401 markings/sec, 115 secs
lola: 24648802 markings, 55158729 edges, 175178 markings/sec, 120 secs
lola: 25519338 markings, 57148632 edges, 174107 markings/sec, 125 secs
lola: 26393313 markings, 59145513 edges, 174795 markings/sec, 130 secs
lola: 27264978 markings, 61133044 edges, 174333 markings/sec, 135 secs
lola: 28136346 markings, 63130023 edges, 174274 markings/sec, 140 secs
lola: 29027115 markings, 65168482 edges, 178154 markings/sec, 145 secs
lola: 29909138 markings, 67189151 edges, 176405 markings/sec, 150 secs
lola: 30791608 markings, 69209577 edges, 176494 markings/sec, 155 secs
lola: 31666593 markings, 71216561 edges, 174997 markings/sec, 160 secs
lola: 32542393 markings, 73225148 edges, 175160 markings/sec, 165 secs
lola: 33420972 markings, 75235289 edges, 175716 markings/sec, 170 secs
lola: 34296643 markings, 77240704 edges, 175134 markings/sec, 175 secs
lola: 35174436 markings, 79249639 edges, 175559 markings/sec, 180 secs
lola: 36044619 markings, 81248382 edges, 174037 markings/sec, 185 secs
lola: 36912782 markings, 83246831 edges, 173633 markings/sec, 190 secs
lola: 37789843 markings, 85255025 edges, 175412 markings/sec, 195 secs
lola: 38655343 markings, 87242992 edges, 173100 markings/sec, 200 secs
lola: 39521080 markings, 89235022 edges, 173147 markings/sec, 205 secs
lola: 40383947 markings, 91218787 edges, 172573 markings/sec, 210 secs
lola: 41244312 markings, 93196018 edges, 172073 markings/sec, 215 secs
lola: 42104544 markings, 95172727 edges, 172046 markings/sec, 220 secs
lola: 42961797 markings, 97144901 edges, 171451 markings/sec, 225 secs
lola: 43811967 markings, 99103876 edges, 170034 markings/sec, 230 secs
lola: 44667224 markings, 101072759 edges, 171051 markings/sec, 235 secs
lola: 45511202 markings, 103023242 edges, 168796 markings/sec, 240 secs
lola: 46364235 markings, 104987857 edges, 170607 markings/sec, 245 secs
lola: 47211845 markings, 106942863 edges, 169522 markings/sec, 250 secs
lola: 48058200 markings, 108896074 edges, 169271 markings/sec, 255 secs
lola: 48909368 markings, 110859335 edges, 170234 markings/sec, 260 secs
lola: 49756441 markings, 112814538 edges, 169415 markings/sec, 265 secs
lola: 50599943 markings, 114761488 edges, 168700 markings/sec, 270 secs
lola: 51445346 markings, 116710517 edges, 169081 markings/sec, 275 secs
lola: 52290604 markings, 118659624 edges, 169052 markings/sec, 280 secs
lola: 53124315 markings, 120589224 edges, 166742 markings/sec, 285 secs
lola: 53960469 markings, 122523923 edges, 167231 markings/sec, 290 secs
lola: 54796164 markings, 124452626 edges, 167139 markings/sec, 295 secs
lola: 55633765 markings, 126385018 edges, 167520 markings/sec, 300 secs
lola: 56471472 markings, 128321111 edges, 167541 markings/sec, 305 secs
lola: 57306077 markings, 130251333 edges, 166921 markings/sec, 310 secs
lola: 58137963 markings, 132178400 edges, 166377 markings/sec, 315 secs
lola: 58970878 markings, 134105323 edges, 166583 markings/sec, 320 secs
lola: 59803190 markings, 136027188 edges, 166462 markings/sec, 325 secs
lola: 60637224 markings, 137953621 edges, 166807 markings/sec, 330 secs
lola: 61461270 markings, 139862103 edges, 164809 markings/sec, 335 secs
lola: 62293054 markings, 141785997 edges, 166357 markings/sec, 340 secs
lola: 63122722 markings, 143702968 edges, 165934 markings/sec, 345 secs
lola: 63949464 markings, 145617582 edges, 165348 markings/sec, 350 secs
lola: 64772135 markings, 147527432 edges, 164534 markings/sec, 355 secs
lola: 65599544 markings, 149443168 edges, 165482 markings/sec, 360 secs
lola: 66417303 markings, 151340451 edges, 163552 markings/sec, 365 secs
lola: 67236842 markings, 153235477 edges, 163908 markings/sec, 370 secs
lola: 68049621 markings, 155124539 edges, 162556 markings/sec, 375 secs
lola: 68862813 markings, 157013041 edges, 162638 markings/sec, 380 secs
lola: 69675171 markings, 158901597 edges, 162472 markings/sec, 385 secs
lola: 70490328 markings, 160789235 edges, 163031 markings/sec, 390 secs
lola: 71299837 markings, 162671914 edges, 161902 markings/sec, 395 secs
lola: 72110036 markings, 164547086 edges, 162040 markings/sec, 400 secs
lola: 72914781 markings, 166415810 edges, 160949 markings/sec, 405 secs
lola: 73726184 markings, 168293424 edges, 162281 markings/sec, 410 secs
lola: 74531483 markings, 170162169 edges, 161060 markings/sec, 415 secs
lola: 75336582 markings, 172030665 edges, 161020 markings/sec, 420 secs
lola: 76140504 markings, 173893670 edges, 160784 markings/sec, 425 secs
lola: 76945691 markings, 175760538 edges, 161037 markings/sec, 430 secs
lola: 77743482 markings, 177612294 edges, 159558 markings/sec, 435 secs
lola: 78536572 markings, 179457753 edges, 158618 markings/sec, 440 secs
lola: 79332089 markings, 181304645 edges, 159103 markings/sec, 445 secs
lola: 80123916 markings, 183144490 edges, 158365 markings/sec, 450 secs
lola: 80911274 markings, 184974907 edges, 157472 markings/sec, 455 secs
lola: 81699620 markings, 186808392 edges, 157669 markings/sec, 460 secs
lola: 82481422 markings, 188630359 edges, 156360 markings/sec, 465 secs
lola: 83269996 markings, 190463677 edges, 157715 markings/sec, 470 secs
lola: 84055950 markings, 192293118 edges, 157191 markings/sec, 475 secs
lola: 84836721 markings, 194111845 edges, 156154 markings/sec, 480 secs
lola: 85621179 markings, 195937206 edges, 156892 markings/sec, 485 secs
lola: 86401965 markings, 197755033 edges, 156157 markings/sec, 490 secs
lola: 87178947 markings, 199571061 edges, 155396 markings/sec, 495 secs
lola: 87258468 markings, 199751422 edges, 15904 markings/sec, 500 secs
lola: 87261088 markings, 199757424 edges, 524 markings/sec, 505 secs
lola: 87265186 markings, 199766663 edges, 820 markings/sec, 510 secs
lola: 87266496 markings, 199769738 edges, 262 markings/sec, 515 secs
lola: 87267102 markings, 199771156 edges, 121 markings/sec, 520 secs
lola: 87270261 markings, 199778689 edges, 632 markings/sec, 525 secs
lola: 87270269 markings, 199778707 edges, 2 markings/sec, 530 secs
lola: 87270279 markings, 199778722 edges, 2 markings/sec, 535 secs
lola: 87271305 markings, 199781158 edges, 205 markings/sec, 540 secs
lola: 87271315 markings, 199781193 edges, 2 markings/sec, 545 secs
lola: 87271324 markings, 199781209 edges, 2 markings/sec, 550 secs
lola: 87271334 markings, 199781230 edges, 2 markings/sec, 555 secs
lola: 87271345 markings, 199781253 edges, 2 markings/sec, 560 secs
lola: 87271353 markings, 199781278 edges, 2 markings/sec, 565 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: 'M'
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 stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-40"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-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 irma4mcc-structural"
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 r175-smll-152708746300227"
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 ;