About the Execution of LoLA for ClientsAndServers-PT-N0100P0
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.240 | 1432700.00 | 1337411.00 | 7401.40 | TTFFT?TFFTTTFTFT | normal |
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-155225121200355.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 ClientsAndServers-PT-N0100P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-155225121200355
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.4K Feb 9 08:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 9 08:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 07:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 5 07:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 115 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 353 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 23:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K Feb 4 22:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 2 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 2 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 29 15:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 29 15:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N0100P0-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552640870555
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ClientsAndServers-PT-N0100P0 @ 3570 seconds
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2137
rslt: Output for CTLCardinality @ ClientsAndServers-PT-N0100P0
{
"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": "Fri Mar 15 09:07:50 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((CF <= MtF) OR (1 <= SF))",
"processed_size": 27,
"rewrites": 44
},
"result":
{
"edges": 699508,
"markings": 600208,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(((StF <= 0) OR (SpA <= SR)))",
"processed_size": 32,
"rewrites": 42
},
"net":
{
"conflict_clusters": 16,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((MpA <= 1)))",
"processed_size": 18,
"rewrites": 43
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((Ci <= CA)))",
"processed_size": 18,
"rewrites": 42
},
"result":
{
"edges": 800,
"markings": 801,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((3 <= Uf) AND (CF <= Uf))))",
"processed_size": 34,
"rewrites": 43
},
"result":
{
"edges": 2005,
"markings": 2006,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((Mi <= Cb)))",
"processed_size": 18,
"rewrites": 42
},
"result":
{
"edges": 3491,
"markings": 3492,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((SG <= SpG)))",
"processed_size": 19,
"rewrites": 42
},
"result":
{
"edges": 80404,
"markings": 60704,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(SpA <= MpG)",
"processed_size": 12,
"rewrites": 44
},
"result":
{
"edges": 1429,
"markings": 1429,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G (((1 <= SA) OR (StR <= CR) OR (1 <= CF) OR (1 <= StR))))",
"processed_size": 64,
"rewrites": 42
},
"result":
{
"edges": 5000,
"markings": 5001,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (((2 <= Cb) R (CG <= SpG)))",
"processed_size": 29,
"rewrites": 44
},
"result":
{
"edges": 1217,
"markings": 1218,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 519
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 519
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((MwU <= 1)))",
"processed_size": 18,
"rewrites": 42
},
"result":
{
"edges": 1219,
"markings": 1219,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 623
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((MwU + 1 <= Ci) OR (MpG <= 1))))",
"processed_size": 40,
"rewrites": 43
},
"result":
{
"edges": 808,
"markings": 809,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 623
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 623
},
"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": "(CF <= Si)",
"processed_size": 10,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 779
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= CwA) AND ((2 <= CA) OR (Uf <= MpG)))))",
"processed_size": 52,
"rewrites": 42
},
"result":
{
"edges": 1017,
"markings": 1018,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 779
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 779
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((2 <= StF)))",
"processed_size": 18,
"rewrites": 42
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1039
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1039
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((Mi + 1 <= CG)))",
"processed_size": 22,
"rewrites": 42
},
"result":
{
"edges": 1608,
"markings": 1609,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1559
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((Ci + 1 <= MpA) AND (SG <= 0)) OR (CwG <= SG)) R F ((SpA + 1 <= SwG)))",
"processed_size": 74,
"rewrites": 50
},
"result":
{
"edges": 1200,
"markings": 1201,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3118
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3118
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((Ci <= 1)))",
"processed_size": 17,
"rewrites": 42
},
"result":
{
"edges": 799,
"markings": 800,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(CR <= 2)",
"processed_size": 9,
"rewrites": 45
},
"result":
{
"edges": 4003,
"markings": 4004,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 18464,
"runtime": 1433.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(**)) OR E(F(A(G(**))))) : E(F(**)) : E(G(**)) : A(G(*)) : E((* R *)) : E((** U A(G(**)))) : E(G(**)) : A(G(**)) : (E(G(*)) AND A(G(*))) : (A(F(**)) AND A(X(**))) : ((E(F(*)) AND **) OR E(F(A(G(**))))) : E(F(*)) : E((** U E(G(**)))) : (E(F(*)) OR E((* R *))) : A(F(**)) : (E(F(**)) AND **)"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "yes yes no no yes unknown yes no no yes yes yes no yes no yes ",
"value": "yes yes no no yes unknown yes no no yes yes yes no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 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 true: (2 <= Mi)
lola: LP says that atomic proposition is always true: (3 <= Mi)
lola: E (F (((Mi + 1 <= CG) OR A (G ((1 <= SpA)))))) : A ((E (X ((2 <= Mi))) U E (F ((Ci <= CA))))) : E (G ((SG <= SpG))) : NOT(E (F (((Uf <= 2) OR (Uf + 1 <= CF))))) : NOT(A (((Cb <= 1) U (SpG + 1 <= CG)))) : E (((CF <= SwA) U A (G ((3 <= SpA))))) : (E (G (((1 <= SA) OR (StR <= CR) OR (1 <= CF) OR (1 <= StR)))) AND A (X (A (G ((0 <= 0)))))) : A (G (E (G ((MpA <= 1))))) : NOT((((0 <= 0) AND A (F ((2 <= MwU)))) OR E (F (((Ci <= MwU) AND (2 <= MpG)))))) : (A (F (((MtF + 1 <= CF) AND (SF <= 0)))) AND A (X (((StF <= 0) OR (SpA <= SR))))) : ((NOT(A (G ((2 <= Ci)))) AND (((CG + 1 <= CR)) AND (CwG + 1 <= SpA))) OR E (F (A (G ((3 <= CR)))))) : NOT(A (G ((Cb + 1 <= Mi)))) : E (((((MpA <= Ci) OR (1 <= SG)) AND (SG + 1 <= CwG)) U E (G ((SwG <= SpA))))) : NOT((A (G ((StF <= 1))) AND A (((SG <= CA) U (SwG <= SwA))))) : A (F ((MpG + 1 <= SpA))) : (E (F (((1 <= CwA) AND ((2 <= CA) OR (Uf <= MpG))))) AND (CF <= Si))
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:208
lola: rewrite Frontend/Parser/formula_rewrite.k:449
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:315
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((MtF + 1 <= CF) AND (SF <= 0)))) AND A (X (((StF <= 0) OR (SpA <= SR)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((MtF + 1 <= CF) AND (SF <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((CF <= MtF) OR (1 <= SF))
lola: processed formula length: 27
lola: 44 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((MtF + 1 <= CF) AND (SF <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 600208 markings, 699508 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((StF <= 0) OR (SpA <= SR))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((StF <= 0) OR (SpA <= SR)))
lola: processed formula length: 32
lola: 42 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((MpA <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((MpA <= 1)))
lola: processed formula length: 18
lola: 43 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: (2 <= MpA)
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: 29 markings, 28 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Ci <= CA)))
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 ((Ci <= CA)))
lola: processed formula length: 18
lola: 42 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: (Ci <= CA)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 801 markings, 800 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= Uf) AND (CF <= Uf))))
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 (((3 <= Uf) AND (CF <= Uf))))
lola: processed formula length: 34
lola: 43 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: ((Uf <= 2) OR (Uf + 1 <= CF))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2006 markings, 2005 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Mi <= Cb)))
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 ((Mi <= Cb)))
lola: processed formula length: 18
lola: 42 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: (Mi <= Cb)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3492 markings, 3491 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((SG <= SpG)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((SG <= SpG)))
lola: processed formula length: 19
lola: 42 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: (SpG + 1 <= SG)
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-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 60704 markings, 80404 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((MpG + 1 <= SpA)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (SpA <= MpG)
lola: processed formula length: 12
lola: 44 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (MpG + 1 <= SpA)
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 / EG
lola: The predicate does not eventually occur.
lola: 1429 markings, 1429 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= SA) OR (StR <= CR) OR (1 <= CF) OR (1 <= StR))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= SA) OR (StR <= CR) OR (1 <= CF) OR (1 <= StR))))
lola: processed formula length: 64
lola: 42 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: ((SA <= 0) AND (CR + 1 <= StR) AND (CF <= 0) AND (StR <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 5001 markings, 5000 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((CF <= SwA) U A (G ((3 <= SpA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((CF <= SwA) U AG((3 <= SpA)))
lola: processed formula length: 31
lola: 43 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: 2052424 markings, 6445376 edges, 410485 markings/sec, 0 secs
lola: 3888871 markings, 12708649 edges, 367289 markings/sec, 5 secs
lola: 5616359 markings, 18850492 edges, 345498 markings/sec, 10 secs
lola: 7278229 markings, 24799087 edges, 332374 markings/sec, 15 secs
lola: 8924598 markings, 30711242 edges, 329274 markings/sec, 20 secs
lola: 10604896 markings, 36673928 edges, 336060 markings/sec, 25 secs
lola: 12149253 markings, 42558744 edges, 308871 markings/sec, 30 secs
lola: 13930043 markings, 48625948 edges, 356158 markings/sec, 35 secs
lola: 15483624 markings, 54339395 edges, 310716 markings/sec, 40 secs
lola: 16949537 markings, 59996914 edges, 293183 markings/sec, 45 secs
lola: 18515755 markings, 65800898 edges, 313244 markings/sec, 50 secs
lola: 20206670 markings, 71584157 edges, 338183 markings/sec, 55 secs
lola: 21688213 markings, 77181335 edges, 296309 markings/sec, 60 secs
lola: 23164226 markings, 82754793 edges, 295203 markings/sec, 65 secs
lola: 24608446 markings, 88363088 edges, 288844 markings/sec, 70 secs
lola: 26192290 markings, 94109944 edges, 316769 markings/sec, 75 secs
lola: 27846922 markings, 99811937 edges, 330926 markings/sec, 80 secs
lola: 29288951 markings, 105260156 edges, 288406 markings/sec, 85 secs
lola: 30692531 markings, 110639001 edges, 280716 markings/sec, 90 secs
lola: 32082869 markings, 116031773 edges, 278068 markings/sec, 95 secs
lola: 33505706 markings, 121554735 edges, 284567 markings/sec, 100 secs
lola: 35048496 markings, 127118378 edges, 308558 markings/sec, 105 secs
lola: 36720815 markings, 132881874 edges, 334464 markings/sec, 110 secs
lola: 38206037 markings, 138481268 edges, 297044 markings/sec, 115 secs
lola: 39678072 markings, 144098167 edges, 294407 markings/sec, 120 secs
lola: 41101836 markings, 149624643 edges, 284753 markings/sec, 125 secs
lola: 42536766 markings, 155195384 edges, 286986 markings/sec, 130 secs
lola: 44003641 markings, 160893504 edges, 293375 markings/sec, 135 secs
lola: 45609425 markings, 166745596 edges, 321157 markings/sec, 140 secs
lola: 47321768 markings, 172594165 edges, 342469 markings/sec, 145 secs
lola: 48781009 markings, 178102132 edges, 291848 markings/sec, 150 secs
lola: 50246095 markings, 183631885 edges, 293017 markings/sec, 155 secs
lola: 51668816 markings, 189154184 edges, 284544 markings/sec, 160 secs
lola: 53077751 markings, 194621543 edges, 281787 markings/sec, 165 secs
lola: 54495889 markings, 200124712 edges, 283628 markings/sec, 170 secs
lola: 55922832 markings, 205663311 edges, 285389 markings/sec, 175 secs
lola: 57334167 markings, 211264235 edges, 282267 markings/sec, 180 secs
lola: 58937109 markings, 216787341 edges, 320588 markings/sec, 185 secs
lola: 60588519 markings, 222501423 edges, 330282 markings/sec, 190 secs
lola: 62023601 markings, 227911955 edges, 287016 markings/sec, 195 secs
lola: 63390875 markings, 233213464 edges, 273455 markings/sec, 200 secs
lola: 64778116 markings, 238593848 edges, 277448 markings/sec, 205 secs
lola: 66171341 markings, 243998363 edges, 278645 markings/sec, 210 secs
lola: 67555909 markings, 249367856 edges, 276914 markings/sec, 215 secs
lola: 68950890 markings, 254778002 edges, 278996 markings/sec, 220 secs
lola: 70346270 markings, 260203131 edges, 279076 markings/sec, 225 secs
lola: 71719744 markings, 265678497 edges, 274695 markings/sec, 230 secs
lola: 73309340 markings, 271309558 edges, 317919 markings/sec, 235 secs
lola: 74973075 markings, 276960407 edges, 332747 markings/sec, 240 secs
lola: 76391848 markings, 282294637 edges, 283755 markings/sec, 245 secs
lola: 77759135 markings, 287515352 edges, 273457 markings/sec, 250 secs
lola: 79115046 markings, 292688849 edges, 271182 markings/sec, 255 secs
lola: 80449439 markings, 297858036 edges, 266879 markings/sec, 260 secs
lola: 81799967 markings, 303118469 edges, 270106 markings/sec, 265 secs
lola: 82952118 markings, 307695801 edges, 230430 markings/sec, 270 secs
lola: 84178313 markings, 312431396 edges, 245239 markings/sec, 275 secs
lola: 85423226 markings, 317242075 edges, 248983 markings/sec, 280 secs
lola: 86595378 markings, 321926518 edges, 234430 markings/sec, 285 secs
lola: 87895735 markings, 326957963 edges, 260071 markings/sec, 290 secs
lola: 89146023 markings, 331943676 edges, 250058 markings/sec, 295 secs
lola: 90578816 markings, 336872650 edges, 286559 markings/sec, 300 secs
lola: 92117802 markings, 342086474 edges, 307797 markings/sec, 305 secs
lola: 93454514 markings, 347030640 edges, 267342 markings/sec, 310 secs
lola: 94699647 markings, 351844582 edges, 249027 markings/sec, 315 secs
lola: 95937052 markings, 356626617 edges, 247481 markings/sec, 320 secs
lola: 97161534 markings, 361356563 edges, 244896 markings/sec, 325 secs
lola: 98410940 markings, 366186396 edges, 249881 markings/sec, 330 secs
lola: 99686138 markings, 371118405 edges, 255040 markings/sec, 335 secs
lola: 100973765 markings, 376099736 edges, 257525 markings/sec, 340 secs
lola: 102188501 markings, 380954523 edges, 242947 markings/sec, 345 secs
lola: 103469932 markings, 385910657 edges, 256286 markings/sec, 350 secs
lola: 104778327 markings, 390974269 edges, 261679 markings/sec, 355 secs
lola: 105997618 markings, 395847273 edges, 243858 markings/sec, 360 secs
lola: 107352624 markings, 401096917 edges, 271001 markings/sec, 365 secs
lola: 108635172 markings, 406222380 edges, 256510 markings/sec, 370 secs
lola: 110148791 markings, 411476201 edges, 302724 markings/sec, 375 secs
lola: 111741156 markings, 416876453 edges, 318473 markings/sec, 380 secs
lola: 113107383 markings, 421896859 edges, 273245 markings/sec, 385 secs
lola: 114373043 markings, 426761370 edges, 253132 markings/sec, 390 secs
lola: 115619265 markings, 431578673 edges, 249244 markings/sec, 395 secs
lola: 116856362 markings, 436359670 edges, 247419 markings/sec, 400 secs
lola: 118085187 markings, 441106586 edges, 245765 markings/sec, 405 secs
lola: 119330735 markings, 445920594 edges, 249110 markings/sec, 410 secs
lola: 120588663 markings, 450783132 edges, 251586 markings/sec, 415 secs
lola: 121799289 markings, 455621471 edges, 242125 markings/sec, 420 secs
lola: 123087044 markings, 460602906 edges, 257551 markings/sec, 425 secs
lola: 124371471 markings, 465570643 edges, 256885 markings/sec, 430 secs
lola: 125573539 markings, 470374751 edges, 240414 markings/sec, 435 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes no no unknown unknown yes no unknown yes unknown yes unknown unknown no unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown yes no no unknown unknown yes no unknown yes unknown yes unknown unknown no unknown
lola: memory consumption: 9442696 KB
lola: time consumption: 451 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= Cb) R (CG <= SpG)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((2 <= Cb) R (CG <= SpG)))
lola: processed formula length: 29
lola: 44 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (SpG + 1 <= CG)
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: lola: state equation: calling and running sara
1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 1218 markings, 1217 edges
lola: ========================================
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((MwU <= 1))) AND A (G (((MwU + 1 <= Ci) OR (MpG <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((MwU <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((MwU <= 1)))
lola: processed formula length: 18
lola: 42 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= MwU)
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-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 1219 markings, 1219 edges
lola: ========================================
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((MwU + 1 <= Ci) OR (MpG <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((MwU + 1 <= Ci) OR (MpG <= 1))))
lola: processed formula length: 40
lola: 43 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: ((Ci <= MwU) AND (2 <= MpG))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 809 markings, 808 edges
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= CwA) AND ((2 <= CA) OR (Uf <= MpG))))) AND (CF <= Si))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (CF <= Si)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (CF <= Si)
lola: processed formula length: 10
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
sara: try reading problem file CTLCardinality-11-0.sara.
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 12 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= CwA) AND ((2 <= CA) OR (Uf <= MpG)))))
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 (((1 <= CwA) AND ((2 <= CA) OR (Uf <= MpG)))))
lola: processed formula length: 52
lola: 42 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: ((1 <= CwA) AND ((2 <= CA) OR (Uf <= MpG)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1018 markings, 1017 edges
lola: ========================================
lola: lola: SUBRESULT
state equation: calling and running saralola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((2 <= StF))) OR E (((CA + 1 <= SG) R (SwA + 1 <= SwG))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= StF)))
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: sara: try reading problem file CTLCardinality-12-0.sara.processed formula: E (F ((2 <= StF)))
lola: processed formula length: 18
lola: 42 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= StF)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1039 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((Mi + 1 <= CG))) OR E (F (A (G ((1 <= SpA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1039 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Mi + 1 <= CG)))
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 ((Mi + 1 <= CG)))
lola: processed formula length: 22
lola: 42 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: (Mi + 1 <= CG)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1609 markings, 1608 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((MpA <= Ci) OR (1 <= SG)) AND (SG + 1 <= CwG)) U E (G ((SwG <= SpA)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((Ci + 1 <= MpA) AND (SG <= 0)) OR (CwG <= SG)) R F ((SpA + 1 <= SwG)))
lola: processed formula length: 74
lola: 50 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 1201 markings, 1200 edges
lola: ========================================
lola: subprocess 15 will run for 3118 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F ((Ci <= 1))) AND (((CG + 1 <= CR)) AND (CwG + 1 <= SpA))) OR E (F (A (G ((3 <= CR))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3118 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Ci <= 1)))
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 ((Ci <= 1)))
lola: processed formula length: 17
lola: 42 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: (Ci <= 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 800 markings, 799 edges
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: state equation: calling and running sara
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((3 <= CR)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (CR <= 2)
lola: processed formula length: 9
lola: 45 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
sara: try reading problem file CTLCardinality-15-0.sara.
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= CR)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 4004 markings, 4003 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (CR <= 2)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ...considering subproblem: E (((CF <= SwA) U A (G ((3 <= SpA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((CF <= SwA) U AG((3 <= SpA)))
lola: processed formula length: 31
lola: 43 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: lola: using a prefix tree store (--store=prefix)state equation: write sara problem file to CTLCardinality-17-1.sara
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: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-1.sara.
lola: 1937008 markings, 6041715 edges, 387402 markings/sec, 0 secs
lola: 3665967 markings, 11925369 edges, 345792 markings/sec, 5 secs
lola: 5255048 markings, 17644157 edges, 317816 markings/sec, 10 secs
lola: 6873552 markings, 23259957 edges, 323701 markings/sec, 15 secs
lola: 8369041 markings, 28776438 edges, 299098 markings/sec, 20 secs
lola: 9973191 markings, 34302954 edges, 320830 markings/sec, 25 secs
lola: 11395644 markings, 39682654 edges, 284491 markings/sec, 30 secs
lola: 12892497 markings, 45161953 edges, 299371 markings/sec, 35 secs
lola: 14474376 markings, 50610114 edges, 316376 markings/sec, 40 secs
lola: 15824938 markings, 55703457 edges, 270112 markings/sec, 45 secs
lola: 17205046 markings, 60893293 edges, 276022 markings/sec, 50 secs
lola: 18607511 markings, 66122042 edges, 280493 markings/sec, 55 secs
lola: 20169012 markings, 71433521 edges, 312300 markings/sec, 60 secs
lola: 21510796 markings, 76472264 edges, 268357 markings/sec, 65 secs
lola: 22803133 markings, 81440938 edges, 258467 markings/sec, 70 secs
lola: 24136131 markings, 86510258 edges, 266600 markings/sec, 75 secs
lola: 25505252 markings, 91714097 edges, 273824 markings/sec, 80 secs
lola: 27055130 markings, 96962359 edges, 309976 markings/sec, 85 secs
lola: 28396347 markings, 101895629 edges, 268243 markings/sec, 90 secs
lola: 29683530 markings, 106769392 edges, 257437 markings/sec, 95 secs
lola: 30921648 markings, 111554277 edges, 247624 markings/sec, 100 secs
lola: 32176043 markings, 116404467 edges, 250879 markings/sec, 105 secs
lola: 33465030 markings, 121392034 edges, 257797 markings/sec, 110 secs
lola: 34860546 markings, 126461249 edges, 279103 markings/sec, 115 secs
lola: 36395407 markings, 131662942 edges, 306972 markings/sec, 120 secs
lola: 37744393 markings, 136695841 edges, 269797 markings/sec, 125 secs
lola: 39032851 markings, 141682488 edges, 257692 markings/sec, 130 secs
lola: 40350340 markings, 146713469 edges, 263498 markings/sec, 135 secs
lola: 41622833 markings, 151654030 edges, 254499 markings/sec, 140 secs
lola: 42900148 markings, 156647725 edges, 255463 markings/sec, 145 secs
lola: 44220306 markings, 161759572 edges, 264032 markings/sec, 150 secs
lola: 45718874 markings, 167127969 edges, 299714 markings/sec, 155 secs
lola: 47298635 markings, 172501631 edges, 315952 markings/sec, 160 secs
lola: 48620743 markings, 177461665 edges, 264422 markings/sec, 165 secs
lola: 49902896 markings, 182405060 edges, 256431 markings/sec, 170 secs
lola: 51199556 markings, 187347195 edges, 259332 markings/sec, 175 secs
lola: 52469212 markings, 192278525 edges, 253931 markings/sec, 180 secs
lola: 53708551 markings, 197142362 edges, 247868 markings/sec, 185 secs
lola: 54989735 markings, 202098316 edges, 256237 markings/sec, 190 secs
lola: 56301096 markings, 207174575 edges, 262272 markings/sec, 195 secs
lola: 57659700 markings, 212321990 edges, 271721 markings/sec, 200 secs
lola: 59067646 markings, 217244220 edges, 281589 markings/sec, 205 secs
lola: 60582927 markings, 222479055 edges, 303056 markings/sec, 210 secs
lola: 61860673 markings, 227331199 edges, 255549 markings/sec, 215 secs
lola: 63115604 markings, 232113575 edges, 250986 markings/sec, 220 secs
lola: 64359643 markings, 236921745 edges, 248808 markings/sec, 225 secs
lola: 65613530 markings, 241768910 edges, 250777 markings/sec, 230 secs
lola: 66848259 markings, 246571271 edges, 246946 markings/sec, 235 secs
lola: 68032718 markings, 251273308 edges, 236892 markings/sec, 240 secs
lola: 69299013 markings, 256169303 edges, 253259 markings/sec, 245 secs
lola: 70583495 markings, 261137659 edges, 256896 markings/sec, 250 secs
lola: 71801719 markings, 266006395 edges, 243645 markings/sec, 255 secs
lola: 73264287 markings, 271151873 edges, 292514 markings/sec, 260 secs
lola: 74790543 markings, 276322243 edges, 305251 markings/sec, 265 secs
lola: 76110045 markings, 281179110 edges, 263900 markings/sec, 270 secs
lola: 77320910 markings, 285844891 edges, 242173 markings/sec, 275 secs
lola: 78504379 markings, 290411781 edges, 236694 markings/sec, 280 secs
lola: 79700672 markings, 295029561 edges, 239259 markings/sec, 285 secs
lola: 80916613 markings, 299724941 edges, 243188 markings/sec, 290 secs
lola: 82145738 markings, 304473254 edges, 245825 markings/sec, 295 secs
lola: 83334030 markings, 309141043 edges, 237658 markings/sec, 300 secs
lola: 84514136 markings, 313773505 edges, 236021 markings/sec, 305 secs
lola: 85762087 markings, 318596322 edges, 249590 markings/sec, 310 secs
lola: 86944775 markings, 323322921 edges, 236538 markings/sec, 315 secs
lola: 88229916 markings, 328293501 edges, 257028 markings/sec, 320 secs
lola: 89589499 markings, 333414226 edges, 271917 markings/sec, 325 secs
lola: 90958499 markings, 338199450 edges, 273800 markings/sec, 330 secs
lola: 92490535 markings, 343471042 edges, 306407 markings/sec, 335 secs
lola: 93794086 markings, 348387734 edges, 260710 markings/sec, 340 secs
lola: 95070510 markings, 353223988 edges, 255285 markings/sec, 345 secs
lola: 96324377 markings, 358017049 edges, 250773 markings/sec, 350 secs
lola: 97540974 markings, 362761971 edges, 243319 markings/sec, 355 secs
lola: 98756934 markings, 367569187 edges, 243192 markings/sec, 360 secs
lola: 100024560 markings, 372470906 edges, 253525 markings/sec, 365 secs
lola: 101309783 markings, 377442615 edges, 257045 markings/sec, 370 secs
lola: 102580851 markings, 382359910 edges, 254214 markings/sec, 375 secs
lola: 103789623 markings, 387188240 edges, 241754 markings/sec, 380 secs
lola: 105104998 markings, 392279761 edges, 263075 markings/sec, 385 secs
lola: 106346019 markings, 397239700 edges, 248204 markings/sec, 390 secs
lola: 107684143 markings, 402421805 edges, 267625 markings/sec, 395 secs
lola: 109082102 markings, 407746980 edges, 279592 markings/sec, 400 secs
lola: 110531553 markings, 412814476 edges, 289890 markings/sec, 405 secs
lola: 112120482 markings, 418245513 edges, 317786 markings/sec, 410 secs
lola: 113441947 markings, 423202978 edges, 264293 markings/sec, 415 secs
lola: 114714639 markings, 428086680 edges, 254538 markings/sec, 420 secs
lola: 115981291 markings, 432923790 edges, 253330 markings/sec, 425 secs
lola: 117204616 markings, 437692960 edges, 244665 markings/sec, 430 secs
lola: 118414190 markings, 442421416 edges, 241915 markings/sec, 435 secs
lola: 119659717 markings, 447235332 edges, 249105 markings/sec, 440 secs
lola: 120930762 markings, 452150330 edges, 254209 markings/sec, 445 secs
lola: 122168909 markings, 457026355 edges, 247629 markings/sec, 450 secs
lola: 123424403 markings, 461951152 edges, 251099 markings/sec, 455 secs
lola: 124717479 markings, 466953482 edges, 258615 markings/sec, 460 secs
lola: 125917795 markings, 471750595 edges, 240063 markings/sec, 465 secs
lola: 127225529 markings, 476811148 edges, 261547 markings/sec, 470 secs
lola: 128458713 markings, 481739748 edges, 246637 markings/sec, 475 secs
lola: 129778898 markings, 486849693 edges, 264037 markings/sec, 480 secs
lola: 131092909 markings, 492048198 edges, 262802 markings/sec, 485 secs
lola: 132532313 markings, 496999611 edges, 287881 markings/sec, 490 secs
lola: 134083596 markings, 502255977 edges, 310257 markings/sec, 495 secs
lola: 135456642 markings, 507299949 edges, 274609 markings/sec, 500 secs
lola: 136724957 markings, 512129897 edges, 253663 markings/sec, 505 secs
lola: 137962468 markings, 516912355 edges, 247502 markings/sec, 510 secs
lola: 139196293 markings, 521680265 edges, 246765 markings/sec, 515 secs
lola: 140423956 markings, 526422534 edges, 245533 markings/sec, 520 secs
lola: 141642654 markings, 531129141 edges, 243740 markings/sec, 525 secs
lola: 142841928 markings, 535825736 edges, 239855 markings/sec, 530 secs
lola: 144024061 markings, 540481423 edges, 236427 markings/sec, 535 secs
lola: 145288626 markings, 545370103 edges, 252913 markings/sec, 540 secs
lola: 146505816 markings, 550206298 edges, 243438 markings/sec, 545 secs
lola: 147775893 markings, 555145037 edges, 254015 markings/sec, 550 secs
lola: 149062072 markings, 560119978 edges, 257236 markings/sec, 555 secs
lola: 150247014 markings, 564855582 edges, 236988 markings/sec, 560 secs
lola: 151555043 markings, 569916935 edges, 261606 markings/sec, 565 secs
lola: 152744582 markings, 574670933 edges, 237908 markings/sec, 570 secs
lola: 154091192 markings, 579885609 edges, 269322 markings/sec, 575 secs
lola: 155321592 markings, 584803061 edges, 246080 markings/sec, 580 secs
lola: 156762555 markings, 590149387 edges, 288193 markings/sec, 585 secs
lola: 158159451 markings, 595032951 edges, 279379 markings/sec, 590 secs
lola: 159739669 markings, 600390576 edges, 316044 markings/sec, 595 secs
lola: 161044526 markings, 605270127 edges, 260971 markings/sec, 600 secs
lola: 162264750 markings, 609983835 edges, 244045 markings/sec, 605 secs
lola: 163465266 markings, 614618912 edges, 240103 markings/sec, 610 secs
lola: 164665188 markings, 619250617 edges, 239984 markings/sec, 615 secs
lola: 165854851 markings, 623841480 edges, 237933 markings/sec, 620 secs
lola: 167047621 markings, 628444372 edges, 238554 markings/sec, 625 secs
lola: 168235329 markings, 633041983 edges, 237542 markings/sec, 630 secs
lola: 169351770 markings, 637488219 edges, 223288 markings/sec, 635 secs
lola: 170557608 markings, 642142589 edges, 241168 markings/sec, 640 secs
lola: 171704740 markings, 646726964 edges, 229426 markings/sec, 645 secs
lola: 172945157 markings, 651518644 edges, 248083 markings/sec, 650 secs
lola: 174198360 markings, 656373247 edges, 250641 markings/sec, 655 secs
lola: 175388506 markings, 661117513 edges, 238029 markings/sec, 660 secs
lola: 176658678 markings, 666028033 edges, 254034 markings/sec, 665 secs
lola: 177816532 markings, 670655279 edges, 231571 markings/sec, 670 secs
lola: 179100019 markings, 675618073 edges, 256697 markings/sec, 675 secs
lola: 180279575 markings, 680332132 edges, 235911 markings/sec, 680 secs
lola: 181554070 markings, 685342049 edges, 254899 markings/sec, 685 secs
lola: 182799768 markings, 690237189 edges, 249140 markings/sec, 690 secs
lola: 184051875 markings, 695241493 edges, 250421 markings/sec, 695 secs
lola: 185482296 markings, 700251411 edges, 286084 markings/sec, 700 secs
lola: 186861045 markings, 705071473 edges, 275750 markings/sec, 705 secs
lola: 188423358 markings, 710446722 edges, 312463 markings/sec, 710 secs
lola: 189738017 markings, 715449842 edges, 262932 markings/sec, 715 secs
lola: 191047383 markings, 720380027 edges, 261873 markings/sec, 720 secs
lola: 192299670 markings, 725221785 edges, 250457 markings/sec, 725 secs
lola: 193535203 markings, 729995531 edges, 247107 markings/sec, 730 secs
lola: 194723070 markings, 734681048 edges, 237573 markings/sec, 735 secs
lola: 195906592 markings, 739308732 edges, 236704 markings/sec, 740 secs
lola: 197119770 markings, 743992261 edges, 242636 markings/sec, 745 secs
lola: 198322520 markings, 748667247 edges, 240550 markings/sec, 750 secs
lola: 199457054 markings, 753168252 edges, 226907 markings/sec, 755 secs
lola: 200687298 markings, 757919848 edges, 246049 markings/sec, 760 secs
lola: 201824715 markings, 762465360 edges, 227483 markings/sec, 765 secs
lola: 203091439 markings, 767361875 edges, 253345 markings/sec, 770 secs
lola: 204271604 markings, 772078391 edges, 236033 markings/sec, 775 secs
lola: 205562107 markings, 777069619 edges, 258101 markings/sec, 780 secs
lola: 206754569 markings, 781835330 edges, 238492 markings/sec, 785 secs
lola: 208036064 markings, 786790126 edges, 256299 markings/sec, 790 secs
lola: 209208106 markings, 791474157 edges, 234408 markings/sec, 795 secs
lola: 210510394 markings, 796512330 edges, 260458 markings/sec, 800 secs
lola: 211676486 markings, 801172547 edges, 233218 markings/sec, 805 secs
lola: 213004753 markings, 806313667 edges, 265653 markings/sec, 810 secs
lola: 214216888 markings, 811157451 edges, 242427 markings/sec, 815 secs
lola: 215487207 markings, 816234617 edges, 254064 markings/sec, 820 secs
lola: 216775534 markings, 820693680 edges, 257665 markings/sec, 825 secs
lola: 217088843 markings, 821788866 edges, 62662 markings/sec, 830 secs
lola: 217230570 markings, 822284215 edges, 28345 markings/sec, 835 secs
lola: 217239037 markings, 822313848 edges, 1693 markings/sec, 840 secs
lola: 217339355 markings, 822664964 edges, 20064 markings/sec, 845 secs
lola: 217339411 markings, 822665156 edges, 11 markings/sec, 850 secs
lola: 217339468 markings, 822665358 edges, 11 markings/sec, 855 secs
lola: 217342526 markings, 822676060 edges, 612 markings/sec, 860 secs
lola: 217344605 markings, 822683339 edges, 416 markings/sec, 865 secs
lola: 217351330 markings, 822706875 edges, 1345 markings/sec, 870 secs
lola: 217358551 markings, 822732147 edges, 1444 markings/sec, 875 secs
lola: 217360063 markings, 822737459 edges, 302 markings/sec, 880 secs
lola: 217361791 markings, 822743487 edges, 346 markings/sec, 885 secs
lola: 217362594 markings, 822746298 edges, 161 markings/sec, 890 secs
lola: 217364187 markings, 822751872 edges, 319 markings/sec, 895 secs
lola: 217364246 markings, 822752079 edges, 12 markings/sec, 900 secs
lola: 217366580 markings, 822760249 edges, 467 markings/sec, 905 secs
lola: 217366620 markings, 822760388 edges, 8 markings/sec, 910 secs
lola: 217366665 markings, 822761949 edges, 9 markings/sec, 915 secs
lola: 217368147 markings, 822765733 edges, 296 markings/sec, 920 secs
lola: 217368197 markings, 822765911 edges, 10 markings/sec, 925 secs
lola: 217369727 markings, 822771262 edges, 306 markings/sec, 930 secs
lola: 217373726 markings, 822785260 edges, 800 markings/sec, 935 secs
lola: 217373772 markings, 822785421 edges, 9 markings/sec, 940 secs
lola: 217373816 markings, 822785575 edges, 9 markings/sec, 945 secs
lola: 217373869 markings, 822785763 edges, 11 markings/sec, 950 secs
lola: 217373925 markings, 822785955 edges, 11 markings/sec, 955 secs
lola: 217373963 markings, 822786092 edges, 8 markings/sec, 960 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes no no yes unknown yes no no yes yes yes no yes no yes
lola:
preliminary result: yes yes no no yes unknown yes no no yes yes yes no yes no yes
lola: memory consumption: 18464 KB
lola: time consumption: 1433 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
BK_STOP 1552642303255
--------------------
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="ClientsAndServers-PT-N0100P0"
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 ClientsAndServers-PT-N0100P0, 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-155225121200355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0100P0.tgz
mv ClientsAndServers-PT-N0100P0 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 '
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 ;