Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.6K Feb 12 15:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 12 15:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 8 18:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 18:15 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 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 01:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 4 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 4 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 1 14:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 1 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_pt
-rw-r--r-- 1 mcc users 7 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 12K 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 SharedMemory-COL-000010-CTLCardinality-00
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-01
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-02
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-03
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-04
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-05
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-06
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-07
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-08
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-09
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-10
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-11
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-12
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-13
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-14
FORMULA_NAME SharedMemory-COL-000010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552939383568

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ SharedMemory-COL-000010 @ 3570 seconds

FORMULA SharedMemory-COL-000010-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLCardinality @ SharedMemory-COL-000010

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon Mar 18 20:03:03 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": "TRUE",
"processed_size": 4,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

{
"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": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "((p10 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1))",
"processed_size": 141,
"rewrites": 63
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space /EXEF",
"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": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 (F (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1))))",
"processed_size": 84,
"rewrites": 61
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "EX(((2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) OR (p10 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2)))",
"processed_size": 200,
"rewrites": 61
},
"net":
{
"conflict_clusters": 111,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "AX(EF((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18)))",
"processed_size": 142,
"rewrites": 62
},
"net":
{
"conflict_clusters": 111,
"singleton_clusters": 0
},
"result":
{
"edges": 109,
"markings": 105,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "AX((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))",
"processed_size": 58,
"rewrites": 61
},
"net":
{
"conflict_clusters": 111,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (G ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))",
"processed_size": 138,
"rewrites": 62
},
"result":
{
"edges": 14,
"markings": 14,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)",
"processed_size": 120,
"rewrites": 63
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 200
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A ((((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 0)) R (3 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))",
"processed_size": 159,
"rewrites": 65
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (((1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) U ((3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) OR (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18))))",
"processed_size": 208,
"rewrites": 63
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "(((p10 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140))",
"processed_size": 233,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E (F ((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))",
"processed_size": 128,
"rewrites": 61
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"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": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))",
"processed_size": 201,
"rewrites": 63
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 220
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": 110,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 110,
"visible_transitions": 0
},
"processed": "(p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p82 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p81 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p79 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p70 + p80 + p60 + p50 + p40 + p30 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)",
"processed_size": 695,
"rewrites": 64
},
"result":
{
"edges": 41,
"markings": 32,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 110
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 79972,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((* R *)) : TRUE : (E(F(**)) AND E(X(**))) : A(G(**)) : (** AND E(F(**))) : E(F(E(G(**)))) : TRUE : A(X(E(F(**)))) : A(X(**)) : A(F(A(G(**)))) : E(G(E(F(**)))) : A(X(A(G(**)))) : FALSE : E((** U **)) : FALSE : FALSE"
},
"net":
{
"arcs": 840,
"conflict_clusters": 111,
"places": 141,
"places_significant": 120,
"singleton_clusters": 0,
"transitions": 220
},
"result":
{
"preliminary_value": "no yes yes no yes yes yes yes no no yes no no no no no ",
"value": "no yes yes no yes yes yes yes no no yes no no no 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 High-Level net
lola: Places: 141, Transitions: 220
lola: @ trans endExtAcc
lola: @ trans beginExtAcc
lola: @ trans endOwnAcc
lola: @ trans reqExtAcc
lola: @ trans beginOwnAcc
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 361/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 141
lola: finding significant places
lola: 141 places, 220 transitions, 120 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (3 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)
lola: LP says that atomic proposition is always false: (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p82 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p81 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p79 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p70 + p80 + p60 + p50 + p40 + p30 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: LP says that atomic proposition is always true: (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)
lola: place invariant simplifies atomic proposition
lola: before: (p10 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)
lola: after: (0 <= 9)
lola: LP says that atomic proposition is always true: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)
lola: LP says that atomic proposition is always false: (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p82 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p81 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p79 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p70 + p80 + p60 + p50 + p40 + p30 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: LP says that atomic proposition is always false: (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p82 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p81 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p79 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p70 + p80 + p60 + p50 + p40 + p30 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: place invariant simplifies atomic proposition
lola: before: (p10 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)
lola: after: (0 <= 9)
lola: LP says that atomic proposition is always true: (3 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)
lola: LP says that atomic proposition is always false: (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p82 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p81 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p79 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p70 + p80 + p60 + p50 + p40 + p30 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: LP says that atomic proposition is always true: (2 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)
lola: LP says that atomic proposition is always false: (2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p82 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p81 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p79 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p70 + p80 + p60 + p50 + p40 + p30 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: LP says that atomic proposition is always true: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)
lola: LP says that atomic proposition is always true: (3 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)
lola: NOT(E ((((1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)) U (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 2)))) : (NOT(A (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) U (1 <= p10)))) OR NOT(E (((3 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) U (3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p82 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p81 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p79 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p70 + p80 + p60 + p50 + p40 + p30 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))) : (E (F (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1)))) AND E (X (((2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) OR (p10 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2))))) : A (G (E (G ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))))) : ((((p10 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)) AND NOT(NOT(E (F ((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))) : E (F ((() AND E (G ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))) : A (G (E (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p82 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p81 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p79 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p70 + p80 + p60 + p50 + p40 + p30 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 2))))) : A (X (E (F ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18))))) : ((E (((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p82 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p81 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p79 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p70 + p80 + p60 + p50 + p40 + p30 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) U (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))) OR (0 <= 9)) AND (E (F ((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= 2))) OR A (X ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) : A (F (A (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p82 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p81 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p79 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p70 + p80 + p60 + p50 + p40 + p30 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))))) : E (G (E (F (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))))) : A (X (A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p10) OR (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))))) : NOT(A (G (A (G ((0 <= 0)))))) : (E ((() U ())) OR E (((1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) U ((3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) OR (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18))))) : E ((() U (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) : NOT(NOT(E (F ((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= 2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 60 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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 60 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 60 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 60 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 4 will run for 297 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: 60 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p10) OR (2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p10 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1))
lola: processed formula length: 141
lola: 63 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: 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: ((p10 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1))
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 /EXEF
lola: The predicate is not invariant from successors.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1)))) AND E (X (((2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) OR (p10 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1))))
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 (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 1))))
lola: processed formula length: 84
lola: 61 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: ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 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
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) OR (p10 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((2 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) OR (p10 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2)))
lola: processed formula length: 200
lola: 61 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)
sara: try reading problem file CTLCardinality-6-0.sara.
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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18)))))
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((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18)))
lola: processed formula length: 142
lola: 62 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: 105 markings, 109 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))
lola: processed formula length: 58
lola: 61 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: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))
lola: processed formula length: 138
lola: 62 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 120
lola: 63 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: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 0)) R (3 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 0)) R (3 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))
lola: processed formula length: 159
lola: 65 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 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 /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 8 markings, 7 edges
sara: place or transition ordering is non-deterministic
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) U ((3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) OR (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18))))
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 (((1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) U ((3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) OR (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18))))
lola: processed formula length: 208
lola: 63 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: ((3 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) OR (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola:
There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p10 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)) AND E (F ((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p10 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p10 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140))
lola: processed formula length: 233
lola: 60 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
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 ((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
lola: processed formula length: 128
lola: 61 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: (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
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: 11 markings, 10 edges
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
sara: try reading problem file CTLCardinality-14-0.sara.
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))
lola: processed formula length: 201
lola: 63 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) OR (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 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: ((p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (1 <= p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 14 markings, 14 edges
sara: place or transition ordering is non-deterministic
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p82 + p51 + p52 + p53 + p54 + p55 + p56 + ... (shortened)
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: (p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p88 + p87 + p86 + p85 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p84 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p83 + p41 + p42 + p43 + p44 + p45 + p46... (shortened)
lola: processed formula length: 695
lola: 64 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: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 32 markings, 41 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes yes yes no no yes no no no no no

lola:
preliminary result: no yes yes no yes yes yes yes no no yes no no no no no
lola: ========================================
lola: memory consumption: 79972 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552939388689

--------------------
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="SharedMemory-COL-000010"
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 SharedMemory-COL-000010, 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 r159-csrt-155286430600121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000010.tgz
mv SharedMemory-COL-000010 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 ;