About the Execution of LoLA for RefineWMG-PT-050051
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.110 | 1790266.00 | 1767706.00 | 8223.20 | TFTTF?TFT?TTF??T | 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.r137-smll-155284909900391.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 RefineWMG-PT-050051, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-155284909900391
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 3.1K Feb 12 14:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 14:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 8 16:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 16:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 107 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 345 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 01:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 01:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 4 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 4 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 1 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 109K 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 RefineWMG-PT-050-051-CTLCardinality-00
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-01
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-02
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-03
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-04
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-05
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-06
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-07
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-08
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-09
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-10
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-11
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-12
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-13
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-14
FORMULA_NAME RefineWMG-PT-050-051-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1553106636471
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RefineWMG-PT-050051 @ 3570 seconds
FORMULA RefineWMG-PT-050-051-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050-051-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1780
rslt: Output for CTLCardinality @ RefineWMG-PT-050051
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Mar 20 18:30:36 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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 ((2 <= p113)))",
"processed_size": 19,
"rewrites": 24
},
"result":
{
"edges": 1939,
"markings": 1940,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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 ((p104 <= p135)))",
"processed_size": 22,
"rewrites": 23
},
"result":
{
"edges": 51,
"markings": 52,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},
{
"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": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p115 <= 0) AND (p36 + 1 <= p180) AND (p132 + 1 <= p10))",
"processed_size": 57,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX((p1 + 1 <= p28))",
"processed_size": 19,
"rewrites": 23
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E(EG((p224 <= p3)) U EX((p249 <= p22)))",
"processed_size": 39,
"rewrites": 25
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 152,
"markings": 52,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "EG(AX((2 <= p51)))",
"processed_size": 18,
"rewrites": 24
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"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": null
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"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": "(p214 + 1 <= p194)",
"processed_size": 18,
"rewrites": 24
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 302
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((2 <= p223) AND (1 <= p17))))",
"processed_size": 36,
"rewrites": 23
},
"result":
{
"edges": 38,
"markings": 39,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 332
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p227 <= p78)))",
"processed_size": 21,
"rewrites": 24
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((p9 + 1 <= p77) OR (p63 <= 0) OR (p53 <= 0))))",
"processed_size": 55,
"rewrites": 23
},
"result":
{
"edges": 126,
"markings": 102,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 415
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((p206 <= 1) AND (p65 <= 0) AND (p53 + 1 <= p46))))",
"processed_size": 57,
"rewrites": 23
},
"result":
{
"edges": 1877,
"markings": 1878,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((((p2 <= 0) OR (p247 <= 0)) AND ((p61 + 1 <= pterce) OR (p127 <= 1)))))",
"processed_size": 79,
"rewrites": 24
},
"result":
{
"edges": 35,
"markings": 36,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 617
},
"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": "(p136 + 1 <= p122)",
"processed_size": 18,
"rewrites": 25
},
"result":
{
"edges": 54,
"markings": 54,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1325
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1325
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p234)",
"processed_size": 11,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2651
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p236 <= 2)))",
"processed_size": 19,
"rewrites": 24
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2651
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2651
},
"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 ((psecond + 1 <= p217)))",
"processed_size": 29,
"rewrites": 23
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "EG(AX((2 <= p51)))",
"processed_size": 18,
"rewrites": 24
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p234)",
"processed_size": 11,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p236 <= 2)))",
"processed_size": 19,
"rewrites": 24
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 21,
"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"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "A (((p202 + 1 <= p242) U ((1 <= p156) AND (1 <= p127))))",
"processed_size": 56,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
},
{
"child":
[
{
"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 ((psecond + 1 <= p217)))",
"processed_size": 29,
"rewrites": 23
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((p51 <= p139) U (p30 <= p220)))",
"processed_size": 35,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 21,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21248,
"runtime": 1790.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(E(G(*)))) : A(G(**)) : E(F(*)) : (E(F(*)) AND A((** U **))) : ((** AND A(G(*))) OR A((** U **))) : A(F(E((** U **)))) : E(F(*)) : (A(G(**)) AND (** OR (A(F(**)) OR E(X(**))))) : (E(F(**)) AND (A(X(*)) OR *)) : A(F(A(G(**)))) : E((E(G(**)) U E(X(**)))) : E(F(**)) : A(G(**)) : A(G(E(F(**)))) : (E(G(A(X(**)))) OR E(X(A(G(**))))) : E(X(E(G(**))))"
},
"net":
{
"arcs": 598,
"conflict_clusters": 163,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"preliminary_value": "yes no yes yes no unknown yes no yes unknown yes yes no unknown unknown yes ",
"value": "yes no yes yes no unknown yes no yes unknown yes yes no unknown unknown 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: 457/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 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: E (F (NOT(A (F ((p122 <= p136)))))) : A (G ((((p2 <= 0) OR (p247 <= 0)) AND ((p61 + 1 <= pterce) OR (p127 <= 1))))) : NOT(A (G (((2 <= p206) OR (1 <= p65) OR (p46 <= p53))))) : (NOT(A (G ((p217 <= psecond)))) AND A (((p51 <= p139) U (p30 <= p220)))) : (((3 <= p234) AND NOT(E (F ((3 <= p236))))) OR A (((p202 + 1 <= p242) U ((1 <= p156) AND (1 <= p127))))) : A (F (E (((p185 <= p69) U (2 <= p116))))) : NOT(A (G (((p77 <= p9) AND (1 <= p63) AND (1 <= p53))))) : (A (G ((2 <= p113))) AND (((p165 <= p202) OR A (F ((3 <= p125)))) OR E (X ((p218 <= 0))))) : (E (F (E (F ((p104 <= p135))))) AND NOT((E (X ((p28 <= p1))) AND ((1 <= p115) OR (p180 <= p36) OR (p10 <= p132))))) : A (F (A (G ((p6 <= p208))))) : E ((E (G ((p224 <= p3))) U E (X ((p249 <= p22))))) : E (F (((2 <= p223) AND (1 <= p17)))) : A (G ((p227 <= p78))) : A (G (E (F ((2 <= p197))))) : (E (G (A (X ((2 <= p51))))) OR E (X (A (G ((3 <= p239)))))) : E (X (E (G ((p214 + 1 <= p194)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k: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: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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 (G ((2 <= p113))) AND ((p165 <= p202) OR (A (F ((3 <= p125))) OR E (X ((p218 <= 0))))))
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 (G ((2 <= p113)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((2 <= p113)))
lola: processed formula length: 19
lola: 24 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: (p113 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1940 markings, 1939 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p104 <= p135))) AND (A (X ((p1 + 1 <= p28))) OR ((p115 <= 0) AND (p36 + 1 <= p180) AND (p132 + 1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p104 <= p135)))
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 ((p104 <= p135)))
lola: processed formula length: 22
lola: 23 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: (p104 <= p135)
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: 52 markings, 51 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p115 <= 0) AND (p36 + 1 <= p180) AND (p132 + 1 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p115 <= 0) AND (p36 + 1 <= p180) AND (p132 + 1 <= p10))
lola: processed formula length: 57
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p1 + 1 <= p28)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p1 + 1 <= p28))
lola: processed formula length: 19
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((p224 <= p3))) U E (X ((p249 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EG((p224 <= p3)) U EX((p249 <= p22)))
lola: processed formula length: 39
lola: 25 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: 52 markings, 152 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X ((2 <= p51))))) OR E (X (A (G ((3 <= p239))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((3 <= p239)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((3 <= p239)))
lola: processed formula length: 19
lola: 24 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: 1119032 markings, 1683960 edges, 223806 markings/sec, 0 secs
lola: 2236841 markings, 3366114 edges, 223562 markings/sec, 5 secs
lola: 3341794 markings, 5028892 edges, 220991 markings/sec, 10 secs
lola: 4450197 markings, 6696888 edges, 221681 markings/sec, 15 secs
lola: 5551294 markings, 8353885 edges, 220219 markings/sec, 20 secs
lola: 6641057 markings, 9993808 edges, 217953 markings/sec, 25 secs
lola: 7743326 markings, 11652573 edges, 220454 markings/sec, 30 secs
lola: 8837870 markings, 13299685 edges, 218909 markings/sec, 35 secs
lola: 9927546 markings, 14939507 edges, 217935 markings/sec, 40 secs
lola: 11020157 markings, 16583722 edges, 218522 markings/sec, 45 secs
lola: 12102657 markings, 18212712 edges, 216500 markings/sec, 50 secs
lola: 13177196 markings, 19829756 edges, 214908 markings/sec, 55 secs
lola: 14257141 markings, 21454913 edges, 215989 markings/sec, 60 secs
lola: 15335228 markings, 23077268 edges, 215617 markings/sec, 65 secs
lola: 16407496 markings, 24690888 edges, 214454 markings/sec, 70 secs
lola: 17480227 markings, 26305192 edges, 214546 markings/sec, 75 secs
lola: 18547921 markings, 27911913 edges, 213539 markings/sec, 80 secs
lola: 19616034 markings, 29519271 edges, 213623 markings/sec, 85 secs
lola: 20683413 markings, 31125515 edges, 213476 markings/sec, 90 secs
lola: 21753387 markings, 32735675 edges, 213995 markings/sec, 95 secs
lola: 22818245 markings, 34338117 edges, 212972 markings/sec, 100 secs
lola: 23880611 markings, 35936820 edges, 212473 markings/sec, 105 secs
lola: 24946316 markings, 37540559 edges, 213141 markings/sec, 110 secs
lola: 26007590 markings, 39137629 edges, 212255 markings/sec, 115 secs
lola: 27063223 markings, 40726196 edges, 211127 markings/sec, 120 secs
lola: 28137363 markings, 42342619 edges, 214828 markings/sec, 125 secs
lola: 29205114 markings, 43949433 edges, 213550 markings/sec, 130 secs
lola: 30267571 markings, 45548282 edges, 212491 markings/sec, 135 secs
lola: 31332896 markings, 47151439 edges, 213065 markings/sec, 140 secs
lola: 32393995 markings, 48748234 edges, 212220 markings/sec, 145 secs
lola: 33451163 markings, 50339107 edges, 211434 markings/sec, 150 secs
lola: 34513926 markings, 51938415 edges, 212553 markings/sec, 155 secs
lola: 35572993 markings, 53532167 edges, 211813 markings/sec, 160 secs
lola: 36628172 markings, 55120048 edges, 211036 markings/sec, 165 secs
lola: 37683935 markings, 56708811 edges, 211153 markings/sec, 170 secs
lola: 38735412 markings, 58291152 edges, 210295 markings/sec, 175 secs
lola: 39787440 markings, 59874294 edges, 210406 markings/sec, 180 secs
lola: 40839539 markings, 61457539 edges, 210420 markings/sec, 185 secs
lola: 41899250 markings, 63052260 edges, 211942 markings/sec, 190 secs
lola: 42954799 markings, 64640710 edges, 211110 markings/sec, 195 secs
lola: 43470862 markings, 65417305 edges, 103213 markings/sec, 200 secs
lola: 43470911 markings, 65417374 edges, 10 markings/sec, 205 secs
lola: 43479015 markings, 65429566 edges, 1621 markings/sec, 210 secs
lola: 43480385 markings, 65431628 edges, 274 markings/sec, 215 secs
lola: 43480467 markings, 65431746 edges, 16 markings/sec, 220 secs
lola: 43480529 markings, 65431861 edges, 12 markings/sec, 225 secs
lola: 43480628 markings, 65432012 edges, 20 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((2 <= p51)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX((2 <= p51)))
lola: processed formula length: 18
lola: 24 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: 1 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p214 + 1 <= p194)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (p214 + 1 <= p194)
lola: processed formula length: 18
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p214 + 1 <= p194)
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 /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p223) AND (1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((2 <= p223) AND (1 <= p17))))
lola: processed formula length: 36
lola: 23 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 <= p223) AND (1 <= p17))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p227 <= p78)))
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 ((p227 <= p78)))
lola: processed formula length: 21
lola: 24 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: (p78 + 1 <= p227)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p9 + 1 <= p77) OR (p63 <= 0) OR (p53 <= 0))))
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 (((p9 + 1 <= p77) OR (p63 <= 0) OR (p53 <= 0))))
lola: processed formula length: 55
lola: 23 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: ((p9 + 1 <= p77) OR (p63 <= 0) OR (p53 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 102 markings, 126 edges
lola: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p206 <= 1) AND (p65 <= 0) AND (p53 + 1 <= p46))))
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 (((p206 <= 1) AND (p65 <= 0) AND (p53 + 1 <= p46))))
lola: processed formula length: 57
lola: 23 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: ((p206 <= 1) AND (p65 <= 0) AND (p53 + 1 <= p46))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1878 markings, 1877 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p2 <= 0) OR (p247 <= 0)) AND ((p61 + 1 <= pterce) OR (p127 <= 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 ((((p2 <= 0) OR (p247 <= 0)) AND ((p61 + 1 <= pterce) OR (p127 <= 1)))))
lola: processed formula length: 79
lola: 24 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)
sara: try reading problem file CTLCardinality-8-0.sara.
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: (((1 <= p2) AND (1 <= p247)) OR ((pterce <= p61) AND (2 <= p127)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 36 markings, 35 edges
lola: ========================================
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((2 <= p197)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (2 <= p197)
lola: processed formula length: 11
lola: 25 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
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: (p197 <= 1)
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= p197)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLCardinality-10-1.sara.
lola: state equation 0: solution produced
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1052449 markings, 1583776 edges, 210490 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2131277 markings, 3207257 edges, 215766 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3200759 markings, 4816659 edges, 213896 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4267352 markings, 6421718 edges, 213319 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5328194 markings, 8018154 edges, 212168 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6383041 markings, 9605533 edges, 210969 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7438941 markings, 11194504 edges, 211180 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8491008 markings, 12777724 edges, 210413 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9462017 markings, 14238945 edges, 194202 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10508077 markings, 15813117 edges, 209212 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11552048 markings, 17384135 edges, 208794 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12593613 markings, 18951549 edges, 208313 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13631725 markings, 20513747 edges, 207622 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 14678389 markings, 22088814 edges, 209333 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 15720136 markings, 23656494 edges, 208349 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 16757372 markings, 25217396 edges, 207447 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 17754593 markings, 26718057 edges, 199444 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 18792316 markings, 28279678 edges, 207545 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 19827573 markings, 29837590 edges, 207051 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 20865380 markings, 31399332 edges, 207561 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 21903536 markings, 32961610 edges, 207631 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 22811224 markings, 34327560 edges, 181538 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 23841270 markings, 35877616 edges, 206009 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 24874397 markings, 37432341 edges, 206625 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 25904681 markings, 38982756 edges, 206057 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 26927247 markings, 40521558 edges, 204513 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 27969650 markings, 42090246 edges, 208481 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 29004273 markings, 43647197 edges, 206925 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 30035727 markings, 45199389 edges, 206291 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 30944551 markings, 46567016 edges, 181765 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 31973882 markings, 48116034 edges, 205866 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 33003191 markings, 49664979 edges, 205862 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 34029612 markings, 51209584 edges, 205284 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 35061121 markings, 52761869 edges, 206302 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 36089693 markings, 54309712 edges, 205714 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 37111910 markings, 55848005 edges, 204443 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 38140838 markings, 57396386 edges, 205786 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 39161854 markings, 58932878 edges, 204203 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 40177094 markings, 60460665 edges, 203048 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 41203882 markings, 62005821 edges, 205358 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 42231099 markings, 63551633 edges, 205443 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 43257293 markings, 65095908 edges, 205239 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 44281509 markings, 66637196 edges, 204843 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 45304233 markings, 68176264 edges, 204545 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 46323690 markings, 69710381 edges, 203891 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 46887423 markings, 70558723 edges, 112747 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 46909675 markings, 70592211 edges, 4450 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p136 + 1 <= p122)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (p136 + 1 <= p122)
lola: processed formula length: 18
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p136 + 1 <= p122)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is possibly preserved from a reachable marking.
lola: 54 markings, 54 edges
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: (p122 <= p136)
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 12 will run for 772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((p185 <= p69) U (2 <= p116)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E((p185 <= p69) U (2 <= p116)))
lola: processed formula length: 34
lola: 24 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: 1058916 markings, 1593501 edges, 211783 markings/sec, 0 secs
lola: 2118021 markings, 3187299 edges, 211821 markings/sec, 5 secs
lola: 3231056 markings, 4862246 edges, 222607 markings/sec, 10 secs
lola: 4346353 markings, 6540609 edges, 223059 markings/sec, 15 secs
lola: 5454858 markings, 8208756 edges, 221701 markings/sec, 20 secs
lola: 6557861 markings, 9868603 edges, 220601 markings/sec, 25 secs
lola: 7613305 markings, 11456893 edges, 211089 markings/sec, 30 secs
lola: 8717173 markings, 13118064 edges, 220774 markings/sec, 35 secs
lola: 9817379 markings, 14773709 edges, 220041 markings/sec, 40 secs
lola: 10918249 markings, 16430355 edges, 220174 markings/sec, 45 secs
lola: 12014543 markings, 18080137 edges, 219259 markings/sec, 50 secs
lola: 13105611 markings, 19722034 edges, 218214 markings/sec, 55 secs
lola: 14201671 markings, 21371433 edges, 219212 markings/sec, 60 secs
lola: 15295954 markings, 23018164 edges, 218857 markings/sec, 65 secs
lola: 16302070 markings, 24532217 edges, 201223 markings/sec, 70 secs
lola: 17387160 markings, 26165125 edges, 217018 markings/sec, 75 secs
lola: 18468146 markings, 27791852 edges, 216197 markings/sec, 80 secs
lola: 19549184 markings, 29418670 edges, 216208 markings/sec, 85 secs
lola: 20627864 markings, 31041907 edges, 215736 markings/sec, 90 secs
lola: 21710977 markings, 32671851 edges, 216623 markings/sec, 95 secs
lola: 22788299 markings, 34293053 edges, 215464 markings/sec, 100 secs
lola: 23862975 markings, 35910285 edges, 214935 markings/sec, 105 secs
lola: 24939866 markings, 37530847 edges, 215378 markings/sec, 110 secs
lola: 26012524 markings, 39145049 edges, 214532 markings/sec, 115 secs
lola: 27080235 markings, 40751805 edges, 213542 markings/sec, 120 secs
lola: 28162457 markings, 42380390 edges, 216444 markings/sec, 125 secs
lola: 29239069 markings, 44000518 edges, 215322 markings/sec, 130 secs
lola: 30309358 markings, 45611151 edges, 214058 markings/sec, 135 secs
lola: 31383478 markings, 47227563 edges, 214824 markings/sec, 140 secs
lola: 32396451 markings, 48751924 edges, 202595 markings/sec, 145 secs
lola: 33465167 markings, 50360179 edges, 213743 markings/sec, 150 secs
lola: 34540384 markings, 51978224 edges, 215043 markings/sec, 155 secs
lola: 35612608 markings, 53591765 edges, 214445 markings/sec, 160 secs
lola: 36678373 markings, 55195596 edges, 213153 markings/sec, 165 secs
lola: 37745273 markings, 56801138 edges, 213380 markings/sec, 170 secs
lola: 38721586 markings, 58270334 edges, 195263 markings/sec, 175 secs
lola: 39749997 markings, 59817943 edges, 205682 markings/sec, 180 secs
lola: 40814219 markings, 61419433 edges, 212844 markings/sec, 185 secs
lola: 41887399 markings, 63034424 edges, 214636 markings/sec, 190 secs
lola: 42955291 markings, 64641440 edges, 213578 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 962 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p6 <= p208)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p208 + 1 <= p6)
lola: processed formula length: 16
lola: 26 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p6 <= p208)
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 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: (p208 + 1 <= p6)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-13-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-1.sara.
sara: try reading problem file CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1072797 markings, 1614378 edges, 214559 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2179047 markings, 3279136 edges, 221250 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3272225 markings, 4924212 edges, 218636 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4296624 markings, 6465780 edges, 204880 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5382771 markings, 8100281 edges, 217229 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6462427 markings, 9725011 edges, 215931 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7545283 markings, 11354543 edges, 216571 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8623637 markings, 12977298 edges, 215671 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9696185 markings, 14591329 edges, 214510 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10771975 markings, 16210239 edges, 215158 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11841185 markings, 17819255 edges, 213842 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12910123 markings, 19427853 edges, 213788 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13978880 markings, 21036164 edges, 213751 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 15048430 markings, 22645682 edges, 213910 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 16113050 markings, 24247774 edges, 212924 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 17174978 markings, 25845822 edges, 212386 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 18236271 markings, 27442923 edges, 212259 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 19293813 markings, 29034355 edges, 211508 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 20347951 markings, 30620698 edges, 210828 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 21412733 markings, 32223024 edges, 212956 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 22471367 markings, 33816114 edges, 211727 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 23522533 markings, 35397981 edges, 210233 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 24579202 markings, 36988117 edges, 211334 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 25628546 markings, 38567220 edges, 209869 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 26675553 markings, 40142817 edges, 209401 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 27682601 markings, 41658277 edges, 201410 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 28741094 markings, 43251147 edges, 211699 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 29730723 markings, 44740396 edges, 197926 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 30780608 markings, 46320324 edges, 209977 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 31830335 markings, 47899998 edges, 209945 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 32875375 markings, 49472631 edges, 209008 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 33918900 markings, 51042988 edges, 208705 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 34971545 markings, 52627059 edges, 210529 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 36017596 markings, 54201216 edges, 209210 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 37055624 markings, 55763300 edges, 207606 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 38101648 markings, 57337426 edges, 209205 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 39141536 markings, 58902305 edges, 207978 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 40176971 markings, 60460472 edges, 207087 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 41223335 markings, 62035092 edges, 209273 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 42271203 markings, 63612003 edges, 209574 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 43314926 markings, 65182642 edges, 208745 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 44355098 markings, 66747962 edges, 208034 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 45391876 markings, 68308153 edges, 207356 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 46427761 markings, 69867016 edges, 207177 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 47442993 markings, 71394771 edges, 203046 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 47480405 markings, 71451082 edges, 7482 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((3 <= p234) AND A (G ((p236 <= 2)))) OR A (((p202 + 1 <= p242) U ((1 <= p156) AND (1 <= p127)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p234)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p234)
lola: processed formula length: 11
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p236 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p236 <= 2)))
lola: processed formula length: 19
lola: 24 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p236)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((psecond + 1 <= p217))) AND A (((p51 <= p139) U (p30 <= p220))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((psecond + 1 <= p217)))
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 ((psecond + 1 <= p217)))
lola: processed formula length: 29
lola: 23 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: (psecond + 1 <= p217)
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: 5 markings, 4 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (A (X ((2 <= p51))))) OR E (X (A (G ((3 <= p239))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((3 <= p239)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((3 <= p239)))
lola: processed formula length: 19
lola: 24 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: 1019012 markings, 1533448 edges, 203802 markings/sec, 0 secs
lola: 2023931 markings, 3045713 edges, 200984 markings/sec, 5 secs
lola: 3069996 markings, 4619886 edges, 209213 markings/sec, 10 secs
lola: 4112140 markings, 6188156 edges, 208429 markings/sec, 15 secs
lola: 5149249 markings, 7748854 edges, 207422 markings/sec, 20 secs
lola: 6184349 markings, 9306534 edges, 207020 markings/sec, 25 secs
lola: 7219540 markings, 10864335 edges, 207038 markings/sec, 30 secs
lola: 8254772 markings, 12422209 edges, 207046 markings/sec, 35 secs
lola: 9286451 markings, 13974741 edges, 206336 markings/sec, 40 secs
lola: 10315219 markings, 15522890 edges, 205754 markings/sec, 45 secs
lola: 11344775 markings, 17072212 edges, 205911 markings/sec, 50 secs
lola: 12369710 markings, 18614597 edges, 204987 markings/sec, 55 secs
lola: 13389283 markings, 20148918 edges, 203915 markings/sec, 60 secs
lola: 14418134 markings, 21697186 edges, 205770 markings/sec, 65 secs
lola: 15441902 markings, 23237794 edges, 204754 markings/sec, 70 secs
lola: 16460407 markings, 24770504 edges, 203701 markings/sec, 75 secs
lola: 17480625 markings, 26305786 edges, 204044 markings/sec, 80 secs
lola: 18495163 markings, 27832511 edges, 202908 markings/sec, 85 secs
lola: 19510641 markings, 29360658 edges, 203096 markings/sec, 90 secs
lola: 20524328 markings, 30886108 edges, 202737 markings/sec, 95 secs
lola: 21542843 markings, 32418832 edges, 203703 markings/sec, 100 secs
lola: 22556676 markings, 33944504 edges, 202767 markings/sec, 105 secs
lola: 23563612 markings, 35459800 edges, 201387 markings/sec, 110 secs
lola: 24579046 markings, 36987859 edges, 203087 markings/sec, 115 secs
lola: 25587989 markings, 38506193 edges, 201789 markings/sec, 120 secs
lola: 26593558 markings, 40019426 edges, 201114 markings/sec, 125 secs
lola: 27607170 markings, 41544758 edges, 202722 markings/sec, 130 secs
lola: 28621268 markings, 43070820 edges, 202820 markings/sec, 135 secs
lola: 29633996 markings, 44594833 edges, 202546 markings/sec, 140 secs
lola: 30642059 markings, 46111821 edges, 201613 markings/sec, 145 secs
lola: 31650088 markings, 47628751 edges, 201606 markings/sec, 150 secs
lola: 32655941 markings, 49142435 edges, 201171 markings/sec, 155 secs
lola: 33655515 markings, 50646626 edges, 199915 markings/sec, 160 secs
lola: 34666925 markings, 52168669 edges, 202282 markings/sec, 165 secs
lola: 35673072 markings, 53682753 edges, 201229 markings/sec, 170 secs
lola: 36672729 markings, 55187111 edges, 199931 markings/sec, 175 secs
lola: 37674874 markings, 56695174 edges, 200429 markings/sec, 180 secs
lola: 38674737 markings, 58199841 edges, 199973 markings/sec, 185 secs
lola: 39673873 markings, 59703390 edges, 199827 markings/sec, 190 secs
lola: 40671124 markings, 61204104 edges, 199450 markings/sec, 195 secs
lola: 41679257 markings, 62721211 edges, 201627 markings/sec, 200 secs
lola: 42683215 markings, 64232016 edges, 200792 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((2 <= p51)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX((2 <= p51)))
lola: processed formula length: 18
lola: 24 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((2 <= p197)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (2 <= p197)
lola: processed formula length: 11
lola: 25 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
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: (p197 <= 1)
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= p197)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: write sara problem file to CTLCardinality-17-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: sara: try reading problem file CTLCardinality-17-1.sara.try reading problem file CTLCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1047065 markings, 1575659 edges, 209413 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2127439 markings, 3201468 edges, 216075 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3197927 markings, 4812402 edges, 214098 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4263462 markings, 6415875 edges, 213107 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5323822 markings, 8011551 edges, 212072 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6312277 markings, 9499045 edges, 197691 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7364588 markings, 11082620 edges, 210462 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8413488 markings, 12661056 edges, 209780 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9462339 markings, 14239423 edges, 209770 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10507489 markings, 15812216 edges, 209030 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11550098 markings, 17381205 edges, 208522 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12589692 markings, 18945649 edges, 207919 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 13625419 markings, 20504248 edges, 207145 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 14672049 markings, 22079293 edges, 209326 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 15712530 markings, 23645057 edges, 208096 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 16747654 markings, 25202754 edges, 207025 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 17784453 markings, 26762986 edges, 207360 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 18817349 markings, 28317350 edges, 206579 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 19847239 markings, 29867182 edges, 205978 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 20881074 markings, 31422965 edges, 206767 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 21914681 markings, 32978393 edges, 206721 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 22947044 markings, 34531946 edges, 206473 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 23974808 markings, 36078588 edges, 205553 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 25003636 markings, 37626814 edges, 205766 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 26029361 markings, 39170385 edges, 205145 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 27048436 markings, 40703947 edges, 203815 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 28087594 markings, 42267734 edges, 207832 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 29119017 markings, 43819871 edges, 206285 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 30149895 markings, 45371179 edges, 206176 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 31179385 markings, 46920408 edges, 205898 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 32206843 markings, 48466593 edges, 205492 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 33230734 markings, 50007390 edges, 204778 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 34254797 markings, 51548468 edges, 204813 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 35280961 markings, 53092682 edges, 205233 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 36304427 markings, 54632867 edges, 204693 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 37324642 markings, 56168142 edges, 204043 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 38348627 markings, 57709083 edges, 204797 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 39365370 markings, 59239146 edges, 203349 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 40374692 markings, 60758016 edges, 201864 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 41400909 markings, 62302313 edges, 205243 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 42424757 markings, 63843069 edges, 204770 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 43444953 markings, 65378306 edges, 204039 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 44466714 markings, 66915908 edges, 204352 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 45482278 markings, 68444178 edges, 203113 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 46496595 markings, 69970591 edges, 202863 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (E (((p185 <= p69) U (2 <= p116)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E((p185 <= p69) U (2 <= p116)))
lola: processed formula length: 34
lola: 24 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: 1054881 markings, 1587420 edges, 210976 markings/sec, 0 secs
lola: 2177464 markings, 3276745 edges, 224517 markings/sec, 5 secs
lola: 3192781 markings, 4804663 edges, 203063 markings/sec, 10 secs
lola: 4300950 markings, 6472293 edges, 221634 markings/sec, 15 secs
lola: 5402455 markings, 8129908 edges, 220301 markings/sec, 20 secs
lola: 6498259 markings, 9778927 edges, 219161 markings/sec, 25 secs
lola: 7599637 markings, 11436340 edges, 220276 markings/sec, 30 secs
lola: 8696173 markings, 13086467 edges, 219307 markings/sec, 35 secs
lola: 9787347 markings, 14728521 edges, 218235 markings/sec, 40 secs
lola: 10880181 markings, 16373078 edges, 218567 markings/sec, 45 secs
lola: 11967222 markings, 18008906 edges, 217408 markings/sec, 50 secs
lola: 13051948 markings, 19641277 edges, 216945 markings/sec, 55 secs
lola: 14139692 markings, 21278155 edges, 217549 markings/sec, 60 secs
lola: 15225264 markings, 22911801 edges, 217114 markings/sec, 65 secs
lola: 16308460 markings, 24541834 edges, 216639 markings/sec, 70 secs
lola: 17389592 markings, 26168802 edges, 216226 markings/sec, 75 secs
lola: 18464880 markings, 27786938 edges, 215058 markings/sec, 80 secs
lola: 19541270 markings, 29406763 edges, 215278 markings/sec, 85 secs
lola: 20616548 markings, 31024884 edges, 215056 markings/sec, 90 secs
lola: 21696417 markings, 32649938 edges, 215974 markings/sec, 95 secs
lola: 22769131 markings, 34264202 edges, 214543 markings/sec, 100 secs
lola: 23839731 markings, 35875308 edges, 214120 markings/sec, 105 secs
lola: 24913285 markings, 37490842 edges, 214711 markings/sec, 110 secs
lola: 25982324 markings, 39099591 edges, 213808 markings/sec, 115 secs
lola: 27045521 markings, 40699564 edges, 212639 markings/sec, 120 secs
lola: 28127741 markings, 42328147 edges, 216444 markings/sec, 125 secs
lola: 29201758 markings, 43944382 edges, 214803 markings/sec, 130 secs
lola: 30269322 markings, 45550916 edges, 213513 markings/sec, 135 secs
lola: 31338900 markings, 47160473 edges, 213916 markings/sec, 140 secs
lola: 32404408 markings, 48763909 edges, 213102 markings/sec, 145 secs
lola: 33466582 markings, 50362319 edges, 212435 markings/sec, 150 secs
lola: 34534103 markings, 51968772 edges, 213504 markings/sec, 155 secs
lola: 35597836 markings, 53569557 edges, 212747 markings/sec, 160 secs
lola: 36657230 markings, 55163771 edges, 211879 markings/sec, 165 secs
lola: 37717534 markings, 56759377 edges, 212061 markings/sec, 170 secs
lola: 38773930 markings, 58349113 edges, 211279 markings/sec, 175 secs
lola: 39832870 markings, 59942662 edges, 211788 markings/sec, 180 secs
lola: 40891514 markings, 61535773 edges, 211729 markings/sec, 185 secs
lola: 41957276 markings, 63139580 edges, 213152 markings/sec, 190 secs
lola: 43018725 markings, 64736891 edges, 212290 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p6 <= p208)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p208 + 1 <= p6)
lola: processed formula length: 16
lola: 26 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p6 <= p208)
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 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: (p208 + 1 <= p6)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-19-0.sara
lola: state equation: write sara problem file to CTLCardinality-19-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: sara: try reading problem file CTLCardinality-19-1.sara.
try reading problem file CTLCardinality-19-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1077984 markings, 1622199 edges, 215597 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2186840 markings, 3290851 edges, 221771 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3229044 markings, 4859237 edges, 208441 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4328433 markings, 6513641 edges, 219878 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5421734 markings, 8158910 edges, 218660 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6507953 markings, 9793521 edges, 217244 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7598795 markings, 11435063 edges, 218168 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8686115 markings, 13071327 edges, 217464 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9767046 markings, 14697965 edges, 216186 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10849580 markings, 16327023 edges, 216507 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11926483 markings, 17947615 edges, 215381 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 13000672 markings, 19564112 edges, 214838 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 14077108 markings, 21183993 edges, 215287 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 15151817 markings, 22801277 edges, 214942 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 16224141 markings, 24414965 edges, 214465 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 17292934 markings, 26023324 edges, 213759 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 18360550 markings, 27629940 edges, 213523 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 19422758 markings, 29228398 edges, 212442 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 20486642 markings, 30829390 edges, 212777 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 21557241 markings, 32440487 edges, 214120 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 22621726 markings, 34042382 edges, 212897 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 23679788 markings, 35634624 edges, 211612 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 24744586 markings, 37236981 edges, 212960 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 25802281 markings, 38828653 edges, 211539 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 26854512 markings, 40412107 edges, 210446 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 27922441 markings, 42019187 edges, 213586 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 28985705 markings, 43619244 edges, 212653 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 30045895 markings, 45214681 edges, 212038 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 31104864 markings, 46808288 edges, 211794 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 32160539 markings, 48396914 edges, 211135 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 33214117 markings, 49982401 edges, 210716 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 34269716 markings, 51570914 edges, 211120 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 35325564 markings, 53159810 edges, 211170 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 36379513 markings, 54745861 edges, 210790 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 37428922 markings, 56325055 edges, 209882 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 38479250 markings, 57905664 edges, 210066 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 39524978 markings, 59479317 edges, 209146 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 40566609 markings, 61046814 edges, 208326 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 41625405 markings, 62640165 edges, 211759 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 42678720 markings, 64225232 edges, 210663 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 43724700 markings, 65799285 edges, 209196 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 44709752 markings, 67281651 edges, 197010 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 45752060 markings, 68850174 edges, 208462 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 46790769 markings, 70413277 edges, 207742 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((3 <= p234) AND A (G ((p236 <= 2)))) OR A (((p202 + 1 <= p242) U ((1 <= p156) AND (1 <= p127)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= p234)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p234)
lola: processed formula length: 11
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((p236 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p236 <= 2)))
lola: processed formula length: 19
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p236)
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: 4 markings, 3 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((p202 + 1 <= p242) U ((1 <= p156) AND (1 <= p127))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p202 + 1 <= p242) U ((1 <= p156) AND (1 <= p127))))
lola: processed formula length: 56
lola: 27 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p202 + 1 <= p242)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLCardinality-22-0.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: (E (F ((psecond + 1 <= p217))) AND A (((p51 <= p139) U (p30 <= p220))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((psecond + 1 <= p217)))
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 ((psecond + 1 <= p217)))
lola: processed formula length: 29
lola: 23 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: (psecond + 1 <= p217)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((p51 <= p139) U (p30 <= p220)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p51 <= p139) U (p30 <= p220)))
lola: processed formula length: 35
lola: 27 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: 0
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: (p51 <= p139)
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 /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no unknown yes no yes unknown yes yes no unknown unknown yes
lola:
preliminary result: yes no yes yes no unknown yes no yes unknown yes yes no unknown unknown yes
sara: try reading problem file CTLCardinality-22-0.sara.
sara: could not read problem information -- aborting [#01]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: memory consumption: 21248 KB
lola: time consumption: 1790 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
BK_STOP 1553108426737
--------------------
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="RefineWMG-PT-050051"
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 RefineWMG-PT-050051, 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 r137-smll-155284909900391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050051.tgz
mv RefineWMG-PT-050051 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 ;