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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 13K Feb 12 15:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 12 15:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 8 18:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 8 18:16 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 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 11K Feb 5 01:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 5 01:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 4 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 4 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Feb 1 14:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Feb 1 14:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 167K 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-PT-000010-CTLCardinality-00
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-01
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-02
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-03
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-04
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-05
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-06
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-07
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-08
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-09
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-10
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-11
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-12
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-13
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-14
FORMULA_NAME SharedMemory-PT-000010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552944649844

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

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

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

FORMULA SharedMemory-PT-000010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA SharedMemory-PT-000010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SharedMemory-PT-000010-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA SharedMemory-PT-000010-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3500
rslt: Output for CTLCardinality @ SharedMemory-PT-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 21:30:49 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": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 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": "((Queue_10 <= Memory_7) OR (Queue_4 <= Ext_Mem_Acc_7_5))",
"processed_size": 57,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 (((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= 1))))",
"processed_size": 125,
"rewrites": 69
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9) OR (Ext_Bus <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10) OR (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= 2)))",
"processed_size": 347,
"rewrites": 69
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)))",
"processed_size": 264,
"rewrites": 70
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 480,
"markings": 325,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AG(((((1 <= Ext_Mem_Acc_1_2) AND (Active_2 <= Ext_Mem_Acc_7_6)) OR (OwnMemAcc_5 <= 0)) OR EX((Ext_Mem_Acc_8_1 <= Queue_10))))",
"processed_size": 126,
"rewrites": 70
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 19486170,
"markings": 1830519,
"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": 441
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 441
},
"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": "(Queue_7 + 1 <= Ext_Mem_Acc_8_1)",
"processed_size": 32,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((Ext_Mem_Acc_9_10 + 1 <= Ext_Mem_Acc_8_3) AND (Ext_Mem_Acc_10_4 + 1 <= Ext_Mem_Acc_6_5))))",
"processed_size": 97,
"rewrites": 69
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 108542,
"markings": 52735,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (G ((OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)))",
"processed_size": 260,
"rewrites": 70
},
"result":
{
"edges": 6,
"markings": 7,
"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": 706
},
"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": "(Ext_Mem_Acc_10_8 + 1 <= Ext_Mem_Acc_3_1)",
"processed_size": 41,
"rewrites": 71
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 882
},
"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": "(Ext_Mem_Acc_5_4 + 1 <= OwnMemAcc_6)",
"processed_size": 36,
"rewrites": 72
},
"result":
{
"edges": 9450027,
"markings": 1813023,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1167
},
"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": "(Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)",
"processed_size": 212,
"rewrites": 71
},
"result":
{
"edges": 16,
"markings": 14,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 190
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1750
},
"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 ((((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= 0)) R (3 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)))",
"processed_size": 241,
"rewrites": 73
},
"result":
{
"edges": 60,
"markings": 42,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"type": "universal_release",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3500
},
"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": "(((Ext_Bus + 1 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)) OR (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10))",
"processed_size": 360,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"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": "(((Ext_Bus + 1 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)) OR (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10))",
"processed_size": 360,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E (F ((Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)))",
"processed_size": 220,
"rewrites": 69
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 25088,
"runtime": 70.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(**)))) : (* OR (E(X(*)) OR E(F(*)))) : E(F(DEADLOCK)) : E(F(E(G(*)))) : ** : TRUE : A(G((** OR E(X(**))))) : FALSE : E(F(A(G(**))))"
},
"net":
{
"arcs": 800,
"conflict_clusters": 101,
"places": 131,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 210
},
"result":
{
"preliminary_value": "no yes yes no yes yes yes yes no no yes yes yes yes no no ",
"value": "no yes yes no yes yes yes yes no no yes yes 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: 341/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 131
lola: finding significant places
lola: 131 places, 210 transitions, 110 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 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: LP says that atomic proposition is always false: (3 <= Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10)
lola: LP says that atomic proposition is always true: (OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: place invariant simplifies atomic proposition
lola: before: (Ext_Bus <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: after: (0 <= 9)
lola: LP says that atomic proposition is always true: (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: LP says that atomic proposition is always false: (3 <= Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10)
lola: LP says that atomic proposition is always false: (2 <= Ext_Mem_Acc_7_6)
lola: LP says that atomic proposition is always false: (3 <= Ext_Mem_Acc_8_6)
lola: LP says that atomic proposition is always false: (3 <= Ext_Mem_Acc_5_7)
lola: LP says that atomic proposition is always false: (2 <= Ext_Mem_Acc_5_8)
lola: LP says that atomic proposition is always true: (Ext_Mem_Acc_3_8 <= Memory_9)
lola: LP says that atomic proposition is always false: (2 <= Ext_Mem_Acc_3_8)
lola: NOT(E ((((1 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)) U (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= 2)))) : (NOT(A (((Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9) U (1 <= Ext_Bus)))) OR NOT(E (((3 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10) U (3 <= Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10))))) : (E (F (((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= 1)))) AND E (X (((2 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9) OR (Ext_Bus <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10) OR (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= 2))))) : A (G (E (G ((OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9))))) : ((((Ext_Bus + 1 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)) OR (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)) AND NOT(NOT(E (F ((Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)))))) : E (F ((() AND E (G ((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)))))) : A (G (E (G ((Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10 <= 2))))) : A (X (E (F ((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9))))) : NOT((((Ext_Mem_Acc_8_1 <= Queue_7) AND A (X ((Ext_Mem_Acc_7_5 <= Ext_Mem_Acc_10_2)))) AND A (G (((Ext_Mem_Acc_8_3 <= Ext_Mem_Acc_9_10) OR (Ext_Mem_Acc_6_5 <= Ext_Mem_Acc_10_4)))))) : (E (F (A (X ((2 <= Ext_Mem_Acc_7_6))))) OR E (F (E (G ((3 <= Ext_Mem_Acc_8_6)))))) : E (F (NOT(A (F ((Ext_Mem_Acc_3_1 <= Ext_Mem_Acc_10_8)))))) : (NOT(NOT(A (G ((0 <= 0))))) AND ((Queue_10 <= Memory_7) OR (Queue_4 <= Ext_Mem_Acc_7_5))) : A (F (A (G ((Ext_Mem_Acc_5_7 <= 2))))) : A (G (((((1 <= Ext_Mem_Acc_1_2) AND (Active_2 <= Ext_Mem_Acc_7_6)) OR (OwnMemAcc_5 <= 0)) OR E (X ((Ext_Mem_Acc_8_1 <= Queue_10)))))) : NOT(NOT((E (F ((2 <= Ext_Mem_Acc_5_8))) AND ()))) : E (F (A (G ((OwnMemAcc_6 <= Ext_Mem_Acc_5_4)))))
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:100
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:282
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:118
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: 68 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: 68 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: ((Queue_10 <= Memory_7) OR (Queue_4 <= Ext_Mem_Acc_7_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Queue_10 <= Memory_7) OR (Queue_4 <= Ext_Mem_Acc_7_5))
lola: processed formula length: 57
lola: 68 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 3 will run for 274 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: 68 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 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: 68 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: (E (F (((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= 1)))) AND E (X (((2 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9) OR (Ext_Bus <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10) OR (Queue_1 + Queue_2 + Queue... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= 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 (((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= 1))))
lola: processed formula length: 125
lola: 69 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: ((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= 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-5-0.sara
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9) OR (Ext_Bus <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10) OR (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((2 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9) OR (Ext_Bus <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10) OR (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= 2)))
lola: processed formula length: 347
lola: 69 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)))))
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((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)))
lola: processed formula length: 264
lola: 70 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: 325 markings, 480 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((1 <= Ext_Mem_Acc_1_2) AND (Active_2 <= Ext_Mem_Acc_7_6)) OR (OwnMemAcc_5 <= 0)) OR E (X ((Ext_Mem_Acc_8_1 <= Queue_10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
sara: try reading problem file CTLCardinality-5-0.sara.
lola: processed formula: AG(((((1 <= Ext_Mem_Acc_1_2) AND (Active_2 <= Ext_Mem_Acc_7_6)) OR (OwnMemAcc_5 <= 0)) OR EX((Ext_Mem_Acc_8_1 <= Queue_10))))
lola: processed formula length: 126
lola: 70 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).
sara: place or transition ordering is non-deterministic

lola: 502204 markings, 3057680 edges, 100441 markings/sec, 0 secs
lola: 903884 markings, 6016755 edges, 80336 markings/sec, 5 secs
lola: 1253294 markings, 9132639 edges, 69882 markings/sec, 10 secs
lola: 1575554 markings, 12289246 edges, 64452 markings/sec, 15 secs
lola: 1746925 markings, 15115688 edges, 34274 markings/sec, 20 secs
lola: 1830487 markings, 17708614 edges, 16712 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1830519 markings, 19486170 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Queue_7 + 1 <= Ext_Mem_Acc_8_1) OR (E (X ((Ext_Mem_Acc_10_2 + 1 <= Ext_Mem_Acc_7_5))) OR E (F (((Ext_Mem_Acc_9_10 + 1 <= Ext_Mem_Acc_8_3) AND (Ext_Mem_Acc_10_4 + 1 <= Ext_Mem_Acc_6_5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Queue_7 + 1 <= Ext_Mem_Acc_8_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Queue_7 + 1 <= Ext_Mem_Acc_8_1)
lola: processed formula length: 32
lola: 68 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Ext_Mem_Acc_9_10 + 1 <= Ext_Mem_Acc_8_3) AND (Ext_Mem_Acc_10_4 + 1 <= Ext_Mem_Acc_6_5))))
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 (((Ext_Mem_Acc_9_10 + 1 <= Ext_Mem_Acc_8_3) AND (Ext_Mem_Acc_10_4 + 1 <= Ext_Mem_Acc_6_5))))
lola: processed formula length: 97
lola: 69 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: ((Ext_Mem_Acc_9_10 + 1 <= Ext_Mem_Acc_8_3) AND (Ext_Mem_Acc_10_4 + 1 <= Ext_Mem_Acc_6_5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((Ext_Mem_Acc_10_2 + 1 <= Ext_Mem_Acc_7_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((Ext_Mem_Acc_10_2 + 1 <= Ext_Mem_Acc_7_5))
lola: processed formula length: 45
lola: 69 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net does not have deadlocks.
lola: 52735 markings, 108542 edges
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)))
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 ((OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)))
lola: processed formula length: 260
lola: 70 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)
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-10-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((Ext_Mem_Acc_10_8 + 1 <= Ext_Mem_Acc_3_1)))))
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: (Ext_Mem_Acc_10_8 + 1 <= Ext_Mem_Acc_3_1)
lola: processed formula length: 41
lola: 71 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 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: (Ext_Mem_Acc_3_1 <= Ext_Mem_Acc_10_8)
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: (Ext_Mem_Acc_10_8 + 1 <= Ext_Mem_Acc_3_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-11-1.sara
lola: SUBRESULT
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-1.sara.
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 12 markings, 12 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 12 will run for 882 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((OwnMemAcc_6 <= Ext_Mem_Acc_5_4)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (Ext_Mem_Acc_5_4 + 1 <= OwnMemAcc_6)
lola: processed formula length: 36
lola: 72 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (OwnMemAcc_6 <= Ext_Mem_Acc_5_4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: try reading problem file CTLCardinality-11-0.sara.
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
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: (Ext_Mem_Acc_5_4 + 1 <= OwnMemAcc_6)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLCardinality-12-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-1.sara.
sara: place or transition ordering is non-deterministic


sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 444599 markings, 1379353 edges, 88920 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 799813 markings, 2900440 edges, 71043 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1127447 markings, 4455813 edges, 65527 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1436013 markings, 6112108 edges, 61713 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 1656492 markings, 7719964 edges, 44096 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 1813023 markings, 9450027 edges
lola: ========================================
lola: subprocess 13 will run for 1167 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)))))
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: (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)
lola: processed formula length: 212
lola: 71 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: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 14 markings, 16 edges
lola: ========================================
lola: subprocess 14 will run for 1750 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= 0)) R (3 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)))
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 ((((Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 <= 0)) R (3 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)))
lola: processed formula length: 241
lola: 73 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: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 42 markings, 60 edges
lola: ========================================
lola: subprocess 15 will run for 3500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((Ext_Bus + 1 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)) OR (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)) AND E (F ((Memory_1 + Memory_2 + Memor... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((Ext_Bus + 1 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)) OR (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((Ext_Bus + 1 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)) OR (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10))
lola: processed formula length: 360
lola: 68 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((Ext_Bus + 1 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)) OR (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)) AND E (F ((Memory_1 + Memory_2 + Memor... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((Ext_Bus + 1 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)) OR (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((Ext_Bus + 1 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)) OR (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10))
lola: processed formula length: 360
lola: 68 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: ========================================
lola: ...considering subproblem: E (F ((Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)))
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 ((Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)))
lola: processed formula length: 220
lola: 69 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: (Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)
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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-17-0.sara
lola: state equation: calling and running sara
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes yes yes no no yes yes yes yes no no
lola:
preliminary result: no yes yes no yes yes yes yes no no yes yes yes yes no no
sara: try reading problem file CTLCardinality-17-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: memory consumption: 25088 KB
lola: time consumption: 70 seconds
lola: print data as JSON (--json)

lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552944719190

--------------------
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-PT-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-PT-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-155286430800247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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