Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r170-oct2-155297750300202.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is TCPcondis-PT-40, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-155297750300202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 4.0K Feb 12 19:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 19:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 9 02:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 9 02:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 102 Feb 24 15:06 GlobalProperties.txt
-rw-r--r-- 1 mcc users 340 Feb 24 15:06 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 01:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 01:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K Feb 4 22:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 4 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 1 21:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 21:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 10 17:31 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-00
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-01
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-02
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-03
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-04
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-05
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-06
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-07
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-08
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-09
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-10
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-11
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-12
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-13
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-14
FORMULA_NAME TCPcondis-PT-40-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553111911061

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ TCPcondis-PT-40 @ 3570 seconds

FORMULA TCPcondis-PT-40-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-40-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1773
rslt: Output for CTLCardinality @ TCPcondis-PT-40

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Mar 20 19:58:31 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(CLOSING <= 0)",
"processed_size": 14,
"rewrites": 17
},
"result":
{
"edges": 1010,
"markings": 1010,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= LASTACK)",
"processed_size": 14,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((3 <= xFINWAIT2) AND (1 <= xSYNSENT))))",
"processed_size": 46,
"rewrites": 15
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX((xFIN <= FINWAIT1))",
"processed_size": 22,
"rewrites": 15
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((CLOSED <= xLISTEN)))",
"processed_size": 27,
"rewrites": 15
},
"result":
{
"edges": 40,
"markings": 41,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((2 <= CLOSED) OR ((2 <= xESTAB) AND (SYNRCVD <= 0)))))",
"processed_size": 62,
"rewrites": 16
},
"result":
{
"edges": 39,
"markings": 40,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(xLISTEN <= 2)",
"processed_size": 14,
"rewrites": 17
},
"result":
{
"edges": 92,
"markings": 92,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((xFIN <= 2) OR (CLOSING <= LISTEN))",
"processed_size": 37,
"rewrites": 17
},
"result":
{
"edges": 408,
"markings": 408,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((xLASTACK <= xFINWAIT1) OR (LISTEN + 1 <= FINWAIT2))",
"processed_size": 54,
"rewrites": 17
},
"result":
{
"edges": 408,
"markings": 408,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (G ((((xCLOSEWAIT + 1 <= xSYNSENT) AND (CLOSING + 1 <= CLOSED)) OR (FINWAIT2 <= 2))))",
"processed_size": 88,
"rewrites": 15
},
"result":
{
"edges": 330,
"markings": 330,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 14
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A(EF((xFIN <= SYNRCVD)) U ((1 <= FINACK) AND (2 <= xFINWAIT1) AND (xESTAB + 1 <= TIMEWAIT)))",
"processed_size": 92,
"rewrites": 16
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 735,
"markings": 367,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 520
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 520
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(LISTEN <= xFIN)",
"processed_size": 16,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 624
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((FINWAIT1 <= 2) AND (xFIN <= 1) AND (xSYN <= SYNSENT))",
"processed_size": 55,
"rewrites": 17
},
"result":
{
"edges": 366,
"markings": 366,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 618
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 618
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= CLOSING)",
"processed_size": 14,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 824
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= xFINWAIT1)",
"processed_size": 16,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((TIMEWAIT <= CLOSED)))",
"processed_size": 28,
"rewrites": 16
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 824
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 824
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((CLOSED <= xSYNRCVD)))",
"processed_size": 28,
"rewrites": 15
},
"result":
{
"edges": 40,
"markings": 41,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1236
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((xSYNACK + 1 <= xFIN) OR (FINACK + 1 <= SYN))",
"processed_size": 47,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1236
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((xTIMEWAIT <= SYNACK)))",
"processed_size": 29,
"rewrites": 16
},
"result":
{
"edges": 166,
"markings": 167,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2473
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((xSYN <= TIMEWAIT) AND (3 <= LASTACK) AND (xCLOSING <= ESTAB))",
"processed_size": 63,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2473
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2473
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((FINACK <= xCLOSING) AND (xSYN <= 2))",
"processed_size": 38,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "(((FINACK <= 0) AND (xSYNRCVD <= 2)) OR (xCLOSED <= xLASTACK) OR ((1 <= FIN) AND (CLOSING <= xCLOSING) AND (FINWAIT2 <= xFIN) AND ((CLOSING <= SYNSENT) OR (1 <= SYNRCVD) OR ((2 <= xSYNACK) AND (1 <= FINWAIT1)))))",
"processed_size": 216,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G (((LISTEN <= 1) OR (FINWAIT2 <= 1))))",
"processed_size": 43,
"rewrites": 15
},
"result":
{
"edges": 142,
"markings": 142,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((FINACK <= xCLOSING) AND (xSYN <= 2))",
"processed_size": 38,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((xSYNACK <= 2)))",
"processed_size": 22,
"rewrites": 16
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23148,
"runtime": 1773.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G((E(F(**)) OR **))) : A(F(**)) : (** OR (A(G(**)) AND A(F(**)))) : (** AND (A(G(*)) AND **)) : A((E(F(**)) U **)) : (A(F(**)) AND **) : A(F(**)) : (E(F(**)) AND A(F(**))) : E(F(**)) : E(G(**)) : (E(G(*)) OR E(G(*))) : A(X(A(F(**)))) : A(F(**)) : (** OR (E(X(**)) AND E(F(**)))) : A(G(**)) : (** OR ((** AND A(G(**))) OR **))"
},
"net":
{
"arcs": 108,
"conflict_clusters": 10,
"places": 30,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "unknown no no no no no no yes yes yes yes no no yes no no ",
"value": "unknown no no no no no no yes yes yes yes no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 62/268435456 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: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: A (G ((E (F ((xCLOSING <= FINACK))) OR (TIMEWAIT <= xFINACK)))) : A (F (((3 <= xFIN) AND (LISTEN + 1 <= CLOSING)))) : A ((A (G ((xTIMEWAIT <= SYNACK))) U ((xSYN <= TIMEWAIT) AND (3 <= LASTACK) AND (xCLOSING <= ESTAB)))) : ((((FINACK <= xCLOSING) AND (xSYN <= 2)) AND NOT(E (F ((3 <= xSYNACK))))) AND (((FINACK <= 0) AND (xSYNRCVD <= 2)) OR (xCLOSED <= xLASTACK) OR ((1 <= FIN) AND (CLOSING <= xCLOSING) AND (FINWAIT2 <= xFIN) AND ((CLOSING <= SYNSENT) OR (1 <= SYNRCVD) OR ((2 <= xSYNACK) AND (1 <= FINWAIT1)))))) : A ((E (F ((xFIN <= SYNRCVD))) U ((1 <= FINACK) AND (2 <= xFINWAIT1) AND (xESTAB + 1 <= TIMEWAIT)))) : (A (F (((3 <= FINWAIT1) OR (2 <= xFIN) OR (SYNSENT + 1 <= xSYN)))) AND (LISTEN <= xFIN)) : A (F (((xFINWAIT1 + 1 <= xLASTACK) AND (FINWAIT2 <= LISTEN)))) : (E (F (A (F ((CLOSED <= xSYNRCVD))))) AND A (F (((xFIN <= xSYNACK) AND (SYN <= FINACK))))) : E (F ((CLOSED <= xLISTEN))) : E (G ((((xCLOSEWAIT + 1 <= xSYNSENT) AND (CLOSING + 1 <= CLOSED)) OR (FINWAIT2 <= 2)))) : (NOT(A (F (((1 <= FIN) AND (FINACK <= CLOSING))))) OR NOT(A (F (((2 <= LISTEN) AND (2 <= FINWAIT2)))))) : A (X (A (F ((1 <= CLOSING))))) : A (F (A (((xLISTEN <= xFIN) U (3 <= xLISTEN))))) : ((1 <= LASTACK) OR (E (X ((xFIN <= FINWAIT1))) AND E (F (((3 <= xFINWAIT2) AND (1 <= xSYNSENT)))))) : A (G (((2 <= CLOSED) OR ((2 <= xESTAB) AND (SYNRCVD <= 0))))) : (((3 <= xFINWAIT1) OR (((FINACK <= CLOSED) OR ((2 <= xLASTACK) AND (LISTEN <= xESTAB))) AND A (G ((TIMEWAIT <= CLOSED))))) OR (3 <= CLOSING))
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= CLOSING)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (CLOSING <= 0)
lola: processed formula length: 14
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= CLOSING)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 1010 markings, 1010 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= LASTACK) OR (E (X ((xFIN <= FINWAIT1))) AND E (F (((3 <= xFINWAIT2) AND (1 <= xSYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= LASTACK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= LASTACK)
lola: processed formula length: 14
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
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: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= xFINWAIT2) AND (1 <= xSYNSENT))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= xFINWAIT2) AND (1 <= xSYNSENT))))
lola: processed formula length: 46
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= xFINWAIT2) AND (1 <= xSYNSENT))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((xFIN <= FINWAIT1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((xFIN <= FINWAIT1))
lola: processed formula length: 22
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
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: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((CLOSED <= xLISTEN)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((CLOSED <= xLISTEN)))
lola: processed formula length: 27
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (CLOSED <= xLISTEN)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-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: 41 markings, 40 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= CLOSED) OR ((2 <= xESTAB) AND (SYNRCVD <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((2 <= CLOSED) OR ((2 <= xESTAB) AND (SYNRCVD <= 0)))))
lola: processed formula length: 62
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((CLOSED <= 1) AND ((xESTAB <= 1) OR (1 <= SYNRCVD)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= xLISTEN)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (xLISTEN <= 2)
lola: processed formula length: 14
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= xLISTEN)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 92 markings, 92 edges
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= xFIN) AND (LISTEN + 1 <= CLOSING))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((xFIN <= 2) OR (CLOSING <= LISTEN))
lola: processed formula length: 37
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= xFIN) AND (LISTEN + 1 <= CLOSING))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 408 markings, 408 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((xFINWAIT1 + 1 <= xLASTACK) AND (FINWAIT2 <= LISTEN))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((xLASTACK <= xFINWAIT1) OR (LISTEN + 1 <= FINWAIT2))
lola: processed formula length: 54
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 408 markings, 408 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((xCLOSEWAIT + 1 <= xSYNSENT) AND (CLOSING + 1 <= CLOSED)) OR (FINWAIT2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((xCLOSEWAIT + 1 <= xSYNSENT) AND (CLOSING + 1 <= CLOSED)) OR (FINWAIT2 <= 2))))
lola: processed formula length: 88
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 330 markings, 330 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((xCLOSING <= FINACK))) OR (TIMEWAIT <= xFINACK))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF((xCLOSING <= FINACK)) OR (TIMEWAIT <= xFINACK)))
lola: processed formula length: 55
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
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: 1472551 markings, 6638093 edges, 294510 markings/sec, 0 secs
lola: 2608971 markings, 12166473 edges, 227284 markings/sec, 5 secs
lola: 3660347 markings, 17409556 edges, 210275 markings/sec, 10 secs
lola: 4651627 markings, 22440164 edges, 198256 markings/sec, 15 secs
lola: 5635872 markings, 27451816 edges, 196849 markings/sec, 20 secs
lola: 6597117 markings, 32376522 edges, 192249 markings/sec, 25 secs
lola: 7534897 markings, 37222030 edges, 187556 markings/sec, 30 secs
lola: 8450182 markings, 41973478 edges, 183057 markings/sec, 35 secs
lola: 9335943 markings, 46618148 edges, 177152 markings/sec, 40 secs
lola: 10210735 markings, 51202014 edges, 174958 markings/sec, 45 secs
lola: 11092767 markings, 55802715 edges, 176406 markings/sec, 50 secs
lola: 11954934 markings, 60346547 edges, 172433 markings/sec, 55 secs
lola: 12818338 markings, 64886475 edges, 172681 markings/sec, 60 secs
lola: 13656689 markings, 69326896 edges, 167670 markings/sec, 65 secs
lola: 14521556 markings, 73858780 edges, 172973 markings/sec, 70 secs
lola: 15340194 markings, 78219254 edges, 163728 markings/sec, 75 secs
lola: 16139238 markings, 82510220 edges, 159809 markings/sec, 80 secs
lola: 16936432 markings, 86767196 edges, 159439 markings/sec, 85 secs
lola: 17727309 markings, 91007224 edges, 158175 markings/sec, 90 secs
lola: 18530390 markings, 95313762 edges, 160616 markings/sec, 95 secs
lola: 19332250 markings, 99612433 edges, 160372 markings/sec, 100 secs
lola: 20114446 markings, 103837157 edges, 156439 markings/sec, 105 secs
lola: 20874313 markings, 107960308 edges, 151973 markings/sec, 110 secs
lola: 21646507 markings, 112099720 edges, 154439 markings/sec, 115 secs
lola: 22406797 markings, 116188789 edges, 152058 markings/sec, 120 secs
lola: 23153916 markings, 120227922 edges, 149424 markings/sec, 125 secs
lola: 23876937 markings, 124203401 edges, 144604 markings/sec, 130 secs
lola: 24639173 markings, 128316333 edges, 152447 markings/sec, 135 secs
lola: 25365159 markings, 132290331 edges, 145197 markings/sec, 140 secs
lola: 26091960 markings, 136259795 edges, 145360 markings/sec, 145 secs
lola: 26817296 markings, 140209798 edges, 145067 markings/sec, 150 secs
lola: 27522806 markings, 144094321 edges, 141102 markings/sec, 155 secs
lola: 28244207 markings, 148039274 edges, 144280 markings/sec, 160 secs
lola: 28986973 markings, 152060820 edges, 148553 markings/sec, 165 secs
lola: 29722232 markings, 156045894 edges, 147052 markings/sec, 170 secs
lola: 30417959 markings, 159897789 edges, 139145 markings/sec, 175 secs
lola: 31126614 markings, 163778469 edges, 141731 markings/sec, 180 secs
lola: 31837427 markings, 167675498 edges, 142163 markings/sec, 185 secs
lola: 32530491 markings, 171471620 edges, 138613 markings/sec, 190 secs
lola: 33222957 markings, 175286144 edges, 138493 markings/sec, 195 secs
lola: 33932657 markings, 179174332 edges, 141940 markings/sec, 200 secs
lola: 34610515 markings, 182933777 edges, 135572 markings/sec, 205 secs
lola: 35312769 markings, 186789166 edges, 140451 markings/sec, 210 secs
lola: 35994654 markings, 190571497 edges, 136377 markings/sec, 215 secs
lola: 36656842 markings, 194269536 edges, 132438 markings/sec, 220 secs
lola: 37358510 markings, 198091587 edges, 140334 markings/sec, 225 secs
lola: 38033663 markings, 201817731 edges, 135031 markings/sec, 230 secs
lola: 38714307 markings, 205580313 edges, 136129 markings/sec, 235 secs
lola: 39372494 markings, 209263256 edges, 131637 markings/sec, 240 secs
lola: 40056211 markings, 213042586 edges, 136743 markings/sec, 245 secs
lola: 40711664 markings, 216704650 edges, 131091 markings/sec, 250 secs
lola: 41371332 markings, 220366801 edges, 131934 markings/sec, 255 secs
lola: 42031662 markings, 224040633 edges, 132066 markings/sec, 260 secs
lola: 42710118 markings, 227783850 edges, 135691 markings/sec, 265 secs
lola: 43377953 markings, 231491914 edges, 133567 markings/sec, 270 secs
lola: 44018518 markings, 235090356 edges, 128113 markings/sec, 275 secs
lola: 44678241 markings, 238756058 edges, 131945 markings/sec, 280 secs
lola: 45316232 markings, 242334389 edges, 127598 markings/sec, 285 secs
lola: 45999301 markings, 246097689 edges, 136614 markings/sec, 290 secs
lola: 46661794 markings, 249774649 edges, 132499 markings/sec, 295 secs
lola: 47312190 markings, 253412173 edges, 130079 markings/sec, 300 secs
lola: 47941749 markings, 256973707 edges, 125912 markings/sec, 305 secs
lola: 48587088 markings, 260575625 edges, 129068 markings/sec, 310 secs
lola: 49215635 markings, 264127174 edges, 125709 markings/sec, 315 secs
lola: 49851850 markings, 267676931 edges, 127243 markings/sec, 320 secs
lola: 50470392 markings, 271155646 edges, 123708 markings/sec, 325 secs
lola: 51084739 markings, 274609404 edges, 122869 markings/sec, 330 secs
lola: 51711115 markings, 278111077 edges, 125275 markings/sec, 335 secs
lola: 52301921 markings, 281457233 edges, 118161 markings/sec, 340 secs
lola: 52917580 markings, 284903508 edges, 123132 markings/sec, 345 secs
lola: 53547112 markings, 288417744 edges, 125906 markings/sec, 350 secs
lola: 54158319 markings, 291850497 edges, 122241 markings/sec, 355 secs
lola: 54782758 markings, 295326978 edges, 124888 markings/sec, 360 secs
lola: 55429386 markings, 298906522 edges, 129326 markings/sec, 365 secs
lola: 56053562 markings, 302383116 edges, 124835 markings/sec, 370 secs
lola: 56646746 markings, 305735225 edges, 118637 markings/sec, 375 secs
lola: 57237618 markings, 309074638 edges, 118174 markings/sec, 380 secs
lola: 57830975 markings, 312435641 edges, 118671 markings/sec, 385 secs
lola: 58446130 markings, 315870125 edges, 123031 markings/sec, 390 secs
lola: 59087935 markings, 319401139 edges, 128361 markings/sec, 395 secs
lola: 59677639 markings, 322730881 edges, 117941 markings/sec, 400 secs
lola: 60258253 markings, 326025114 edges, 116123 markings/sec, 405 secs
lola: 60818785 markings, 329233856 edges, 112106 markings/sec, 410 secs
lola: 61393616 markings, 332502002 edges, 114966 markings/sec, 415 secs
lola: 61953851 markings, 335693857 edges, 112047 markings/sec, 420 secs
lola: 62553346 markings, 339052841 edges, 119899 markings/sec, 425 secs
lola: 63151744 markings, 342407031 edges, 119680 markings/sec, 430 secs
lola: 63730339 markings, 345678561 edges, 115719 markings/sec, 435 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown unknown no unknown yes yes unknown no no yes no unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((xFIN <= SYNRCVD))) U ((1 <= FINACK) AND (2 <= xFINWAIT1) AND (xESTAB + 1 <= TIMEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EF((xFIN <= SYNRCVD)) U ((1 <= FINACK) AND (2 <= xFINWAIT1) AND (xESTAB + 1 <= TIMEWAIT)))
lola: processed formula length: 92
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
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: 367 markings, 735 edges
lola: ========================================
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((3 <= FINWAIT1) OR (2 <= xFIN) OR (SYNSENT + 1 <= xSYN)))) AND (LISTEN <= xFIN))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (LISTEN <= xFIN)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (LISTEN <= xFIN)
lola: processed formula length: 16
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
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: subprocess 11 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= FINWAIT1) OR (2 <= xFIN) OR (SYNSENT + 1 <= xSYN))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((FINWAIT1 <= 2) AND (xFIN <= 1) AND (xSYN <= SYNSENT))
lola: processed formula length: 55
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= FINWAIT1) OR (2 <= xFIN) OR (SYNSENT + 1 <= xSYN))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 366 markings, 366 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((FIN <= 0) OR (CLOSING + 1 <= FINACK)))) OR E (G (((LISTEN <= 1) OR (FINWAIT2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown no no no unknown yes yes unknown no no yes no unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 25456 KB
lola: time consumption: 1073 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown no unknown unknown no no no unknown yes yes unknown no no yes no unknown
lola: memory consumption: 25456 KB
lola: time consumption: 1074 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 618 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= xFINWAIT1) OR ((((FINACK <= CLOSED) OR ((2 <= xLASTACK) AND (LISTEN <= xESTAB))) AND A (G ((TIMEWAIT <= CLOSED)))) OR (3 <= CLOSING)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 618 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= CLOSING)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= CLOSING)
lola: processed formula length: 14
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
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: subprocess 13 will run for 824 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= xFINWAIT1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= xFINWAIT1)
lola: processed formula length: 16
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
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: subprocess 14 will run for 1236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((TIMEWAIT <= CLOSED)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((TIMEWAIT <= CLOSED)))
lola: processed formula length: 28
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (CLOSED + 1 <= TIMEWAIT)
lola: state equation task get result unparse finished id 0
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: 51 markings, 50 edges
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 824 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((CLOSED <= xSYNRCVD))) AND A (F (((xFIN <= xSYNACK) AND (SYN <= FINACK)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 824 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((CLOSED <= xSYNRCVD)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((CLOSED <= xSYNRCVD)))
lola: processed formula length: 28
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (CLOSED <= xSYNRCVD)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-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: 41 markings, 40 edges
lola: ========================================
lola: subprocess 14 will run for 1236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((xFIN <= xSYNACK) AND (SYN <= FINACK))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((xSYNACK + 1 <= xFIN) OR (FINACK + 1 <= SYN))
lola: processed formula length: 47
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((xSYN <= TIMEWAIT) AND (3 <= LASTACK) AND (xCLOSING <= ESTAB)) OR (A (G ((xTIMEWAIT <= SYNACK))) AND A (F (((xSYN <= TIMEWAIT) AND (3 <= LASTACK) AND (xCLOSING <= ESTAB))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((xTIMEWAIT <= SYNACK)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((xTIMEWAIT <= SYNACK)))
lola: processed formula length: 29
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: formula 0: (SYNACK + 1 <= xTIMEWAIT)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 167 markings, 166 edges
lola: ========================================
lola: subprocess 15 will run for 2473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((xSYN <= TIMEWAIT) AND (3 <= LASTACK) AND (xCLOSING <= ESTAB))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((xSYN <= TIMEWAIT) AND (3 <= LASTACK) AND (xCLOSING <= ESTAB))
lola: processed formula length: 63
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((FINACK <= xCLOSING) AND (xSYN <= 2)) AND (A (G ((xSYNACK <= 2))) AND (((FINACK <= 0) AND (xSYNRCVD <= 2)) OR (xCLOSED <= xLASTACK) OR ((1 <= FIN) AND (CLOSING <= xCLOSING) AND (FINWAIT2 <= xFIN) AND ((CLOSING <= SYNSENT) OR (1 <= SYNRCVD) OR ((2 <= xSYNACK) AND (1 <= FINWAIT1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FINACK <= xCLOSING) AND (xSYN <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FINACK <= xCLOSING) AND (xSYN <= 2))
lola: processed formula length: 38
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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: 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: (((FINACK <= 0) AND (xSYNRCVD <= 2)) OR (xCLOSED <= xLASTACK) OR ((1 <= FIN) AND (CLOSING <= xCLOSING) AND (FINWAIT2 <= xFIN) AND ((CLOSING <= SYNSENT) OR (1 <= SYNRCVD) OR ((2 <= xSYNACK) AND (1 <= FINWAIT1)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((FINACK <= 0) AND (xSYNRCVD <= 2)) OR (xCLOSED <= xLASTACK) OR ((1 <= FIN) AND (CLOSING <= xCLOSING) AND (FINWAIT2 <= xFIN) AND ((CLOSING <= SYNSENT) OR (1 <= SYNRCVD) OR ((2 <= xSYNACK) AND (1 <= FINWAIT1)))))
lola: processed formula length: 216
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 10 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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((xCLOSING <= FINACK))) OR (TIMEWAIT <= xFINACK))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF((xCLOSING <= FINACK)) OR (TIMEWAIT <= xFINACK)))
lola: processed formula length: 55
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
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: 1481251 markings, 6679852 edges, 296250 markings/sec, 0 secs
lola: 2672648 markings, 12486809 edges, 238279 markings/sec, 5 secs
lola: 3761328 markings, 17909539 edges, 217736 markings/sec, 10 secs
lola: 4771390 markings, 23028657 edges, 202012 markings/sec, 15 secs
lola: 5711825 markings, 27842206 edges, 188087 markings/sec, 20 secs
lola: 6685973 markings, 32837899 edges, 194830 markings/sec, 25 secs
lola: 7663457 markings, 37894579 edges, 195497 markings/sec, 30 secs
lola: 8621225 markings, 42866164 edges, 191554 markings/sec, 35 secs
lola: 9548179 markings, 47720390 edges, 185391 markings/sec, 40 secs
lola: 10462178 markings, 52509896 edges, 182800 markings/sec, 45 secs
lola: 11410768 markings, 57487736 edges, 189718 markings/sec, 50 secs
lola: 12337152 markings, 62370299 edges, 185277 markings/sec, 55 secs
lola: 13241438 markings, 67137632 edges, 180857 markings/sec, 60 secs
lola: 14160896 markings, 71989244 edges, 183892 markings/sec, 65 secs
lola: 15051690 markings, 76684845 edges, 178159 markings/sec, 70 secs
lola: 15873494 markings, 81077931 edges, 164361 markings/sec, 75 secs
lola: 16701920 markings, 85531822 edges, 165685 markings/sec, 80 secs
lola: 17531870 markings, 89966808 edges, 165990 markings/sec, 85 secs
lola: 18389720 markings, 94552668 edges, 171570 markings/sec, 90 secs
lola: 19260137 markings, 99220408 edges, 174083 markings/sec, 95 secs
lola: 20106144 markings, 103790112 edges, 169201 markings/sec, 100 secs
lola: 20963221 markings, 108404036 edges, 171415 markings/sec, 105 secs
lola: 21809769 markings, 112997889 edges, 169310 markings/sec, 110 secs
lola: 22678544 markings, 117628330 edges, 173755 markings/sec, 115 secs
lola: 23496132 markings, 122110253 edges, 163518 markings/sec, 120 secs
lola: 24319132 markings, 126577154 edges, 164600 markings/sec, 125 secs
lola: 25106719 markings, 130881438 edges, 157517 markings/sec, 130 secs
lola: 25897632 markings, 135209125 edges, 158183 markings/sec, 135 secs
lola: 26711129 markings, 139623387 edges, 162699 markings/sec, 140 secs
lola: 27498805 markings, 143960372 edges, 157535 markings/sec, 145 secs
lola: 28297699 markings, 148337071 edges, 159779 markings/sec, 150 secs
lola: 29125985 markings, 152806662 edges, 165657 markings/sec, 155 secs
lola: 29928291 markings, 157177628 edges, 160461 markings/sec, 160 secs
lola: 30704079 markings, 161467799 edges, 155158 markings/sec, 165 secs
lola: 31503781 markings, 165837552 edges, 159940 markings/sec, 170 secs
lola: 32283100 markings, 170141067 edges, 155864 markings/sec, 175 secs
lola: 33084252 markings, 174516448 edges, 160230 markings/sec, 180 secs
lola: 33882925 markings, 178894504 edges, 159735 markings/sec, 185 secs
lola: 34651721 markings, 183161179 edges, 153759 markings/sec, 190 secs
lola: 35432015 markings, 187461037 edges, 156059 markings/sec, 195 secs
lola: 36197624 markings, 191710683 edges, 153122 markings/sec, 200 secs
lola: 36982001 markings, 196020319 edges, 156875 markings/sec, 205 secs
lola: 37769775 markings, 200336856 edges, 157555 markings/sec, 210 secs
lola: 38522046 markings, 204495290 edges, 150454 markings/sec, 215 secs
lola: 39258892 markings, 208619485 edges, 147369 markings/sec, 220 secs
lola: 40004865 markings, 212770785 edges, 149195 markings/sec, 225 secs
lola: 40733287 markings, 216819897 edges, 145684 markings/sec, 230 secs
lola: 41472668 markings, 220917494 edges, 147876 markings/sec, 235 secs
lola: 42163784 markings, 224789162 edges, 138223 markings/sec, 240 secs
lola: 42898522 markings, 228827562 edges, 146948 markings/sec, 245 secs
lola: 43606840 markings, 232764282 edges, 141664 markings/sec, 250 secs
lola: 44293658 markings, 236645747 edges, 137364 markings/sec, 255 secs
lola: 44998969 markings, 240564926 edges, 141062 markings/sec, 260 secs
lola: 45688848 markings, 244398382 edges, 137976 markings/sec, 265 secs
lola: 46396656 markings, 248319124 edges, 141562 markings/sec, 270 secs
lola: 47104381 markings, 252252480 edges, 141545 markings/sec, 275 secs
lola: 47799173 markings, 256158378 edges, 138958 markings/sec, 280 secs
lola: 48491832 markings, 260030801 edges, 138532 markings/sec, 285 secs
lola: 49189377 markings, 263990384 edges, 139509 markings/sec, 290 secs
lola: 49912459 markings, 268019404 edges, 144616 markings/sec, 295 secs
lola: 50610062 markings, 271948856 edges, 139521 markings/sec, 300 secs
lola: 51314448 markings, 275907015 edges, 140877 markings/sec, 305 secs
lola: 52014854 markings, 279826037 edges, 140081 markings/sec, 310 secs
lola: 52712312 markings, 283753542 edges, 139492 markings/sec, 315 secs
lola: 53418323 markings, 287699613 edges, 141202 markings/sec, 320 secs
lola: 54109548 markings, 291576472 edges, 138245 markings/sec, 325 secs
lola: 54807139 markings, 295468389 edges, 139518 markings/sec, 330 secs
lola: 55533772 markings, 299475951 edges, 145327 markings/sec, 335 secs
lola: 56227813 markings, 303367038 edges, 138808 markings/sec, 340 secs
lola: 56908644 markings, 307211122 edges, 136166 markings/sec, 345 secs
lola: 57568665 markings, 310960105 edges, 132004 markings/sec, 350 secs
lola: 58250495 markings, 314772421 edges, 136366 markings/sec, 355 secs
lola: 58978915 markings, 318787731 edges, 145684 markings/sec, 360 secs
lola: 59659294 markings, 322628647 edges, 136076 markings/sec, 365 secs
lola: 60325224 markings, 326403117 edges, 133186 markings/sec, 370 secs
lola: 60986939 markings, 330186832 edges, 132343 markings/sec, 375 secs
lola: 61650975 markings, 333979821 edges, 132807 markings/sec, 380 secs
lola: 62351219 markings, 337892445 edges, 140049 markings/sec, 385 secs
lola: 63042673 markings, 341775474 edges, 138291 markings/sec, 390 secs
lola: 63718330 markings, 345609592 edges, 135131 markings/sec, 395 secs
lola: 64433171 markings, 349578158 edges, 142968 markings/sec, 400 secs
lola: 65129979 markings, 353488256 edges, 139362 markings/sec, 405 secs
lola: 65800525 markings, 357299546 edges, 134109 markings/sec, 410 secs
lola: 66495143 markings, 361191483 edges, 138924 markings/sec, 415 secs
lola: 67146192 markings, 364935347 edges, 130210 markings/sec, 420 secs
lola: 67813356 markings, 368727780 edges, 133433 markings/sec, 425 secs
lola: 68485744 markings, 372538085 edges, 134478 markings/sec, 430 secs
lola: 69152716 markings, 376331456 edges, 133394 markings/sec, 435 secs
lola: 69814236 markings, 380120810 edges, 132304 markings/sec, 440 secs
lola: 70542285 markings, 384135823 edges, 145610 markings/sec, 445 secs
lola: 71198371 markings, 387892464 edges, 131217 markings/sec, 450 secs
lola: 71843184 markings, 391604731 edges, 128963 markings/sec, 455 secs
lola: 72516872 markings, 395408363 edges, 134738 markings/sec, 460 secs
lola: 73167513 markings, 399133906 edges, 130128 markings/sec, 465 secs
lola: 73827305 markings, 402856738 edges, 131958 markings/sec, 470 secs
lola: 74482554 markings, 406568668 edges, 131050 markings/sec, 475 secs
lola: 75116682 markings, 410196578 edges, 126826 markings/sec, 480 secs
lola: 75742769 markings, 413792430 edges, 125217 markings/sec, 485 secs
lola: 76364447 markings, 417381505 edges, 124336 markings/sec, 490 secs
lola: 77013671 markings, 421053449 edges, 129845 markings/sec, 495 secs
lola: 77644745 markings, 424675096 edges, 126215 markings/sec, 500 secs
lola: 78300164 markings, 428378385 edges, 131084 markings/sec, 505 secs
lola: 78964676 markings, 432118703 edges, 132902 markings/sec, 510 secs
lola: 79579353 markings, 435676265 edges, 122935 markings/sec, 515 secs
lola: 80212312 markings, 439284805 edges, 126592 markings/sec, 520 secs
lola: 80864711 markings, 442978806 edges, 130480 markings/sec, 525 secs
lola: 81509096 markings, 446636659 edges, 128877 markings/sec, 530 secs
lola: 82177133 markings, 450380468 edges, 133607 markings/sec, 535 secs
lola: 82808504 markings, 453986662 edges, 126274 markings/sec, 540 secs
lola: 83451896 markings, 457625211 edges, 128678 markings/sec, 545 secs
lola: 84071201 markings, 461185026 edges, 123861 markings/sec, 550 secs
lola: 84694760 markings, 464757738 edges, 124712 markings/sec, 555 secs
lola: 85330735 markings, 468371576 edges, 127195 markings/sec, 560 secs
lola: 85961285 markings, 471970986 edges, 126110 markings/sec, 565 secs
lola: 86583928 markings, 475541229 edges, 124529 markings/sec, 570 secs
lola: 87190848 markings, 479053210 edges, 121384 markings/sec, 575 secs
lola: 87806379 markings, 482575836 edges, 123106 markings/sec, 580 secs
lola: 88416893 markings, 486051560 edges, 122103 markings/sec, 585 secs
lola: 89015093 markings, 489476295 edges, 119640 markings/sec, 590 secs
lola: 89618381 markings, 492935386 edges, 120658 markings/sec, 595 secs
lola: 90208106 markings, 496351811 edges, 117945 markings/sec, 600 secs
lola: 90818021 markings, 499836732 edges, 121983 markings/sec, 605 secs
lola: 91446273 markings, 503390374 edges, 125650 markings/sec, 610 secs
lola: 92047869 markings, 506899873 edges, 120319 markings/sec, 615 secs
lola: 92680584 markings, 510525904 edges, 126543 markings/sec, 620 secs
lola: 93288310 markings, 514051234 edges, 121545 markings/sec, 625 secs
lola: 93913061 markings, 517640172 edges, 124950 markings/sec, 630 secs
lola: 94538414 markings, 521222824 edges, 125071 markings/sec, 635 secs
lola: 95170172 markings, 524844398 edges, 126352 markings/sec, 640 secs
lola: 95796670 markings, 528443026 edges, 125300 markings/sec, 645 secs
lola: 96439766 markings, 532097258 edges, 128619 markings/sec, 650 secs
lola: 97049345 markings, 535641262 edges, 121916 markings/sec, 655 secs
lola: 97681466 markings, 539272040 edges, 126424 markings/sec, 660 secs
lola: 98311562 markings, 542860143 edges, 126019 markings/sec, 665 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (G (((FIN <= 0) OR (CLOSING + 1 <= FINACK)))) OR E (G (((LISTEN <= 1) OR (FINWAIT2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (((LISTEN <= 1) OR (FINWAIT2 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((LISTEN <= 1) OR (FINWAIT2 <= 1))))
lola: processed formula length: 43
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 142 markings, 142 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= LISTEN) AND (2 <= FINWAIT2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((FINACK <= xCLOSING) AND (xSYN <= 2)) AND (A (G ((xSYNACK <= 2))) AND (((FINACK <= 0) AND (xSYNRCVD <= 2)) OR (xCLOSED <= xLASTACK) OR ((1 <= FIN) AND (CLOSING <= xCLOSING) AND (FINWAIT2 <= xFIN) AND ((CLOSING <= SYNSENT) OR (1 <= SYNRCVD) OR ((2 <= xSYNACK) AND (1 <= FINWAIT1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((FINACK <= xCLOSING) AND (xSYN <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FINACK <= xCLOSING) AND (xSYN <= 2))
lola: processed formula length: 38
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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: ========================================
lola: ...considering subproblem: A (G ((xSYNACK <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((xSYNACK <= 2)))
lola: processed formula length: 22
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= xSYNACK)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-19-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no no no no no yes yes yes yes no no yes no no
lola:
preliminary result: unknown no no no no no no yes yes yes yes no no yes no no
sara: try reading problem file CTLCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic

lola: memory consumption: 23148 KB
lola: time consumption: 1773 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1553113708859

--------------------
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-40"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is TCPcondis-PT-40, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-oct2-155297750300202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-40.tgz
mv TCPcondis-PT-40 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;