About the Execution of LoLA for NeoElection-COL-2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4325.040 | 29205.00 | 6291.00 | 17.40 | FFTTTTTTFTTFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r104-oct2-155272225400121.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is NeoElection-COL-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272225400121
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.4K Feb 12 02:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 02:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 8 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 8 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 104 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 342 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 4 06:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 06:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 1 00:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 1 00:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 69K 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 NeoElection-COL-2-CTLCardinality-00
FORMULA_NAME NeoElection-COL-2-CTLCardinality-01
FORMULA_NAME NeoElection-COL-2-CTLCardinality-02
FORMULA_NAME NeoElection-COL-2-CTLCardinality-03
FORMULA_NAME NeoElection-COL-2-CTLCardinality-04
FORMULA_NAME NeoElection-COL-2-CTLCardinality-05
FORMULA_NAME NeoElection-COL-2-CTLCardinality-06
FORMULA_NAME NeoElection-COL-2-CTLCardinality-07
FORMULA_NAME NeoElection-COL-2-CTLCardinality-08
FORMULA_NAME NeoElection-COL-2-CTLCardinality-09
FORMULA_NAME NeoElection-COL-2-CTLCardinality-10
FORMULA_NAME NeoElection-COL-2-CTLCardinality-11
FORMULA_NAME NeoElection-COL-2-CTLCardinality-12
FORMULA_NAME NeoElection-COL-2-CTLCardinality-13
FORMULA_NAME NeoElection-COL-2-CTLCardinality-14
FORMULA_NAME NeoElection-COL-2-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552776430100
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ NeoElection-COL-2 @ 3570 seconds
FORMULA NeoElection-COL-2-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NeoElection-COL-2-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3541
rslt: Output for CTLCardinality @ NeoElection-COL-2
{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Mar 16 22:47:10 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": 58
},
"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": 1,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((2 <= p407 + p405 + p403 + p402 + p404 + p406)))",
"processed_size": 50,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 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": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"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": 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": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": "DEADLOCK",
"processed_size": 8,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 58
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "AF(EX(((2 <= p401 + p400 + p399) AND (p407 + p405 + p403 + p402 + p404 + p406 <= 0))))",
"processed_size": 86,
"rewrites": 60
},
"net":
{
"conflict_clusters": 303,
"singleton_clusters": 0
},
"result":
{
"edges": 66,
"markings": 58,
"produced_by": "CTL model checker",
"value": false
},
"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
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G ((p401 + p400 + p399 <= 1)))",
"processed_size": 33,
"rewrites": 59
},
"result":
{
"edges": 32,
"markings": 33,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 309
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "AF(EG((p389 + p388 + p387 <= 1)))",
"processed_size": 33,
"rewrites": 60
},
"net":
{
"conflict_clusters": 303,
"singleton_clusters": 0
},
"result":
{
"edges": 39,
"markings": 36,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AF(EG((p401 + p400 + p399 <= 1)))",
"processed_size": 33,
"rewrites": 60
},
"net":
{
"conflict_clusters": 303,
"singleton_clusters": 0
},
"result":
{
"edges": 34,
"markings": 34,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 84,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 81,
"visible_transitions": 0
},
"processed": "AF((((p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12 <= p389 + p388 + p387) AND (2 <= p410 + p409 + p408)) AND AF((p410 + p409 + p408 <= p401 + p400 + p399))))",
"processed_size": 562,
"rewrites": 60
},
"net":
{
"conflict_clusters": 303,
"singleton_clusters": 0
},
"result":
{
"edges": 32,
"markings": 33,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 76152,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : ** : TRUE : A(F(E(G(**)))) : TRUE : TRUE : TRUE : TRUE : A(F(E(X(**)))) : A(F(E(G(*)))) : TRUE : A(F((** AND A(F(**))))) : TRUE : DEADLOCK : E(G(*)) : FALSE"
},
"net":
{
"arcs": 1914,
"conflict_clusters": 303,
"places": 438,
"places_significant": 145,
"singleton_clusters": 0,
"transitions": 343
},
"result":
{
"preliminary_value": "no no yes yes yes yes yes yes no yes yes no yes no yes no ",
"value": "no no yes yes yes yes yes yes no yes yes no yes no 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 High-Level net
lola: Places: 438, Transitions: 343
lola: @ trans T-startNeg__end
lola: @ trans T-poll__handleAI2
lola: @ trans T-poll__handleAI1
lola: @ trans T-poll__handleRI
lola: @ trans T-poll__handleAnsP2
lola: @ trans T-sendAnnPs__start
lola: @ trans T-startNeg__start
lola: @ trans T-sendAnnPs__send
lola: @ trans T-sendAnnPs__end
lola: @ trans T-poll__iAmPrimary
lola: @ trans T-poll__end
lola: @ trans T-poll__handleAnsP3
lola: @ trans T-poll__handleAnnP1
lola: @ trans T-startSec
lola: @ trans T-poll__handleRP
lola: @ trans T-poll__handleAskP
lola: @ trans T-poll__handleAnnP2
lola: @ trans T-poll__start
lola: @ trans T-poll__handleAnsP1
lola: @ trans T-poll__handleAnsP4
lola: @ trans T-startNeg__send
lola: @ trans T-poll__iAmSecondary
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 781/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 438
lola: finding significant places
lola: 438 places, 343 transitions, 145 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: (p435 + p436 + p437 <= p401 + p400 + p399)
lola: LP says that atomic proposition is always true: (p398 + p397 + p396 + p395 + p394 + p393 <= p368 + p367 + p366)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p208 + p209 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p226 + p227 + p298 + p281 + p280 + p263 + p262 + p245 + p244 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p234 + p233 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p232 + p231 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p230 + p229 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p228 + p225 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p224 + p223 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p222 + p221 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p220 + p219 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p218 + p217 + p216 + p215 + p214 + p213 + p212 + p211 + p210 + p207 + p206 + p205 + p204)
lola: after: (3 <= p208 + p209 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p226 + p227 + p298 + p281 + p280 + p263 + p262 + p245 + p244)
lola: LP says that atomic proposition is always false: (3 <= p208 + p209 + p353 + p352 + p335 + p334 + p317 + p316 + p299 + p226 + p227 + p298 + p281 + p280 + p263 + p262 + p245 + p244)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p414 + p415 + p416)
lola: after: (3 <= 0)
lola: LP says that atomic proposition is always true: (p368 + p367 + p366 <= p407 + p405 + p403 + p402 + p404 + p406)
lola: place invariant simplifies atomic proposition
lola: before: (p411 + p412 + p413 <= p401 + p400 + p399)
lola: after: (0 <= p401 + p400 + p399)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p163 + p166 + p169 + p172 + p175 + p177 + p178 + p181 + p183 + p184 + p187 + p188 + p186 + p185 + p182 + p180 + p179 + p176 + p174 + p173 + p171 + p170 + p168 + p167 + p165 + p164 + p162)
lola: after: (0 <= 2)
lola: LP says that atomic proposition is always false: (1 <= p368 + p367 + p366)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p390 + p391 + p392)
lola: after: (2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p390 + p391 + p392)
lola: after: (2 <= 0)
lola: LP says that atomic proposition is always false: (2 <= p192 + p193 + p194)
lola: LP says that atomic proposition is always false: (1 <= p398 + p397 + p396 + p395 + p394 + p393)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p414 + p415 + p416)
lola: after: (2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p368 + p367 + p366 <= p390 + p391 + p392)
lola: after: (p368 + p367 + p366 <= 0)
lola: LP says that atomic proposition is always true: (p368 + p367 + p366 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12 + p10 + p11 + p161 + p13 + p14 + p160 + p16 + p17 + p158 + p19 + p20 + p157 + p155 + p154 + p152 + p25 + p26 + p151 + p28 + p29 + p146 + p31 + p32 + p145 + p34 + p35 + p143 + p37 + p38 + p142 + p140 + p139 + p137 + p43 + p44 + p136 + p46 + p47 + p134 + p49 + p50 + p133 + p52 + p53 + p128 + p55 + p56 + p127 + p125 + p124 + p122 + p61 + p62 + p121 + p64 + p65 + p119 + p67 + p68 + p118 + p70 + p71 + p116 + p73 + p74 + p115 + p110 + p109 + p107 + p79 + p80 + p106 + p82 + p83 + p104 + p85 + p86 + p103 + p88 + p89 + p101 + p91 + p92 + p100 + p8 + p7 + p2 + p97 + p98 + p1 <= p398 + p397 + p396 + p395 + p394 + p393)
lola: after: (p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12 <= p398 + p397 + p396 + p395 + p394 + p393)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p196 + p199 + p202 + p203 + p201 + p200 + p198 + p197 + p195)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386)
lola: after: (0 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p411 + p412 + p413 <= p410 + p409 + p408)
lola: after: (0 <= p410 + p409 + p408)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12 + p10 + p11 + p161 + p13 + p14 + p160 + p16 + p17 + p158 + p19 + p20 + p157 + p155 + p154 + p152 + p25 + p26 + p151 + p28 + p29 + p146 + p31 + p32 + p145 + p34 + p35 + p143 + p37 + p38 + p142 + p140 + p139 + p137 + p43 + p44 + p136 + p46 + p47 + p134 + p49 + p50 + p133 + p52 + p53 + p128 + p55 + p56 + p127 + p125 + p124 + p122 + p61 + p62 + p121 + p64 + p65 + p119 + p67 + p68 + p118 + p70 + p71 + p116 + p73 + p74 + p115 + p110 + p109 + p107 + p79 + p80 + p106 + p82 + p83 + p104 + p85 + p86 + p103 + p88 + p89 + p101 + p91 + p92 + p100 + p8 + p7 + p2 + p97 + p98 + p1)
lola: after: (1 <= p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12)
lola: LP says that atomic proposition is always false: (3 <= p192 + p193 + p194)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p390 + p391 + p392)
lola: after: (3 <= 0)
lola: LP says that atomic proposition is always false: (2 <= p368 + p367 + p366)
lola: place invariant simplifies atomic proposition
lola: before: (p407 + p405 + p403 + p402 + p404 + p406 <= p411 + p412 + p413)
lola: after: (p407 + p405 + p403 + p402 + p404 + p406 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 <= p196 + p199 + p202 + p203 + p201 + p200 + p198 + p197 + p195)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12 + p10 + p11 + p161 + p13 + p14 + p160 + p16 + p17 + p158 + p19 + p20 + p157 + p155 + p154 + p152 + p25 + p26 + p151 + p28 + p29 + p146 + p31 + p32 + p145 + p34 + p35 + p143 + p37 + p38 + p142 + p140 + p139 + p137 + p43 + p44 + p136 + p46 + p47 + p134 + p49 + p50 + p133 + p52 + p53 + p128 + p55 + p56 + p127 + p125 + p124 + p122 + p61 + p62 + p121 + p64 + p65 + p119 + p67 + p68 + p118 + p70 + p71 + p116 + p73 + p74 + p115 + p110 + p109 + p107 + p79 + p80 + p106 + p82 + p83 + p104 + p85 + p86 + p103 + p88 + p89 + p101 + p91 + p92 + p100 + p8 + p7 + p2 + p97 + p98 + p1 <= p389 + p388 + p387)
lola: after: (p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12 <= p389 + p388 + p387)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12 + p10 + p11 + p161 + p13 + p14 + p160 + p16 + p17 + p158 + p19 + p20 + p157 + p155 + p154 + p152 + p25 + p26 + p151 + p28 + p29 + p146 + p31 + p32 + p145 + p34 + p35 + p143 + p37 + p38 + p142 + p140 + p139 + p137 + p43 + p44 + p136 + p46 + p47 + p134 + p49 + p50 + p133 + p52 + p53 + p128 + p55 + p56 + p127 + p125 + p124 + p122 + p61 + p62 + p121 + p64 + p65 + p119 + p67 + p68 + p118 + p70 + p71 + p116 + p73 + p74 + p115 + p110 + p109 + p107 + p79 + p80 + p106 + p82 + p83 + p104 + p85 + p86 + p103 + p88 + p89 + p101 + p91 + p92 + p100 + p8 + p7 + p2 + p97 + p98 + p1)
lola: after: (3 <= p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12)
lola: LP says that atomic proposition is always false: (3 <= p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12)
lola: place invariant simplifies atomic proposition
lola: before: (p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 <= p435 + p436 + p437)
lola: after: (2 <= p435 + p436 + p437)
lola: LP says that atomic proposition is always false: (2 <= p435 + p436 + p437)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p390 + p391 + p392)
lola: after: (3 <= 0)
lola: LP says that atomic proposition is always false: (1 <= p435 + p436 + p437)
lola: (E (G (A (F ((p435 + p436 + p437 <= p401 + p400 + p399))))) AND A (F (()))) : (A (F (())) OR (((2 <= p407 + p405 + p403 + p402 + p404 + p406)))) : E (G (NOT(E (F ((2 <= p192 + p193 + p194)))))) : A (F (E (G ((p401 + p400 + p399 <= 1))))) : NOT(A (F ((1 <= p398 + p397 + p396 + p395 + p394 + p393)))) : E (G (())) : NOT(A (F (()))) : E (G (A (X ((p368 + p367 + p366 <= 1))))) : A (F (E (X (((2 <= p401 + p400 + p399) AND (p407 + p405 + p403 + p402 + p404 + p406 <= 0)))))) : A (F (NOT(A (F ((2 <= p389 + p388 + p387)))))) : E (G ((0 <= 0))) : A (F ((((p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12 <= p389 + p388 + p387) AND (2 <= p410 + p409 + p408)) AND A (F ((p410 + p409 + p408 <= p401 + p400 + p399)))))) : E (G (NOT(E (F ((3 <= p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 + p153 + p23 + p22 + p156 + p21 + p18 + p159 + p15 + p12)))))) : A (X (A (F (())))) : NOT(A (F ((2 <= p401 + p400 + p399)))) : E (G (A (F (()))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:116
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:122
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:282
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:282
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:139
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:163
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: 58 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: (((2 <= p407 + p405 + p403 + p402 + p404 + p406)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= p407 + p405 + p403 + p402 + p404 + p406)))
lola: processed formula length: 50
lola: 58 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 58 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 58 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 4 will run for 297 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: 58 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 5 will run for 324 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: 58 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 6 will run for 356 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: 58 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 7 will run for 396 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: 58 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 8 will run for 445 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: 58 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 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 58 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 10 will run for 594 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: 58 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 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((2 <= p401 + p400 + p399) AND (p407 + p405 + p403 + p402 + p404 + p406 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX(((2 <= p401 + p400 + p399) AND (p407 + p405 + p403 + p402 + p404 + p406 <= 0))))
lola: processed formula length: 86
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: 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: 58 markings, 66 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p401 + p400 + p399 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p401 + p400 + p399 <= 1)))
lola: processed formula length: 33
lola: 59 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
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: The predicate is possibly preserved.
lola: state equation task get result unparse finished++ id 0
lola: 33 markings, 32 edges
lola: formula 0: (2 <= p401 + p400 + p399)
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 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p389 + p388 + p387 <= 1)))))
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((p389 + p388 + p387 <= 1)))
lola: processed formula length: 33
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: 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: 36 markings, 39 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p401 + p400 + p399 <= 1)))))
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((p401 + p400 + p399 <= 1)))
lola: processed formula length: 33
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: 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: 34 markings, 34 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((p0 + p99 + p96 + p3 + p4 + p5 + p6 + p95 + p94 + p9 + p93 + p90 + p102 + p87 + p84 + p105 + p81 + p78 + p108 + p77 + p76 + p111 + p112 + p113 + p114 + p75 + p72 + p117 + p69 + p66 + p120 + p63 + p60 + p123 + p59 + p58 + p126 + p57 + p54 + p129 + p130 + p131 + p132 + p51 + p48 + p135 + p45 + p42 + p138 + p41 + p40 + p141 + p39 + p36 + p144 + p33 + p30 + p147 + p148 + p149 + p150 + p27 + p24 +... (shortened)
lola: processed formula length: 562
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: 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: 33 markings, 32 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes yes yes yes yes no yes yes no yes no yes no
lola:
preliminary result: no no yes yes yes yes yes yes no yes yes no yes no yes no
lola: memory consumption: 76152 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 1552776459305
--------------------
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="NeoElection-COL-2"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is NeoElection-COL-2, 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 r104-oct2-155272225400121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-2.tgz
mv NeoElection-COL-2 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 ;