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.r104-oct2-155272225400094.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 NeighborGrid-PT-d3n3m1t11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272225400094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.1K Feb 11 23:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 11 23:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 8 00:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 00:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 4 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 1 00:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 1 00:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rwxr-xr-x 1 mcc users 46K 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 NeighborGrid-PT-d3n3m1t11-CTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552772958396

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ NeighborGrid-PT-d3n3m1t11 @ 3570 seconds

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2919
rslt: Output for CTLCardinality @ NeighborGrid-PT-d3n3m1t11

{
"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": "Sat Mar 16 21:49:18 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "((p_0_0_0 <= p_0_2_0) AND (2 <= p_2_0_0))",
"processed_size": 41,
"rewrites": 17
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"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": 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": "(p_2_2_2 + 1 <= p_0_0_2)",
"processed_size": 24,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "EX(EX((3 <= p_1_1_2)))",
"processed_size": 22,
"rewrites": 17
},
"net":
{
"conflict_clusters": 27,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "AX(EF(((2 <= p_2_1_1) OR (3 <= p_1_1_2))))",
"processed_size": 43,
"rewrites": 17
},
"net":
{
"conflict_clusters": 27,
"singleton_clusters": 0
},
"result":
{
"edges": 4451,
"markings": 2148,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EX((AG((p_0_1_1 <= p_2_2_2)) AND ((p_0_1_1 <= 1) AND (p_2_1_2 + 1 <= p_1_2_2))))",
"processed_size": 80,
"rewrites": 17
},
"net":
{
"conflict_clusters": 27,
"singleton_clusters": 0
},
"result":
{
"edges": 402880,
"markings": 173165,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": "(p_2_2_1 + 1 <= p_0_1_0)",
"processed_size": 24,
"rewrites": 18
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "AG(EX(((p_2_2_1 <= p_1_2_2) OR (p_2_1_0 <= p_2_0_1))))",
"processed_size": 55,
"rewrites": 17
},
"net":
{
"conflict_clusters": 27,
"singleton_clusters": 0
},
"result":
{
"edges": 71287,
"markings": 27396,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 497
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"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": "EX(A((p_2_2_0 <= p_2_0_0) U (3 <= p_1_2_1)))",
"processed_size": 44,
"rewrites": 17
},
"net":
{
"conflict_clusters": 27,
"singleton_clusters": 0
},
"result":
{
"edges": 1289,
"markings": 1139,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 696
},
"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 <= p_0_1_2)))",
"processed_size": 22,
"rewrites": 16
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1123
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p_1_1_2 <= 0) AND (p_0_1_2 + 1 <= p_0_2_1))",
"processed_size": 45,
"rewrites": 19
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1684
},
"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": "(p_1_0_2 <= p_2_1_1)",
"processed_size": 20,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3255
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E ((((p_1_0_2 <= p_1_2_1) OR (2 <= p_1_0_0) OR (1 <= p_2_0_1) OR (p_0_2_2 <= p_1_1_1)) U ((p_0_1_0 <= p_0_0_2) AND (1 <= p_1_2_2) AND (3 <= p_1_1_2))))",
"processed_size": 154,
"rewrites": 18
},
"result":
{
"edges": 51000,
"markings": 20632,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 35
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p_1_0_2 <= p_2_1_1)",
"processed_size": 20,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 19284,
"runtime": 627.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(X(A((** U **)))) : (** AND A(G(E(F(**))))) : E(X(E(G(**)))) : (A(F(**)) AND E(X(E(X(**))))) : A(X(E(F(**)))) : E(F(**)) : A(G(E(F(**)))) : E(X((A(G(**)) AND **))) : A(G(*)) : A(X(A(F(**)))) : A(G(E(X(**)))) : E((E(X(**)) U **)) : E((** U **)) : E(X(E(F(**)))) : FALSE : A(G(A(F(**))))"
},
"net":
{
"arcs": 324,
"conflict_clusters": 27,
"places": 27,
"places_significant": 26,
"singleton_clusters": 0,
"transitions": 162
},
"result":
{
"preliminary_value": "no unknown yes yes yes yes unknown no no no no unknown yes yes no no ",
"value": "no unknown yes yes yes yes unknown no no no no unknown yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 189/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 162 transitions, 26 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 (X (A (((p_2_2_0 <= p_2_0_0) U (3 <= p_1_2_1))))) : ((p_1_0_2 <= p_2_1_1) AND A (G (E (F ((1 <= p_1_2_1)))))) : E (X (E (G (((p_0_0_0 <= p_0_2_0) AND (2 <= p_2_0_0)))))) : (A (F (A (F ((p_0_0_2 <= p_2_2_2))))) AND E (X (E (X ((3 <= p_1_1_2)))))) : A (X (E (F (((2 <= p_2_1_1) OR (3 <= p_1_1_2)))))) : E (F ((3 <= p_0_1_2))) : A (G ((E (F ((p_2_2_2 <= p_1_2_0))) AND A (F ((0 <= 0)))))) : E (X ((A (G ((p_0_1_1 <= p_2_2_2))) AND ((p_0_1_1 <= 1) AND (p_2_1_2 + 1 <= p_1_2_2))))) : A (G (NOT(A (F ((3 <= p_2_2_2)))))) : A (X (A (F ((p_0_1_0 <= p_2_2_1))))) : A (G (E (X (((p_2_2_1 <= p_1_2_2) OR (p_2_1_0 <= p_2_0_1)))))) : E ((E (X ((p_0_0_0 <= p_0_2_1))) U (3 <= p_0_1_2))) : E ((((p_1_0_2 <= p_1_2_1) OR (2 <= p_1_0_0) OR (1 <= p_2_0_1) OR (p_0_2_2 <= p_1_1_1)) U ((p_0_1_0 <= p_0_0_2) AND (1 <= p_1_2_2) AND (3 <= p_1_1_2)))) : E (F (E (X ((3 <= p_2_1_1))))) : NOT((A (G ((0 <= 0))) OR (2 <= p_1_1_1))) : A (G (A (F (((1 <= p_1_1_2) OR (p_0_2_1 <= p_0_1_2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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:458
lola: rewrite Frontend/Parser/formula_rewrite.k:395
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:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((p_0_0_0 <= p_0_2_0) AND (2 <= p_2_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: ((p_0_0_0 <= p_0_2_0) AND (2 <= p_2_0_0))
lola: processed formula length: 41
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p_0_0_0 <= p_0_2_0) AND (2 <= p_2_0_0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 11 markings, 11 edges
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p_0_0_2 <= p_2_2_2))) AND E (X (E (X ((3 <= p_1_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p_0_0_2 <= p_2_2_2)))
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: (p_2_2_2 + 1 <= p_0_0_2)
lola: processed formula length: 24
lola: 18 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: (p_0_0_2 <= p_2_2_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-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((3 <= p_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EX((3 <= p_1_1_2)))
lola: processed formula length: 22
lola: 17 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: ========================================
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((2 <= p_2_1_1) OR (3 <= p_1_1_2))))))
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(((2 <= p_2_1_1) OR (3 <= p_1_1_2))))
lola: processed formula length: 43
lola: 17 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2148 markings, 4451 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((p_0_1_1 <= p_2_2_2))) AND ((p_0_1_1 <= 1) AND (p_2_1_2 + 1 <= p_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((AG((p_0_1_1 <= p_2_2_2)) AND ((p_0_1_1 <= 1) AND (p_2_1_2 + 1 <= p_1_2_2))))
lola: processed formula length: 80
lola: 17 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: 173165 markings, 402880 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((p_0_1_0 <= p_2_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p_2_2_1 + 1 <= p_0_1_0)
lola: processed formula length: 24
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p_2_2_1 <= p_1_2_2) OR (p_2_1_0 <= p_2_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p_2_2_1 <= p_1_2_2) OR (p_2_1_0 <= p_2_0_1))))
lola: processed formula length: 55
lola: 17 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: 27396 markings, 71287 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p_0_0_0 <= p_0_2_1))) U (3 <= p_0_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EX((p_0_0_0 <= p_0_2_1)) U (3 <= p_0_1_2))
lola: processed formula length: 44
lola: 17 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: 1678453 markings, 4094086 edges, 335691 markings/sec, 0 secs
lola: 3074407 markings, 7575292 edges, 279191 markings/sec, 5 secs
lola: 4465525 markings, 11061588 edges, 278224 markings/sec, 10 secs
lola: 5814719 markings, 14444123 edges, 269839 markings/sec, 15 secs
lola: 7135846 markings, 17728571 edges, 264225 markings/sec, 20 secs
lola: 8530792 markings, 21146511 edges, 278989 markings/sec, 25 secs
lola: 9951558 markings, 24620390 edges, 284153 markings/sec, 30 secs
lola: 11286578 markings, 28017589 edges, 267004 markings/sec, 35 secs
lola: 12673587 markings, 31419063 edges, 277402 markings/sec, 40 secs
lola: 13966319 markings, 34737867 edges, 258546 markings/sec, 45 secs
lola: 15242293 markings, 37872921 edges, 255195 markings/sec, 50 secs
lola: 16555243 markings, 41054948 edges, 262590 markings/sec, 55 secs
lola: 17931482 markings, 44250891 edges, 275248 markings/sec, 60 secs
lola: 19518711 markings, 47754340 edges, 317446 markings/sec, 65 secs
lola: 21313926 markings, 51577171 edges, 359043 markings/sec, 70 secs
lola: 23046069 markings, 55158964 edges, 346429 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((3 <= p_2_1_1)))))
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: (3 <= p_2_1_1)
lola: processed formula length: 14
lola: 17 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: (3 <= p_2_1_1)
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 /EXEF
lola: The predicate is reachable from some successor.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (((p_2_2_0 <= p_2_0_0) U (3 <= p_1_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(A((p_2_2_0 <= p_2_0_0) U (3 <= p_1_2_1)))
lola: processed formula length: 44
lola: 17 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: 1139 markings, 1289 edges
lola: ========================================
lola: subprocess 10 will run for 580 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p_2_2_2 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p_2_2_2 <= 2)))
lola: processed formula length: 22
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p_2_2_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 11 will run for 696 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p_0_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p_0_1_2)))
lola: processed formula length: 22
lola: 16 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 <= p_0_1_2)
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 12 will run for 871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p_2_2_2 <= p_1_2_0)))))
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: (p_2_2_2 <= p_1_2_0)
lola: processed formula length: 20
lola: 18 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: (p_1_2_0 + 1 <= p_2_2_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: (p_2_2_2 <= p_1_2_0)
lola: state equation task get result unparse finished id 1
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-1.sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara

sara: try reading problem file CTLCardinality-12-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2730519 markings, 6360028 edges, 546104 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5145210 markings, 12428829 edges, 482938 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7479145 markings, 18331882 edges, 466787 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 9789415 markings, 24066562 edges, 462054 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12054872 markings, 29796928 edges, 453091 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 14301999 markings, 35396085 edges, 449425 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 16569151 markings, 41035676 edges, 453430 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 19009880 markings, 46736813 edges, 488146 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 21853138 markings, 52704875 edges, 568652 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 24587144 markings, 58276266 edges, 546801 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 27083575 markings, 63491738 edges, 499286 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 29493162 markings, 68676994 edges, 481917 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 31847143 markings, 73775247 edges, 470796 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 34145795 markings, 78787435 edges, 459730 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 36272654 markings, 83446587 edges, 425372 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 38540747 markings, 88392566 edges, 453619 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 40618841 markings, 93038967 edges, 415619 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 42662244 markings, 97696181 edges, 408681 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 44729578 markings, 102601238 edges, 413467 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 46950100 markings, 107663346 edges, 444104 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 49127640 markings, 112473050 edges, 435508 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 51256236 markings, 117228507 edges, 425719 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p_1_1_2) OR (p_0_2_1 <= p_0_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p_1_1_2 <= 0) AND (p_0_1_2 + 1 <= p_0_2_1))
lola: processed formula length: 45
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: ((p_1_1_2 <= 0) AND (p_0_1_2 + 1 <= p_0_2_1))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 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: ((1 <= p_1_1_2) OR (p_0_2_1 <= p_0_1_2))
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 /EFEG
lola: The predicate does not eventually occur from all states.
lola: 13 markings, 13 edges
lola: subprocess 14 will run for 1684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_1_0_2 <= p_2_1_1) AND A (G (E (F ((1 <= p_1_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_1_0_2 <= p_2_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_1_0_2 <= p_2_1_1)
lola: processed formula length: 20
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p_1_2_1)))))
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: (1 <= p_1_2_1)
lola: processed formula length: 14
lola: 18 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: ========================================
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: (p_1_2_1 <= 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 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: (1 <= p_1_2_1)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: write sara problem file to CTLCardinality-15-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
sara: try reading problem file CTLCardinality-15-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3366273 markings, 5941884 edges, 673255 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6621169 markings, 11720641 edges, 650979 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9416905 markings, 16994410 edges, 559147 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12256708 markings, 22227128 edges, 567961 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 15081681 markings, 27447487 edges, 564995 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17654086 markings, 32432041 edges, 514481 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 20307172 markings, 37426870 edges, 530617 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 23089241 markings, 42553346 edges, 556414 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 25675556 markings, 47493949 edges, 517263 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 28183372 markings, 52342634 edges, 501563 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 30782119 markings, 57229591 edges, 519749 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 33470350 markings, 62262308 edges, 537646 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 36433015 markings, 67607369 edges, 592533 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 39578271 markings, 73160662 edges, 629051 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 42436646 markings, 78410239 edges, 571675 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 45267034 markings, 83558864 edges, 566078 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 48221593 markings, 88817947 edges, 590912 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 50855597 markings, 93667357 edges, 526801 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 53324835 markings, 98397434 edges, 493848 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 55874998 markings, 103158659 edges, 510033 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 58403980 markings, 107900756 edges, 505796 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 60776958 markings, 112448222 edges, 474596 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p_1_0_2 <= p_1_2_1) OR (2 <= p_1_0_0) OR (1 <= p_2_0_1) OR (p_0_2_2 <= p_1_1_1)) U ((p_0_1_0 <= p_0_0_2) AND (1 <= p_1_2_2) AND (3 <= p_1_1_2))))
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 ((((p_1_0_2 <= p_1_2_1) OR (2 <= p_1_0_0) OR (1 <= p_2_0_1) OR (p_0_2_2 <= p_1_1_1)) U ((p_0_1_0 <= p_0_0_2) AND (1 <= p_1_2_2) AND (3 <= p_1_1_2))))
lola: processed formula length: 154
lola: 18 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: ((p_0_1_0 <= p_0_0_2) AND (1 <= p_1_2_2) AND (3 <= p_1_1_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic

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: 20632 markings, 51000 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p_0_0_0 <= p_0_2_1))) U (3 <= p_0_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EX((p_0_0_0 <= p_0_2_1)) U (3 <= p_0_1_2))
lola: processed formula length: 44
lola: 17 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: 1637367 markings, 3991871 edges, 327473 markings/sec, 0 secs
lola: 3028284 markings, 7460582 edges, 278183 markings/sec, 5 secs
lola: 4434454 markings, 10986196 edges, 281234 markings/sec, 10 secs
lola: 5779696 markings, 14358912 edges, 269048 markings/sec, 15 secs
lola: 7109992 markings, 17666882 edges, 266059 markings/sec, 20 secs
lola: 8506195 markings, 21087615 edges, 279241 markings/sec, 25 secs
lola: 9925092 markings, 24554822 edges, 283779 markings/sec, 30 secs
lola: 11271825 markings, 27978948 edges, 269347 markings/sec, 35 secs
lola: 12667017 markings, 31402360 edges, 279038 markings/sec, 40 secs
lola: 13971268 markings, 34750281 edges, 260850 markings/sec, 45 secs
lola: 15290116 markings, 37990720 edges, 263770 markings/sec, 50 secs
lola: 16637582 markings, 41248951 edges, 269493 markings/sec, 55 secs
lola: 18035771 markings, 44500714 edges, 279638 markings/sec, 60 secs
lola: 19688046 markings, 48130036 edges, 330455 markings/sec, 65 secs
lola: 21511896 markings, 51990968 edges, 364770 markings/sec, 70 secs
lola: 23192066 markings, 55481758 edges, 336034 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p_2_2_2 <= p_1_2_0)))))
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: (p_2_2_2 <= p_1_2_0)
lola: processed formula length: 20
lola: 18 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: (p_1_2_0 + 1 <= p_2_2_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: (p_2_2_2 <= p_1_2_0)
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: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-17-0.sara.
sara: try reading problem file CTLCardinality-17-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2590611 markings, 6032998 edges, 518122 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5015719 markings, 12098635 edges, 485022 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7366271 markings, 18037261 edges, 470110 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 9640334 markings, 23696181 edges, 454813 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 11877512 markings, 29351341 edges, 447436 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 14112136 markings, 34907969 edges, 446925 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 16346038 markings, 40473050 edges, 446780 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 18705513 markings, 46080351 edges, 471895 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 21510744 markings, 52002601 edges, 561046 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 24207511 markings, 57551570 edges, 539353 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 26767318 markings, 62792914 edges, 511961 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 29138545 markings, 67916635 edges, 474245 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 31493835 markings, 73001486 edges, 471058 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 33762366 markings, 77963941 edges, 453706 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 35966970 markings, 82794365 edges, 440921 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 38231041 markings, 87694719 edges, 452814 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 40371611 markings, 92495904 edges, 428114 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 42425817 markings, 97147225 edges, 410841 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 44486127 markings, 102032451 edges, 412062 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 46652749 markings, 107031105 edges, 433324 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 48869858 markings, 111895711 edges, 443422 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 50983120 markings, 116584699 edges, 422652 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 53050757 markings, 121278516 edges, 413527 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((p_1_0_2 <= p_2_1_1) AND A (G (E (F ((1 <= p_1_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p_1_0_2 <= p_2_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_1_0_2 <= p_2_1_1)
lola: processed formula length: 20
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p_1_2_1)))))
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: (1 <= p_1_2_1)
lola: processed formula length: 14
lola: 18 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: ========================================
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: (p_1_2_1 <= 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 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: (1 <= p_1_2_1)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-19-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-19-1.sara
sara: try reading problem file CTLCardinality-19-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-19-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3353492 markings, 5916707 edges, 670698 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6576435 markings, 11642408 edges, 644589 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9375857 markings, 16915568 edges, 559884 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12206850 markings, 22134457 edges, 566199 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 15016698 markings, 27322960 edges, 561970 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17563178 markings, 32261139 edges, 509296 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 20219392 markings, 37269817 edges, 531243 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 23036126 markings, 42453390 edges, 563347 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 25632044 markings, 47413672 edges, 519184 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 28128831 markings, 52235910 edges, 499357 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 30721695 markings, 57109794 edges, 518573 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 33384193 markings, 62103873 edges, 532500 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 36325506 markings, 67418435 edges, 588263 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 39454824 markings, 72936302 edges, 625864 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 42229712 markings, 78062187 edges, 554978 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 45051709 markings, 83186252 edges, 564399 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 47969962 markings, 88369189 edges, 583651 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 50617731 markings, 93217605 edges, 529554 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 53072139 markings, 97920779 edges, 490882 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 55599978 markings, 102645716 edges, 505568 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 58118763 markings, 107355655 edges, 503757 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 60544445 markings, 111991880 edges, 485136 markings/sec, 105 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: RESULT
lola:
SUMMARY: no unknown yes yes yes yes unknown no no no no unknown yes yes no no
lola:
preliminary result: no unknown yes yes yes yes unknown no no no no unknown yes yes no no
lola: memory consumption: 19284 KB
lola: time consumption: 627 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552773609282

--------------------
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="NeighborGrid-PT-d3n3m1t11"
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 NeighborGrid-PT-d3n3m1t11, 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 r104-oct2-155272225400094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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