fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r082-csrt-155246548900085
Last Updated
Apr 15, 2019

About the Execution of LoLA for FMS-PT-02000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.310 1507929.00 1568514.00 3382.70 F??T?TFTF?TFTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246548900085.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is FMS-PT-02000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246548900085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 2.7K Feb 10 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 10 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 6 21:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 6 21:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 99 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 337 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 23:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K Feb 4 23:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 3 08:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 3 08:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jan 31 01:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 31 01:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:20 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-02000-CTLCardinality-00
FORMULA_NAME FMS-PT-02000-CTLCardinality-01
FORMULA_NAME FMS-PT-02000-CTLCardinality-02
FORMULA_NAME FMS-PT-02000-CTLCardinality-03
FORMULA_NAME FMS-PT-02000-CTLCardinality-04
FORMULA_NAME FMS-PT-02000-CTLCardinality-05
FORMULA_NAME FMS-PT-02000-CTLCardinality-06
FORMULA_NAME FMS-PT-02000-CTLCardinality-07
FORMULA_NAME FMS-PT-02000-CTLCardinality-08
FORMULA_NAME FMS-PT-02000-CTLCardinality-09
FORMULA_NAME FMS-PT-02000-CTLCardinality-10
FORMULA_NAME FMS-PT-02000-CTLCardinality-11
FORMULA_NAME FMS-PT-02000-CTLCardinality-12
FORMULA_NAME FMS-PT-02000-CTLCardinality-13
FORMULA_NAME FMS-PT-02000-CTLCardinality-14
FORMULA_NAME FMS-PT-02000-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552654519792

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ FMS-PT-02000 @ 3570 seconds

FORMULA FMS-PT-02000-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-02000-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2062
rslt: Output for CTLCardinality @ FMS-PT-02000

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Mar 15 12:55:19 2019
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"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": 297
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (((P2d <= P12s) U ((2 <= P2wM2) AND (3 <= M1))))",
"processed_size": 50,
"rewrites": 25
},
"result":
{
"edges": 19996,
"markings": 10001,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 311
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= P1wP2)))",
"processed_size": 20,
"rewrites": 23
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 346
},
"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 ((P1s <= 2)))",
"processed_size": 18,
"rewrites": 24
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 389
},
"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 ((P1 <= P2wM2)))",
"processed_size": 21,
"rewrites": 23
},
"result":
{
"edges": 2000,
"markings": 2001,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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 ((P2 <= P2d)))",
"processed_size": 19,
"rewrites": 23
},
"result":
{
"edges": 2000,
"markings": 2001,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 519
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((P12 + 1 <= P2wM2) OR (P12 + 1 <= M3) OR (2 <= P2wM2))))",
"processed_size": 65,
"rewrites": 24
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 623
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((((M2 <= P1M1) OR (P12s <= P1M1)))))",
"processed_size": 43,
"rewrites": 24
},
"result":
{
"edges": 6021,
"markings": 6020,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 778
},
"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": "(P2 <= 2)",
"processed_size": 9,
"rewrites": 25
},
"result":
{
"edges": 10004,
"markings": 10004,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 12,
"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": 1038
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= P1d)",
"processed_size": 10,
"rewrites": 26
},
"result":
{
"edges": 16010,
"markings": 16010,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2819
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((P12M3 + 1 <= P1wP2) R (M3 <= 1)))",
"processed_size": 38,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (((P2d <= P12s) U ((2 <= P2wM2) AND (3 <= M1))))",
"processed_size": 50,
"rewrites": 25
},
"result":
{
"edges": 19996,
"markings": 10001,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((P12M3 + 1 <= P1wP2) R (M3 <= 1)))",
"processed_size": 38,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((P1wM1 + 1 <= M3) AND (P1 <= 0))))",
"processed_size": 41,
"rewrites": 23
},
"result":
{
"edges": 5995,
"markings": 5996,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 18944,
"runtime": 1508.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(A(X(**)))) : A(G(E(X(**)))) : E(F(E(G(**)))) : E((E(F(**)) U E(G(**)))) : (E(F(**)) OR A((* R *))) : A(G(**)) : E(F(**)) : A(G(*)) : (E((** U **)) AND E(F(A(X(**))))) : E(F(**)) : FALSE : E(F(**)) : A(G(A(F(**)))) : TRUE : FALSE"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no unknown unknown yes unknown yes no yes no unknown yes no yes no yes no ",
"value": "no unknown unknown yes unknown yes no yes no unknown yes no yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= P2M2)
lola: LP says that atomic proposition is always false: (3 <= P2M2)
lola: LP says that atomic proposition is always false: (3 <= M2)
lola: LP says that atomic proposition is always false: (2 <= P2M2)
lola: A (G (((P12 + 1 <= P2wM2) OR (P12 + 1 <= M3) OR (2 <= P2wM2)))) : E (F (A (X ((1 <= P1s))))) : A (G (E (X ((P2M2 <= P2d))))) : E (F (E (G ((P2 <= 2))))) : E ((E (F ((P1d <= P12M3))) U E (G ((M3 <= P12))))) : (E (F (((P1wM1 + 1 <= M3) AND (P1 <= 0)))) OR NOT(E (((P1wP2 <= P12M3) U (2 <= M3))))) : A (G ((((M2 <= P1M1) OR (P12s <= P1M1))))) : E ((A (X ((2 <= P1wM1))) U E (F ((3 <= P1wP2))))) : E (G (NOT(E (F ((3 <= P1s)))))) : (E (((P2d <= P12s) U ((2 <= P2wM2) AND (3 <= M1)))) AND E (F (A (X ((3 <= P12s)))))) : A (F (E (F ((P1 <= P2wM2))))) : E (F ((E (G ((P12M3 <= P1))) AND (2 <= P2M2)))) : E (F ((P2 <= P2d))) : A (G (A (F ((P1d <= 2))))) : ((3 <= P2M2) OR A (G ((M2 <= 2)))) : E (F (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:473
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:476
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= P1s)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((1 <= P1s)))
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: 3321941 markings, 6089776 edges, 664388 markings/sec, 0 secs
lola: 6801995 markings, 12467736 edges, 696011 markings/sec, 5 secs
lola: 9936390 markings, 18213765 edges, 626879 markings/sec, 10 secs
lola: 13142280 markings, 24088994 edges, 641178 markings/sec, 15 secs
lola: 16434822 markings, 30053354 edges, 658508 markings/sec, 20 secs
lola: 19270458 markings, 34777912 edges, 567127 markings/sec, 25 secs
lola: 22213895 markings, 39681648 edges, 588687 markings/sec, 30 secs
lola: 25026139 markings, 44368264 edges, 562449 markings/sec, 35 secs
lola: 27892218 markings, 49142510 edges, 573216 markings/sec, 40 secs
lola: 31403791 markings, 54993316 edges, 702315 markings/sec, 45 secs
lola: 34439135 markings, 60051982 edges, 607069 markings/sec, 50 secs
lola: 37468642 markings, 65098977 edges, 605901 markings/sec, 55 secs
lola: 40537727 markings, 70287195 edges, 613817 markings/sec, 60 secs
lola: 43680967 markings, 75840107 edges, 628648 markings/sec, 65 secs
lola: 47104500 markings, 81841460 edges, 684707 markings/sec, 70 secs
lola: 50562583 markings, 87881903 edges, 691617 markings/sec, 75 secs
lola: 53960572 markings, 93810187 edges, 679598 markings/sec, 80 secs
lola: 57304376 markings, 99651990 edges, 668761 markings/sec, 85 secs
lola: 60521937 markings, 105257531 edges, 643512 markings/sec, 90 secs
lola: 63566735 markings, 110560297 edges, 608960 markings/sec, 95 secs
lola: 66499989 markings, 115662753 edges, 586651 markings/sec, 100 secs
lola: 69421976 markings, 120765264 edges, 584397 markings/sec, 105 secs
lola: 72384995 markings, 125906496 edges, 592604 markings/sec, 110 secs
lola: 75339270 markings, 131048899 edges, 590855 markings/sec, 115 secs
lola: 78187812 markings, 136012567 edges, 569708 markings/sec, 120 secs
lola: 81008895 markings, 140924824 edges, 564217 markings/sec, 125 secs
lola: 84083043 markings, 146268078 edges, 614830 markings/sec, 130 secs
lola: 87083276 markings, 151497049 edges, 600047 markings/sec, 135 secs
lola: 89980316 markings, 156537681 edges, 579408 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((P2M2 <= P2d)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((P2M2 <= P2d)))
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: 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: 2805883 markings, 5143953 edges, 561177 markings/sec, 0 secs
lola: 6044783 markings, 11079179 edges, 647780 markings/sec, 5 secs
lola: 9375773 markings, 17184857 edges, 666198 markings/sec, 10 secs
lola: 12465162 markings, 22846113 edges, 617878 markings/sec, 15 secs
lola: 15657265 markings, 28697352 edges, 638421 markings/sec, 20 secs
lola: 18480633 markings, 33461610 edges, 564674 markings/sec, 25 secs
lola: 21249800 markings, 38076102 edges, 553833 markings/sec, 30 secs
lola: 23856650 markings, 42419341 edges, 521370 markings/sec, 35 secs
lola: 26410829 markings, 46674720 edges, 510836 markings/sec, 40 secs
lola: 29187074 markings, 51300877 edges, 555249 markings/sec, 45 secs
lola: 32518680 markings, 56851928 edges, 666321 markings/sec, 50 secs
lola: 35828472 markings, 62365730 edges, 661958 markings/sec, 55 secs
lola: 39234077 markings, 68040671 edges, 681121 markings/sec, 60 secs
lola: 42709560 markings, 74131779 edges, 695097 markings/sec, 65 secs
lola: 46142399 markings, 80157742 edges, 686568 markings/sec, 70 secs
lola: 49209484 markings, 85516374 edges, 613417 markings/sec, 75 secs
lola: 52242725 markings, 90810813 edges, 606648 markings/sec, 80 secs
lola: 55156052 markings, 95891720 edges, 582665 markings/sec, 85 secs
lola: 58303088 markings, 101393047 edges, 629407 markings/sec, 90 secs
lola: 61632476 markings, 107186073 edges, 665878 markings/sec, 95 secs
lola: 64990895 markings, 113031324 edges, 671684 markings/sec, 100 secs
lola: 68321821 markings, 118851506 edges, 666185 markings/sec, 105 secs
lola: 71568484 markings, 124507945 edges, 649333 markings/sec, 110 secs
lola: 74831224 markings, 130165068 edges, 652548 markings/sec, 115 secs
lola: 78081962 markings, 135835389 edges, 650148 markings/sec, 120 secs
lola: 81240438 markings, 141336293 edges, 631695 markings/sec, 125 secs
lola: 84504632 markings, 147021998 edges, 652839 markings/sec, 130 secs
lola: 87795948 markings, 152736408 edges, 658263 markings/sec, 135 secs
lola: 90843432 markings, 158036770 edges, 609497 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((P2d <= P12s) U ((2 <= P2wM2) AND (3 <= M1)))) AND E (F (A (X ((3 <= P12s))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((P2d <= P12s) U ((2 <= P2wM2) AND (3 <= M1))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((P2d <= P12s) U ((2 <= P2wM2) AND (3 <= M1))))
lola: processed formula length: 50
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= P2wM2) AND (3 <= M1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 10001 markings, 19996 edges
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((3 <= P12s)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: ========================================
lola: processed formula: EF(AX((3 <= P12s)))
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: 2935798 markings, 5380658 edges, 587160 markings/sec, 0 secs
lola: 6558030 markings, 12020390 edges, 724446 markings/sec, 5 secs
lola: 10028595 markings, 18380218 edges, 694113 markings/sec, 10 secs
lola: 13409645 markings, 24578586 edges, 676210 markings/sec, 15 secs
lola: 16977060 markings, 30956897 edges, 713483 markings/sec, 20 secs
lola: 19781501 markings, 35628870 edges, 560888 markings/sec, 25 secs
lola: 22529031 markings, 40207712 edges, 549506 markings/sec, 30 secs
lola: 25160689 markings, 44591271 edges, 526332 markings/sec, 35 secs
lola: 27809551 markings, 49005232 edges, 529772 markings/sec, 40 secs
lola: 31006693 markings, 54332193 edges, 639428 markings/sec, 45 secs
lola: 34085183 markings, 59462170 edges, 615698 markings/sec, 50 secs
lola: 37093158 markings, 64473643 edges, 601595 markings/sec, 55 secs
lola: 40503080 markings, 70225042 edges, 681984 markings/sec, 60 secs
lola: 43803911 markings, 76055751 edges, 660166 markings/sec, 65 secs
lola: 46931372 markings, 81535149 edges, 625492 markings/sec, 70 secs
lola: 49983755 markings, 86874538 edges, 610477 markings/sec, 75 secs
lola: 53269252 markings, 92601885 edges, 657099 markings/sec, 80 secs
lola: 56361196 markings, 97994235 edges, 618389 markings/sec, 85 secs
lola: 59360024 markings, 103222394 edges, 599766 markings/sec, 90 secs
lola: 62312592 markings, 108382153 edges, 590514 markings/sec, 95 secs
lola: 65299442 markings, 113582260 edges, 597370 markings/sec, 100 secs
lola: 68235006 markings, 118695634 edges, 587113 markings/sec, 105 secs
lola: 71235394 markings, 123903203 edges, 600078 markings/sec, 110 secs
lola: 74397785 markings, 129426993 edges, 632478 markings/sec, 115 secs
lola: 77304176 markings, 134482793 edges, 581278 markings/sec, 120 secs
lola: 80204460 markings, 139518849 edges, 580057 markings/sec, 125 secs
lola: 83082436 markings, 144539814 edges, 575595 markings/sec, 130 secs
lola: 86109529 markings, 149784041 edges, 605419 markings/sec, 135 secs
lola: 88971701 markings, 154767093 edges, 572434 markings/sec, 140 secs
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 6 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= P1wP2)))
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 ((3 <= P1wP2)))
lola: processed formula length: 20
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: (3 <= P1wP2)
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: 13 markings, 12 edges
lola: subprocess 7 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P1s <= 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 ((P1s <= 2)))
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P1 <= P2wM2)))
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 ((P1 <= P2wM2)))
lola: processed formula length: 21
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: (P1 <= P2wM2)
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: 2001 markings, 2000 edges
lola: ========================================
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P2 <= P2d)))
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 ((P2 <= P2d)))
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: 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: (P2 <= P2d)
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: 2001 markings, 2000 edges
lola: ========================================
lola: subprocess 10 will run for 519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P12 + 1 <= P2wM2) OR (P12 + 1 <= M3) OR (2 <= P2wM2))))
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 (((P12 + 1 <= P2wM2) OR (P12 + 1 <= M3) OR (2 <= P2wM2))))
lola: processed formula length: 65
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 623 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((M2 <= P1M1) OR (P12s <= P1M1)))))
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 ((((M2 <= P1M1) OR (P12s <= P1M1)))))
lola: processed formula length: 43
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: (((P1M1 + 1 <= M2) AND (P1M1 + 1 <= P12s)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6020 markings, 6021 edges
lola: ========================================
lola: subprocess 12 will run for 778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((P2 <= 2)))))
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: (P2 <= 2)
lola: processed formula length: 9
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 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= P2)
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: (P2 <= 2)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
lola: The predicate is possibly preserved from a reachable marking.
lola: 10004 markings, 10004 edges
lola: ========================================
lola: subprocess 13 will run for 1038 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((P1d <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (3 <= P1d)
lola: processed formula length: 10
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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P1d <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation 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: (3 <= P1d)
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: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: state equation: write sara problem file to CTLCardinality-13-1.sara
lola: The predicate does not eventually occur from all states.
lola: 16010 markings, 16010 edges
lola: subprocess 14 will run for 1557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((P1d <= P12M3))) U E (G ((M3 <= P12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: ========================================
lola: processed formula: E(EF((P1d <= P12M3)) U EG((M3 <= P12)))
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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-1.sara.
sara: try reading problem file CTLCardinality-12-0.sara.


lola: 2180770 markings, 8359099 edges, 436154 markings/sec, 0 secs
lola: 4318794 markings, 16554873 edges, 427605 markings/sec, 5 secs
lola: 6503418 markings, 24928315 edges, 436925 markings/sec, 10 secs
lola: 8705691 markings, 33368410 edges, 440455 markings/sec, 15 secs
lola: 10789539 markings, 41355918 edges, 416770 markings/sec, 20 secs
lola: 12906706 markings, 49470371 edges, 423433 markings/sec, 25 secs
lola: 15070093 markings, 57760998 edges, 432677 markings/sec, 30 secs
lola: 17172557 markings, 65627446 edges, 420493 markings/sec, 35 secs
lola: 18965014 markings, 72198548 edges, 358491 markings/sec, 40 secs
lola: 20699935 markings, 78559022 edges, 346984 markings/sec, 45 secs
lola: 22384217 markings, 84734613 edges, 336856 markings/sec, 50 secs
lola: 24070797 markings, 90917810 edges, 337316 markings/sec, 55 secs
lola: 25721137 markings, 96968067 edges, 330068 markings/sec, 60 secs
lola: 27357904 markings, 102968046 edges, 327353 markings/sec, 65 secs
lola: 29257824 markings, 109934670 edges, 379984 markings/sec, 70 secs
lola: 31272536 markings, 117320510 edges, 402942 markings/sec, 75 secs
lola: 33253426 markings, 124583080 edges, 396178 markings/sec, 80 secs
lola: 35226255 markings, 131816764 edges, 394566 markings/sec, 85 secs
lola: 37168423 markings, 138937109 edges, 388434 markings/sec, 90 secs
lola: 39190578 markings, 146350721 edges, 404431 markings/sec, 95 secs
lola: 41381235 markings, 154550311 edges, 438131 markings/sec, 100 secs
lola: 43551036 markings, 162716538 edges, 433960 markings/sec, 105 secs
lola: 45667710 markings, 170656275 edges, 423335 markings/sec, 110 secs
lola: 47751804 markings, 178477712 edges, 416819 markings/sec, 115 secs
lola: 49813010 markings, 186199233 edges, 412241 markings/sec, 120 secs
lola: 51840739 markings, 193791623 edges, 405546 markings/sec, 125 secs
lola: 53839615 markings, 201290209 edges, 399775 markings/sec, 130 secs
lola: 55820547 markings, 208709051 edges, 396186 markings/sec, 135 secs
lola: 57807845 markings, 216151353 edges, 397460 markings/sec, 140 secs
lola: 59709237 markings, 223256066 edges, 380278 markings/sec, 145 secs
lola: 61471864 markings, 229854219 edges, 352525 markings/sec, 150 secs
lola: 63236370 markings, 236469761 edges, 352901 markings/sec, 155 secs
lola: 64965791 markings, 242920134 edges, 345884 markings/sec, 160 secs
lola: 66829881 markings, 249913428 edges, 372818 markings/sec, 165 secs
lola: 68727579 markings, 257011373 edges, 379540 markings/sec, 170 secs
lola: 70583188 markings, 263950537 edges, 371122 markings/sec, 175 secs
lola: 72369947 markings, 270625185 edges, 357352 markings/sec, 180 secs
lola: 74179897 markings, 277390861 edges, 361990 markings/sec, 185 secs
lola: 76000233 markings, 284203089 edges, 364067 markings/sec, 190 secs
lola: 77856925 markings, 291151942 edges, 371338 markings/sec, 195 secs
lola: 79690021 markings, 298003414 edges, 366619 markings/sec, 200 secs
lola: 81537529 markings, 304911415 edges, 369502 markings/sec, 205 secs
lola: 83395710 markings, 311865271 edges, 371636 markings/sec, 210 secs
lola: 85266206 markings, 318872186 edges, 374099 markings/sec, 215 secs
lola: 87100020 markings, 325731444 edges, 366763 markings/sec, 220 secs
lola: 88922748 markings, 332533999 edges, 364546 markings/sec, 225 secs
lola: 90767059 markings, 339447342 edges, 368862 markings/sec, 230 secs
lola: 92594546 markings, 346263969 edges, 365497 markings/sec, 235 secs
lola: 94392675 markings, 352996195 edges, 359626 markings/sec, 240 secs
lola: 96200326 markings, 359735965 edges, 361530 markings/sec, 245 secs
lola: 98010369 markings, 366537172 edges, 362009 markings/sec, 250 secs
lola: 99869999 markings, 373471024 edges, 371926 markings/sec, 255 secs
lola: 101725864 markings, 380409661 edges, 371173 markings/sec, 260 secs
lola: 103571139 markings, 387315921 edges, 369055 markings/sec, 265 secs
lola: 105371366 markings, 394036541 edges, 360045 markings/sec, 270 secs
lola: 107199916 markings, 400865376 edges, 365710 markings/sec, 275 secs
lola: 109040513 markings, 407753329 edges, 368119 markings/sec, 280 secs
lola: 110892999 markings, 414701611 edges, 370497 markings/sec, 285 secs
lola: 112617936 markings, 421145004 edges, 344987 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2819 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((P1wM1 + 1 <= M3) AND (P1 <= 0)))) OR A (((P12M3 + 1 <= P1wP2) R (M3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2819 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((P12M3 + 1 <= P1wP2) R (M3 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((P12M3 + 1 <= P1wP2) R (M3 <= 1)))
lola: processed formula length: 38
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= M3)
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 /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 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 (F (A (X ((1 <= P1s)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((1 <= P1s)))
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: 2806710 markings, 5146006 edges, 561342 markings/sec, 0 secs
lola: 6394663 markings, 11721661 edges, 717591 markings/sec, 5 secs
lola: 9865548 markings, 18083081 edges, 694177 markings/sec, 10 secs
lola: 13342111 markings, 24453939 edges, 695313 markings/sec, 15 secs
lola: 16930477 markings, 30878331 edges, 717673 markings/sec, 20 secs
lola: 20023401 markings, 36032119 edges, 618585 markings/sec, 25 secs
lola: 22992653 markings, 40979487 edges, 593850 markings/sec, 30 secs
lola: 25895032 markings, 45815468 edges, 580476 markings/sec, 35 secs
lola: 29030105 markings, 51039527 edges, 627015 markings/sec, 40 secs
lola: 32517638 markings, 56850269 edges, 697507 markings/sec, 45 secs
lola: 35980916 markings, 62620517 edges, 692656 markings/sec, 50 secs
lola: 39344425 markings, 68224536 edges, 672702 markings/sec, 55 secs
lola: 42958924 markings, 74572780 edges, 722900 markings/sec, 60 secs
lola: 46424330 markings, 80643464 edges, 693081 markings/sec, 65 secs
lola: 49887531 markings, 86698137 edges, 692640 markings/sec, 70 secs
lola: 53219363 markings, 92518130 edges, 666366 markings/sec, 75 secs
lola: 56490818 markings, 98231414 edges, 654291 markings/sec, 80 secs
lola: 59724073 markings, 103859689 edges, 646651 markings/sec, 85 secs
lola: 62921638 markings, 109429837 edges, 639513 markings/sec, 90 secs
lola: 66049897 markings, 114882796 edges, 625652 markings/sec, 95 secs
lola: 69214325 markings, 120393834 edges, 632886 markings/sec, 100 secs
lola: 72375728 markings, 125891295 edges, 632281 markings/sec, 105 secs
lola: 75513129 markings, 131362579 edges, 627480 markings/sec, 110 secs
lola: 78670555 markings, 136867954 edges, 631485 markings/sec, 115 secs
lola: 81817951 markings, 142341031 edges, 629479 markings/sec, 120 secs
lola: 84925936 markings, 147735503 edges, 621597 markings/sec, 125 secs
lola: 88071248 markings, 153210614 edges, 629062 markings/sec, 130 secs
lola: 90829774 markings, 158014172 edges, 551705 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((P2M2 <= P2d)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((P2M2 <= P2d)))
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: 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: 3551053 markings, 6510163 edges, 710211 markings/sec, 0 secs
lola: 7081546 markings, 12979775 edges, 706099 markings/sec, 5 secs
lola: 10582805 markings, 19397399 edges, 700252 markings/sec, 10 secs
lola: 14102588 markings, 25849062 edges, 703957 markings/sec, 15 secs
lola: 17535889 markings, 31887633 edges, 686660 markings/sec, 20 secs
lola: 20518667 markings, 36857914 edges, 596556 markings/sec, 25 secs
lola: 23417152 markings, 41687361 edges, 579697 markings/sec, 30 secs
lola: 26266065 markings, 46433287 edges, 569783 markings/sec, 35 secs
lola: 29238306 markings, 51385790 edges, 594448 markings/sec, 40 secs
lola: 32683295 markings, 57125472 edges, 688998 markings/sec, 45 secs
lola: 36040889 markings, 62720423 edges, 671519 markings/sec, 50 secs
lola: 39437854 markings, 68380088 edges, 679393 markings/sec, 55 secs
lola: 43079782 markings, 74786031 edges, 728386 markings/sec, 60 secs
lola: 46524866 markings, 80824646 edges, 689017 markings/sec, 65 secs
lola: 49898135 markings, 86717873 edges, 674654 markings/sec, 70 secs
lola: 53228321 markings, 92534011 edges, 666037 markings/sec, 75 secs
lola: 56537365 markings, 98310997 edges, 661809 markings/sec, 80 secs
lola: 59825475 markings, 104041054 edges, 657622 markings/sec, 85 secs
lola: 63090489 markings, 109729458 edges, 653003 markings/sec, 90 secs
lola: 66342040 markings, 115394932 edges, 650310 markings/sec, 95 secs
lola: 69578848 markings, 121026930 edges, 647362 markings/sec, 100 secs
lola: 72770409 markings, 126594458 edges, 638312 markings/sec, 105 secs
lola: 75972187 markings, 132148419 edges, 640356 markings/sec, 110 secs
lola: 79175474 markings, 137735643 edges, 640657 markings/sec, 115 secs
lola: 82369783 markings, 143290419 edges, 638862 markings/sec, 120 secs
lola: 85553194 markings, 148819174 edges, 636682 markings/sec, 125 secs
lola: 88684184 markings, 154286066 edges, 626198 markings/sec, 130 secs
lola: 90876395 markings, 158091389 edges, 438442 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (((P2d <= P12s) U ((2 <= P2wM2) AND (3 <= M1)))) AND E (F (A (X ((3 <= P12s))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (((P2d <= P12s) U ((2 <= P2wM2) AND (3 <= M1))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((P2d <= P12s) U ((2 <= P2wM2) AND (3 <= M1))))
lola: processed formula length: 50
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= P2wM2) AND (3 <= M1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 10001 markings, 19996 edges
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((3 <= P12s)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((3 <= P12s)))
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: 3371768 markings, 6180923 edges, 674354 markings/sec, 0 secs
lola: 6563540 markings, 12031747 edges, 638354 markings/sec, 5 secs
lola: 9826799 markings, 18011855 edges, 652652 markings/sec, 10 secs
lola: 12984929 markings, 23801207 edges, 631626 markings/sec, 15 secs
lola: 16494721 markings, 30153110 edges, 701958 markings/sec, 20 secs
lola: 19622273 markings, 35364130 edges, 625510 markings/sec, 25 secs
lola: 22592153 markings, 40311912 edges, 593976 markings/sec, 30 secs
lola: 25487869 markings, 45137415 edges, 579143 markings/sec, 35 secs
lola: 28398890 markings, 49987517 edges, 582204 markings/sec, 40 secs
lola: 31851925 markings, 55741284 edges, 690607 markings/sec, 45 secs
lola: 35263704 markings, 61424569 edges, 682356 markings/sec, 50 secs
lola: 38515776 markings, 66844024 edges, 650414 markings/sec, 55 secs
lola: 42101441 markings, 73062100 edges, 717133 markings/sec, 60 secs
lola: 45651694 markings, 79292628 edges, 710051 markings/sec, 65 secs
lola: 49117064 markings, 85362792 edges, 693074 markings/sec, 70 secs
lola: 52542177 markings, 91334101 edges, 685023 markings/sec, 75 secs
lola: 55902394 markings, 97200857 edges, 672043 markings/sec, 80 secs
lola: 59252156 markings, 103030710 edges, 669952 markings/sec, 85 secs
lola: 62604695 markings, 108884113 edges, 670508 markings/sec, 90 secs
lola: 65860869 markings, 114550831 edges, 651235 markings/sec, 95 secs
lola: 69076543 markings, 120146076 edges, 643135 markings/sec, 100 secs
lola: 72296316 markings, 125758510 edges, 643955 markings/sec, 105 secs
lola: 75420216 markings, 131194288 edges, 624780 markings/sec, 110 secs
lola: 78639882 markings, 136809296 edges, 643933 markings/sec, 115 secs
lola: 81763195 markings, 142241547 edges, 624663 markings/sec, 120 secs
lola: 84863127 markings, 147621863 edges, 619986 markings/sec, 125 secs
lola: 87924848 markings, 152967769 edges, 612344 markings/sec, 130 secs
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 ((E (F ((P1d <= P12M3))) U E (G ((M3 <= P12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((P1d <= P12M3)) U EG((M3 <= P12)))
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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1921046 markings, 7363222 edges, 384209 markings/sec, 0 secs
lola: 4145538 markings, 15889576 edges, 444898 markings/sec, 5 secs
lola: 6319244 markings, 24220153 edges, 434741 markings/sec, 10 secs
lola: 8497398 markings, 32570068 edges, 435631 markings/sec, 15 secs
lola: 10603091 markings, 40640621 edges, 421139 markings/sec, 20 secs
lola: 12645588 markings, 48468242 edges, 408499 markings/sec, 25 secs
lola: 14718783 markings, 56415774 edges, 414639 markings/sec, 30 secs
lola: 16827218 markings, 64361514 edges, 421687 markings/sec, 35 secs
lola: 18621151 markings, 70938856 edges, 358787 markings/sec, 40 secs
lola: 20346616 markings, 77263563 edges, 345093 markings/sec, 45 secs
lola: 22033880 markings, 83449498 edges, 337453 markings/sec, 50 secs
lola: 23668780 markings, 89444010 edges, 326980 markings/sec, 55 secs
lola: 25170855 markings, 94951037 edges, 300415 markings/sec, 60 secs
lola: 26760973 markings, 100780721 edges, 318024 markings/sec, 65 secs
lola: 28426061 markings, 106884180 edges, 333018 markings/sec, 70 secs
lola: 30406046 markings, 114144136 edges, 395997 markings/sec, 75 secs
lola: 32359711 markings, 121306664 edges, 390733 markings/sec, 80 secs
lola: 34293481 markings, 128396781 edges, 386754 markings/sec, 85 secs
lola: 36182029 markings, 135320085 edges, 377710 markings/sec, 90 secs
lola: 38087044 markings, 142305135 edges, 381003 markings/sec, 95 secs
lola: 40097394 markings, 149693535 edges, 402070 markings/sec, 100 secs
lola: 42268633 markings, 157897866 edges, 434248 markings/sec, 105 secs
lola: 44277290 markings, 165443226 edges, 401731 markings/sec, 110 secs
lola: 46241650 markings, 172817017 edges, 392872 markings/sec, 115 secs
lola: 48212647 markings, 180202882 edges, 394199 markings/sec, 120 secs
lola: 50169007 markings, 187523529 edges, 391272 markings/sec, 125 secs
lola: 52150993 markings, 194950483 edges, 396397 markings/sec, 130 secs
lola: 54126771 markings, 202362716 edges, 395156 markings/sec, 135 secs
lola: 56075821 markings, 209666019 edges, 389810 markings/sec, 140 secs
lola: 58045184 markings, 217026604 edges, 393873 markings/sec, 145 secs
lola: 59984002 markings, 224292994 edges, 387764 markings/sec, 150 secs
lola: 61922388 markings, 231535805 edges, 387677 markings/sec, 155 secs
lola: 63839874 markings, 238722742 edges, 383497 markings/sec, 160 secs
lola: 65728228 markings, 245789449 edges, 377671 markings/sec, 165 secs
lola: 67646065 markings, 252961807 edges, 383567 markings/sec, 170 secs
lola: 69551806 markings, 260088363 edges, 381148 markings/sec, 175 secs
lola: 71456427 markings, 267214131 edges, 380924 markings/sec, 180 secs
lola: 73272000 markings, 274025010 edges, 363115 markings/sec, 185 secs
lola: 74979771 markings, 280399730 edges, 341554 markings/sec, 190 secs
lola: 76678393 markings, 286749048 edges, 339724 markings/sec, 195 secs
lola: 78359645 markings, 293021282 edges, 336250 markings/sec, 200 secs
lola: 80194536 markings, 299895003 edges, 366978 markings/sec, 205 secs
lola: 81873617 markings, 306185600 edges, 335816 markings/sec, 210 secs
lola: 83537788 markings, 312390885 edges, 332834 markings/sec, 215 secs
lola: 85237998 markings, 318767593 edges, 340042 markings/sec, 220 secs
lola: 86967805 markings, 325224558 edges, 345961 markings/sec, 225 secs
lola: 88655787 markings, 331555226 edges, 337596 markings/sec, 230 secs
lola: 90309348 markings, 337709864 edges, 330712 markings/sec, 235 secs
lola: 92068948 markings, 344314654 edges, 351920 markings/sec, 240 secs
lola: 93729409 markings, 350517419 edges, 332092 markings/sec, 245 secs
lola: 95394850 markings, 356732599 edges, 333088 markings/sec, 250 secs
lola: 97065227 markings, 362981209 edges, 334075 markings/sec, 255 secs
lola: 98722884 markings, 369190236 edges, 331531 markings/sec, 260 secs
lola: 100404491 markings, 375482754 edges, 336321 markings/sec, 265 secs
lola: 102198198 markings, 382178764 edges, 358741 markings/sec, 270 secs
lola: 103877343 markings, 388438582 edges, 335829 markings/sec, 275 secs
lola: 105551167 markings, 394695976 edges, 334765 markings/sec, 280 secs
lola: 107289237 markings, 401205803 edges, 347614 markings/sec, 285 secs
lola: 109003777 markings, 407612039 edges, 342908 markings/sec, 290 secs
lola: 110674710 markings, 413862073 edges, 334187 markings/sec, 295 secs
lola: 112367477 markings, 420195288 edges, 338553 markings/sec, 300 secs
lola: 112740536 markings, 421595364 edges, 74612 markings/sec, 305 secs
lola: 112743525 markings, 421605321 edges, 598 markings/sec, 310 secs
lola: 112743530 markings, 421605340 edges, 1 markings/sec, 315 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (((P1wM1 + 1 <= M3) AND (P1 <= 0)))) OR A (((P12M3 + 1 <= P1wP2) R (M3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((P12M3 + 1 <= P1wP2) R (M3 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((P12M3 + 1 <= P1wP2) R (M3 <= 1)))
lola: processed formula length: 38
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= M3)
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 /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: E (F (((P1wM1 + 1 <= M3) AND (P1 <= 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 (((P1wM1 + 1 <= M3) AND (P1 <= 0))))
lola: processed formula length: 41
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: ((P1wM1 + 1 <= M3) AND (P1 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5996 markings, 5995 edges
lola: ========================================
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown unknown yes unknown yes no yes no unknown yes no yes no yes no
lola:
preliminary result: no unknown unknown yes unknown yes no yes no unknown yes no yes no yes no
lola: memory consumption: 18944 KB
lola: time consumption: 1508 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552656027721

--------------------
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="FMS-PT-02000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is FMS-PT-02000, 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 r082-csrt-155246548900085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-02000.tgz
mv FMS-PT-02000 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;