About the Execution of LoLA for TCPcondis-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
176.730 | 1022.00 | 1032.00 | 77.70 | TFTTFFTTFFTTTFFF | 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 184K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 12K 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.6K 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.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4K 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 19K 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 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 24K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is TCPcondis-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743000185
=====================================================================
--------------------
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-10-CTLCardinality-00
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-01
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-02
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-03
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-04
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-05
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-06
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-07
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-08
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-09
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-10
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-11
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-12
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-13
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-14
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527235376134
info: Time: 3600 - MCC
===========================================================================================
prep: translating TCPcondis-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TCPcondis-PT-10 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ TCPcondis-PT-10 @ 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-10-CTLCardinality.task
lola: always true
lola: E (F (A (X ((1 <= xTIMEWAIT))))) : A (F ((((xSYNACK + 1 <= SYN) OR (CLOSEWAIT <= 1)) AND (CLOSEWAIT + 1 <= SYNRCVD)))) : A (F (((SYNRCVD + 1 <= ESTAB) OR (1 <= ESTAB) OR ((1 <= xESTAB) AND (2 <= SYNRCVD) AND (xSYNRCVD <= xLISTEN))))) : (E (X (E (G ((1 <= xLASTACK))))) OR NOT(A (F (((3 <= xCLOSING) AND (3 <= FIN)))))) : A (G ((((FIN <= 1) OR (xESTAB + 1 <= xSYN)) AND ((SYN + 1 <= xCLOSED) OR (CLOSED <= 0))))) : A ((((xFINWAIT2 + 1 <= TIMEWAIT) OR (xSYNRCVD <= 2)) U A (G ((3 <= xESTAB))))) : NOT(A (F (A (G ((1 <= SYNRCVD)))))) : ((A (X ((3 <= xFINWAIT1))) OR E (F (((CLOSED <= SYNACK) AND (xSYNACK <= SYNACK))))) OR ((3 <= CLOSING) AND ((xLASTACK <= 0)) AND ((3 <= xFINACK) OR (xCLOSEWAIT <= FINWAIT2) OR ((1 <= xCLOSEWAIT) AND (ESTAB <= xSYNACK)) OR ((2 <= SYNACK) AND (1 <= ESTAB) AND ((1 <= SYN) OR (FIN <= SYNRCVD)))))) : ((A (((xCLOSED <= xFINWAIT1) U (LASTACK <= xSYNACK))) AND A (F ((CLOSEWAIT + 1 <= LISTEN)))) OR (2 <= CLOSING)) : (E ((((xFINWAIT2 <= CLOSEWAIT) OR (xFINWAIT2 <= CLOSEWAIT)) U ((2 <= ESTAB) AND (SYNRCVD <= CLOSEWAIT)))) AND A (F ((3 <= xTIMEWAIT)))) : A (X (E (G ((xCLOSING + 1 <= xCLOSED))))) : (E (F ((3 <= CLOSEWAIT))) AND (A (X (((xSYNACK <= SYN) OR (FINWAIT2 <= xSYNACK)))) OR (xSYNACK <= xSYNRCVD))) : (E (F ((2 <= xFINWAIT1))) AND (E (X ((xFINWAIT2 <= xCLOSED))) OR A (G ((CLOSED <= 2))))) : (A (F ((SYN + 1 <= xCLOSEWAIT))) AND A (F (((CLOSEWAIT <= 1) AND (3 <= xCLOSEWAIT))))) : A (F (A (X (((2 <= LISTEN) OR (xCLOSED <= xLISTEN)))))) : A (G ((A (F ((FINWAIT2 <= CLOSEWAIT))) OR E (X ((2 <= LISTEN))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= xTIMEWAIT)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((1 <= xTIMEWAIT)))
lola: processed formula length: 30
lola: 11 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 385 markings, 584 edges
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-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: (E (X (E (G ((1 <= xLASTACK))))) OR E (G (((xCLOSING <= 2) OR (FIN <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((xCLOSING <= 2) OR (FIN <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((xCLOSING <= 2) OR (FIN <= 2))))
lola: processed formula length: 40
lola: 9 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 151 markings, 151 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((3 <= xFINWAIT1))) OR (E (F (((CLOSED <= SYNACK) AND (xSYNACK <= SYNACK)))) OR ((3 <= CLOSING) AND ((xLASTACK <= 0)) AND ((3 <= xFINACK) OR (xCLOSEWAIT <= FINWAIT2) OR ((1 <= xCLOSEWAIT) AND (ESTAB <= xSYNACK)) OR ((2 <= SYNACK) AND (1 <= ESTAB) AND ((1 <= SYN) OR (FIN <= SYNRCVD)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= xFINWAIT1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((3 <= xFINWAIT1))
lola: processed formula length: 20
lola: 10 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((CLOSED <= SYNACK) AND (xSYNACK <= SYNACK))))
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 <= SYNACK) AND (xSYNACK <= SYNACK))))
lola: processed formula length: 52
lola: 10 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.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 <= SYNACK) AND (xSYNACK <= SYNACK))
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: 11 markings, 10 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
state equation: write sara problem file to TCPcondis-PT-10-CTLCardinality-3-0.sara
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-7 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: A (X (E (G ((xCLOSING + 1 <= xCLOSED)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U (xCLOSED <= xCLOSING))))
lola: processed formula length: 40
lola: 12 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 286 markings, 289 edges
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-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: (E (F ((3 <= CLOSEWAIT))) AND (A (X (((xSYNACK <= SYN) OR (FINWAIT2 <= xSYNACK)))) OR (xSYNACK <= xSYNRCVD)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= 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 ((3 <= CLOSEWAIT)))
lola: processed formula length: 24
lola: 10 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.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 <= CLOSEWAIT)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (xSYNACK <= xSYNRCVD)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (xSYNACK <= xSYNRCVD)
lola: processed formula length: 21
lola: 9 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-11 TRUE 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 ((2 <= xFINWAIT1))) AND (E (X ((xFINWAIT2 <= xCLOSED))) OR A (G ((CLOSED <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= xFINWAIT1)))
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 <= xFINWAIT1)))
lola: processed formula length: 24
lola: 10 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.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 <= xFINWAIT1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: state equation: write sara problem file to TCPcondis-PT-10-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((CLOSED <= 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 ((CLOSED <= 2)))
lola: processed formula length: 21
lola: 11 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.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: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (3 <= CLOSED)
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((xFINWAIT2 <= xCLOSED)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((xFINWAIT2 <= xCLOSED))
lola: processed formula length: 26
lola: 10 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-12 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 (F (A (X (((2 <= LISTEN) OR (xCLOSED <= xLISTEN))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX(((2 <= LISTEN) OR (xCLOSED <= xLISTEN))))
lola: processed formula length: 54
lola: 11 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 152 markings, 152 edges
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-14 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 ((A (F ((FINWAIT2 <= CLOSEWAIT))) OR E (X ((2 <= LISTEN))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (FINWAIT2 <= CLOSEWAIT))) AND NOT(EX((2 <= LISTEN))))))
lola: processed formula length: 82
lola: 13 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 108 markings, 155 edges
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-15 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 ((((FIN <= 1) OR (xESTAB + 1 <= xSYN)) AND ((SYN + 1 <= xCLOSED) OR (CLOSED <= 0)))))
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 ((((FIN <= 1) OR (xESTAB + 1 <= xSYN)) AND ((SYN + 1 <= xCLOSED) OR (CLOSED <= 0)))))
lola: processed formula length: 92
lola: 11 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.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 <= FIN) AND (xSYN <= xESTAB)) OR ((xCLOSED <= SYN) AND (1 <= CLOSED)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-10-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file TCPcondis-PT-10-CTLCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((xSYNACK + 1 <= SYN) OR (CLOSEWAIT <= 1)) AND (CLOSEWAIT + 1 <= SYNRCVD))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (((SYN <= xSYNACK) AND (2 <= CLOSEWAIT)) OR (SYNRCVD <= CLOSEWAIT))
lola: processed formula length: 68
lola: 11 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 49 markings, 49 edges
FORMULA TCPcondis-PT-10-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: sara: place or transition ordering is non-deterministic
subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((SYNRCVD + 1 <= ESTAB) OR (1 <= ESTAB) OR ((1 <= xESTAB) AND (2 <= SYNRCVD) AND (xSYNRCVD <= xLISTEN)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((ESTAB <= SYNRCVD) AND (ESTAB <= 0) AND ((xESTAB <= 0) OR (SYNRCVD <= 1) OR (xLISTEN + 1 <= xSYNRCVD)))
lola: processed formula length: 106
lola: 11 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 43579 markings, 286350 edges
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-2 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: A ((((xFINWAIT2 + 1 <= TIMEWAIT) OR (xSYNRCVD <= 2)) U A (G ((3 <= xESTAB)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(((xFINWAIT2 + 1 <= TIMEWAIT) OR (xSYNRCVD <= 2)) U NOT(E(TRUE U (xESTAB <= 2))))
lola: processed formula length: 83
lola: 12 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 27 markings, 53 edges
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-5 FALSE 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 (G (E (F ((SYNRCVD <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (SYNRCVD <= 0)
lola: processed formula length: 14
lola: 10 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 108 markings, 108 edges
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-6 TRUE 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: (A (F ((SYN + 1 <= xCLOSEWAIT))) AND A (F (((CLOSEWAIT <= 1) AND (3 <= xCLOSEWAIT)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((CLOSEWAIT <= 1) AND (3 <= xCLOSEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((2 <= CLOSEWAIT) OR (xCLOSEWAIT <= 2))
lola: processed formula length: 40
lola: 11 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 45 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-13 FALSE 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 ((((xFINWAIT2 <= CLOSEWAIT) OR (xFINWAIT2 <= CLOSEWAIT)) U ((2 <= ESTAB) AND (SYNRCVD <= CLOSEWAIT)))) AND A (F ((3 <= xTIMEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= xTIMEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (xTIMEWAIT <= 2)
lola: processed formula length: 16
lola: 11 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 131 markings, 131 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-9 FALSE 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: ((A (((xCLOSED <= xFINWAIT1) U (LASTACK <= xSYNACK))) AND A (F ((CLOSEWAIT + 1 <= LISTEN)))) OR (2 <= CLOSING))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= CLOSING)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= CLOSING)
lola: processed formula length: 14
lola: 9 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((xCLOSED <= xFINWAIT1) U (LASTACK <= xSYNACK)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((xCLOSED <= xFINWAIT1) U (LASTACK <= xSYNACK)))
lola: processed formula length: 51
lola: 13 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (((xCLOSED <= xFINWAIT1) U (LASTACK <= xSYNACK))) AND A (F ((CLOSEWAIT + 1 <= LISTEN)))) OR (2 <= CLOSING))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (2 <= CLOSING)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= CLOSING)
lola: processed formula length: 14
lola: 9 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((CLOSEWAIT + 1 <= LISTEN)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (LISTEN <= CLOSEWAIT)
lola: processed formula length: 21
lola: 11 rewrites
lola: closed formula file TCPcondis-PT-10-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 189 markings, 189 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA TCPcondis-PT-10-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes no no yes yes no no yes yes yes no no no
lola:
preliminary result: yes no yes yes no no yes yes no no yes yes yes no no no
lola: memory consumption: 25136 KB
lola: time consumption: 1 seconds
BK_STOP 1527235377156
--------------------
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-10"
export BK_EXAMINATION="CTLCardinality"
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-10.tgz
mv TCPcondis-PT-10 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-10, 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 r172-smll-152708743000185"
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 '
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 ;