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

About the Execution of LoLA for FMS-PT-00200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.670 1568218.00 1618290.00 980.30 TTTFFTT??TFTTFTF 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-155246548900058.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-00200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246548900058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.3K Feb 10 23:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 10 23:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 6 20:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 6 20:59 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.3K Feb 4 23:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 3 08:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 3 08:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jan 31 01:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 17K 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-00200-CTLCardinality-00
FORMULA_NAME FMS-PT-00200-CTLCardinality-01
FORMULA_NAME FMS-PT-00200-CTLCardinality-02
FORMULA_NAME FMS-PT-00200-CTLCardinality-03
FORMULA_NAME FMS-PT-00200-CTLCardinality-04
FORMULA_NAME FMS-PT-00200-CTLCardinality-05
FORMULA_NAME FMS-PT-00200-CTLCardinality-06
FORMULA_NAME FMS-PT-00200-CTLCardinality-07
FORMULA_NAME FMS-PT-00200-CTLCardinality-08
FORMULA_NAME FMS-PT-00200-CTLCardinality-09
FORMULA_NAME FMS-PT-00200-CTLCardinality-10
FORMULA_NAME FMS-PT-00200-CTLCardinality-11
FORMULA_NAME FMS-PT-00200-CTLCardinality-12
FORMULA_NAME FMS-PT-00200-CTLCardinality-13
FORMULA_NAME FMS-PT-00200-CTLCardinality-14
FORMULA_NAME FMS-PT-00200-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552654470630

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

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

FORMULA FMS-PT-00200-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00200-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00200-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA FMS-PT-00200-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00200-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00200-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00200-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00200-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00200-CTLCardinality-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00200-CTLCardinality-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00200-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2002
rslt: Output for CTLCardinality @ FMS-PT-00200

{
"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:54:30 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EF(((((P2wM2 <= P12M3) AND (3 <= P2wM2)) OR (P1M1 <= M2)) AND AX((3 <= P12wM3))))",
"processed_size": 82,
"rewrites": 30
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 75599765,
"markings": 43135734,
"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": 268
},
"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": 29
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 290
},
"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 <= P1s)))",
"processed_size": 18,
"rewrites": 29
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 317
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 <= P2wP1))))",
"processed_size": 22,
"rewrites": 29
},
"result":
{
"edges": 12,
"markings": 13,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G (((P2M2 <= P12wM3) OR (P12 <= P2wM2) OR (P1d <= P1wM1) OR ((1 <= P3M2) AND (M2 <= P1d) AND (2 <= P2)))))",
"processed_size": 112,
"rewrites": 30
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 400
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"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": "AG(E((3 <= P3s) U (1 <= P1)))",
"processed_size": 29,
"rewrites": 30
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 853169,
"markings": 400996,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "AF(E((P2wM2 <= M3) U (P1 <= P2wM2)))",
"processed_size": 36,
"rewrites": 30
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 147395,
"markings": 80597,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 553
},
"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 (((P2 + 1 <= P1s) R (P2s <= 2)))",
"processed_size": 34,
"rewrites": 33
},
"result":
{
"edges": 3040517,
"markings": 1481215,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 11,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 691
},
"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": "(P12 <= P2)",
"processed_size": 11,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 921
},
"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 ((P3 <= M3)))",
"processed_size": 18,
"rewrites": 29
},
"result":
{
"edges": 198,
"markings": 199,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 921
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((3 <= P1d) OR (3 <= P12wM3))",
"processed_size": 30,
"rewrites": 31
},
"result":
{
"edges": 73147485,
"markings": 42079581,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1357
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((P2d <= 0)) OR ((2 <= P12s) OR (P12s <= M2))))",
"processed_size": 54,
"rewrites": 38
},
"result":
{
"edges": 5319,
"markings": 4892,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2715
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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 (((P2 <= 1) AND (P1wM1 <= 2))))",
"processed_size": 36,
"rewrites": 29
},
"result":
{
"edges": 199,
"markings": 200,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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 (((P2 <= 1) AND (P1wM1 <= 2))))",
"processed_size": 36,
"rewrites": 29
},
"result":
{
"edges": 199,
"markings": 200,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 18,
"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"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G (((P12s <= 2) AND (P3s + 1 <= M3))))",
"processed_size": 41,
"rewrites": 29
},
"result":
{
"edges": 1004,
"markings": 1004,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 20564,
"runtime": 1568.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** AND E(F(**))) : (E(G(*)) AND E(F(*))) : E(F((E(G(**)) AND **))) : FALSE : A((* R *)) : E(G(E(F(**)))) : A(F(E((** U **)))) : E(F(A(G(**)))) : E((A(F(**)) U A(G(**)))) : E(F(**)) : FALSE : E(F((** AND A(X(**))))) : E(F(**)) : A(G(E((** U **)))) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "yes yes yes no no yes yes unknown unknown yes no yes yes no yes no ",
"value": "yes yes yes no no yes yes unknown unknown yes no yes 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: (3 <= M3)
lola: LP says that atomic proposition is always false: (3 <= M3)
lola: LP says that atomic proposition is always false: (3 <= P2M2)
lola: LP says that atomic proposition is always false: (3 <= P2M2)
lola: LP says that atomic proposition is always false: (3 <= P12M3)
lola: ((P12 <= P2) AND E (F ((P3 <= M3)))) : NOT((A (F (((3 <= P12s) OR (M3 <= P3s)))) OR A (G (((2 <= P2) OR (3 <= P1wM1)))))) : E (F ((E (G ((1 <= P2d))) AND ((P12s <= 1) AND (M2 + 1 <= P12s))))) : E (F (A (((1 <= M1) U (3 <= M3))))) : (() OR NOT(E (((P1s <= P2) U (3 <= P2s))))) : E (G (E (F (((3 <= P1d) OR (3 <= P12wM3)))))) : A (F (E (((P2wM2 <= M3) U (P1 <= P2wM2))))) : E (F (A (G (((2 <= P2s)))))) : E ((A (F ((1 <= P1))) U A (G ((P2M2 <= P3M2))))) : E (F ((3 <= P1wP2))) : E (F (())) : E (F (((((P2wM2 <= P12M3) AND (3 <= P2wM2)) OR (P1M1 <= M2)) AND A (X ((3 <= P12wM3)))))) : E (F (A (F ((3 <= P1s))))) : A (G (E (((3 <= P3s) U (1 <= P1))))) : NOT(NOT(E (F (((3 <= P2wP1)))))) : A (G (((P2M2 <= P12wM3) OR (P12 <= P2wM2) OR (P1d <= P1wM1) OR ((1 <= P3M2) AND (M2 <= P1d) AND (2 <= P2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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:300
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: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((P2wM2 <= P12M3) AND (3 <= P2wM2)) OR (P1M1 <= M2)) AND A (X ((3 <= P12wM3))))))
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(((((P2wM2 <= P12M3) AND (3 <= P2wM2)) OR (P1M1 <= M2)) AND AX((3 <= P12wM3))))
lola: processed formula length: 82
lola: 30 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: 3345770 markings, 5832931 edges, 669154 markings/sec, 0 secs
lola: 6598151 markings, 11478888 edges, 650476 markings/sec, 5 secs
lola: 9819586 markings, 17068091 edges, 644287 markings/sec, 10 secs
lola: 12878923 markings, 22370594 edges, 611867 markings/sec, 15 secs
lola: 15913985 markings, 27634426 edges, 607012 markings/sec, 20 secs
lola: 18741347 markings, 32533484 edges, 565472 markings/sec, 25 secs
lola: 21780867 markings, 37798934 edges, 607904 markings/sec, 30 secs
lola: 24750204 markings, 42947224 edges, 593867 markings/sec, 35 secs
lola: 27847130 markings, 48311753 edges, 619385 markings/sec, 40 secs
lola: 30753977 markings, 53346189 edges, 581369 markings/sec, 45 secs
lola: 33563954 markings, 58215371 edges, 561995 markings/sec, 50 secs
lola: 36569251 markings, 63421814 edges, 601059 markings/sec, 55 secs
lola: 39713805 markings, 68865477 edges, 628911 markings/sec, 60 secs
lola: 42661183 markings, 74463306 edges, 589476 markings/sec, 65 secs
lola: 43135734 markings, 75599765 edges, 94910 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 43135734 markings, 75599765 edges
lola: ========================================
lola: subprocess 3 will run for 268 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: 29 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: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= P1s)))
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 <= P1s)))
lola: processed formula length: 18
lola: 29 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 <= P1s)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= P2wP1))))
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 <= P2wP1))))
lola: processed formula length: 22
lola: 29 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 <= P2wP1))
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: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P2M2 <= P12wM3) OR (P12 <= P2wM2) OR (P1d <= P1wM1) OR ((1 <= P3M2) AND (M2 <= P1d) AND (2 <= P2)))))
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 (((P2M2 <= P12wM3) OR (P12 <= P2wM2) OR (P1d <= P1wM1) OR ((1 <= P3M2) AND (M2 <= P1d) AND (2 <= P2)))))
lola: processed formula length: 112
lola: 30 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: 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: ((P12wM3 + 1 <= P2M2) AND (P2wM2 + 1 <= P12) AND (P1wM1 + 1 <= P1d) AND ((P3M2 <= 0) OR (P1d + 1 <= M2) OR (P2 <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
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.
lola: ========================================
lola: subprocess 7 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((2 <= P2s))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((P2s <= 1))
lola: processed formula length: 12
lola: 32 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 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: ((P2s <= 1))
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-7-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-1.sara.

lola: state equation 1: solution produced
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: ((2 <= P2s))
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.


lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 4102842 markings, 7148870 edges, 820568 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 8022441 markings, 13950669 edges, 783920 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 11664278 markings, 20265950 edges, 728367 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 15253663 markings, 26488537 edges, 717877 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 18760167 markings, 32567925 edges, 701301 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 22273774 markings, 38652835 edges, 702721 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 25734118 markings, 44650442 edges, 692069 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 29189229 markings, 50636682 edges, 691022 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 32607872 markings, 56554319 edges, 683729 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 36271336 markings, 62899461 edges, 732693 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 40010104 markings, 69375554 edges, 747754 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 43640343 markings, 76797836 edges, 726048 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 46844832 markings, 84598933 edges, 640898 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 49860616 markings, 92025734 edges, 603157 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 52516545 markings, 98695551 edges, 531186 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 55034563 markings, 105112114 edges, 503604 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 57493048 markings, 111402380 edges, 491697 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 60051887 markings, 117966589 edges, 511768 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 62443500 markings, 124205553 edges, 478323 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 64854430 markings, 130413429 edges, 482186 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 67182269 markings, 136504586 edges, 465568 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 69735481 markings, 143002533 edges, 510642 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 72103596 markings, 149082558 edges, 473623 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 74432707 markings, 155063069 edges, 465822 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 76603524 markings, 160836634 edges, 434163 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 78786782 markings, 166680714 edges, 436652 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 80921588 markings, 172415268 edges, 426961 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 83104897 markings, 178228617 edges, 436662 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 85336014 markings, 184067267 edges, 446223 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 87488744 markings, 189806861 edges, 430546 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 89803714 markings, 195781683 edges, 462994 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 91994570 markings, 201555557 edges, 438171 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 94013601 markings, 207071077 edges, 403806 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 96082201 markings, 212631368 edges, 413720 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 98196126 markings, 218276923 edges, 422785 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 100423158 markings, 224212035 edges, 445406 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 102663773 markings, 230220995 edges, 448123 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 104928177 markings, 236229648 edges, 452881 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 107228554 markings, 242272840 edges, 460075 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 109393841 markings, 248030886 edges, 433057 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 111411361 markings, 253438454 edges, 403504 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 113498239 markings, 258944915 edges, 417376 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 115693591 markings, 264694683 edges, 439070 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 117846050 markings, 270460581 edges, 430492 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 119986973 markings, 276184315 edges, 428185 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 122163147 markings, 282027863 edges, 435235 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 124363523 markings, 287917640 edges, 440075 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 126417092 markings, 293493289 edges, 410714 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 128460164 markings, 299090795 edges, 408614 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 130545532 markings, 304729093 edges, 417074 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 132589113 markings, 310257646 edges, 408716 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 134559226 markings, 315694408 edges, 394023 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 136559488 markings, 321144647 edges, 400052 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 138657002 markings, 326818877 edges, 419503 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 140801902 markings, 332522076 edges, 428980 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 141763882 markings, 335149701 edges, 192396 markings/sec, 275 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 400 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((3 <= P3s) U (1 <= P1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((3 <= P3s) U (1 <= P1)))
lola: processed formula length: 29
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 400996 markings, 853169 edges
lola: ========================================
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((P2wM2 <= M3) U (P1 <= P2wM2)))))
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((P2wM2 <= M3) U (P1 <= P2wM2)))
lola: processed formula length: 36
lola: 30 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: 80597 markings, 147395 edges
lola: ========================================
lola: subprocess 10 will run for 534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((1 <= P1))) U A (G ((P2M2 <= P3M2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((1 <= P1)) U AG((P2M2 <= P3M2)))
lola: processed formula length: 37
lola: 31 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: 1717996 markings, 8276848 edges, 343599 markings/sec, 0 secs
lola: 3102560 markings, 15744981 edges, 276913 markings/sec, 5 secs
lola: 4458172 markings, 23045470 edges, 271122 markings/sec, 10 secs
lola: 5879981 markings, 30718985 edges, 284362 markings/sec, 15 secs
lola: 7167785 markings, 37681417 edges, 257561 markings/sec, 20 secs
lola: 8432786 markings, 44520612 edges, 253000 markings/sec, 25 secs
lola: 9722777 markings, 51373691 edges, 257998 markings/sec, 30 secs
lola: 10942963 markings, 58116924 edges, 244037 markings/sec, 35 secs
lola: 12177593 markings, 64809864 edges, 246926 markings/sec, 40 secs
lola: 13485180 markings, 71765807 edges, 261517 markings/sec, 45 secs
lola: 14705089 markings, 78512034 edges, 243982 markings/sec, 50 secs
lola: 15921734 markings, 85109322 edges, 243329 markings/sec, 55 secs
lola: 17135177 markings, 91681233 edges, 242689 markings/sec, 60 secs
lola: 18448046 markings, 98732926 edges, 262574 markings/sec, 65 secs
lola: 19674894 markings, 105482857 edges, 245370 markings/sec, 70 secs
lola: 20870244 markings, 111964784 edges, 239070 markings/sec, 75 secs
lola: 22100051 markings, 118473928 edges, 245961 markings/sec, 80 secs
lola: 23290126 markings, 124981498 edges, 238015 markings/sec, 85 secs
lola: 24477993 markings, 131465041 edges, 237573 markings/sec, 90 secs
lola: 25658280 markings, 137970751 edges, 236057 markings/sec, 95 secs
lola: 26939000 markings, 144928456 edges, 256144 markings/sec, 100 secs
lola: 28151888 markings, 151496937 edges, 242578 markings/sec, 105 secs
lola: 29338128 markings, 157903244 edges, 237248 markings/sec, 110 secs
lola: 30520579 markings, 164385253 edges, 236490 markings/sec, 115 secs
lola: 31781953 markings, 171126503 edges, 252275 markings/sec, 120 secs
lola: 32947487 markings, 177577936 edges, 233107 markings/sec, 125 secs
lola: 34167028 markings, 183976840 edges, 243908 markings/sec, 130 secs
lola: 35315081 markings, 190447566 edges, 229611 markings/sec, 135 secs
lola: 36517487 markings, 196976666 edges, 240481 markings/sec, 140 secs
lola: 37757197 markings, 203726505 edges, 247942 markings/sec, 145 secs
lola: 39017357 markings, 210567079 edges, 252032 markings/sec, 150 secs
lola: 40235935 markings, 217140639 edges, 243716 markings/sec, 155 secs
lola: 41508711 markings, 223823231 edges, 254555 markings/sec, 160 secs
lola: 43041928 markings, 231810886 edges, 306643 markings/sec, 165 secs
lola: 44575543 markings, 239790956 edges, 306723 markings/sec, 170 secs
lola: 46062036 markings, 247600378 edges, 297299 markings/sec, 175 secs
lola: 47514448 markings, 255192554 edges, 290482 markings/sec, 180 secs
lola: 48958013 markings, 262822563 edges, 288713 markings/sec, 185 secs
lola: 50364408 markings, 270270361 edges, 281279 markings/sec, 190 secs
lola: 51748961 markings, 277638592 edges, 276911 markings/sec, 195 secs
lola: 53099319 markings, 284969512 edges, 270072 markings/sec, 200 secs
lola: 54467382 markings, 292277154 edges, 273613 markings/sec, 205 secs
lola: 55783469 markings, 299424744 edges, 263217 markings/sec, 210 secs
lola: 57094853 markings, 306530428 edges, 262277 markings/sec, 215 secs
lola: 58387753 markings, 313530640 edges, 258580 markings/sec, 220 secs
lola: 59738519 markings, 320691647 edges, 270153 markings/sec, 225 secs
lola: 61068676 markings, 327863962 edges, 266031 markings/sec, 230 secs
lola: 62373061 markings, 334997237 edges, 260877 markings/sec, 235 secs
lola: 63640883 markings, 341926930 edges, 253564 markings/sec, 240 secs
lola: 64944701 markings, 348926612 edges, 260764 markings/sec, 245 secs
lola: 66214198 markings, 355817855 edges, 253899 markings/sec, 250 secs
lola: 67495388 markings, 362808218 edges, 256238 markings/sec, 255 secs
lola: 68717910 markings, 369511863 edges, 244504 markings/sec, 260 secs
lola: 69948488 markings, 376345528 edges, 246116 markings/sec, 265 secs
lola: 71182081 markings, 383120906 edges, 246719 markings/sec, 270 secs
lola: 72401352 markings, 389745548 edges, 243854 markings/sec, 275 secs
lola: 73641958 markings, 396546288 edges, 248121 markings/sec, 280 secs
lola: 74923170 markings, 403508079 edges, 256242 markings/sec, 285 secs
lola: 76121042 markings, 410032586 edges, 239574 markings/sec, 290 secs
lola: 77289270 markings, 416448595 edges, 233646 markings/sec, 295 secs
lola: 78514066 markings, 423172997 edges, 244959 markings/sec, 300 secs
lola: 79795550 markings, 430208730 edges, 256297 markings/sec, 305 secs
lola: 81046469 markings, 437075888 edges, 250184 markings/sec, 310 secs
lola: 82307895 markings, 443987298 edges, 252285 markings/sec, 315 secs
lola: 83517923 markings, 450646936 edges, 242006 markings/sec, 320 secs
lola: 84675385 markings, 457131363 edges, 231492 markings/sec, 325 secs
lola: 85848838 markings, 463660065 edges, 234691 markings/sec, 330 secs
lola: 87021572 markings, 470152108 edges, 234547 markings/sec, 335 secs
lola: 88221689 markings, 476844127 edges, 240023 markings/sec, 340 secs
lola: 89439082 markings, 483553512 edges, 243479 markings/sec, 345 secs
lola: 90675126 markings, 490339896 edges, 247209 markings/sec, 350 secs
lola: 91907977 markings, 497148310 edges, 246570 markings/sec, 355 secs
lola: 93126038 markings, 503968039 edges, 243612 markings/sec, 360 secs
lola: 94359772 markings, 510740571 edges, 246747 markings/sec, 365 secs
lola: 95567594 markings, 517439511 edges, 241564 markings/sec, 370 secs
lola: 96749242 markings, 523983501 edges, 236330 markings/sec, 375 secs
lola: 97928824 markings, 530541200 edges, 235916 markings/sec, 380 secs
lola: 99120294 markings, 537063629 edges, 238294 markings/sec, 385 secs
lola: 100335838 markings, 543783098 edges, 243109 markings/sec, 390 secs
lola: 101549751 markings, 550503274 edges, 242783 markings/sec, 395 secs
lola: 102749671 markings, 557001746 edges, 239984 markings/sec, 400 secs
lola: 103993907 markings, 563697702 edges, 248847 markings/sec, 405 secs
lola: 105107595 markings, 569953923 edges, 222738 markings/sec, 410 secs
lola: 106259173 markings, 576303223 edges, 230316 markings/sec, 415 secs
lola: 107453458 markings, 582946512 edges, 238857 markings/sec, 420 secs
lola: 108627116 markings, 589568150 edges, 234732 markings/sec, 425 secs
lola: 109802215 markings, 596110380 edges, 235020 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((P2 + 1 <= P1s) R (P2s <= 2)))
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 (((P2 + 1 <= P1s) R (P2s <= 2)))
lola: processed formula length: 34
lola: 33 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: (3 <= P2s)
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-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 1481215 markings, 3040517 edges
lola: subprocess 12 will run for 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((P12 <= P2) AND E (F ((P3 <= M3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 12 will run for 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P12 <= P2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P12 <= P2)
lola: processed formula length: 11
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 921 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P3 <= M3)))
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 ((P3 <= M3)))
lola: processed formula length: 18
lola: 29 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: (P3 <= 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 199 markings, 198 edges
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 921 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((3 <= P1d) OR (3 <= P12wM3))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((3 <= P1d) OR (3 <= P12wM3))
lola: processed formula length: 30
lola: 31 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 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: ((3 <= P1d) OR (3 <= P12wM3))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
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: ((P1d <= 2) AND (P12wM3 <= 2))
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-13-0.sara
lola: lola: state equation: calling and running sara
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-0.sara.

sara: try reading problem file CTLCardinality-13-1.sara.

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 4837405 markings, 8421830 edges, 967481 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 9125202 markings, 15865220 edges, 857559 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 13247961 markings, 23011442 edges, 824552 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 17491194 markings, 30365202 edges, 848647 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 21732174 markings, 37717866 edges, 848196 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 25924018 markings, 44977748 edges, 838369 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 30082066 markings, 52181475 edges, 831610 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 34131453 markings, 59199139 edges, 809877 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 38260598 markings, 66347561 edges, 825829 markings/sec, 40 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 42079581 markings, 73147485 edges
lola: subprocess 14 will run for 1357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((1 <= P2d))) AND ((P12s <= 1) AND (M2 + 1 <= P12s)))))
lola: ========================================
lola: SUBTASK
lola: lola: checking an existential CTL formula with single witness path (use LTL...)
========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((P2d <= 0)) OR ((2 <= P12s) OR (P12s <= M2))))
lola: processed formula length: 54
lola: 38 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 4892 markings, 5319 edges
lola: ========================================
lola: subprocess 15 will run for 2715 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((P12s <= 2) AND (P3s + 1 <= M3)))) AND E (F (((P2 <= 1) AND (P1wM1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2715 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((P2 <= 1) AND (P1wM1 <= 2))))
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 <= 1) AND (P1wM1 <= 2))))
lola: processed formula length: 36
lola: 29 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 <= 1) AND (P1wM1 <= 2))
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-15-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: 200 markings, 199 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 (G (((2 <= P2s))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((P2s <= 1))
lola: processed formula length: 12
lola: 32 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= P2s))
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-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-0.sara.

lola: state equation 0: solution produced
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: ((P2s <= 1))
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-16-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-1.sara.

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 4229403 markings, 7367379 edges, 845881 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 8174372 markings, 14212695 edges, 788994 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 11983545 markings, 20819494 edges, 761835 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 15722401 markings, 27298807 edges, 747771 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 19317972 markings, 33535067 edges, 719114 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 22972751 markings, 39864244 edges, 730956 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 26561920 markings, 46083416 edges, 717834 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 30047125 markings, 52123276 edges, 697041 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 33605452 markings, 58285560 edges, 711665 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 37231390 markings, 64562397 edges, 725188 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 40865258 markings, 70861498 edges, 726774 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 44298370 markings, 78428038 edges, 686622 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 47342926 markings, 85832024 edges, 608911 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 50247476 markings, 92997295 edges, 580910 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 52970820 markings, 99869485 edges, 544669 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 55645371 markings, 106651681 edges, 534910 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 58225640 markings, 113259131 edges, 516054 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 60796447 markings, 119837484 edges, 514161 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 63181676 markings, 126172788 edges, 477046 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 65727749 markings, 132654669 edges, 509215 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 68255307 markings, 139161691 edges, 505512 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 70693793 markings, 145489309 edges, 487697 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 73149280 markings, 151777151 edges, 491097 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 75528084 markings, 157994012 edges, 475761 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 77827138 markings, 164105975 edges, 459811 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 80068713 markings, 170136036 edges, 448315 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 82316769 markings, 176136786 edges, 449611 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 84659616 markings, 182297341 edges, 468569 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 86879376 markings, 188250831 edges, 443952 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 89364725 markings, 194602921 edges, 497070 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 91566115 markings, 200495595 edges, 440278 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 93777818 markings, 206433246 edges, 442341 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 95922402 markings, 212254916 edges, 428917 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 98181124 markings, 218239600 edges, 451744 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 100342403 markings, 224012172 edges, 432256 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 102374637 markings, 229477792 edges, 406447 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 104581955 markings, 235271206 edges, 441464 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 106814093 markings, 241171881 edges, 446428 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 109071830 markings, 247156367 edges, 451547 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 111171751 markings, 252796160 edges, 419984 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 113359811 markings, 258584238 edges, 437612 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 115717941 markings, 264760569 edges, 471626 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 117895391 markings, 270590418 edges, 435490 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 120074700 markings, 276435331 edges, 435862 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 122158236 markings, 282018575 edges, 416707 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 124376358 markings, 287957468 edges, 443624 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 126496786 markings, 293699414 edges, 424086 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 128562902 markings, 299359285 edges, 413223 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 130536448 markings, 304701442 edges, 394709 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 132512391 markings, 310053106 edges, 395189 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 134418109 markings, 315330113 edges, 381144 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 136531203 markings, 321066665 edges, 422619 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 138653798 markings, 326809992 edges, 424519 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 140863641 markings, 332675411 edges, 441969 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 141784343 markings, 335206797 edges, 184140 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((A (F ((1 <= P1))) U A (G ((P2M2 <= P3M2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF((1 <= P1)) U AG((P2M2 <= P3M2)))
lola: processed formula length: 37
lola: 31 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: 1728125 markings, 8374939 edges, 345625 markings/sec, 0 secs
lola: 3219255 markings, 16371268 edges, 298226 markings/sec, 5 secs
lola: 4662589 markings, 24146309 edges, 288667 markings/sec, 10 secs
lola: 6074978 markings, 31777829 edges, 282478 markings/sec, 15 secs
lola: 7475572 markings, 39272110 edges, 280119 markings/sec, 20 secs
lola: 8837639 markings, 46713152 edges, 272413 markings/sec, 25 secs
lola: 10208707 markings, 54060491 edges, 274214 markings/sec, 30 secs
lola: 11541871 markings, 61364548 edges, 266633 markings/sec, 35 secs
lola: 12882543 markings, 68626377 edges, 268134 markings/sec, 40 secs
lola: 14213991 markings, 75849117 edges, 266290 markings/sec, 45 secs
lola: 15535980 markings, 83019515 edges, 264398 markings/sec, 50 secs
lola: 16877508 markings, 90120214 edges, 268306 markings/sec, 55 secs
lola: 18180532 markings, 97231936 edges, 260605 markings/sec, 60 secs
lola: 19461545 markings, 104319171 edges, 256203 markings/sec, 65 secs
lola: 20798431 markings, 111426582 edges, 267377 markings/sec, 70 secs
lola: 22100051 markings, 118479894 edges, 260324 markings/sec, 75 secs
lola: 23370280 markings, 125539173 edges, 254046 markings/sec, 80 secs
lola: 24670538 markings, 132567999 edges, 260052 markings/sec, 85 secs
lola: 25955113 markings, 139584731 edges, 256915 markings/sec, 90 secs
lola: 27223934 markings, 146352307 edges, 253764 markings/sec, 95 secs
lola: 28471602 markings, 153251506 edges, 249534 markings/sec, 100 secs
lola: 29749831 markings, 160202701 edges, 255646 markings/sec, 105 secs
lola: 31031086 markings, 167158453 edges, 256251 markings/sec, 110 secs
lola: 32356279 markings, 174139114 edges, 265039 markings/sec, 115 secs
lola: 33617310 markings, 181078776 edges, 252206 markings/sec, 120 secs
lola: 34905078 markings, 188051936 edges, 257554 markings/sec, 125 secs
lola: 36170187 markings, 194986134 edges, 253022 markings/sec, 130 secs
lola: 37437660 markings, 201983135 edges, 253495 markings/sec, 135 secs
lola: 38724961 markings, 208988710 edges, 257460 markings/sec, 140 secs
lola: 40001830 markings, 215920785 edges, 255374 markings/sec, 145 secs
lola: 41306945 markings, 223030160 edges, 261023 markings/sec, 150 secs
lola: 42868529 markings, 230988593 edges, 312317 markings/sec, 155 secs
lola: 44466839 markings, 239221370 edges, 319662 markings/sec, 160 secs
lola: 45990314 markings, 247212569 edges, 304695 markings/sec, 165 secs
lola: 47476001 markings, 255008239 edges, 297137 markings/sec, 170 secs
lola: 48937934 markings, 262708203 edges, 292387 markings/sec, 175 secs
lola: 50360661 markings, 270258274 edges, 284545 markings/sec, 180 secs
lola: 51770165 markings, 277752352 edges, 281901 markings/sec, 185 secs
lola: 53161078 markings, 285298534 edges, 278183 markings/sec, 190 secs
lola: 54557500 markings, 292768906 edges, 279284 markings/sec, 195 secs
lola: 55896009 markings, 300038117 edges, 267702 markings/sec, 200 secs
lola: 57227633 markings, 307247613 edges, 266325 markings/sec, 205 secs
lola: 58537616 markings, 314362045 edges, 261997 markings/sec, 210 secs
lola: 59901626 markings, 321560581 edges, 272802 markings/sec, 215 secs
lola: 61278935 markings, 328982682 edges, 275462 markings/sec, 220 secs
lola: 62543656 markings, 335922362 edges, 252944 markings/sec, 225 secs
lola: 63836762 markings, 343001394 edges, 258621 markings/sec, 230 secs
lola: 65179434 markings, 350176973 edges, 268534 markings/sec, 235 secs
lola: 66443048 markings, 357060543 edges, 252723 markings/sec, 240 secs
lola: 67689839 markings, 363890997 edges, 249358 markings/sec, 245 secs
lola: 68889762 markings, 370494130 edges, 239985 markings/sec, 250 secs
lola: 70128714 markings, 377306956 edges, 247790 markings/sec, 255 secs
lola: 71320998 markings, 383895142 edges, 238457 markings/sec, 260 secs
lola: 72554021 markings, 390570296 edges, 246605 markings/sec, 265 secs
lola: 73801351 markings, 397417714 edges, 249466 markings/sec, 270 secs
lola: 75035450 markings, 404126540 edges, 246820 markings/sec, 275 secs
lola: 76277051 markings, 410887104 edges, 248320 markings/sec, 280 secs
lola: 77449595 markings, 417327784 edges, 234509 markings/sec, 285 secs
lola: 78655868 markings, 423949711 edges, 241255 markings/sec, 290 secs
lola: 79860823 markings, 430570864 edges, 240991 markings/sec, 295 secs
lola: 81080651 markings, 437264964 edges, 243966 markings/sec, 300 secs
lola: 82266947 markings, 443776660 edges, 237259 markings/sec, 305 secs
lola: 83410955 markings, 450038497 edges, 228802 markings/sec, 310 secs
lola: 84509820 markings, 456202278 edges, 219773 markings/sec, 315 secs
lola: 85661063 markings, 462608764 edges, 230249 markings/sec, 320 secs
lola: 86756220 markings, 468691284 edges, 219031 markings/sec, 325 secs
lola: 87887267 markings, 474956376 edges, 226209 markings/sec, 330 secs
lola: 89029247 markings, 481279570 edges, 228396 markings/sec, 335 secs
lola: 90171886 markings, 487587267 edges, 228528 markings/sec, 340 secs
lola: 91284640 markings, 493753596 edges, 222551 markings/sec, 345 secs
lola: 92450417 markings, 500162425 edges, 233155 markings/sec, 350 secs
lola: 93555212 markings, 506316250 edges, 220959 markings/sec, 355 secs
lola: 94707245 markings, 512673024 edges, 230407 markings/sec, 360 secs
lola: 95849096 markings, 519005289 edges, 228370 markings/sec, 365 secs
lola: 96980145 markings, 525259962 edges, 226210 markings/sec, 370 secs
lola: 98073261 markings, 531383716 edges, 218623 markings/sec, 375 secs
lola: 99208722 markings, 537534928 edges, 227092 markings/sec, 380 secs
lola: 100361776 markings, 543935846 edges, 230611 markings/sec, 385 secs
lola: 101500440 markings, 550235344 edges, 227733 markings/sec, 390 secs
lola: 102638531 markings, 556389779 edges, 227618 markings/sec, 395 secs
lola: 103826110 markings, 562772296 edges, 237516 markings/sec, 400 secs
lola: 104893038 markings, 568746166 edges, 213386 markings/sec, 405 secs
lola: 105996021 markings, 574830940 edges, 220597 markings/sec, 410 secs
lola: 107141312 markings, 581185572 edges, 229058 markings/sec, 415 secs
lola: 108261291 markings, 587484375 edges, 223996 markings/sec, 420 secs
lola: 109425844 markings, 594020272 edges, 232911 markings/sec, 425 secs
lola: 110617458 markings, 600676275 edges, 238323 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (G (((P12s <= 2) AND (P3s + 1 <= M3)))) AND E (F (((P2 <= 1) AND (P1wM1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((P2 <= 1) AND (P1wM1 <= 2))))
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 <= 1) AND (P1wM1 <= 2))))
lola: processed formula length: 36
lola: 29 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 <= 1) AND (P1wM1 <= 2))
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: 200 markings, 199 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (((P12s <= 2) AND (P3s + 1 <= M3))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((P12s <= 2) AND (P3s + 1 <= M3))))
lola: processed formula length: 41
lola: 29 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= P12s) OR (M3 <= P3s))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 1004 markings, 1004 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes yes unknown unknown yes no yes yes no yes no
lola:
preliminary result: yes yes yes no no yes yes unknown unknown yes no yes yes no yes no
lola: memory consumption: 20564 KB
lola: time consumption: 1568 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552656038848

--------------------
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-00200"
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-00200, 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-155246548900058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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