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 196K
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 lola
Input is TCPcondis-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743000180
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527232957517

info: Time: 3600 - MCC
===========================================================================================
prep: translating TCPcondis-PT-05 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TCPcondis-PT-05 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ TCPcondis-PT-05 @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 960
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-05-ReachabilityCardinality.task
lola: always true
lola: always true
lola: always true
lola: always true
lola: A (G (TRUE)) : A (G (((xFINWAIT2 <= 1) OR (FINWAIT2 <= xSYNSENT) OR (1 <= CLOSEWAIT)))) : A (G ((xTIMEWAIT <= CLOSED))) : A (G ((FINWAIT1 <= 2))) : A (G (((ESTAB <= 1) OR ((2 <= xESTAB) AND (2 <= xCLOSEWAIT)) OR (LASTACK + 1 <= xFIN) OR (LASTACK <= 1)))) : E (F (((xLASTACK <= 2) AND (FINWAIT2 + 1 <= xFINWAIT2) AND ((xFINACK <= ESTAB) OR (CLOSING <= xFINACK)) AND (TIMEWAIT + 1 <= xTIMEWAIT)))) : E (F (((FINACK <= 1) AND (xESTAB <= 1) AND (2 <= FINWAIT1) AND ((FIN <= SYNRCVD) OR (xCLOSED <= xCLOSEWAIT))))) : A (G (())) : E (F (((FINACK + 1 <= xSYNRCVD) AND (xCLOSEWAIT <= 0) AND (xSYNRCVD + 1 <= LASTACK) AND (SYNACK <= 0)))) : E (F (())) : E (F (((2 <= LASTACK) AND (1 <= xCLOSEWAIT) AND ((xFIN <= CLOSING) OR (2 <= TIMEWAIT)) AND (((FINWAIT2 <= TIMEWAIT) AND (1 <= CLOSING)) OR ((FINACK <= FIN) AND (2 <= xLISTEN)))))) : A (G (((1 <= SYNACK) OR (SYNACK <= TIMEWAIT)))) : E (F (((SYNSENT + 1 <= xFIN) AND (xCLOSING + 1 <= xTIMEWAIT) AND ((xFINACK <= 2) OR (xLISTEN + 1 <= LASTACK))))) : A (G (())) : E (F ((((SYNSENT <= xFINWAIT1) OR (3 <= xCLOSED)) AND ((xTIMEWAIT <= xLASTACK) OR (FINACK <= SYNRCVD)) AND (3 <= xFINWAIT1) AND ((1 <= CLOSING) OR (CLOSING <= SYN))))) : A (G (((FINWAIT2 <= xCLOSING) OR (SYNRCVD <= CLOSEWAIT))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges

FORMULA TCPcondis-PT-05-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FINWAIT1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FINWAIT1 <= 2)))
lola: processed formula length: 23
lola: 14 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (3 <= FINWAIT1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityCardinality-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= SYNACK) OR (SYNACK <= TIMEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= SYNACK) OR (SYNACK <= TIMEWAIT))))
lola: processed formula length: 48
lola: 14 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((SYNACK <= 0) AND (TIMEWAIT + 1 <= SYNACK))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file TCPcondis-PT-05-ReachabilityCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((xTIMEWAIT <= CLOSED)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((xTIMEWAIT <= CLOSED)))
lola: processed formula length: 29
lola: 14 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (CLOSED + 1 <= xTIMEWAIT)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityCardinality-6-0.sara
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((xFINWAIT2 <= 1) OR (FINWAIT2 <= xSYNSENT) OR (1 <= CLOSEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((xFINWAIT2 <= 1) OR (FINWAIT2 <= xSYNSENT) OR (1 <= CLOSEWAIT))))
lola: processed formula length: 74
lola: 14 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((2 <= xFINWAIT2) AND (xSYNSENT + 1 <= FINWAIT2) AND (CLOSEWAIT <= 0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityCardinality-7-0.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: 187 markings, 216 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FINWAIT2 <= xCLOSING) OR (SYNRCVD <= CLOSEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((FINWAIT2 <= xCLOSING) OR (SYNRCVD <= CLOSEWAIT))))
lola: processed formula length: 59
lola: 14 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 12 markings, 11 edges

FORMULA TCPcondis-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: ========================================
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ESTAB <= 1) OR ((2 <= xESTAB) AND (2 <= xCLOSEWAIT)) OR (LASTACK + 1 <= xFIN) OR (LASTACK <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((ESTAB <= 1) OR ((2 <= xESTAB) AND (2 <= xCLOSEWAIT)) OR (LASTACK + 1 <= xFIN) OR (LASTACK <= 1))))
lola: processed formula length: 109
lola: 14 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 26 markings, 25 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((2 <= ESTAB) AND ((xESTAB <= 1) OR (xCLOSEWAIT <= 1)) AND (xFIN <= LASTACK) AND (2 <= LASTACK))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FINACK + 1 <= xSYNRCVD) AND (xCLOSEWAIT <= 0) AND (xSYNRCVD + 1 <= LASTACK) AND (SYNACK <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FINACK + 1 <= xSYNRCVD) AND (xCLOSEWAIT <= 0) AND (xSYNRCVD + 1 <= LASTACK) AND (SYNACK <= 0))))
lola: processed formula length: 104
lola: 13 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FINACK + 1 <= xSYNRCVD) AND (xCLOSEWAIT <= 0) AND (xSYNRCVD + 1 <= LASTACK) AND (SYNACK <= 0))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 56 markings, 55 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FINACK <= 1) AND (xESTAB <= 1) AND (2 <= FINWAIT1) AND ((FIN <= SYNRCVD) OR (xCLOSED <= xCLOSEWAIT)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FINACK <= 1) AND (xESTAB <= 1) AND (2 <= FINWAIT1) AND ((FIN <= SYNRCVD) OR (xCLOSED <= xCLOSEWAIT)))))
lola: processed formula length: 112
lola: 13 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: formula 0: ((FINACK <= 1) AND (xESTAB <= 1) AND (2 <= FINWAIT1) AND ((FIN <= SYNRCVD) OR (xCLOSED <= xCLOSEWAIT)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((SYNSENT + 1 <= xFIN) AND (xCLOSING + 1 <= xTIMEWAIT) AND ((xFINACK <= 2) OR (xLISTEN + 1 <= LASTACK)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((SYNSENT + 1 <= xFIN) AND (xCLOSING + 1 <= xTIMEWAIT) AND ((xFINACK <= 2) OR (xLISTEN + 1 <= LASTACK)))))
lola: processed formula length: 113
lola: 13 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((xLASTACK <= 2) AND (FINWAIT2 + 1 <= xFINWAIT2) AND ((xFINACK <= ESTAB) OR (CLOSING <= xFINACK)) AND (TIMEWAIT + 1 <= xTIMEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((xLASTACK <= 2) AND (FINWAIT2 + 1 <= xFINWAIT2) AND ((xFINACK <= ESTAB) OR (CLOSING <= xFINACK)) AND (TIMEWAIT + 1 <= xTIMEWAIT))))
lola: processed formula length: 139
lola: 13 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((SYNSENT <= xFINWAIT1) OR (3 <= xCLOSED)) AND ((xTIMEWAIT <= xLASTACK) OR (FINACK <= SYNRCVD)) AND (3 <= xFINWAIT1) AND ((1 <= CLOSING) OR (CLOSING <= SYN)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((SYNSENT <= xFINWAIT1) OR (3 <= xCLOSED)) AND ((xTIMEWAIT <= xLASTACK) OR (FINACK <= SYNRCVD)) AND (3 <= xFINWAIT1) AND ((1 <= CLOSING) OR (CLOSING <= SYN)))))
lola: processed formula length: 170
lola: 13 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((SYNSENT <= xFINWAIT1) OR (3 <= xCLOSED)) AND ((xTIMEWAIT <= xLASTACK) OR (FINACK <= SYNRCVD)) AND (3 <= xFINWAIT1) AND ((1 <= CLOSING) OR (CLOSING <= SYN)))
lola: state equation: Generated DNF with 32 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: lola: result: yes
state equation: calling and running sara
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= LASTACK) AND (1 <= xCLOSEWAIT) AND ((xFIN <= CLOSING) OR (2 <= TIMEWAIT)) AND (((FINWAIT2 <= TIMEWAIT) AND (1 <= CLOSING)) OR ((FINACK <= FIN) AND (2 <= xLISTEN))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((2 <= LASTACK) AND (1 <= xCLOSEWAIT) AND ((xFIN <= CLOSING) OR (2 <= TIMEWAIT)) AND (((FINWAIT2 <= TIMEWAIT) AND (1 <= CLOSING)) OR ((FINACK <= FIN) AND (2 <= xLISTEN))))))
lola: processed formula length: 181
lola: 13 rewrites
lola: closed formula file TCPcondis-PT-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((2 <= LASTACK) AND (1 <= xCLOSEWAIT) AND ((xFIN <= CLOSING) OR (2 <= TIMEWAIT)) AND (((FINWAIT2 <= TIMEWAIT) AND (1 <= CLOSING)) OR ((FINACK <= FIN) AND (2 <= xLISTEN))))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityCardinality-15-0.sara
lola: sara: try reading problem file TCPcondis-PT-05-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no yes yes yes yes no yes yes yes yes yes no
lola:
preliminary result: yes no no no no yes yes yes yes no yes yes yes yes yes no
sara: place or transition ordering is non-deterministic
lola: memory consumption: 24544 KB
lola: time consumption: 0 seconds


BK_TIME_CONFINEMENT_REACHED

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