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-155246548800022.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-00010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246548800022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 4.0K Feb 10 23:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 10 23:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 6 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 6 20:57 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:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K Feb 4 23:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 3 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 3 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jan 31 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 31 01:02 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-00010-CTLCardinality-00
FORMULA_NAME FMS-PT-00010-CTLCardinality-01
FORMULA_NAME FMS-PT-00010-CTLCardinality-02
FORMULA_NAME FMS-PT-00010-CTLCardinality-03
FORMULA_NAME FMS-PT-00010-CTLCardinality-04
FORMULA_NAME FMS-PT-00010-CTLCardinality-05
FORMULA_NAME FMS-PT-00010-CTLCardinality-06
FORMULA_NAME FMS-PT-00010-CTLCardinality-07
FORMULA_NAME FMS-PT-00010-CTLCardinality-08
FORMULA_NAME FMS-PT-00010-CTLCardinality-09
FORMULA_NAME FMS-PT-00010-CTLCardinality-10
FORMULA_NAME FMS-PT-00010-CTLCardinality-11
FORMULA_NAME FMS-PT-00010-CTLCardinality-12
FORMULA_NAME FMS-PT-00010-CTLCardinality-13
FORMULA_NAME FMS-PT-00010-CTLCardinality-14
FORMULA_NAME FMS-PT-00010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552654428449

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

FORMULA FMS-PT-00010-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA FMS-PT-00010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA FMS-PT-00010-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA FMS-PT-00010-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00010-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA FMS-PT-00010-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-00010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2128
rslt: Output for CTLCardinality @ FMS-PT-00010

{
"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:53:48 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": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((2 <= P12wM3) OR (2 <= P2wM2)) AND (1 <= P1))",
"processed_size": 48,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "(M1 + 1 <= P12M3)",
"processed_size": 17,
"rewrites": 32
},
"result":
{
"edges": 67,
"markings": 62,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((P3 <= 0)))",
"processed_size": 17,
"rewrites": 31
},
"result":
{
"edges": 10,
"markings": 11,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((P2wP1 <= M1))))",
"processed_size": 23,
"rewrites": 32
},
"result":
{
"edges": 37,
"markings": 37,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "A (G (((P3M2 + 1 <= P1) OR ((P1wP2 + 1 <= P2wP1) AND (P1s <= 0)))))",
"processed_size": 68,
"rewrites": 32
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E(((1 <= P2wM2) OR (M1 <= P1wP2) OR (P2M2 <= 0)) U AF((3 <= P1wP2)))",
"processed_size": 70,
"rewrites": 32
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 3013,
"markings": 856,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AG((AG((P1M1 <= P1)) OR EG((2 <= P2wP1))))",
"processed_size": 42,
"rewrites": 33
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 1282,
"markings": 762,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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 <= P1wP2)",
"processed_size": 12,
"rewrites": 34
},
"result":
{
"edges": 1396,
"markings": 840,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (((3 <= M1) U ((P2 + 1 <= M3) AND (P1 + 1 <= P2wM2))))",
"processed_size": 56,
"rewrites": 33
},
"result":
{
"edges": 426,
"markings": 240,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= P1)))",
"processed_size": 17,
"rewrites": 32
},
"result":
{
"edges": 10,
"markings": 11,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 742
},
"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": "(2 <= P3s)",
"processed_size": 10,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 990
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((P2d + 1 <= P2M2) OR (M3 <= P1s))",
"processed_size": 35,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 742
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((3 <= P3s) OR ((P12wM3 + 1 <= P2s))) AND (M1 <= 2))",
"processed_size": 54,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 990
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((P12 <= 0) AND (M3 <= P2M2))))",
"processed_size": 37,
"rewrites": 31
},
"result":
{
"edges": 69,
"markings": 64,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 990
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= P2wM2)",
"processed_size": 12,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1485
},
"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 <= P2s)))",
"processed_size": 18,
"rewrites": 31
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"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": 2970
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((((1 <= P2wM2) OR (2 <= P3)) U (P12 + 1 <= P3)))",
"processed_size": 52,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1485
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((P12wM3 + 1 <= P1wM1)))",
"processed_size": 29,
"rewrites": 31
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"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": 2970
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((P2wP1 <= P1)))",
"processed_size": 21,
"rewrites": 31
},
"result":
{
"edges": 53,
"markings": 53,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G (((P2d <= 0) OR (P1s <= 1))))",
"processed_size": 35,
"rewrites": 32
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2969
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G (((2 <= P12) AND (P12s <= P2M2))))",
"processed_size": 39,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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 (G (((P1d <= P2M2) AND (2 <= P3M2))))",
"processed_size": 39,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"result":
{
"edges": 126,
"markings": 114,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "nodeadlock",
"workflow": "search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= P2wM2)",
"processed_size": 12,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 <= P2s)))",
"processed_size": 18,
"rewrites": 31
},
"result":
{
"edges": 12,
"markings": 13,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((((1 <= P2wM2) OR (2 <= P3)) U (P12 + 1 <= P3)))",
"processed_size": 52,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "E (F (((P3 <= P12wM3) OR (P2s <= P1wM1))))",
"processed_size": 43,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((P12wM3 + 1 <= P1wM1)))",
"processed_size": 29,
"rewrites": 31
},
"result":
{
"edges": 1,
"markings": 2,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((P2wP1 <= P1)))",
"processed_size": 21,
"rewrites": 31
},
"result":
{
"edges": 53,
"markings": 53,
"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"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(P12M3 + 1 <= P1)",
"processed_size": 17,
"rewrites": 33
},
"result":
{
"edges": 53,
"markings": 53,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G (((P2d <= 0) OR (P1s <= 1))))",
"processed_size": 35,
"rewrites": 32
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G (((2 <= P12) AND (P12s <= P2M2))))",
"processed_size": 39,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((P2s <= 2)))",
"processed_size": 18,
"rewrites": 31
},
"result":
{
"edges": 54,
"markings": 54,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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 (G (((P1d <= P2M2) AND (2 <= P3M2))))",
"processed_size": 39,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (((P12wM3 <= P2M2) U (M3 <= P12s)))",
"processed_size": 37,
"rewrites": 33
},
"result":
{
"edges": 3215684,
"markings": 472250,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24196,
"runtime": 1442.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((E(F(**)) OR **) AND (E(F(**)) AND A((** U **)))) : A(G(**)) : (A(G(**)) OR (A(F(**)) AND (E(G(**)) AND E(F(*))))) : A(F(A(G(**)))) : A(G((A(G(**)) OR E(G(**))))) : E((** U **)) : A(G(**)) : E((** U A(F(**)))) : (E(F(**)) OR **) : (* AND **) : ((E(G(*)) AND E((** U **))) OR (E(G(**)) OR A(G(**)))) : (** OR (A(G(**)) OR **)) : E(X(E(F(**)))) : (A(G(E(F(**)))) AND A(G(NODEADLOCK))) : FALSE : E(F(*))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "yes no no no no yes no yes yes no yes no yes unknown no yes ",
"value": "yes no no no no yes no yes yes no yes no yes unknown no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 <= P12M3)
lola: LP says that atomic proposition is always false: (2 <= M2)
lola: LP says that atomic proposition is always false: (2 <= M2)
lola: LP says that atomic proposition is always false: (3 <= P2M2)
lola: (((E (F ((3 <= P2s))) OR (3 <= P2wM2)) AND E (F (((P3 <= P12wM3) OR (P2s <= P1wM1))))) AND A ((((1 <= P2wM2) OR (2 <= P3)) U (P12 + 1 <= P3)))) : A (G (((P3M2 + 1 <= P1) OR ((P1wP2 + 1 <= P2wP1) AND (P1s <= 0))))) : (A (G (((P2d <= 0) OR (P1s <= 1)))) OR ((A (F ((P1 <= P12M3))) AND E (G ((P2wP1 <= P1)))) AND NOT(A (G ((P1wM1 <= P12wM3)))))) : A (F (A (G ((P1wP2 <= 2))))) : A (G ((A (G ((P1M1 <= P1))) OR E (G ((2 <= P2wP1)))))) : E (((3 <= M1) U ((P2 + 1 <= M3) AND (P1 + 1 <= P2wM2)))) : A (G (((P2wP1 <= M1)))) : E ((((1 <= P2wM2) OR (M1 <= P1wP2) OR (P2M2 <= 0)) U A (F ((3 <= P1wP2))))) : (E (F (((P12 <= 0) AND (M3 <= P2M2)))) OR (((3 <= P3s) OR ((P12wM3 + 1 <= P2s))) AND (M1 <= 2))) : (NOT((((P12wM3 <= 1) AND (P2wM2 <= 1)) AND A (G ((0 <= 0))))) AND (1 <= P1)) : ((NOT(A (F ((3 <= P2s)))) AND E (((P12wM3 <= P2M2) U (M3 <= P12s)))) OR (E (G (((P1d <= P2M2) AND (2 <= P3M2)))) OR A (G (((2 <= P12) AND (P12s <= P2M2)))))) : (((2 <= P3s) OR A (G ((1 <= P1)))) OR ((P2d + 1 <= P2M2) OR (M3 <= P1s))) : E (X (E (F ((M1 + 1 <= P12M3))))) : A (G ((E (F ((3 <= P2))) AND E (X ((0 <= 0)))))) : ((((P1d <= 0) OR (P3s <= P2wP1) OR (P1s + 1 <= P12s)) OR (A (G ((2 <= P1wM1))) OR ((P1d <= P3) AND ((1 <= P1M1) OR (P12s <= P3s))))) AND (E (((1 <= M1) U (2 <= M2))) OR (E (X ((P1d <= P1s))) AND A (G ((3 <= P2M2)))))) : NOT(E (G (A (G ((1 <= P3))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:251
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:115
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:476
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= P12wM3) OR (2 <= P2wM2)) AND (1 <= P1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((2 <= P12wM3) OR (2 <= P2wM2)) AND (1 <= P1))
lola: processed formula length: 48
lola: 31 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 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: 30 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 (X (E (F ((M1 + 1 <= P12M3)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (M1 + 1 <= P12M3)
lola: processed formula length: 17
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 (state space /EXEF)
lola: state space: using reachability graph (EXef 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: 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: (M1 + 1 <= P12M3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 62 markings, 67 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P3 <= 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 ((P3 <= 0)))
lola: processed formula length: 17
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)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P2wP1 <= M1))))
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 (((P2wP1 <= M1))))
lola: processed formula length: 23
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 (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: 37 markings, 37 edges
lola: ========================================
sara: try reading problem file CTLCardinality-2-0.sara.
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P3M2 + 1 <= P1) OR ((P1wP2 + 1 <= P2wP1) AND (P1s <= 0)))))
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 (((P3M2 + 1 <= P1) OR ((P1wP2 + 1 <= P2wP1) AND (P1s <= 0)))))
lola: processed formula length: 68
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 (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: ((P1 <= P3M2) AND ((P2wP1 <= P1wP2) OR (1 <= P1s)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= P2wM2) OR (M1 <= P1wP2) OR (P2M2 <= 0)) U A (F ((3 <= P1wP2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809

lola: processed formula: E(((1 <= P2wM2) OR (M1 <= P1wP2) OR (P2M2 <= 0)) U AF((3 <= P1wP2)))
lola: processed formula length: 70
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: 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: 856 markings, 3013 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((P1M1 <= P1))) OR E (G ((2 <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AG((P1M1 <= P1)) OR EG((2 <= P2wP1))))
lola: processed formula length: 42
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: 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 762 markings, 1282 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((P1wP2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (3 <= P1wP2)
lola: processed formula length: 12
lola: 34 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: 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 <= P1wP2)
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 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: (P1wP2 <= 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: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-8-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
sara: try reading problem file CTLCardinality-8-1.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 840 markings, 1396 edges

lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((3 <= M1) U ((P2 + 1 <= M3) AND (P1 + 1 <= P2wM2))))
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 (((3 <= M1) U ((P2 + 1 <= M3) AND (P1 + 1 <= P2wM2))))
lola: processed formula length: 56
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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((P2 + 1 <= M3) AND (P1 + 1 <= P2wM2))
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: 240 markings, 426 edges
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((3 <= P2))))) AND A (G (NOT DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas

lola: RUNNING
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking absence of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The net is deadlock-free.
lola: 114 markings, 126 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= P2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (3 <= P2)
lola: processed formula length: 9
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P2 <= 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: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (3 <= P2)
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-11-1.sara
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: sara is running 0 secs || sara is running 0 secs || 2369165 markings, 6045830 edges, 473833 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4123148 markings, 11049604 edges, 350797 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 5585537 markings, 15356745 edges, 292478 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 7078129 markings, 19863729 edges, 298518 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 8446397 markings, 24072244 edges, 273654 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 9696859 markings, 27946000 edges, 250092 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 10984818 markings, 32005573 edges, 257592 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 12372070 markings, 36409833 edges, 277450 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 13716427 markings, 40701594 edges, 268871 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 15037101 markings, 44946787 edges, 264135 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 16303499 markings, 49092075 edges, 253280 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 17567737 markings, 53190513 edges, 252848 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 18644075 markings, 56772290 edges, 215268 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 19776679 markings, 60498313 edges, 226521 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 20927249 markings, 64318707 edges, 230114 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 22079386 markings, 68157064 edges, 230427 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 23237374 markings, 72041175 edges, 231598 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 24427792 markings, 76019929 edges, 238084 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 25566018 markings, 79859220 edges, 227645 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 26678575 markings, 83643309 edges, 222511 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 27841345 markings, 87605436 edges, 232554 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 28954322 markings, 91410669 edges, 222595 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 30002192 markings, 95014562 edges, 209574 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 31122378 markings, 98865514 edges, 224037 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 32243679 markings, 102728506 edges, 224260 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 33287894 markings, 106331518 edges, 208843 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 34357297 markings, 110042380 edges, 213881 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 35405321 markings, 113712623 edges, 209605 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 36451268 markings, 117363174 edges, 209189 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 37461091 markings, 120888676 edges, 201965 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 38435760 markings, 124314495 edges, 194934 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 39418477 markings, 127748914 edges, 196543 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 40416121 markings, 131258988 edges, 199529 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 41432893 markings, 134842951 edges, 203354 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 42444251 markings, 138433634 edges, 202272 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 43431364 markings, 141918941 edges, 197423 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 44407661 markings, 145402669 edges, 195259 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 45386674 markings, 148903643 edges, 195803 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 46337382 markings, 152295296 edges, 190142 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 47278305 markings, 155665504 edges, 188185 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 48227748 markings, 159081878 edges, 189889 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 49153055 markings, 162384961 edges, 185061 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 50061838 markings, 165651888 edges, 181757 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 50968457 markings, 168927480 edges, 181324 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 51896045 markings, 172283931 edges, 185518 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 52793329 markings, 175546006 edges, 179457 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 53701619 markings, 178807744 edges, 181658 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 54603014 markings, 182059358 edges, 180279 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 55504245 markings, 185330935 edges, 180246 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 56388664 markings, 188559519 edges, 176884 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 57271448 markings, 191794087 edges, 176557 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 58175900 markings, 195075183 edges, 180890 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 59061561 markings, 198311642 edges, 177132 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 59905453 markings, 201404720 edges, 168778 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 60819682 markings, 204760608 edges, 182846 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 61694086 markings, 207976164 edges, 174881 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 62567383 markings, 211188519 edges, 174659 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 63447676 markings, 214403265 edges, 176059 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 64364730 markings, 217781563 edges, 183411 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 65293847 markings, 221191068 edges, 185823 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 66216823 markings, 224583183 edges, 184595 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 67120359 markings, 227940590 edges, 180707 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 68012027 markings, 231254637 edges, 178334 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 68875032 markings, 234457936 edges, 172601 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 69704470 markings, 237561724 edges, 165888 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 70538308 markings, 240650464 edges, 166768 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 71425294 markings, 243942200 edges, 177397 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 72311576 markings, 247228926 edges, 177256 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 73180092 markings, 250444631 edges, 173703 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 74044404 markings, 253693097 edges, 172862 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 74930281 markings, 257005254 edges, 177175 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 75804988 markings, 260279102 edges, 174941 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 76688883 markings, 263583006 edges, 176779 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 77572739 markings, 266883903 edges, 176771 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 78441955 markings, 270149013 edges, 173843 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 79295157 markings, 273352450 edges, 170640 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 80170747 markings, 276639295 edges, 175118 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 81042728 markings, 279910646 edges, 174396 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 81911917 markings, 283176676 edges, 173838 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 82779061 markings, 286418904 edges, 173429 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 83636758 markings, 289650480 edges, 171539 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 84494361 markings, 292892909 edges, 171521 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 85306588 markings, 295950844 edges, 162445 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 86146734 markings, 299136786 edges, 168029 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 86966730 markings, 302223493 edges, 163999 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 87767838 markings, 305262296 edges, 160222 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 88562349 markings, 308314127 edges, 158902 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 89349065 markings, 311325117 edges, 157343 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 90141678 markings, 314344428 edges, 158523 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 90958642 markings, 317438346 edges, 163393 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 91755753 markings, 320485455 edges, 159422 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 92538035 markings, 323477824 edges, 156456 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 93319934 markings, 326466838 edges, 156380 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 94118873 markings, 329535725 edges, 159788 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 94914634 markings, 332575733 edges, 159152 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 95693472 markings, 335554230 edges, 155768 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 96465213 markings, 338500731 edges, 154348 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 97226933 markings, 341416874 edges, 152344 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 97984223 markings, 344327036 edges, 151458 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 98743617 markings, 347256137 edges, 151879 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 99512387 markings, 350222772 edges, 153754 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 100285765 markings, 353202658 edges, 154676 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 101050692 markings, 356144063 edges, 152985 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 101811829 markings, 359087411 edges, 152227 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 102595493 markings, 362109513 edges, 156733 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 103339000 markings, 364996023 edges, 148701 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 104085680 markings, 367866735 edges, 149336 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 104848880 markings, 370838086 edges, 152640 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 105624381 markings, 373845844 edges, 155100 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 106411551 markings, 376891192 edges, 157434 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 107164427 markings, 379823822 edges, 150575 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 107926869 markings, 382774212 edges, 152488 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 108679182 markings, 385691747 edges, 150463 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 109416837 markings, 388555484 edges, 147531 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 110164762 markings, 391456808 edges, 149585 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 110919097 markings, 394393589 edges, 150867 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 111674660 markings, 397355692 edges, 151113 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 112466017 markings, 400425161 edges, 158271 markings/sec, 585 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown no no yes no yes unknown no unknown unknown yes unknown no yes
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown no unknown no no yes no yes unknown no unknown unknown yes unknown no yes
lola: memory consumption: 11949088 KB
lola: time consumption: 599 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown no unknown no no yes no yes unknown no unknown unknown yes unknown no yes
lola: memory consumption: 11950100 KB
lola: time consumption: 599 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= P3s) OR (A (G ((1 <= P1))) OR ((P2d + 1 <= P2M2) OR (M3 <= P1s))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= P1)))
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 ((1 <= P1)))
lola: processed formula length: 17
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 (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: (P1 <= 0)
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 12 will run for 742 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= P3s)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= P3s)
lola: processed formula length: 10
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 13 will run for 990 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((P2d + 1 <= P2M2) OR (M3 <= P1s))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P2d + 1 <= P2M2) OR (M3 <= P1s))
lola: processed formula length: 35
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 742 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((P12 <= 0) AND (M3 <= P2M2)))) OR (((3 <= P3s) OR ((P12wM3 + 1 <= P2s))) AND (M1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 742 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((3 <= P3s) OR ((P12wM3 + 1 <= P2s))) AND (M1 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= P3s) OR ((P12wM3 + 1 <= P2s))) AND (M1 <= 2))
lola: processed formula length: 54
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 990 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((P12 <= 0) AND (M3 <= P2M2))))
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 (((P12 <= 0) AND (M3 <= P2M2))))
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: 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: ((P12 <= 0) AND (M3 <= P2M2))
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: 64 markings, 69 edges
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 990 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F ((3 <= P2s))) OR (3 <= P2wM2)) AND (E (F (((P3 <= P12wM3) OR (P2s <= P1wM1)))) AND A ((((1 <= P2wM2) OR (2 <= P3)) U (P12 + 1 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 990 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= P2wM2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P2wM2)
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= P2s)))
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 <= P2s)))
lola: processed formula length: 18
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)
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 <= P2s)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: try reading problem file CTLCardinality-13-0.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 15 will run for 2970 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= P2wM2) OR (2 <= P3)) U (P12 + 1 <= P3)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((1 <= P2wM2) OR (2 <= P3)) U (P12 + 1 <= P3)))
lola: processed formula length: 52
lola: 35 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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: ========================================
sara: try reading problem file CTLCardinality-14-0.sara.

lola: subprocess 14 will run for 1485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((P2d <= 0) OR (P1s <= 1)))) OR (A (F ((P1 <= P12M3))) AND (E (G ((P2wP1 <= P1))) AND E (F ((P12wM3 + 1 <= P1wM1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P12wM3 + 1 <= P1wM1)))
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 ((P12wM3 + 1 <= P1wM1)))
lola: processed formula length: 29
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)
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: (P12wM3 + 1 <= P1wM1)
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: 2 markings, 1 edges
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: subprocess 15 will run for 2970 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((P2wP1 <= P1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((P2wP1 <= P1)))
lola: processed formula length: 21
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 / 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 53 markings, 53 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P2d <= 0) OR (P1s <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((P2d <= 0) OR (P1s <= 1))))
lola: processed formula length: 35
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 (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: ((1 <= P2d) AND (2 <= P1s))
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-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
sara: try reading problem file CTLCardinality-14-0.sara.

lola: subprocess 15 will run for 2970 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G ((P2s <= 2))) AND E (((P12wM3 <= P2M2) U (M3 <= P12s)))) OR (E (G (((P1d <= P2M2) AND (2 <= P3M2)))) OR A (G (((2 <= P12) AND (P12s <= P2M2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2969 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= P12) AND (P12s <= P2M2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((2 <= P12) AND (P12s <= P2M2))))
lola: processed formula length: 39
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 (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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not invariant.
lola: formula 0: ((P12 <= 1) OR (P2M2 + 1 <= P12s))
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((P1d <= P2M2) AND (2 <= P3M2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((P1d <= P2M2) AND (2 <= P3M2))))
lola: processed formula length: 39
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((P2M2 + 1 <= P1d) OR (P3M2 <= 1))
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: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
sara: try reading problem file CTLCardinality-17-0.sara.

lola: ========================================
lola: ...considering subproblem: E (((P12wM3 <= P2M2) U (M3 <= P12s)))
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 (((P12wM3 <= P2M2) U (M3 <= P12s)))
lola: processed formula length: 37
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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (M3 <= P12s)
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-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-0.sara.

lola: state equation 0: solution produced
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown no no yes no yes yes no unknown no yes unknown no yes
lola: memory consumption: 33428 KB
lola: time consumption: 602 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((3 <= P2))))) AND A (G (NOT DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking absence of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The net is deadlock-free.
lola: 114 markings, 126 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= P2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (3 <= P2)
lola: processed formula length: 9
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P2 <= 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: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.
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 <= P2)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-17-1.sara

lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-1.sara.

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2603233 markings, 6694949 edges, 520647 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4586889 markings, 12405959 edges, 396731 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 6384321 markings, 17755813 edges, 359486 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 8061936 markings, 22879013 edges, 335523 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 9664569 markings, 27841692 edges, 320527 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 11163033 markings, 32569491 edges, 299693 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 12658044 markings, 37312324 edges, 299002 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 14101492 markings, 41929411 edges, 288690 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 15515180 markings, 46508469 edges, 282738 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 16889952 markings, 51001471 edges, 274954 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 18247351 markings, 55440657 edges, 271480 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 19569956 markings, 59822481 edges, 264521 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 20871159 markings, 64133407 edges, 260241 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 22159234 markings, 68426223 edges, 257615 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 23417665 markings, 72648737 edges, 251686 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 24648291 markings, 76767377 edges, 246125 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 25862919 markings, 80870571 edges, 242926 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 27046140 markings, 84884099 edges, 236644 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 28163358 markings, 88695380 edges, 223444 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 29243928 markings, 92412917 edges, 216114 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 30313072 markings, 96100592 edges, 213829 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 31394873 markings, 99795796 edges, 216360 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 32539477 markings, 103749911 edges, 228921 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 33684001 markings, 107714095 edges, 228905 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 34811191 markings, 111630546 edges, 225438 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 35931105 markings, 115550824 edges, 223983 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 37044454 markings, 119441507 edges, 222670 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 38150823 markings, 123314036 edges, 221274 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 39256187 markings, 127177983 edges, 221073 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 40337664 markings, 130971564 edges, 216295 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 41381148 markings, 134654738 edges, 208697 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 42420382 markings, 138348645 edges, 207847 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 43462224 markings, 142027213 edges, 208368 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 44503564 markings, 145740552 edges, 208268 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 45554331 markings, 149496579 edges, 210153 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 46596451 markings, 153225529 edges, 208424 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 47628883 markings, 156934100 edges, 206486 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 48658310 markings, 160628558 edges, 205885 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 49650935 markings, 164177635 edges, 198525 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 50627994 markings, 167692065 edges, 195412 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 51605430 markings, 171232979 edges, 195487 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 52577939 markings, 174753368 edges, 194502 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 53549522 markings, 178255941 edges, 194317 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 54522112 markings, 181769826 edges, 194518 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 55505313 markings, 185335263 edges, 196640 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 56451775 markings, 188792451 edges, 189292 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 57383981 markings, 192198517 edges, 186441 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 58342598 markings, 195675321 edges, 191723 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 59298181 markings, 199164653 edges, 191117 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 60241423 markings, 202644451 edges, 188648 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 61183953 markings, 206107819 edges, 188506 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 62132657 markings, 209598606 edges, 189741 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 63091160 markings, 213107657 edges, 191701 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 64047779 markings, 216609708 edges, 191324 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 64974870 markings, 220039514 edges, 185418 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 65921104 markings, 223490115 edges, 189247 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 66856674 markings, 226950756 edges, 187114 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 67777004 markings, 230379405 edges, 184066 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 68682330 markings, 233732073 edges, 181065 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 69594146 markings, 237149722 edges, 182363 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 70518673 markings, 240581309 edges, 184905 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 71405395 markings, 243864270 edges, 177344 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 72287536 markings, 247137162 edges, 176428 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 73160141 markings, 250370229 edges, 174521 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 74028021 markings, 253634240 edges, 173576 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 74921689 markings, 256973072 edges, 178734 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 75800033 markings, 260260487 edges, 175669 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 76694358 markings, 263603132 edges, 178865 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 77603950 markings, 266999335 edges, 181918 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 78499887 markings, 270367460 edges, 179187 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 79404177 markings, 273757295 edges, 180858 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 80303239 markings, 277144450 edges, 179812 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 81199600 markings, 280505718 edges, 179272 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 82082132 markings, 283819027 edges, 176506 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 82953146 markings, 287073935 edges, 174203 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 83810373 markings, 290311193 edges, 171445 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 84679039 markings, 293592355 edges, 173733 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 85533435 markings, 296813084 edges, 170879 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 86389886 markings, 300048466 edges, 171290 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 87247260 markings, 303287894 edges, 171475 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 88102223 markings, 306531647 edges, 170993 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 88941797 markings, 309769492 edges, 167915 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 89792878 markings, 313014788 edges, 170216 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 90644198 markings, 316250531 edges, 170264 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 91493454 markings, 319464393 edges, 169851 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 92336601 markings, 322721772 edges, 168629 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 93190274 markings, 325977965 edges, 170735 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 94033727 markings, 329222264 edges, 168691 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 94889206 markings, 332477721 edges, 171096 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 95728383 markings, 335684300 edges, 167835 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 96568459 markings, 338893060 edges, 168015 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 97410428 markings, 342127531 edges, 168394 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 98251867 markings, 345368262 edges, 168288 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 99090750 markings, 348597228 edges, 167777 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 99921225 markings, 351801588 edges, 166095 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 100760279 markings, 355024739 edges, 167811 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 101585647 markings, 358218109 edges, 165074 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 102403682 markings, 361364377 edges, 163607 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 103213442 markings, 364503165 edges, 161952 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 104017258 markings, 367616325 edges, 160763 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 104826509 markings, 370752318 edges, 161850 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 105642940 markings, 373917690 edges, 163286 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 106443381 markings, 377019935 edges, 160088 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 107258036 markings, 380180610 edges, 162931 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 107985776 markings, 383008483 edges, 145548 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 108701408 markings, 385773394 edges, 143126 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 109464876 markings, 388744655 edges, 152694 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 110212227 markings, 391638581 edges, 149470 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 110952259 markings, 394524904 edges, 148006 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 111689132 markings, 397412073 edges, 147375 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 112474216 markings, 400455530 edges, 157017 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 113258419 markings, 403517515 edges, 156841 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 114045106 markings, 406582185 edges, 157337 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 114822352 markings, 409625904 edges, 155449 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 115587591 markings, 412646416 edges, 153048 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 116363736 markings, 415701377 edges, 155229 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 117131104 markings, 418714529 edges, 153474 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 117906737 markings, 421755302 edges, 155127 markings/sec, 585 secs
lola: sara is running 590 secs || sara is running 590 secs || 118683458 markings, 424778299 edges, 155344 markings/sec, 590 secs
lola: sara is running 595 secs || sara is running 595 secs || 119460797 markings, 427800122 edges, 155468 markings/sec, 595 secs
lola: sara is running 600 secs || sara is running 600 secs || 120235433 markings, 430827451 edges, 154927 markings/sec, 600 secs
lola: sara is running 605 secs || sara is running 605 secs || 120998292 markings, 433845330 edges, 152572 markings/sec, 605 secs
lola: sara is running 610 secs || sara is running 610 secs || 121770086 markings, 436867392 edges, 154359 markings/sec, 610 secs
lola: sara is running 615 secs || sara is running 615 secs || 122536187 markings, 439890149 edges, 153220 markings/sec, 615 secs
lola: sara is running 620 secs || sara is running 620 secs || 123301913 markings, 442890532 edges, 153145 markings/sec, 620 secs
lola: sara is running 625 secs || sara is running 625 secs || 124058148 markings, 445901106 edges, 151247 markings/sec, 625 secs
lola: sara is running 630 secs || sara is running 630 secs || 124813853 markings, 448889036 edges, 151141 markings/sec, 630 secs
lola: sara is running 635 secs || sara is running 635 secs || 125559500 markings, 451851281 edges, 149129 markings/sec, 635 secs
lola: sara is running 640 secs || sara is running 640 secs || 126309710 markings, 454815311 edges, 150042 markings/sec, 640 secs
lola: sara is running 645 secs || sara is running 645 secs || 127050941 markings, 457763372 edges, 148246 markings/sec, 645 secs
lola: sara is running 650 secs || sara is running 650 secs || 127812890 markings, 460768940 edges, 152390 markings/sec, 650 secs
lola: sara is running 655 secs || sara is running 655 secs || 128572126 markings, 463763878 edges, 151847 markings/sec, 655 secs
lola: sara is running 660 secs || sara is running 660 secs || 129325789 markings, 466770150 edges, 150733 markings/sec, 660 secs
lola: sara is running 665 secs || sara is running 665 secs || 130076968 markings, 469766044 edges, 150236 markings/sec, 665 secs
lola: sara is running 670 secs || sara is running 670 secs || 130835782 markings, 472766471 edges, 151763 markings/sec, 670 secs
lola: sara is running 675 secs || sara is running 675 secs || 131596979 markings, 475776113 edges, 152239 markings/sec, 675 secs
lola: sara is running 680 secs || sara is running 680 secs || 132352436 markings, 478783595 edges, 151091 markings/sec, 680 secs
lola: sara is running 685 secs || sara is running 685 secs || 133103727 markings, 481749754 edges, 150258 markings/sec, 685 secs
lola: sara is running 690 secs || sara is running 690 secs || 133855780 markings, 484728788 edges, 150411 markings/sec, 690 secs
lola: sara is running 695 secs || sara is running 695 secs || 134578965 markings, 487599689 edges, 144637 markings/sec, 695 secs
lola: sara is running 700 secs || sara is running 700 secs || 135292443 markings, 490441802 edges, 142696 markings/sec, 700 secs
lola: sara is running 705 secs || sara is running 705 secs || 136018004 markings, 493334070 edges, 145112 markings/sec, 705 secs
lola: sara is running 710 secs || sara is running 710 secs || 136739033 markings, 496198413 edges, 144206 markings/sec, 710 secs
lola: sara is running 715 secs || sara is running 715 secs || 137458589 markings, 499065304 edges, 143911 markings/sec, 715 secs
lola: sara is running 720 secs || sara is running 720 secs || 138179065 markings, 501932099 edges, 144095 markings/sec, 720 secs
lola: sara is running 725 secs || sara is running 725 secs || 138887762 markings, 504757039 edges, 141739 markings/sec, 725 secs
lola: sara is running 730 secs || sara is running 730 secs || 139592483 markings, 507556499 edges, 140944 markings/sec, 730 secs
lola: sara is running 735 secs || sara is running 735 secs || 140297195 markings, 510405315 edges, 140942 markings/sec, 735 secs
lola: sara is running 740 secs || sara is running 740 secs || 141008414 markings, 513245878 edges, 142244 markings/sec, 740 secs
lola: sara is running 745 secs || sara is running 745 secs || 141707246 markings, 516047296 edges, 139766 markings/sec, 745 secs
lola: sara is running 750 secs || sara is running 750 secs || 142418800 markings, 518896723 edges, 142311 markings/sec, 750 secs
lola: sara is running 755 secs || sara is running 755 secs || 143143871 markings, 521796825 edges, 145014 markings/sec, 755 secs
lola: sara is running 760 secs || sara is running 760 secs || 143858556 markings, 524659744 edges, 142937 markings/sec, 760 secs
lola: sara is running 765 secs || sara is running 765 secs || 144571459 markings, 527526587 edges, 142581 markings/sec, 765 secs
lola: sara is running 770 secs || sara is running 770 secs || 145282905 markings, 530364993 edges, 142289 markings/sec, 770 secs
lola: sara is running 775 secs || sara is running 775 secs || 146003787 markings, 533258991 edges, 144176 markings/sec, 775 secs
lola: sara is running 780 secs || sara is running 780 secs || 146711583 markings, 536111050 edges, 141559 markings/sec, 780 secs
lola: sara is running 785 secs || sara is running 785 secs || 147434209 markings, 539034163 edges, 144525 markings/sec, 785 secs
lola: sara is running 790 secs || sara is running 790 secs || 148152076 markings, 541925588 edges, 143573 markings/sec, 790 secs
lola: sara is running 795 secs || sara is running 795 secs || 148880452 markings, 544871483 edges, 145675 markings/sec, 795 secs
lola: sara is running 800 secs || sara is running 800 secs || 149593122 markings, 547727626 edges, 142534 markings/sec, 800 secs
lola: sara is running 805 secs || sara is running 805 secs || 150311800 markings, 550626449 edges, 143736 markings/sec, 805 secs
lola: sara is running 810 secs || sara is running 810 secs || 151024564 markings, 553500502 edges, 142553 markings/sec, 810 secs
lola: sara is running 815 secs || sara is running 815 secs || 151763950 markings, 556463552 edges, 147877 markings/sec, 815 secs
lola: sara is running 820 secs || sara is running 820 secs || 152483128 markings, 559379391 edges, 143836 markings/sec, 820 secs
lola: sara is running 825 secs || sara is running 825 secs || 152766595 markings, 560523466 edges, 56693 markings/sec, 825 secs
lola: sara is running 830 secs || sara is running 830 secs || 152911368 markings, 561099117 edges, 28955 markings/sec, 830 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 (F ((3 <= P2s))) OR (3 <= P2wM2)) AND (E (F (((P3 <= P12wM3) OR (P2s <= P1wM1)))) AND A ((((1 <= P2wM2) OR (2 <= P3)) U (P12 + 1 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= P2wM2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P2wM2)
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= P2s)))
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 <= P2s)))
lola: processed formula length: 18
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)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((((1 <= P2wM2) OR (2 <= P3)) U (P12 + 1 <= P3)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((1 <= P2wM2) OR (2 <= P3)) U (P12 + 1 <= P3)))
lola: processed formula length: 52
lola: 35 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= P2wM2) OR (2 <= P3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((P3 <= P12wM3) OR (P2s <= P1wM1))))
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 <= P12wM3) OR (P2s <= P1wM1))))
lola: processed formula length: 43
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)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (((P2d <= 0) OR (P1s <= 1)))) OR (A (F ((P1 <= P12M3))) AND (E (G ((P2wP1 <= P1))) AND E (F ((P12wM3 + 1 <= P1wM1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((P12wM3 + 1 <= P1wM1)))
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 ((P12wM3 + 1 <= P1wM1)))
lola: processed formula length: 29
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)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((P2wP1 <= P1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((P2wP1 <= P1)))
lola: processed formula length: 21
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 / 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 53 markings, 53 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((P1 <= P12M3)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (P12M3 + 1 <= P1)
lola: processed formula length: 17
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P1 <= P12M3)
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 / EG
lola: The predicate does not eventually occur.
lola: 53 markings, 53 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((P2d <= 0) OR (P1s <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((P2d <= 0) OR (P1s <= 1))))
lola: processed formula length: 35
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 (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: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((E (G ((P2s <= 2))) AND E (((P12wM3 <= P2M2) U (M3 <= P12s)))) OR (E (G (((P1d <= P2M2) AND (2 <= P3M2)))) OR A (G (((2 <= P12) AND (P12s <= P2M2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= P12) AND (P12s <= P2M2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((2 <= P12) AND (P12s <= P2M2))))
lola: processed formula length: 39
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 (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: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((P2s <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((P2s <= 2)))
lola: processed formula length: 18
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 / 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 <= P2s)
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 / EG
lola: The predicate is possibly preserved.
lola: 54 markings, 54 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (((P1d <= P2M2) AND (2 <= P3M2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((P1d <= P2M2) AND (2 <= P3M2))))
lola: processed formula length: 39
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 / 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((P12wM3 <= P2M2) U (M3 <= P12s)))
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 (((P12wM3 <= P2M2) U (M3 <= P12s)))
lola: processed formula length: 37
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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (M3 <= P12s)
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-22-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-22-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 472250 markings, 3215684 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes no yes yes no yes no yes unknown no yes
lola:
preliminary result: yes no no no no yes no yes yes no yes no yes unknown no yes
lola: memory consumption: 24196 KB
lola: time consumption: 1442 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552655871033

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

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