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-155297750300184.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-30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-155297750300184
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 4.3K Feb 12 19:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 12 19:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 9 02:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.4K Feb 5 01:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K 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 7.9K Feb 4 22:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 1 21:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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-30-CTLCardinality-00
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-01
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-02
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-03
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-04
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-05
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-06
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-07
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-08
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-09
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-10
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-11
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-12
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-13
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-14
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553110946730

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

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

FORMULA TCPcondis-PT-30-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA TCPcondis-PT-30-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA TCPcondis-PT-30-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA TCPcondis-PT-30-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2637
rslt: Output for CTLCardinality @ TCPcondis-PT-30

{
"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:42:26 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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(AF((xSYNSENT + 1 <= xSYNRCVD)))",
"processed_size": 34,
"rewrites": 30
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 370,
"markings": 367,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"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": "(LISTEN <= 0)",
"processed_size": 13,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((3 <= LISTEN) AND (2 <= xLISTEN)) OR (TIMEWAIT <= 2))",
"processed_size": 56,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 275
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(CLOSEWAIT + 1 <= xSYNSENT)",
"processed_size": 27,
"rewrites": 32
},
"result":
{
"edges": 160,
"markings": 160,
"produced_by": "state space /EFEG",
"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_from_all_states",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"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": "AF(AX((xTIMEWAIT + 1 <= FINACK)))",
"processed_size": 33,
"rewrites": 30
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 277,
"markings": 277,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 275
},
"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": "((TIMEWAIT + 1 <= SYNSENT) AND (LISTEN <= 2))",
"processed_size": 45,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 300
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "E (F (((xSYNSENT + 1 <= LASTACK) AND (xSYNACK + 1 <= xSYN))))",
"processed_size": 61,
"rewrites": 29
},
"result":
{
"edges": 198,
"markings": 190,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 300
},
"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": "(xSYNSENT <= xSYNACK)",
"processed_size": 21,
"rewrites": 31
},
"result":
{
"edges": 72,
"markings": 72,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 330
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(SYNACK <= xFINACK)",
"processed_size": 19,
"rewrites": 31
},
"result":
{
"edges": 70342,
"markings": 26225,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 367
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((2 <= xLASTACK)))",
"processed_size": 23,
"rewrites": 29
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"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": 413
},
"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": "(SYN <= 1)",
"processed_size": 10,
"rewrites": 31
},
"result":
{
"edges": 103,
"markings": 103,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 472
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": "E (G (((xCLOSEWAIT <= 2) OR (xTIMEWAIT + 1 <= SYNACK) OR (3 <= xCLOSED))))",
"processed_size": 76,
"rewrites": 29
},
"result":
{
"edges": 255,
"markings": 255,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 550
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"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": "AF(E((CLOSED <= xLISTEN) U (3 <= xSYN)))",
"processed_size": 40,
"rewrites": 30
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 1529,
"markings": 761,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 660
},
"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 ((xFIN <= 1)))",
"processed_size": 19,
"rewrites": 30
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 826
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((CLOSING <= LISTEN) AND (1 <= xLISTEN) AND (SYNRCVD + 1 <= xTIMEWAIT))",
"processed_size": 71,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 826
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G (((LISTEN <= 0) OR (FINWAIT1 <= 2))))",
"processed_size": 43,
"rewrites": 30
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1101
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"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": "(((xFIN + 1 <= xFINWAIT1) AND (xFINACK <= 0)) OR (2 <= xCLOSEWAIT) OR (3 <= xLISTEN) OR (2 <= xSYNRCVD))",
"processed_size": 107,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1101
},
"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": "(xCLOSING <= xFINWAIT2)",
"processed_size": 23,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1652
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= xLASTACK) OR (CLOSING <= xTIMEWAIT)) AND ((xSYNSENT <= SYNACK) OR (xFINWAIT1 <= FINWAIT1)))))",
"processed_size": 109,
"rewrites": 29
},
"result":
{
"edges": 276,
"markings": 276,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1652
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (((((2 <= xSYNSENT) OR (SYNRCVD <= FINWAIT2)) AND (xSYNRCVD <= xCLOSED)) U ((3 <= xFINACK) AND (3 <= xLISTEN) AND ((ESTAB <= xFINWAIT2) OR (xFINWAIT2 <= LASTACK)))))",
"processed_size": 169,
"rewrites": 31
},
"result":
{
"edges": 214128,
"markings": 77595,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3304
},
"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 ((xSYNRCVD + 1 <= xFINWAIT1)))",
"processed_size": 35,
"rewrites": 29
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"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 ((xSYNRCVD + 1 <= xFINWAIT1)))",
"processed_size": 35,
"rewrites": 29
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"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"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G ((FINWAIT1 <= xSYNSENT)))",
"processed_size": 30,
"rewrites": 29
},
"result":
{
"edges": 75,
"markings": 75,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23572,
"runtime": 909.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(*)) OR *) : E(X(A(F(*)))) : A(G(E(X(**)))) : (A(G(A(F(**)))) AND (E(G(**)) OR (** OR (A(X(**)) AND **)))) : E((** U **)) : E(F(**)) : ((E(F(**)) OR E(F(**))) AND E(G(**))) : A(F(E((** U **)))) : A(F(A(X(**)))) : (E(F(*)) OR (** AND (A(X(**)) AND **))) : (E(G(**)) AND **) : (E(X(E(G(**)))) AND (A(F(*)) AND A(X(*)))) : (A(G(*)) OR *) : A(F(**)) : A(X(A(F(**)))) : E(G(**))"
},
"net":
{
"arcs": 108,
"conflict_clusters": 10,
"places": 30,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "no no unknown no yes yes yes no no yes yes no no no yes yes ",
"value": "no no unknown no yes yes yes no no yes yes no no no yes yes "
},
"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: NOT((E (F (((1 <= LISTEN) AND (3 <= FINWAIT1)))) AND (((xFINWAIT1 <= xFIN) OR (1 <= xFINACK)) AND (xCLOSEWAIT <= 1) AND (xLISTEN <= 2) AND (xSYNRCVD <= 1)))) : E (X (NOT(E (G ((xSYNRCVD <= xSYNSENT)))))) : A (G (E (X (((xCLOSING <= CLOSING) OR (LASTACK <= xSYNSENT)))))) : (A (G (A (F ((xSYNSENT <= CLOSEWAIT))))) AND ((E (G ((xSYN <= SYNACK))) OR (((3 <= LISTEN) AND (2 <= xLISTEN)) OR (TIMEWAIT <= 2))) OR (A (X ((xSYN <= TIMEWAIT))) AND (LISTEN <= 0)))) : E (((((2 <= xSYNSENT) OR (SYNRCVD <= FINWAIT2)) AND (xSYNRCVD <= xCLOSED)) U ((3 <= xFINACK) AND (3 <= xLISTEN) AND ((ESTAB <= xFINWAIT2) OR (xFINWAIT2 <= LASTACK))))) : E ((() U E (F ((2 <= xLASTACK))))) : ((E (F (((2 <= CLOSEWAIT) OR (3 <= xESTAB)))) OR E (F ((xSYNRCVD + 1 <= xFINWAIT1)))) AND E (G ((FINWAIT1 <= xSYNSENT)))) : A (F (E (((CLOSED <= xLISTEN) U (3 <= xSYN))))) : A (F (A (X ((xTIMEWAIT + 1 <= FINACK))))) : (NOT(A (G (((LASTACK <= xSYNSENT) OR (xSYN <= xSYNACK))))) OR (((1 <= LASTACK) OR (FINACK + 1 <= xLASTACK) OR (FINWAIT2 + 1 <= xLASTACK)) AND (A (X ((LISTEN <= ESTAB))) AND ((TIMEWAIT + 1 <= SYNSENT) AND (LISTEN <= 2))))) : (E (G ((((1 <= xLASTACK) OR (CLOSING <= xTIMEWAIT)) AND ((xSYNSENT <= SYNACK) OR (xFINWAIT1 <= FINWAIT1))))) AND (xCLOSING <= xFINWAIT2)) : (E (X (E (G ((SYNACK <= SYNRCVD))))) AND NOT((E (G ((xSYNSENT <= xSYNACK))) OR E (X ((1 <= FINACK)))))) : NOT((E (F ((2 <= xFIN))) AND ((LISTEN + 1 <= CLOSING) OR (xLISTEN <= 0) OR (xTIMEWAIT <= SYNRCVD)))) : A (F (A (F ((2 <= SYN))))) : A (X (A (F ((xFINACK + 1 <= SYNACK))))) : E (G (((xCLOSEWAIT <= 2) OR (xTIMEWAIT + 1 <= SYNACK) OR (3 <= xCLOSED))))
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((xSYNSENT + 1 <= xSYNRCVD)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF((xSYNSENT + 1 <= xSYNRCVD)))
lola: processed formula length: 34
lola: 30 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 367 markings, 370 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((xCLOSING <= CLOSING) OR (LASTACK <= xSYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((xCLOSING <= CLOSING) OR (LASTACK <= xSYNSENT))))
lola: processed formula length: 57
lola: 30 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1513001 markings, 5366422 edges, 302600 markings/sec, 0 secs
lola: 2680621 markings, 9874673 edges, 233524 markings/sec, 5 secs
lola: 3741650 markings, 14097941 edges, 212206 markings/sec, 10 secs
lola: 4709329 markings, 18085596 edges, 193536 markings/sec, 15 secs
lola: 5675994 markings, 22047040 edges, 193333 markings/sec, 20 secs
lola: 6637615 markings, 25983227 edges, 192324 markings/sec, 25 secs
lola: 7558134 markings, 29804140 edges, 184104 markings/sec, 30 secs
lola: 8447292 markings, 33547896 edges, 177832 markings/sec, 35 secs
lola: 9312203 markings, 37210427 edges, 172982 markings/sec, 40 secs
lola: 10158609 markings, 40817906 edges, 169281 markings/sec, 45 secs
lola: 10974743 markings, 44349967 edges, 163227 markings/sec, 50 secs
lola: 11790982 markings, 47867740 edges, 163248 markings/sec, 55 secs
lola: 12363731 markings, 50311603 edges, 114550 markings/sec, 60 secs
lola: 12898674 markings, 52629830 edges, 106989 markings/sec, 65 secs
lola: 13438401 markings, 54951010 edges, 107945 markings/sec, 70 secs
lola: 13996118 markings, 57316601 edges, 111543 markings/sec, 75 secs
lola: 14518793 markings, 59587111 edges, 104535 markings/sec, 80 secs
lola: 15032189 markings, 61834981 edges, 102679 markings/sec, 85 secs
lola: 15573120 markings, 64167066 edges, 108186 markings/sec, 90 secs
lola: 16131004 markings, 66558734 edges, 111577 markings/sec, 95 secs
lola: 16664973 markings, 68874556 edges, 106794 markings/sec, 100 secs
lola: 17169922 markings, 71120784 edges, 100990 markings/sec, 105 secs
lola: 17704055 markings, 73447104 edges, 106827 markings/sec, 110 secs
lola: 18224491 markings, 75743745 edges, 104087 markings/sec, 115 secs
lola: 18757895 markings, 78076032 edges, 106681 markings/sec, 120 secs
lola: 19285038 markings, 80392635 edges, 105429 markings/sec, 125 secs
lola: 19820596 markings, 82732259 edges, 107112 markings/sec, 130 secs
lola: 20337281 markings, 85030643 edges, 103337 markings/sec, 135 secs
lola: 20851969 markings, 87320481 edges, 102938 markings/sec, 140 secs
lola: 21371602 markings, 89624976 edges, 103927 markings/sec, 145 secs
lola: 21894974 markings, 91943965 edges, 104674 markings/sec, 150 secs
lola: 22417367 markings, 94258267 edges, 104479 markings/sec, 155 secs
lola: 22925955 markings, 96518069 edges, 101718 markings/sec, 160 secs
lola: 23412979 markings, 98709163 edges, 97405 markings/sec, 165 secs
lola: 23918453 markings, 100960077 edges, 101095 markings/sec, 170 secs
lola: 24419300 markings, 103205648 edges, 100169 markings/sec, 175 secs
lola: 24905915 markings, 105398917 edges, 97323 markings/sec, 180 secs
lola: 25477741 markings, 107926630 edges, 114365 markings/sec, 185 secs
lola: 26043654 markings, 110469810 edges, 113183 markings/sec, 190 secs
lola: 26593526 markings, 112905436 edges, 109974 markings/sec, 195 secs
lola: 27136800 markings, 115330329 edges, 108655 markings/sec, 200 secs
lola: 27714357 markings, 117934632 edges, 115511 markings/sec, 205 secs
lola: 28281147 markings, 120487078 edges, 113358 markings/sec, 210 secs
lola: 28830773 markings, 123002342 edges, 109925 markings/sec, 215 secs
lola: 29384657 markings, 125530449 edges, 110777 markings/sec, 220 secs
lola: 29955345 markings, 128102681 edges, 114138 markings/sec, 225 secs
lola: 30521376 markings, 130643333 edges, 113206 markings/sec, 230 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6781728 KB
lola: time consumption: 241 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 unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6843044 KB
lola: time consumption: 244 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 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((xSYNSENT <= CLOSEWAIT))))) AND (E (G ((xSYN <= SYNACK))) OR ((((3 <= LISTEN) AND (2 <= xLISTEN)) OR (TIMEWAIT <= 2)) OR (A (X ((xSYN <= TIMEWAIT))) AND (LISTEN <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (LISTEN <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (LISTEN <= 0)
lola: processed formula length: 13
lola: 28 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 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((3 <= LISTEN) AND (2 <= xLISTEN)) OR (TIMEWAIT <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= LISTEN) AND (2 <= xLISTEN)) OR (TIMEWAIT <= 2))
lola: processed formula length: 56
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((xSYNSENT <= CLOSEWAIT)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (CLOSEWAIT + 1 <= xSYNSENT)
lola: processed formula length: 27
lola: 32 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
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: (xSYNSENT <= CLOSEWAIT)
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-4-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (CLOSEWAIT + 1 <= xSYNSENT)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 160 markings, 160 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((xTIMEWAIT + 1 <= FINACK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX((xTIMEWAIT + 1 <= FINACK)))
lola: processed formula length: 33
lola: 30 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 277 markings, 277 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((xSYNSENT + 1 <= LASTACK) AND (xSYNACK + 1 <= xSYN)))) OR (((1 <= LASTACK) OR (FINACK + 1 <= xLASTACK) OR (FINWAIT2 + 1 <= xLASTACK)) AND (A (X ((LISTEN <= ESTAB))) AND ((TIMEWAIT + 1 <= SYNSENT) AND (LISTEN <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
sara: try reading problem file CTLCardinality-4-0.sara.
lola: ========================================
lola: ...considering subproblem: ((TIMEWAIT + 1 <= SYNSENT) AND (LISTEN <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((TIMEWAIT + 1 <= SYNSENT) AND (LISTEN <= 2))
lola: processed formula length: 45
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((xSYNSENT + 1 <= LASTACK) AND (xSYNACK + 1 <= xSYN))))
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 (((xSYNSENT + 1 <= LASTACK) AND (xSYNACK + 1 <= xSYN))))
lola: processed formula length: 61
lola: 29 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: ((xSYNSENT + 1 <= LASTACK) AND (xSYNACK + 1 <= xSYN))
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-5-0.sara
lola:
state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 190 markings, 198 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (G ((SYNACK <= SYNRCVD))))) AND (A (F ((xSYNACK + 1 <= xSYNSENT))) AND A (X ((FINACK <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((xSYNACK + 1 <= xSYNSENT)))
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:788
lola: processed formula: (xSYNSENT <= xSYNACK)
lola: processed formula length: 21
lola: 31 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 72 markings, 72 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (xSYNACK + 1 <= xSYNSENT)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((xFINACK + 1 <= SYNACK)))))
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: (SYNACK <= xFINACK)
lola: processed formula length: 19
lola: 31 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: (xFINACK + 1 <= SYNACK)
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-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate eventually occurs from all successors.
lola: 26225 markings, 70342 edges
lola: state equation 0: solution produced
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= xLASTACK)))
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 ((2 <= xLASTACK)))
lola: processed formula length: 23
lola: 29 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: (2 <= xLASTACK)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= SYN)))
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: (SYN <= 1)
lola: processed formula length: 10
lola: 31 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: (2 <= SYN)
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: 103 markings, 103 edges
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((xCLOSEWAIT <= 2) OR (xTIMEWAIT + 1 <= SYNACK) OR (3 <= xCLOSED))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((xCLOSEWAIT <= 2) OR (xTIMEWAIT + 1 <= SYNACK) OR (3 <= xCLOSED))))
lola: processed formula length: 76
lola: 29 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= xCLOSEWAIT) AND (SYNACK <= xTIMEWAIT) AND (xCLOSED <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
sara: try reading problem file CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 255 markings, 255 edges
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((CLOSED <= xLISTEN) U (3 <= xSYN)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E((CLOSED <= xLISTEN) U (3 <= xSYN)))
lola: processed formula length: 40
lola: 30 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: 761 markings, 1529 edges
lola: ========================================
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((xFIN <= 1))) OR ((CLOSING <= LISTEN) AND (1 <= xLISTEN) AND (SYNRCVD + 1 <= xTIMEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((xFIN <= 1)))
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 ((xFIN <= 1)))
lola: processed formula length: 19
lola: 30 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 12 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((CLOSING <= LISTEN) AND (1 <= xLISTEN) AND (SYNRCVD + 1 <= xTIMEWAIT))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((CLOSING <= LISTEN) AND (1 <= xLISTEN) AND (SYNRCVD + 1 <= xTIMEWAIT))
lola: processed formula length: 71
lola: 28 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 12 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((LISTEN <= 0) OR (FINWAIT1 <= 2)))) OR (((xFIN + 1 <= xFINWAIT1) AND (xFINACK <= 0)) OR (2 <= xCLOSEWAIT) OR (3 <= xLISTEN) OR (2 <= xSYNRCVD)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((LISTEN <= 0) OR (FINWAIT1 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((LISTEN <= 0) OR (FINWAIT1 <= 2))))
lola: processed formula length: 43
lola: 30 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((xFIN + 1 <= xFINWAIT1) AND (xFINACK <= 0)) OR (2 <= xCLOSEWAIT) OR (3 <= xLISTEN) OR (2 <= xSYNRCVD))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((xFIN + 1 <= xFINWAIT1) AND (xFINACK <= 0)) OR (2 <= xCLOSEWAIT) OR (3 <= xLISTEN) OR (2 <= xSYNRCVD))
lola: processed formula length: 107
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 5 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: subprocess 13 will run for 1101 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((1 <= xLASTACK) OR (CLOSING <= xTIMEWAIT)) AND ((xSYNSENT <= SYNACK) OR (xFINWAIT1 <= FINWAIT1))))) AND (xCLOSING <= xFINWAIT2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (xCLOSING <= xFINWAIT2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (xCLOSING <= xFINWAIT2)
lola: processed formula length: 23
lola: 28 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 14 will run for 1652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= xLASTACK) OR (CLOSING <= xTIMEWAIT)) AND ((xSYNSENT <= SYNACK) OR (xFINWAIT1 <= FINWAIT1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= xLASTACK) OR (CLOSING <= xTIMEWAIT)) AND ((xSYNSENT <= SYNACK) OR (xFINWAIT1 <= FINWAIT1)))))
lola: processed formula length: 109
lola: 29 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: 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: The predicate is possibly preserved.
lola: 276 markings, 276 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((xLASTACK <= 0) AND (xTIMEWAIT + 1 <= CLOSING)) OR ((SYNACK + 1 <= xSYNSENT) AND (FINWAIT1 + 1 <= xFINWAIT1)))
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: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((2 <= xSYNSENT) OR (SYNRCVD <= FINWAIT2)) AND (xSYNRCVD <= xCLOSED)) U ((3 <= xFINACK) AND (3 <= xLISTEN) AND ((ESTAB <= xFINWAIT2) OR (xFINWAIT2 <= LASTACK)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((2 <= xSYNSENT) OR (SYNRCVD <= FINWAIT2)) AND (xSYNRCVD <= xCLOSED)) U ((3 <= xFINACK) AND (3 <= xLISTEN) AND ((ESTAB <= xFINWAIT2) OR (xFINWAIT2 <= LASTACK)))))
lola: processed formula length: 169
lola: 31 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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 <= xFINACK) AND (3 <= xLISTEN) AND ((ESTAB <= xFINWAIT2) OR (xFINWAIT2 <= LASTACK)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 77595 markings, 214128 edges
lola: ========================================
lola: subprocess 15 will run for 3304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F (((2 <= CLOSEWAIT) OR (3 <= xESTAB)))) OR E (F ((xSYNRCVD + 1 <= xFINWAIT1)))) AND E (G ((FINWAIT1 <= xSYNSENT))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((xSYNRCVD + 1 <= xFINWAIT1)))
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 ((xSYNRCVD + 1 <= xFINWAIT1)))
lola: processed formula length: 35
lola: 29 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: (xSYNRCVD + 1 <= xFINWAIT1)
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: yes
lola: produced by: state space
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
sara: try reading problem file CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((xCLOSING <= CLOSING) OR (LASTACK <= xSYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((xCLOSING <= CLOSING) OR (LASTACK <= xSYNSENT))))
lola: processed formula length: 57
lola: 30 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1325535 markings, 4655644 edges, 265107 markings/sec, 0 secs
lola: 2329190 markings, 8494878 edges, 200731 markings/sec, 5 secs
lola: 3252289 markings, 12150511 edges, 184620 markings/sec, 10 secs
lola: 4116361 markings, 15630528 edges, 172814 markings/sec, 15 secs
lola: 4937876 markings, 19004619 edges, 164303 markings/sec, 20 secs
lola: 5759524 markings, 22386844 edges, 164330 markings/sec, 25 secs
lola: 6600825 markings, 25825396 edges, 168260 markings/sec, 30 secs
lola: 7405520 markings, 29183888 edges, 160939 markings/sec, 35 secs
lola: 8189775 markings, 32483865 edges, 156851 markings/sec, 40 secs
lola: 8962253 markings, 35730247 edges, 154496 markings/sec, 45 secs
lola: 9716015 markings, 38941217 edges, 150752 markings/sec, 50 secs
lola: 10447507 markings, 42072934 edges, 146298 markings/sec, 55 secs
lola: 11162811 markings, 45163333 edges, 143061 markings/sec, 60 secs
lola: 11865583 markings, 48190213 edges, 140554 markings/sec, 65 secs
lola: 12588702 markings, 51279779 edges, 144624 markings/sec, 70 secs
lola: 13305707 markings, 54366109 edges, 143401 markings/sec, 75 secs
lola: 14027766 markings, 57457448 edges, 144412 markings/sec, 80 secs
lola: 14719701 markings, 60463938 edges, 138387 markings/sec, 85 secs
lola: 15401441 markings, 63429097 edges, 136348 markings/sec, 90 secs
lola: 16118979 markings, 66506292 edges, 143508 markings/sec, 95 secs
lola: 16794007 markings, 69448354 edges, 135006 markings/sec, 100 secs
lola: 17457568 markings, 72386622 edges, 132712 markings/sec, 105 secs
lola: 18138288 markings, 75368272 edges, 136144 markings/sec, 110 secs
lola: 18809719 markings, 78305606 edges, 134286 markings/sec, 115 secs
lola: 19468299 markings, 81204114 edges, 131716 markings/sec, 120 secs
lola: 20125948 markings, 84093803 edges, 131530 markings/sec, 125 secs
lola: 20754539 markings, 86886185 edges, 125718 markings/sec, 130 secs
lola: 21380437 markings, 89662727 edges, 125180 markings/sec, 135 secs
lola: 21995680 markings, 92403731 edges, 123049 markings/sec, 140 secs
lola: 22611218 markings, 95127375 edges, 123108 markings/sec, 145 secs
lola: 23211006 markings, 97804922 edges, 119958 markings/sec, 150 secs
lola: 23807503 markings, 100464272 edges, 119299 markings/sec, 155 secs
lola: 24391879 markings, 103087504 edges, 116875 markings/sec, 160 secs
lola: 24978101 markings, 105706325 edges, 117244 markings/sec, 165 secs
lola: 25570466 markings, 108340145 edges, 118473 markings/sec, 170 secs
lola: 26145366 markings, 110914649 edges, 114980 markings/sec, 175 secs
lola: 26723280 markings, 113490603 edges, 115583 markings/sec, 180 secs
lola: 27299845 markings, 116056548 edges, 115313 markings/sec, 185 secs
lola: 27861153 markings, 118580420 edges, 112262 markings/sec, 190 secs
lola: 28402129 markings, 121045212 edges, 108195 markings/sec, 195 secs
lola: 28945313 markings, 123515680 edges, 108637 markings/sec, 200 secs
lola: 29486038 markings, 125985149 edges, 108145 markings/sec, 205 secs
lola: 30051610 markings, 128520731 edges, 113114 markings/sec, 210 secs
lola: 30606961 markings, 131028167 edges, 111070 markings/sec, 215 secs
lola: 31175692 markings, 133551539 edges, 113746 markings/sec, 220 secs
lola: 31706297 markings, 135977487 edges, 106121 markings/sec, 225 secs
lola: 32262815 markings, 138478178 edges, 111304 markings/sec, 230 secs
lola: 32802747 markings, 140935034 edges, 107986 markings/sec, 235 secs
lola: 33345145 markings, 143385821 edges, 108480 markings/sec, 240 secs
lola: 33906209 markings, 145890453 edges, 112213 markings/sec, 245 secs
lola: 34482985 markings, 148435189 edges, 115355 markings/sec, 250 secs
lola: 34995838 markings, 150782334 edges, 102571 markings/sec, 255 secs
lola: 35543738 markings, 153253878 edges, 109580 markings/sec, 260 secs
lola: 36087099 markings, 155721695 edges, 108672 markings/sec, 265 secs
lola: 36659060 markings, 158265200 edges, 114392 markings/sec, 270 secs
lola: 37197404 markings, 160709265 edges, 107669 markings/sec, 275 secs
lola: 37678963 markings, 162926918 edges, 96312 markings/sec, 280 secs
lola: 38191837 markings, 165242885 edges, 102575 markings/sec, 285 secs
lola: 38702356 markings, 167557030 edges, 102104 markings/sec, 290 secs
lola: 39216770 markings, 169884417 edges, 102883 markings/sec, 295 secs
lola: 39737670 markings, 172246960 edges, 104180 markings/sec, 300 secs
lola: 40308513 markings, 174769598 edges, 114169 markings/sec, 305 secs
lola: 40833761 markings, 177174134 edges, 105050 markings/sec, 310 secs
lola: 41379303 markings, 179645235 edges, 109108 markings/sec, 315 secs
lola: 41889804 markings, 182008933 edges, 102100 markings/sec, 320 secs
lola: 42404415 markings, 184385884 edges, 102922 markings/sec, 325 secs
lola: 42898508 markings, 186698671 edges, 98819 markings/sec, 330 secs
lola: 43420154 markings, 189095510 edges, 104329 markings/sec, 335 secs
lola: 43942169 markings, 191494164 edges, 104403 markings/sec, 340 secs
lola: 44475788 markings, 193915786 edges, 106724 markings/sec, 345 secs
lola: 44984173 markings, 196275639 edges, 101677 markings/sec, 350 secs
lola: 45491166 markings, 198632034 edges, 101399 markings/sec, 355 secs
lola: 46004291 markings, 200990144 edges, 102625 markings/sec, 360 secs
lola: 46515632 markings, 203357446 edges, 102268 markings/sec, 365 secs
lola: 47017580 markings, 205681990 edges, 100390 markings/sec, 370 secs
lola: 47550801 markings, 208095461 edges, 106644 markings/sec, 375 secs
lola: 48071947 markings, 210483027 edges, 104229 markings/sec, 380 secs
lola: 48591997 markings, 212873443 edges, 104010 markings/sec, 385 secs
lola: 49082141 markings, 215163973 edges, 98029 markings/sec, 390 secs
lola: 49591060 markings, 217503795 edges, 101784 markings/sec, 395 secs
lola: 50082133 markings, 219801319 edges, 98215 markings/sec, 400 secs
lola: 50595198 markings, 222159410 edges, 102613 markings/sec, 405 secs
lola: 51087878 markings, 224461526 edges, 98536 markings/sec, 410 secs
lola: 51595383 markings, 226806762 edges, 101501 markings/sec, 415 secs
lola: 52086337 markings, 229084466 edges, 98191 markings/sec, 420 secs
lola: 52570054 markings, 231358438 edges, 96743 markings/sec, 425 secs
lola: 53043569 markings, 233596106 edges, 94703 markings/sec, 430 secs
lola: 53592278 markings, 236062433 edges, 109742 markings/sec, 435 secs
lola: 54073132 markings, 238332136 edges, 96171 markings/sec, 440 secs
lola: 54591742 markings, 240715764 edges, 103722 markings/sec, 445 secs
lola: 55140696 markings, 243196501 edges, 109791 markings/sec, 450 secs
lola: 55618142 markings, 245443707 edges, 95489 markings/sec, 455 secs
lola: 56107008 markings, 247724483 edges, 97773 markings/sec, 460 secs
lola: 56594778 markings, 250007281 edges, 97554 markings/sec, 465 secs
lola: 57105879 markings, 252389278 edges, 102220 markings/sec, 470 secs
lola: 57605267 markings, 254728345 edges, 99878 markings/sec, 475 secs
lola: 58128501 markings, 257135072 edges, 104647 markings/sec, 480 secs
lola: 58668832 markings, 259600757 edges, 108066 markings/sec, 485 secs
lola: 59187463 markings, 261983092 edges, 103726 markings/sec, 490 secs
lola: 59722230 markings, 264422121 edges, 106953 markings/sec, 495 secs
lola: 60206995 markings, 266709010 edges, 96953 markings/sec, 500 secs
lola: 60718510 markings, 269083557 edges, 102303 markings/sec, 505 secs
lola: 61198039 markings, 271336196 edges, 95906 markings/sec, 510 secs
lola: 61671097 markings, 273561690 edges, 94612 markings/sec, 515 secs
lola: 62163341 markings, 275857322 edges, 98449 markings/sec, 520 secs
lola: 62639931 markings, 278105179 edges, 95318 markings/sec, 525 secs
lola: 63140997 markings, 280419019 edges, 100213 markings/sec, 530 secs
lola: 63614286 markings, 282650710 edges, 94658 markings/sec, 535 secs
lola: 64074796 markings, 284842783 edges, 92102 markings/sec, 540 secs
lola: 64545854 markings, 287064882 edges, 94212 markings/sec, 545 secs
lola: 65032722 markings, 289345200 edges, 97374 markings/sec, 550 secs
lola: 65514683 markings, 291594909 edges, 96392 markings/sec, 555 secs
lola: 66015372 markings, 293905809 edges, 100138 markings/sec, 560 secs
lola: 66496780 markings, 296154671 edges, 96282 markings/sec, 565 secs
lola: 66952680 markings, 298329733 edges, 91180 markings/sec, 570 secs
lola: 67422485 markings, 300541925 edges, 93961 markings/sec, 575 secs
lola: 67898806 markings, 302781224 edges, 95264 markings/sec, 580 secs
lola: 68403255 markings, 305094331 edges, 100890 markings/sec, 585 secs
lola: 68860268 markings, 307272015 edges, 91403 markings/sec, 590 secs
lola: 69362895 markings, 309573625 edges, 100525 markings/sec, 595 secs
lola: 69820431 markings, 311748864 edges, 91507 markings/sec, 600 secs
lola: 70300202 markings, 313994183 edges, 95954 markings/sec, 605 secs
lola: 70752897 markings, 316155293 edges, 90539 markings/sec, 610 secs
lola: 71228794 markings, 318394735 edges, 95179 markings/sec, 615 secs
lola: 71733899 markings, 320708775 edges, 101021 markings/sec, 620 secs
lola: 72261173 markings, 323120968 edges, 105455 markings/sec, 625 secs
lola: 72383698 markings, 323700926 edges, 24505 markings/sec, 630 secs
lola: 72397628 markings, 323766645 edges, 2786 markings/sec, 635 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((E (F (((2 <= CLOSEWAIT) OR (3 <= xESTAB)))) OR E (F ((xSYNRCVD + 1 <= xFINWAIT1)))) AND E (G ((FINWAIT1 <= xSYNSENT))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((xSYNRCVD + 1 <= xFINWAIT1)))
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 ((xSYNRCVD + 1 <= xFINWAIT1)))
lola: processed formula length: 35
lola: 29 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: (xSYNRCVD + 1 <= xFINWAIT1)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((FINWAIT1 <= xSYNSENT)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((FINWAIT1 <= xSYNSENT)))
lola: processed formula length: 30
lola: 29 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: 75 markings, 75 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (xSYNSENT + 1 <= FINWAIT1)
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: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no yes yes yes no no yes yes no no no yes yes
lola:
preliminary result: no no unknown no yes yes yes no no yes yes no no no yes yes
lola: ========================================
lola: memory consumption: 23572 KB
lola: time consumption: 909 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1553111879553

--------------------
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-30"
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-30, 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-155297750300184"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-30.tgz
mv TCPcondis-PT-30 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 ;