Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r027-smll-155225120800067.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is CSRepetitions-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-155225120800067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 17K Feb 9 08:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 9 08:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 5 06:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 5 06:49 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 106 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 344 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 5.4K Feb 4 23:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 23:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 2 01:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K Feb 2 01:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jan 29 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Jan 29 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 71K 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 CSRepetitions-PT-03-CTLCardinality-00
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-01
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-02
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-03
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-04
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-05
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-06
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-07
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-08
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-09
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-10
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-11
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-12
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-13
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-14
FORMULA_NAME CSRepetitions-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552495863468

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ CSRepetitions-PT-03 @ 3570 seconds

FORMULA CSRepetitions-PT-03-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CSRepetitions-PT-03-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLCardinality @ CSRepetitions-PT-03

{
"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 13 16:51:03 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": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"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": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "((Client_Waiting_9 + Client_Waiting_8 + Client_Waiting_7 + Client_Waiting_6 + Client_Waiting_5 + Client_Waiting_4 + Client_Waiting_3 + Client_Waiting_2 + Client_Waiting_1 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3) OR (3 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3))",
"processed_size": 1370,
"rewrites": 61
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((2 <= RequestBuffer_1) AND (1 <= Client_Sending_1) AND (1 <= Server_Anwering_6_2))",
"processed_size": 83,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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 ((Client_Sending_3 <= RequestBufferSlots)))",
"processed_size": 48,
"rewrites": 61
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": "EF(AX((Client_Sending_6 + 1 <= Server_Anwering_6_2)))",
"processed_size": 53,
"rewrites": 61
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 436,
"markings": 260,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": "AG(EX(((Server_Anwering_9_2 <= Server_Anwering_7_2) OR (Server_Anwering_2_1 <= Server_Waiting_2))))",
"processed_size": 100,
"rewrites": 61
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 436,
"markings": 260,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((1 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3)))",
"processed_size": 69,
"rewrites": 61
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 509
},
"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": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 27,
"visible_transitions": 0
},
"processed": "A (G ((3 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3)))",
"processed_size": 606,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"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": 594
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "AF(EG(((Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 <= Client_Waiting_9 + Client_Waiting_8 + Client_Waiting_7 + Client_Waiting_6 + Client_Waiting_5 + Client_Waiting_4 + Client_Waiting_3 + Client_Waiting_2 + Client_Waiting_1) AND (1 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3))))",
"processed_size": 1378,
"rewrites": 61
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 26,
"markings": 13,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "AF(EG((Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9)))",
"processed_size": 764,
"rewrites": 61
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": "(Server_Anwering_6_1 <= Server_Anwering_6_2)",
"processed_size": 44,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"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": "((Client_Sending_8 <= 0) AND ((Client_Sending_6 <= 0) OR (RequestBuffer_8 <= 0)))",
"processed_size": 82,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((RequestBuffer_2 + 1 <= Server_Anwering_1_2)))",
"processed_size": 52,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((Server_Anwering_8_1 + 1 <= Server_Anwering_7_2)))",
"processed_size": 56,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"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": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 2) AND (Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= 2))",
"processed_size": 234,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(2 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3)",
"processed_size": 61,
"rewrites": 59
},
"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": 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": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "E (G ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3)))",
"processed_size": 764,
"rewrites": 60
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 72
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (G ((3 <= Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9)))",
"processed_size": 183,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 45
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 41,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "E (F (((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= RequestBufferSlots) AND (RequestBufferSlots <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (2 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3))))",
"processed_size": 879,
"rewrites": 60
},
"result":
{
"edges": 13,
"markings": 14,
"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": 3,
"problems": 3
},
"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": 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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(2 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3)",
"processed_size": 61,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= RequestBufferSlots) AND (3 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (RequestBufferSlots <= 0))",
"processed_size": 176,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 2) AND (Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= 2))",
"processed_size": 234,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "E (G ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3)))",
"processed_size": 764,
"rewrites": 60
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 72
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 41,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "E (F (((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= RequestBufferSlots) AND (RequestBufferSlots <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (2 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3))))",
"processed_size": 879,
"rewrites": 60
},
"result":
{
"edges": 13,
"markings": 14,
"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": 3,
"problems": 3
},
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (G ((3 <= Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9)))",
"processed_size": 183,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 45
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 76,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "((((Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= RequestBufferSlots) OR (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3))) OR (Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3))",
"processed_size": 1624,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 27332,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((** OR (E(G(**)) AND **)) AND E(F(**))) : A(G(**)) : A(G(**)) : A(F(E(G(**)))) : FALSE : (** AND ((** AND A(F(**))) OR (E(G(**)) OR **))) : E(X(E(F(**)))) : A(F(E(G(**)))) : ((A(X(**)) AND **) OR A(G(**))) : A(G(E(X(**)))) : (A(G(*)) OR E(G(*))) : FALSE : TRUE : ((** AND A(F(**))) OR *) : E(F(A(X(*)))) : FALSE"
},
"net":
{
"arcs": 279,
"conflict_clusters": 11,
"places": 58,
"places_significant": 46,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "yes no no no no no yes yes no no no no yes yes yes no ",
"value": "yes no no no no no yes yes no no no no yes yes yes 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: 139/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1856
lola: finding significant places
lola: 58 places, 81 transitions, 46 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: LP says that atomic proposition is always false: (2 <= Client_Sending_7)
lola: LP says that atomic proposition is always false: (3 <= Server_Anwering_7_3)
lola: LP says that atomic proposition is always false: (2 <= Server_Anwering_7_1)
lola: LP says that atomic proposition is always false: (3 <= Client_Waiting_3)
lola: LP says that atomic proposition is always false: (2 <= Server_Waiting_3)
lola: LP says that atomic proposition is always false: (2 <= Server_Anwering_1_2)
lola: LP says that atomic proposition is always false: (3 <= Server_Anwering_1_1)
lola: LP says that atomic proposition is always false: (3 <= Client_Sending_6)
lola: LP says that atomic proposition is always false: (3 <= Server_Anwering_3_2)
lola: LP says that atomic proposition is always false: (2 <= Client_Waiting_7)
lola: LP says that atomic proposition is always false: (3 <= Server_Anwering_4_2)
lola: LP says that atomic proposition is always false: (2 <= Server_Anwering_2_1)
lola: LP says that atomic proposition is always false: (2 <= Client_Sending_9)
lola: ((((((Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= RequestBufferSlots) OR (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3))) OR (Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3)) OR (E (G ((3 <= Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9))) AND ((2 <= Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9) AND (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= Client_Waiting_9 + Client_Waiting_8 + Client_Waiting_7 + Client_Waiting_6 + Client_Waiting_5 + Client_Waiting_4 + Client_Waiting_3 + Client_Waiting_2 + Client_Waiting_1) AND (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 + 1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9)))) AND E (F (((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= RequestBufferSlots) AND (RequestBufferSlots <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (2 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3))))) : A (G ((1 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3))) : (A (G ((3 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3))) OR E (F (()))) : A (F (E (G (((Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 <= Client_Waiting_9 + Client_Waiting_8 + Client_Waiting_7 + Client_Waiting_6 + Client_Waiting_5 + Client_Waiting_4 + Client_Waiting_3 + Client_Waiting_2 + Client_Waiting_1) AND (1 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3)))))) : E (F (A (F ((1 <= 0))))) : ((2 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND ((((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 2) AND (Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= 2)) AND A (F ((3 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3)))) OR (E (G ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3))) OR ((Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= RequestBufferSlots) AND (3 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (RequestBufferSlots <= 0))))) : E (F (E (X (((Client_Waiting_9 + Client_Waiting_8 + Client_Waiting_7 + Client_Waiting_6 + Client_Waiting_5 + Client_Waiting_4 + Client_Waiting_3 + Client_Waiting_2 + Client_Waiting_1 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3) OR (3 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3)))))) : A (F (E (G ((Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9))))) : ((E (F (())) OR (A (X ((RequestBuffer_2 <= Server_Anwering_6_3))) AND ((2 <= RequestBuffer_1) AND (1 <= Client_Sending_1) AND (1 <= Server_Anwering_6_2)))) OR NOT(NOT(A (G ((Client_Sending_3 <= RequestBufferSlots)))))) : A (G (E (X (((Server_Anwering_9_2 <= Server_Anwering_7_2) OR (Server_Anwering_2_1 <= Server_Waiting_2)))))) : (E (F ((2 <= Server_Anwering_7_1))) OR NOT((E (F ((Server_Anwering_7_2 <= Server_Anwering_8_1))) AND A (F ((Server_Anwering_1_2 <= RequestBuffer_2)))))) : (((() AND E (G ((Client_Sending_1 <= Client_Sending_6)))) OR A (G ((RequestBuffer_2 <= RequestBuffer_3)))) AND (E (F (((Client_Sending_8 <= Client_Waiting_7) AND (Client_Waiting_3 <= Server_Anwering_3_1)))) AND E (((Client_Waiting_7 <= Client_Waiting_3) U (2 <= Server_Waiting_3))))) : ((2 <= Server_Anwering_1_2) OR NOT(E (F ((3 <= Server_Anwering_1_1))))) : (((Server_Anwering_6_1 <= Server_Anwering_6_2) AND (A (F ((1 <= Server_Anwering_7_3))) AND ())) OR NOT((E (F ((2 <= Client_Waiting_7))) OR ((1 <= Client_Sending_8) OR ((1 <= Client_Sending_6) AND (1 <= RequestBuffer_8)))))) : E (F (NOT(E (X ((Server_Anwering_6_2 <= Client_Sending_6)))))) : E ((((RequestBuffer_6 <= RequestBuffer_3)) U E (F ((2 <= Client_Sending_9)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 59 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((Client_Waiting_9 + Client_Waiting_8 + Client_Waiting_7 + Client_Waiting_6 + Client_Waiting_5 + Client_Waiting_4 + Client_Waiting_3 + Client_Waiting_2 + Client_Waiting_1 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((Client_Waiting_9 + Client_Waiting_8 + Client_Waiting_7 + Client_Waiting_6 + Client_Waiting_5 + Client_Waiting_4 + Client_Waiting_3 + Client_Waiting_2 + Client_Waiting_1 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server... (shortened)
lola: processed formula length: 1370
lola: 61 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 /EXEF)
lola: state space: using reachability graph (EXef 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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (X ((RequestBuffer_2 <= Server_Anwering_6_3))) AND ((2 <= RequestBuffer_1) AND (1 <= Client_Sending_1) AND (1 <= Server_Anwering_6_2))) OR A (G ((Client_Sending_3 <= RequestBufferSlots))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= RequestBuffer_1) AND (1 <= Client_Sending_1) AND (1 <= Server_Anwering_6_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= RequestBuffer_1) AND (1 <= Client_Sending_1) AND (1 <= Server_Anwering_6_2))
lola: processed formula length: 83
lola: 59 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: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Client_Sending_3 <= RequestBufferSlots)))
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 ((Client_Sending_3 <= RequestBufferSlots)))
lola: processed formula length: 48
lola: 61 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: (RequestBufferSlots + 1 <= Client_Sending_3)
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
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((Client_Sending_6 + 1 <= Server_Anwering_6_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((Client_Sending_6 + 1 <= Server_Anwering_6_2)))
lola: processed formula length: 53
lola: 61 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 260 markings, 436 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((Server_Anwering_9_2 <= Server_Anwering_7_2) OR (Server_Anwering_2_1 <= Server_Waiting_2))))))
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(((Server_Anwering_9_2 <= Server_Anwering_7_2) OR (Server_Anwering_2_1 <= Server_Waiting_2))))
lola: processed formula length: 100
lola: 61 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: 260 markings, 436 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3)))
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 ((1 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3)))
lola: processed formula length: 69
lola: 61 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: (Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= 0)
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-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwerin... (shortened)
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 ((3 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwerin... (shortened)
lola: processed formula length: 606
lola: 61 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: (Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 <= 2)
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-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwer... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_... (shortened)
lola: processed formula length: 1378
lola: 61 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: 13 markings, 26 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anweri... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3... (shortened)
lola: processed formula length: 764
lola: 61 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((Server_Anwering_6_1 <= Server_Anwering_6_2) AND A (F ((1 <= Server_Anwering_7_3)))) OR ((Client_Sending_8 <= 0) AND ((Client_Sending_6 <= 0) OR (RequestBuffer_8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Server_Anwering_6_1 <= Server_Anwering_6_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Server_Anwering_6_1 <= Server_Anwering_6_2)
lola: processed formula length: 44
lola: 59 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 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Client_Sending_8 <= 0) AND ((Client_Sending_6 <= 0) OR (RequestBuffer_8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Client_Sending_8 <= 0) AND ((Client_Sending_6 <= 0) OR (RequestBuffer_8 <= 0)))
lola: processed formula length: 82
lola: 59 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((Server_Anwering_8_1 + 1 <= Server_Anwering_7_2))) OR E (G ((RequestBuffer_2 + 1 <= Server_Anwering_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((RequestBuffer_2 + 1 <= Server_Anwering_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((RequestBuffer_2 + 1 <= Server_Anwering_1_2)))
lola: processed formula length: 52
lola: 60 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 is not possibly preserved.
lola: 1 markings, 0 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: (Server_Anwering_1_2 <= RequestBuffer_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Server_Anwering_8_1 + 1 <= Server_Anwering_7_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 ((Server_Anwering_8_1 + 1 <= Server_Anwering_7_2)))
lola: processed formula length: 56
lola: 61 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: (Server_Anwering_7_2 <= Server_Anwering_8_1)
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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND ((((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 2) AND (Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= 2)) AND A (F ((3 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwerin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 2) AND (Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 2) AND (Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= 2))
lola: processed formula length: 234
lola: 59 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
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3)
lola: processed formula length: 61
lola: 59 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: 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: E (G ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anw... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anw... (shortened)
lola: processed formula length: 764
lola: 60 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: (Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + 1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9)
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-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((((Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= RequestBufferSlots) OR (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= Server_Anwering_8_3 + Ser... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((3 <= Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9)))
lola: processed formula length: 183
lola: 60 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: (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= 2)
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 is not possibly preserved.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: Child process aborted or communication problem between parent and child process
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= RequestBufferSlots) AND (RequestBufferSlots <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (2 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server... (shortened)
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 (((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= RequestBufferSlots) AND (RequestBufferSlots <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (2 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server... (shortened)
lola: processed formula length: 879
lola: 60 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: ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= RequestBufferSlots) AND (RequestBufferSlots <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (2 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: sara: try reading problem file CTLCardinality-15-0.sara.
state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
sara: error: lola: : 204 : error======================================== near '
TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ========================================
lola: ...considering subproblem: ((2 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND ((((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 2) AND (Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= 2)) AND A (F ((3 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwerin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (2 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3)
lola: processed formula length: 61
lola: 59 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: ========================================
lola: ...considering subproblem: ((Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= RequestBufferSlots) AND (3 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (RequestBufferSlots <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= RequestBufferSlots) AND (3 <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (RequestBufferSlots <= 0))
lola: processed formula length: 176
lola: 59 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: ========================================
lola: ========================================
lola: ...considering subproblem: ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 2) AND (Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= 2) AND (Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3 <= 2))
lola: processed formula length: 234
lola: 59 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
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anw... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anw... (shortened)
lola: processed formula length: 764
lola: 60 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: (Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + 1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9)
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: state equation: calling and running sara
sara: try reading problem file CTLCardinality-19-0.sara.
sara: error: :204: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((((Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= RequestBufferSlots) OR (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= Server_Anwering_8_3 + Ser... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= RequestBufferSlots) AND (RequestBufferSlots <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (2 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server... (shortened)
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 (((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= RequestBufferSlots) AND (RequestBufferSlots <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (2 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server... (shortened)
lola: processed formula length: 879
lola: 60 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: ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= RequestBufferSlots) AND (RequestBufferSlots <= Server_Waiting_1 + Server_Waiting_2 + Server_Waiting_3) AND (2 <= Server_Anwering_8_3 + Server_Anwering_8_2 + Server_Anwering_8_1 + Server_Anwering_7_3 + Server_Anwering_7_2 + Server_Anwering_7_1 + Server_Anwering_6_3 + Server_Anwering_6_2 + Server_Anwering_6_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.
sara: error: :204: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((3 <= Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9)))
lola: processed formula length: 183
lola: 60 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 is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= RequestBufferSlots) OR (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= Server_Anwering_8_3 + Serve... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= RequestBufferSlots) OR (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 <= Server_Anwering_8_3 + Serve... (shortened)
lola: processed formula length: 1624
lola: 59 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no yes yes no no no no yes yes yes no
lola:
preliminary result: yes no no no no no yes yes no no no no yes yes yes no
lola: memory consumption: 27332 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552495868693

--------------------
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="CSRepetitions-PT-03"
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-3957"
echo " Executing tool lola"
echo " Input is CSRepetitions-PT-03, 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 r027-smll-155225120800067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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