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

About the Execution of LoLA for DNAwalker-PT-09ringLR

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4282.280 1201602.00 1207102.00 60.00 FTFFFFFFFFFTFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r049-oct2-155234405500670.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is DNAwalker-PT-09ringLR, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r049-oct2-155234405500670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 2.9K Feb 10 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 10 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 6 15:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 6 15:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 23:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K Feb 4 23:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 3 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 30 22:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 30 22:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:19 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 112K 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 DNAwalker-PT-09ringLR-CTLCardinality-00
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-01
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-02
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-03
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-04
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-05
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-06
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-07
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-08
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-09
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-10
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-11
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-12
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-13
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-14
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552473429959

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DNAwalker-PT-09ringLR @ 3570 seconds

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-09ringLR-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2368
rslt: Output for CTLCardinality @ DNAwalker-PT-09ringLR

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 215
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E(EF((3 <= B20)) U AX((2 <= A5)))",
"processed_size": 33,
"rewrites": 43
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 240889488,
"markings": 28209796,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 218
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "AF(AX((B3 + 1 <= A13)))",
"processed_size": 23,
"rewrites": 42
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 235
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((3 <= A6) OR (1 <= B3))",
"processed_size": 25,
"rewrites": 43
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 23
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 255
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((B21 <= 2)))",
"processed_size": 18,
"rewrites": 41
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 278
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((A4 + 1 <= A13) AND (A13 + 1 <= B11))))",
"processed_size": 46,
"rewrites": 41
},
"result":
{
"edges": 158661782,
"markings": 27934939,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 285
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX((B11 + 1 <= A8))",
"processed_size": 19,
"rewrites": 41
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 259
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(EF((A10 + 1 <= A20)))",
"processed_size": 24,
"rewrites": 42
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 69545305,
"markings": 8994510,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 280
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((B10 <= 1)))",
"processed_size": 18,
"rewrites": 42
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 311
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= A3)))",
"processed_size": 17,
"rewrites": 41
},
"result":
{
"edges": 79876666,
"markings": 15965754,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 336
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"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 ((((A17 <= 1) OR (A13 <= 1)) AND (3 <= A15))))",
"processed_size": 52,
"rewrites": 41
},
"result":
{
"edges": 124343139,
"markings": 21600442,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 361
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "E (F (((A6 + 1 <= A20) AND (A20 + 1 <= A15) AND (2 <= A4))))",
"processed_size": 60,
"rewrites": 41
},
"result":
{
"edges": 100573661,
"markings": 17869397,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 398
},
"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": "(A20 <= 1)",
"processed_size": 10,
"rewrites": 43
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 478
},
"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": "(B3 <= 2)",
"processed_size": 9,
"rewrites": 43
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 598
},
"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": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((A14 <= 0) OR (A19 <= 2) OR (A20 <= 0))",
"processed_size": 42,
"rewrites": 43
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 64
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 797
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (G (((3 <= A17) OR (2 <= A17) OR ((1 <= A3) AND (B11 <= A6)) OR (A10 <= 0) OR (A13 <= 0))))",
"processed_size": 97,
"rewrites": 41
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 109
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(A1 <= A8)",
"processed_size": 10,
"rewrites": 44
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 28904,
"runtime": 1177.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(G(**)) : A(F(*)) : A(F(A(G(**)))) : A(F(**)) : E(F(**)) : A(X(E(F(*)))) : A(F(**)) : E((E(F(**)) U A(X(**)))) : A(F(A(X(**)))) : E(F(*)) : A(G(*)) : (A(X(E(G(**)))) OR A(F(*))) : E(G(A(F(*)))) : (E(F(*)) OR (E(G(*)) AND A(X(*)))) : TRUE"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "no yes no no no no no no no no no yes no yes no yes ",
"value": "no yes no no no no no no no no no yes no yes 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: 287/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: E (F (((A6 + 1 <= A20) AND (A20 + 1 <= A15) AND (2 <= A4)))) : E (G (((3 <= A17) OR (2 <= A17) OR ((1 <= A3) AND (B11 <= A6)) OR (A10 <= 0) OR (A13 <= 0)))) : NOT(E (G ((B3 <= 2)))) : A (F (A (G ((A8 + 1 <= A1))))) : A (F (A (((1 <= A4) U (2 <= A20))))) : A ((E (F ((B20 <= A11))) U E (F ((3 <= A3))))) : A (X (NOT(A (G ((A20 <= A10)))))) : A ((E (X ((0 <= 0))) U ((1 <= A14) AND (3 <= A19) AND (1 <= A20)))) : E ((E (F ((3 <= B20))) U A (X ((2 <= A5))))) : A (F (A (X ((B3 + 1 <= A13))))) : NOT(A (G ((((2 <= A17) AND (2 <= A13)) OR (A15 <= 2))))) : NOT(E (F (E (F ((2 <= B10)))))) : (A (X (E (G ((3 <= A2))))) OR NOT(E (G (((3 <= A6) OR (1 <= B3)))))) : E (G (NOT(E (G ((2 <= A9)))))) : NOT((A (G (((A13 <= A4) OR (B11 <= A13)))) AND (A (F ((3 <= B21))) OR E (X ((A8 <= B11)))))) : A (G (E (F ((0 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:452
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:208
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:401
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 201 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 40 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 215 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((3 <= B20))) U A (X ((2 <= A5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((3 <= B20)) U AX((2 <= A5)))
lola: processed formula length: 33
lola: 43 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: 1145614 markings, 7329218 edges, 229123 markings/sec, 0 secs
lola: 2105494 markings, 15093937 edges, 191976 markings/sec, 5 secs
lola: 2984216 markings, 22622592 edges, 175744 markings/sec, 10 secs
lola: 3911484 markings, 29949223 edges, 185454 markings/sec, 15 secs
lola: 4753790 markings, 37357250 edges, 168461 markings/sec, 20 secs
lola: 5729309 markings, 45491533 edges, 195104 markings/sec, 25 secs
lola: 6770834 markings, 53237854 edges, 208305 markings/sec, 30 secs
lola: 7718063 markings, 60652312 edges, 189446 markings/sec, 35 secs
lola: 8756038 markings, 68268484 edges, 207595 markings/sec, 40 secs
lola: 9628473 markings, 75738413 edges, 174487 markings/sec, 45 secs
lola: 10422193 markings, 82943962 edges, 158744 markings/sec, 50 secs
lola: 11234905 markings, 89946294 edges, 162542 markings/sec, 55 secs
lola: 11950882 markings, 97055032 edges, 143195 markings/sec, 60 secs
lola: 12655342 markings, 104130708 edges, 140892 markings/sec, 65 secs
lola: 13731990 markings, 112028076 edges, 215330 markings/sec, 70 secs
lola: 14634492 markings, 119489452 edges, 180500 markings/sec, 75 secs
lola: 15576201 markings, 127226608 edges, 188342 markings/sec, 80 secs
lola: 16561079 markings, 134688473 edges, 196976 markings/sec, 85 secs
lola: 17514141 markings, 142495850 edges, 190612 markings/sec, 90 secs
lola: 18338574 markings, 149881107 edges, 164887 markings/sec, 95 secs
lola: 19090905 markings, 157488280 edges, 150466 markings/sec, 100 secs
lola: 19991261 markings, 165285784 edges, 180071 markings/sec, 105 secs
lola: 20868964 markings, 172859028 edges, 175541 markings/sec, 110 secs
lola: 21745257 markings, 180465339 edges, 175259 markings/sec, 115 secs
lola: 22579537 markings, 187874218 edges, 166856 markings/sec, 120 secs
lola: 23440812 markings, 195544799 edges, 172255 markings/sec, 125 secs
lola: 24273053 markings, 202926567 edges, 166448 markings/sec, 130 secs
lola: 25116024 markings, 210571483 edges, 168594 markings/sec, 135 secs
lola: 25891414 markings, 217827721 edges, 155078 markings/sec, 140 secs
lola: 26644534 markings, 225054621 edges, 150624 markings/sec, 145 secs
lola: 27271508 markings, 231313448 edges, 125395 markings/sec, 150 secs
lola: 27891548 markings, 237698446 edges, 124008 markings/sec, 155 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 28209796 markings, 240889488 edges
lola: ========================================
lola: subprocess 2 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((B3 + 1 <= A13)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX((B3 + 1 <= A13)))
lola: processed formula length: 23
lola: 42 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((3 <= A2))))) OR A (F (((A6 <= 2) AND (B3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((A6 <= 2) AND (B3 <= 0))))
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:788
lola: processed formula: ((3 <= A6) OR (1 <= B3))
lola: processed formula length: 25
lola: 43 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: ((A6 <= 2) AND (B3 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((3 <= A2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG((3 <= A2)))
lola: processed formula length: 17
lola: 42 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((A4 + 1 <= A13) AND (A13 + 1 <= B11)))) OR (E (G ((B21 <= 2))) AND A (X ((B11 + 1 <= A8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((B21 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((B21 <= 2)))
lola: processed formula length: 18
lola: 41 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 <= B21)
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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((A4 + 1 <= A13) AND (A13 + 1 <= B11))))
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 (((A4 + 1 <= A13) AND (A13 + 1 <= B11))))
lola: processed formula length: 46
lola: 41 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: ((A4 + 1 <= A13) AND (A13 + 1 <= B11))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 1140669 markings, 3135581 edges, 228134 markings/sec, 0 secs
lola: sara is running 5 secs || 2260891 markings, 6077427 edges, 224044 markings/sec, 5 secs
lola: sara is running 10 secs || 3306930 markings, 9253512 edges, 209208 markings/sec, 10 secs
lola: sara is running 15 secs || 4452559 markings, 12503480 edges, 229126 markings/sec, 15 secs
lola: sara is running 20 secs || 5555975 markings, 15903461 edges, 220683 markings/sec, 20 secs
lola: sara is running 25 secs || 6586889 markings, 19451273 edges, 206183 markings/sec, 25 secs
lola: sara is running 30 secs || 7461818 markings, 22947569 edges, 174986 markings/sec, 30 secs
lola: sara is running 35 secs || 8115820 markings, 26736108 edges, 130800 markings/sec, 35 secs
lola: sara is running 40 secs || 8754070 markings, 30560871 edges, 127650 markings/sec, 40 secs
lola: sara is running 45 secs || 9431768 markings, 34078169 edges, 135540 markings/sec, 45 secs
lola: sara is running 50 secs || 10097923 markings, 37512028 edges, 133231 markings/sec, 50 secs
lola: sara is running 55 secs || 10640276 markings, 41317700 edges, 108471 markings/sec, 55 secs
lola: sara is running 60 secs || 11162193 markings, 45188882 edges, 104383 markings/sec, 60 secs
lola: sara is running 65 secs || 11874414 markings, 48700565 edges, 142444 markings/sec, 65 secs
lola: sara is running 70 secs || 12502967 markings, 52292928 edges, 125711 markings/sec, 70 secs
lola: sara is running 75 secs || 13041163 markings, 56240844 edges, 107639 markings/sec, 75 secs
lola: sara is running 80 secs || 13657471 markings, 60047683 edges, 123262 markings/sec, 80 secs
lola: sara is running 85 secs || 14235234 markings, 63865686 edges, 115553 markings/sec, 85 secs
lola: sara is running 90 secs || 14830744 markings, 67757641 edges, 119102 markings/sec, 90 secs
lola: sara is running 95 secs || 15395364 markings, 71851738 edges, 112924 markings/sec, 95 secs
lola: sara is running 100 secs || 16004598 markings, 75805983 edges, 121847 markings/sec, 100 secs
lola: sara is running 105 secs || 16690044 markings, 79529502 edges, 137089 markings/sec, 105 secs
lola: sara is running 110 secs || 17356959 markings, 83027763 edges, 133383 markings/sec, 110 secs
lola: sara is running 115 secs || 17905807 markings, 86901878 edges, 109770 markings/sec, 115 secs
lola: sara is running 120 secs || 18497327 markings, 90747749 edges, 118304 markings/sec, 120 secs
lola: sara is running 125 secs || 19076634 markings, 94528046 edges, 115861 markings/sec, 125 secs
lola: sara is running 130 secs || 19625136 markings, 98591192 edges, 109700 markings/sec, 130 secs
lola: sara is running 135 secs || 20203524 markings, 102537983 edges, 115678 markings/sec, 135 secs
lola: sara is running 140 secs || 20784937 markings, 106463895 edges, 116283 markings/sec, 140 secs
lola: sara is running 145 secs || 21438855 markings, 109929444 edges, 130784 markings/sec, 145 secs
lola: sara is running 150 secs || 22050520 markings, 113586107 edges, 122333 markings/sec, 150 secs
lola: sara is running 155 secs || 22652177 markings, 117354165 edges, 120331 markings/sec, 155 secs
lola: sara is running 160 secs || 23286841 markings, 120818283 edges, 126933 markings/sec, 160 secs
lola: sara is running 165 secs || 23809642 markings, 124481724 edges, 104560 markings/sec, 165 secs
lola: sara is running 170 secs || 24345136 markings, 128265525 edges, 107099 markings/sec, 170 secs
lola: sara is running 175 secs || 24842162 markings, 132075057 edges, 99405 markings/sec, 175 secs
lola: sara is running 180 secs || 25325495 markings, 136018527 edges, 96667 markings/sec, 180 secs
lola: sara is running 185 secs || 25792726 markings, 140010335 edges, 93446 markings/sec, 185 secs
lola: sara is running 190 secs || 26294503 markings, 143806922 edges, 100355 markings/sec, 190 secs
lola: sara is running 195 secs || 26761692 markings, 147712746 edges, 93438 markings/sec, 195 secs
lola: sara is running 200 secs || 27214350 markings, 151653330 edges, 90532 markings/sec, 200 secs
lola: sara is running 205 secs || 27644325 markings, 155762385 edges, 85995 markings/sec, 205 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 27934939 markings, 158661782 edges
lola: ========================================
lola: subprocess 6 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((B11 + 1 <= A8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((B11 + 1 <= A8))
lola: processed formula length: 19
lola: 41 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((A10 + 1 <= A20)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((A10 + 1 <= A20)))
lola: processed formula length: 24
lola: 42 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1297230 markings, 7531495 edges, 259446 markings/sec, 0 secs
lola: 2198129 markings, 14472652 edges, 180180 markings/sec, 5 secs
lola: 3179951 markings, 21779445 edges, 196364 markings/sec, 10 secs
lola: 4050679 markings, 28481242 edges, 174146 markings/sec, 15 secs
lola: 4840998 markings, 35042816 edges, 158064 markings/sec, 20 secs
lola: 5796634 markings, 42225655 edges, 191127 markings/sec, 25 secs
lola: 6595160 markings, 49007268 edges, 159705 markings/sec, 30 secs
lola: 7436400 markings, 55901702 edges, 168248 markings/sec, 35 secs
lola: 8256533 markings, 62825550 edges, 164027 markings/sec, 40 secs
lola: 8902526 markings, 68699653 edges, 129199 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8994510 markings, 69545305 edges
lola: subprocess 6 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((B10 <= 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:788
lola: processed formula: A (G ((B10 <= 1)))
lola: processed formula length: 18
lola: 42 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= A3)))
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 <= A3)))
lola: processed formula length: 17
lola: 41 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 <= A3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 899664 markings, 3324580 edges, 179933 markings/sec, 0 secs
lola: sara is running 5 secs || 1662342 markings, 6804503 edges, 152536 markings/sec, 5 secs
lola: sara is running 10 secs || 2450820 markings, 10227612 edges, 157696 markings/sec, 10 secs
lola: sara is running 15 secs || 3160141 markings, 13986554 edges, 141864 markings/sec, 15 secs
lola: sara is running 20 secs || 3943807 markings, 17864582 edges, 156733 markings/sec, 20 secs
lola: sara is running 25 secs || 4593670 markings, 21641740 edges, 129973 markings/sec, 25 secs
lola: sara is running 30 secs || 5269418 markings, 25596481 edges, 135150 markings/sec, 30 secs
lola: sara is running 35 secs || 5966952 markings, 29455808 edges, 139507 markings/sec, 35 secs
lola: sara is running 40 secs || 6754198 markings, 33215062 edges, 157449 markings/sec, 40 secs
lola: sara is running 45 secs || 7607075 markings, 36608528 edges, 170575 markings/sec, 45 secs
lola: sara is running 50 secs || 8379813 markings, 40313713 edges, 154548 markings/sec, 50 secs
lola: sara is running 55 secs || 9140586 markings, 43938575 edges, 152155 markings/sec, 55 secs
lola: sara is running 60 secs || 9896427 markings, 47775651 edges, 151168 markings/sec, 60 secs
lola: sara is running 65 secs || 10549794 markings, 51727879 edges, 130673 markings/sec, 65 secs
lola: sara is running 70 secs || 11338212 markings, 55222591 edges, 157684 markings/sec, 70 secs
lola: sara is running 75 secs || 11972378 markings, 58973254 edges, 126833 markings/sec, 75 secs
lola: sara is running 80 secs || 12688977 markings, 62576157 edges, 143320 markings/sec, 80 secs
lola: sara is running 85 secs || 13617594 markings, 66278727 edges, 185723 markings/sec, 85 secs
lola: sara is running 90 secs || 14341073 markings, 70196506 edges, 144696 markings/sec, 90 secs
lola: sara is running 95 secs || 14951362 markings, 74068076 edges, 122058 markings/sec, 95 secs
lola: sara is running 100 secs || 15681231 markings, 78053326 edges, 145974 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 15965754 markings, 79876666 edges
lola: ========================================
lola: subprocess 8 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((A17 <= 1) OR (A13 <= 1)) AND (3 <= A15))))
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 ((((A17 <= 1) OR (A13 <= 1)) AND (3 <= A15))))
lola: processed formula length: 52
lola: 41 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: (((A17 <= 1) OR (A13 <= 1)) AND (3 <= A15))
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-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 742916 markings, 3313961 edges, 148583 markings/sec, 0 secs
lola: sara is running 5 secs || 1456838 markings, 6858202 edges, 142784 markings/sec, 5 secs
lola: sara is running 10 secs || 2192605 markings, 10330781 edges, 147153 markings/sec, 10 secs
lola: sara is running 15 secs || 2954148 markings, 14043688 edges, 152309 markings/sec, 15 secs
lola: sara is running 20 secs || 3621539 markings, 17939172 edges, 133478 markings/sec, 20 secs
lola: sara is running 25 secs || 4299781 markings, 21543727 edges, 135648 markings/sec, 25 secs
lola: sara is running 30 secs || 5037782 markings, 25127694 edges, 147600 markings/sec, 30 secs
lola: sara is running 35 secs || 5655627 markings, 28734950 edges, 123569 markings/sec, 35 secs
lola: sara is running 40 secs || 6375168 markings, 32303911 edges, 143908 markings/sec, 40 secs
lola: sara is running 45 secs || 7025320 markings, 35845640 edges, 130030 markings/sec, 45 secs
lola: sara is running 50 secs || 7690941 markings, 39167738 edges, 133124 markings/sec, 50 secs
lola: sara is running 55 secs || 8342444 markings, 42660035 edges, 130301 markings/sec, 55 secs
lola: sara is running 60 secs || 9015850 markings, 46450097 edges, 134681 markings/sec, 60 secs
lola: sara is running 65 secs || 9516018 markings, 50460653 edges, 100034 markings/sec, 65 secs
lola: sara is running 70 secs || 10206806 markings, 54298712 edges, 138158 markings/sec, 70 secs
lola: sara is running 75 secs || 10887038 markings, 58148140 edges, 136046 markings/sec, 75 secs
lola: sara is running 80 secs || 11514429 markings, 62196436 edges, 125478 markings/sec, 80 secs
lola: sara is running 85 secs || 12233305 markings, 66098391 edges, 143775 markings/sec, 85 secs
lola: sara is running 90 secs || 12913474 markings, 70252672 edges, 136034 markings/sec, 90 secs
lola: sara is running 95 secs || 13580380 markings, 74320635 edges, 133381 markings/sec, 95 secs
lola: sara is running 100 secs || 14129730 markings, 78549980 edges, 109870 markings/sec, 100 secs
lola: sara is running 105 secs || 14866069 markings, 82392775 edges, 147268 markings/sec, 105 secs
lola: sara is running 110 secs || 15542830 markings, 86357243 edges, 135352 markings/sec, 110 secs
lola: sara is running 115 secs || 16197552 markings, 90232964 edges, 130944 markings/sec, 115 secs
lola: sara is running 120 secs || 16826714 markings, 94316401 edges, 125832 markings/sec, 120 secs
lola: sara is running 125 secs || 17549803 markings, 98247055 edges, 144618 markings/sec, 125 secs
lola: sara is running 130 secs || 18290786 markings, 102300175 edges, 148197 markings/sec, 130 secs
lola: sara is running 135 secs || 18991564 markings, 106473208 edges, 140156 markings/sec, 135 secs
lola: sara is running 140 secs || 19638600 markings, 110452988 edges, 129407 markings/sec, 140 secs
lola: sara is running 145 secs || 20183264 markings, 114715651 edges, 108933 markings/sec, 145 secs
lola: sara is running 150 secs || 20873207 markings, 118924716 edges, 137989 markings/sec, 150 secs
lola: sara is running 155 secs || 21472104 markings, 123506165 edges, 119779 markings/sec, 155 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 21600442 markings, 124343139 edges
lola: subprocess 9 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((A6 + 1 <= A20) AND (A20 + 1 <= A15) AND (2 <= A4))))
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 (((A6 + 1 <= A20) AND (A20 + 1 <= A15) AND (2 <= A4))))
lola: processed formula length: 60
lola: 41 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: ((A6 + 1 <= A20) AND (A20 + 1 <= A15) AND (2 <= A4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
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.
sara: error: :457: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 663599 markings, 3296667 edges, 132720 markings/sec, 0 secs
lola: sara is running 5 secs || 1484920 markings, 6783780 edges, 164264 markings/sec, 5 secs
lola: sara is running 10 secs || 2229256 markings, 10490500 edges, 148867 markings/sec, 10 secs
lola: sara is running 15 secs || 3005269 markings, 14253045 edges, 155203 markings/sec, 15 secs
lola: sara is running 20 secs || 3734994 markings, 17913103 edges, 145945 markings/sec, 20 secs
lola: sara is running 25 secs || 4416494 markings, 21719410 edges, 136300 markings/sec, 25 secs
lola: sara is running 30 secs || 5132174 markings, 25306447 edges, 143136 markings/sec, 30 secs
lola: sara is running 35 secs || 5768312 markings, 29173160 edges, 127228 markings/sec, 35 secs
lola: sara is running 40 secs || 6443448 markings, 32937645 edges, 135027 markings/sec, 40 secs
lola: sara is running 45 secs || 7146303 markings, 36238767 edges, 140571 markings/sec, 45 secs
lola: sara is running 50 secs || 7757299 markings, 39454991 edges, 122199 markings/sec, 50 secs
lola: sara is running 55 secs || 8328265 markings, 42856615 edges, 114193 markings/sec, 55 secs
lola: sara is running 60 secs || 8961154 markings, 46219236 edges, 126578 markings/sec, 60 secs
lola: sara is running 65 secs || 9710725 markings, 49717114 edges, 149914 markings/sec, 65 secs
lola: sara is running 70 secs || 10359881 markings, 53129310 edges, 129831 markings/sec, 70 secs
lola: sara is running 75 secs || 10989442 markings, 56676478 edges, 125912 markings/sec, 75 secs
lola: sara is running 80 secs || 11536409 markings, 60302490 edges, 109393 markings/sec, 80 secs
lola: sara is running 85 secs || 12108364 markings, 63747761 edges, 114391 markings/sec, 85 secs
lola: sara is running 90 secs || 12719626 markings, 67187608 edges, 122252 markings/sec, 90 secs
lola: sara is running 95 secs || 13251638 markings, 70728040 edges, 106402 markings/sec, 95 secs
lola: sara is running 100 secs || 13787768 markings, 74547024 edges, 107226 markings/sec, 100 secs
lola: sara is running 105 secs || 14377750 markings, 78531574 edges, 117996 markings/sec, 105 secs
lola: sara is running 110 secs || 14960859 markings, 82506435 edges, 116622 markings/sec, 110 secs
lola: sara is running 115 secs || 15543680 markings, 86285238 edges, 116564 markings/sec, 115 secs
lola: sara is running 120 secs || 16175942 markings, 89898802 edges, 126452 markings/sec, 120 secs
lola: sara is running 125 secs || 16816668 markings, 93550933 edges, 128145 markings/sec, 125 secs
lola: sara is running 130 secs || 17416889 markings, 97503540 edges, 120044 markings/sec, 130 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 17869397 markings, 100573661 edges
lola: ========================================
lola: subprocess 10 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= A20)))
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: (A20 <= 1)
lola: processed formula length: 10
lola: 43 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 11 edges
lola: formula 0: (2 <= A20)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= B3)))
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:788
lola: processed formula: (B3 <= 2)
lola: processed formula length: 9
lola: 43 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: (3 <= B3)
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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 12 will run for 598 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= A14) AND (3 <= A19) AND (1 <= A20))))
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: ((A14 <= 0) OR (A19 <= 2) OR (A20 <= 0))
lola: processed formula length: 42
lola: 43 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: ((1 <= A14) AND (3 <= A19) AND (1 <= A20))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 13 will run for 797 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= A17) OR (2 <= A17) OR ((1 <= A3) AND (B11 <= A6)) OR (A10 <= 0) OR (A13 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((3 <= A17) OR (2 <= A17) OR ((1 <= A3) AND (B11 <= A6)) OR (A10 <= 0) OR (A13 <= 0))))
lola: processed formula length: 97
lola: 41 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: ((A17 <= 2) AND (A17 <= 1) AND ((A3 <= 0) OR (A6 + 1 <= B11)) AND (1 <= A10) AND (1 <= A13))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 14 will run for 1196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((A9 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((A9 <= 1)))
lola: processed formula length: 17
lola: 42 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: 14 markings, 28 edges
lola: ========================================
lola: subprocess 15 will run for 2393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((A8 + 1 <= A1)))))
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: (A1 <= A8)
lola: processed formula length: 10
lola: 44 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (A8 + 1 <= A1)
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: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
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: The predicate is not eventually invariant.
lola: state equation task get result unparse finished++ id 1
lola: 14 markings, 14 edges
lola: formula 1: (A1 <= A8)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no no yes no yes no yes
lola:
preliminary result: no yes no no no no no no no no no yes no yes no yes
lola: memory consumption: 28904 KB
lola: time consumption: 1177 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552474631561

--------------------
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="DNAwalker-PT-09ringLR"
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 DNAwalker-PT-09ringLR, 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 r049-oct2-155234405500670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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