Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
........................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.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.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 24K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is TCPcondis-PT-50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743100236
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527276175745

info: Time: 3600 - MCC
===========================================================================================
prep: translating TCPcondis-PT-50 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TCPcondis-PT-50 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ TCPcondis-PT-50 @ 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-50-ReachabilityCardinality.task
lola: always true
lola: E (F (((CLOSED <= xLASTACK) OR ((FINWAIT2 <= FIN) AND (3 <= xSYNACK) AND ((FINACK <= SYN) OR (2 <= xTIMEWAIT)))))) : E (F ((((2 <= xLASTACK) OR (3 <= FINWAIT2)) AND ((3 <= FIN) OR (3 <= xTIMEWAIT)) AND (xSYN <= CLOSING)))) : A (G (((1 <= TIMEWAIT) OR (TIMEWAIT <= CLOSED) OR (1 <= CLOSED)))) : E (F (((1 <= xESTAB) AND (1 <= xSYN) AND (xFINWAIT1 + 1 <= xFIN) AND (CLOSEWAIT + 1 <= LASTACK)))) : E (F (((1 <= TIMEWAIT) AND (FINWAIT1 <= CLOSEWAIT)))) : E (F (((xFINACK + 1 <= xLASTACK) AND (FINACK <= 0) AND (SYN <= 0) AND (xFINACK + 1 <= TIMEWAIT)))) : A (G ((FINWAIT2 <= 2))) : E (F ((2 <= xTIMEWAIT))) : A (G (((xSYNACK <= xCLOSED) OR (3 <= xCLOSEWAIT)))) : A (G (((LISTEN + 1 <= xFINACK) OR (TIMEWAIT <= xCLOSING)))) : E (F (((3 <= xSYNSENT) AND (3 <= FINWAIT2)))) : E (F (((3 <= xFINACK) AND (2 <= FINWAIT2) AND ((xLISTEN <= FINWAIT2) OR (xCLOSED <= ESTAB) OR ((SYNACK <= SYN) AND (FINACK <= xFINWAIT2)))))) : E (F (((xCLOSED <= FINACK) AND ((xFINACK <= xESTAB) OR (1 <= xCLOSED) OR (xSYNSENT <= 0))))) : E (F (((SYNACK <= 2) AND (CLOSEWAIT <= 1) AND (2 <= xFIN)))) : E (F (((FINWAIT1 + 1 <= xLASTACK) AND (xTIMEWAIT + 1 <= xFINWAIT2) AND ((1 <= SYNSENT) OR (TIMEWAIT <= CLOSED) OR ((3 <= xCLOSED) AND (2 <= xCLOSED)))))) : A (G (((CLOSEWAIT + 1 <= xSYNSENT) OR (CLOSING <= 2) OR ((xCLOSING <= 0) AND (SYNRCVD + 1 <= xLISTEN)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FINWAIT2 <= 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 ((FINWAIT2 <= 2)))
lola: processed formula length: 23
lola: 2 rewrites
lola: closed formula file TCPcondis-PT-50-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 <= FINWAIT2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges

FORMULA TCPcondis-PT-50-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-0.sara
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= 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 ((2 <= xTIMEWAIT)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file TCPcondis-PT-50-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-50-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= TIMEWAIT) OR (TIMEWAIT <= CLOSED) OR (1 <= 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 (((1 <= TIMEWAIT) OR (TIMEWAIT <= CLOSED) OR (1 <= CLOSED))))
lola: processed formula length: 68
lola: 2 rewrites
lola: closed formula file TCPcondis-PT-50-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: ((TIMEWAIT <= 0) AND (CLOSED + 1 <= TIMEWAIT) AND (CLOSED <= 0))
lola: ========================================
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file TCPcondis-PT-50-ReachabilityCardinality-2-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-50-ReachabilityCardinality-2 TRUE 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: E (F (((3 <= xSYNSENT) AND (3 <= FINWAIT2))))
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 (((3 <= xSYNSENT) AND (3 <= FINWAIT2))))
lola: processed formula length: 45
lola: 1 rewrites
lola: closed formula file TCPcondis-PT-50-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: ((3 <= xSYNSENT) AND (3 <= FINWAIT2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA TCPcondis-PT-50-ReachabilityCardinality-10 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 (((xSYNACK <= xCLOSED) OR (3 <= xCLOSEWAIT))))
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 (((xSYNACK <= xCLOSED) OR (3 <= xCLOSEWAIT))))
lola: processed formula length: 52
lola: 2 rewrites
lola: closed formula file TCPcondis-PT-50-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: ((xCLOSED + 1 <= xSYNACK) AND (xCLOSEWAIT <= 2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-4-0.sara
sara: try reading problem file TCPcondis-PT-50-ReachabilityCardinality-3-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: 53 markings, 52 edges
lola: ========================================

FORMULA TCPcondis-PT-50-ReachabilityCardinality-8 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: E (F (((1 <= TIMEWAIT) AND (FINWAIT1 <= CLOSEWAIT))))
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 (((1 <= TIMEWAIT) AND (FINWAIT1 <= CLOSEWAIT))))
lola: processed formula length: 53
lola: 1 rewrites
lola: closed formula file TCPcondis-PT-50-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
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= TIMEWAIT) AND (FINWAIT1 <= CLOSEWAIT))
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: 13 markings, 12 edges
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-5-0.sara
lola: ========================================

FORMULA TCPcondis-PT-50-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((SYNACK <= 2) AND (CLOSEWAIT <= 1) AND (2 <= xFIN))))
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 (((SYNACK <= 2) AND (CLOSEWAIT <= 1) AND (2 <= xFIN))))
lola: processed formula length: 60
lola: 1 rewrites
lola: closed formula file TCPcondis-PT-50-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: 14 markings, 13 edges
lola: ========================================

FORMULA TCPcondis-PT-50-ReachabilityCardinality-13 TRUE 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 (((LISTEN + 1 <= xFINACK) OR (TIMEWAIT <= xCLOSING))))
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 (((LISTEN + 1 <= xFINACK) OR (TIMEWAIT <= xCLOSING))))
lola: processed formula length: 60
lola: 2 rewrites
lola: closed formula file TCPcondis-PT-50-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: ((xFINACK <= LISTEN) AND (xCLOSING + 1 <= TIMEWAIT))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file TCPcondis-PT-50-ReachabilityCardinality-5-0.sara.
sara: try reading problem file TCPcondis-PT-50-ReachabilityCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.

FORMULA TCPcondis-PT-50-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((xCLOSED <= FINACK) AND ((xFINACK <= xESTAB) OR (1 <= xCLOSED) OR (xSYNSENT <= 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 (((xCLOSED <= FINACK) AND ((xFINACK <= xESTAB) OR (1 <= xCLOSED) OR (xSYNSENT <= 0)))))
lola: processed formula length: 94
lola: 1 rewrites
lola: closed formula file TCPcondis-PT-50-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: ((xCLOSED <= FINACK) AND ((xFINACK <= xESTAB) OR (1 <= xCLOSED) OR (xSYNSENT <= 0)))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 51 markings, 50 edges
lola: ========================================

FORMULA TCPcondis-PT-50-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((xFINACK + 1 <= xLASTACK) AND (FINACK <= 0) AND (SYN <= 0) AND (xFINACK + 1 <= TIMEWAIT))))
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 (((xFINACK + 1 <= xLASTACK) AND (FINACK <= 0) AND (SYN <= 0) AND (xFINACK + 1 <= TIMEWAIT))))
lola: processed formula length: 98
lola: 1 rewrites
lola: closed formula file TCPcondis-PT-50-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: ((xFINACK + 1 <= xLASTACK) AND (FINACK <= 0) AND (SYN <= 0) AND (xFINACK + 1 <= TIMEWAIT))
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: 22 markings, 21 edges
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-9-0.sara
lola: ========================================

FORMULA TCPcondis-PT-50-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= xESTAB) AND (1 <= xSYN) AND (xFINWAIT1 + 1 <= xFIN) AND (CLOSEWAIT + 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 (((1 <= xESTAB) AND (1 <= xSYN) AND (xFINWAIT1 + 1 <= xFIN) AND (CLOSEWAIT + 1 <= LASTACK))))
lola: processed formula length: 98
lola: 1 rewrites
lola: closed formula file TCPcondis-PT-50-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: ((1 <= xESTAB) AND (1 <= xSYN) AND (xFINWAIT1 + 1 <= xFIN) AND (CLOSEWAIT + 1 <= LASTACK))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA TCPcondis-PT-50-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= xLASTACK) OR (3 <= FINWAIT2)) AND ((3 <= FIN) OR (3 <= xTIMEWAIT)) AND (xSYN <= CLOSING))))
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 <= xLASTACK) OR (3 <= FINWAIT2)) AND ((3 <= FIN) OR (3 <= xTIMEWAIT)) AND (xSYN <= CLOSING))))
lola: processed formula length: 107
lola: 1 rewrites
lola: closed formula file TCPcondis-PT-50-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 <= xLASTACK) OR (3 <= FINWAIT2)) AND ((3 <= FIN) OR (3 <= xTIMEWAIT)) AND (xSYN <= CLOSING))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-11-0.sara
sara: try reading problem file TCPcondis-PT-50-ReachabilityCardinality-10-0.sara.
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 174 markings, 173 edges
lola: ========================================

FORMULA TCPcondis-PT-50-ReachabilityCardinality-1 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: sara: place or transition ordering is non-deterministic
========================================
lola: ...considering subproblem: A (G (((CLOSEWAIT + 1 <= xSYNSENT) OR (CLOSING <= 2) OR ((xCLOSING <= 0) AND (SYNRCVD + 1 <= xLISTEN)))))
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 (((CLOSEWAIT + 1 <= xSYNSENT) OR (CLOSING <= 2) OR ((xCLOSING <= 0) AND (SYNRCVD + 1 <= xLISTEN)))))
lola: processed formula length: 107
lola: 2 rewrites
lola: closed formula file TCPcondis-PT-50-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: ((xSYNSENT <= CLOSEWAIT) AND (3 <= CLOSING) AND ((1 <= xCLOSING) OR (xLISTEN <= SYNRCVD)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-12-0.sara
lola: ========================================

FORMULA TCPcondis-PT-50-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FINWAIT1 + 1 <= xLASTACK) AND (xTIMEWAIT + 1 <= xFINWAIT2) AND ((1 <= SYNSENT) OR (TIMEWAIT <= CLOSED) OR ((3 <= xCLOSED) AND (2 <= xCLOSED))))))
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 (((FINWAIT1 + 1 <= xLASTACK) AND (xTIMEWAIT + 1 <= xFINWAIT2) AND ((1 <= SYNSENT) OR (TIMEWAIT <= CLOSED) OR ((3 <= xCLOSED) AND (2 <= xCLOSED))))))
lola: processed formula length: 155
lola: 1 rewrites
lola: closed formula file TCPcondis-PT-50-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: ((FINWAIT1 + 1 <= xLASTACK) AND (xTIMEWAIT + 1 <= xFINWAIT2) AND ((1 <= SYNSENT) OR (TIMEWAIT <= CLOSED) OR ((3 <= xCLOSED) AND (2 <= xCLOSED))))
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1087 markings, 1091 edges
lola: ========================================

FORMULA TCPcondis-PT-50-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((CLOSED <= xLASTACK) OR ((FINWAIT2 <= FIN) AND (3 <= xSYNACK) AND ((FINACK <= SYN) OR (2 <= 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 (((CLOSED <= xLASTACK) OR ((FINWAIT2 <= FIN) AND (3 <= xSYNACK) AND ((FINACK <= SYN) OR (2 <= xTIMEWAIT))))))
lola: processed formula length: 116
lola: 1 rewrites
lola: closed formula file TCPcondis-PT-50-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: ((CLOSED <= xLASTACK) OR ((FINWAIT2 <= FIN) AND (3 <= xSYNACK) AND ((FINACK <= SYN) OR (2 <= xTIMEWAIT))))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 51 markings, 50 edges
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-14-0.sara
lola: ========================================

FORMULA TCPcondis-PT-50-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= xFINACK) AND (2 <= FINWAIT2) AND ((xLISTEN <= FINWAIT2) OR (xCLOSED <= ESTAB) OR ((SYNACK <= SYN) AND (FINACK <= xFINWAIT2))))))
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 (((3 <= xFINACK) AND (2 <= FINWAIT2) AND ((xLISTEN <= FINWAIT2) OR (xCLOSED <= ESTAB) OR ((SYNACK <= SYN) AND (FINACK <= xFINWAIT2))))))
lola: processed formula length: 143
lola: 1 rewrites
lola: closed formula file TCPcondis-PT-50-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: ((3 <= xFINACK) AND (2 <= FINWAIT2) AND ((xLISTEN <= FINWAIT2) OR (xCLOSED <= ESTAB) OR ((SYNACK <= SYN) AND (FINACK <= xFINWAIT2))))
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-50-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: state equation: calling and running sara
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================

FORMULA TCPcondis-PT-50-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes no yes no no yes yes yes yes yes no
lola:
preliminary result: yes yes yes yes yes yes no yes no no yes yes yes yes yes no
sara: try reading problem file TCPcondis-PT-50-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: memory consumption: 24460 KB
lola: time consumption: 1 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-50"
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-50.tgz
mv TCPcondis-PT-50 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-50, 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-152708743100236"
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 ;