About the Execution of LoLA for PermAdmissibility-COL-20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4338.690 | 83414.00 | 63792.00 | 32.30 | TFTFTFFTFTFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r104-oct2-155272225900404.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is PermAdmissibility-COL-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272225900404
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 4.5K Feb 12 04:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 12 04:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 03:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 8 03:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 111 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 349 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 07:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 07:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 1 02:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 02:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-20-ReachabilityCardinality-00
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-01
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-02
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-03
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-04
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-05
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-06
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-07
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-08
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-09
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-10
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-11
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-12
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-13
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-14
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552791625390
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ PermAdmissibility-COL-20 @ 3570 seconds
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3487
rslt: Output for ReachabilityCardinality @ PermAdmissibility-COL-20
{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Mar 17 03:00:25 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 219
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((2 <= p128)))",
"processed_size": 19,
"rewrites": 1
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"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": 234
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))",
"processed_size": 60,
"rewrites": 1
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"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": 250
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 1)))",
"processed_size": 60,
"rewrites": 2
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 270
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G ((((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= 0) AND (p174 <= 1)) OR (1 <= p137))))",
"processed_size": 96,
"rewrites": 2
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "A (G (((p70 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= 2))))",
"processed_size": 137,
"rewrites": 2
},
"result":
{
"edges": 41,
"markings": 42,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 319
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "A (G (((p163 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) OR (3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))",
"processed_size": 138,
"rewrites": 2
},
"result":
{
"edges": 38,
"markings": 39,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 351
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "E (F (((p35 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))))",
"processed_size": 121,
"rewrites": 1
},
"result":
{
"edges": 22,
"markings": 23,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 390
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "A (G (((3 <= p53) OR (p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))",
"processed_size": 137,
"rewrites": 2
},
"result":
{
"edges": 49,
"markings": 50,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 438
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "A (G (((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p103) AND (p35 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172))))",
"processed_size": 140,
"rewrites": 2
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 501
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "E (F (((2 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) AND (p128 + 1 <= p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136))))",
"processed_size": 207,
"rewrites": 1
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 585
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 27,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p70) AND (2 <= p137) AND ((p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) OR (3 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172)) AND (2 <= p163))))",
"processed_size": 220,
"rewrites": 1
},
"result":
{
"edges": 35,
"markings": 36,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 702
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "A (G (((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0) OR ((p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + 1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) AND (p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + 1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)))))",
"processed_size": 274,
"rewrites": 2
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 877
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) AND (1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34) AND (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p173) AND (3 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26))))",
"processed_size": 236,
"rewrites": 1
},
"result":
{
"edges": 59,
"markings": 60,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1170
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 53,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 44,
"visible_transitions": 0
},
"processed": "A (G ((((p163 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) OR (p164 <= p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94) OR (p44 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR (1 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69)) AND ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + 1 <= p164) OR (p53 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172)))))",
"processed_size": 384,
"rewrites": 2
},
"result":
{
"edges": 86,
"markings": 87,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1755
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "E (F ((((3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) OR (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p146)) AND ((2 <= p103) OR (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) AND ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 2) OR (p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + 1 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)))))",
"processed_size": 387,
"rewrites": 1
},
"result":
{
"edges": 19,
"markings": 20,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3511
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 52,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 52,
"visible_transitions": 0
},
"processed": "A (G (((3 <= p173) OR (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78) OR (p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p164) OR (p53 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR ((p128 + 1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 0)))))",
"processed_size": 364,
"rewrites": 2
},
"result":
{
"edges": 169,
"markings": 170,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 90292,
"runtime": 59.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 5984,
"conflict_clusters": 72,
"places": 208,
"places_significant": 177,
"singleton_clusters": 0,
"transitions": 1024
},
"result":
{
"preliminary_value": "yes no yes no yes no no yes no yes no no yes no yes no ",
"value": "yes no yes no yes no no yes no yes no no yes no yes 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: 208, Transitions: 1024
lola: @ trans switch9
lola: @ trans switch2
lola: @ trans switch3
lola: @ trans switch4
lola: @ trans switch11
lola: @ trans switch10
lola: @ trans switch12
lola: @ trans switch1
lola: @ trans display4
lola: @ trans switch8
lola: @ trans display2
lola: @ trans switch5
lola: @ trans switch6
lola: @ trans display1
lola: @ trans display3
lola: @ trans switch7
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 1232/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6656
lola: finding significant places
lola: 208 places, 1024 transitions, 177 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 ReachabilityCardinality.xml
lola: place invariant simplifies atomic proposition
lola: before: (p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p100 + p101 + p102 + p95 + p96 + p97 + p98 + p99)
lola: after: (0 <= 0)
lola: E (F (((1 <= p70) AND (2 <= p137) AND ((p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) OR (3 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172)) AND (2 <= p163)))) : A (G ((((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= 0) AND (p174 <= 1)) OR (1 <= p137)))) : E (F (((p35 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))) : A (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 1))) : E (F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))) : A (G (((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p103) AND (p35 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172)))) : A (G (((p70 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= 2)))) : E (F (((1 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) AND (1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34) AND (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p173) AND (3 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26)))) : A (G (((p163 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) OR (3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))) : E (F (((2 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) AND (p128 + 1 <= p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136)))) : A (G (((3 <= p173) OR (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78) OR (p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p164) OR (p53 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR ((p128 + 1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 0))))) : A (G ((((p163 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) OR (p164 <= p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94) OR (p44 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR (1 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69)) AND ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + 1 <= p164) OR (p53 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172))))) : E (F ((2 <= p128))) : A (G (((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0) OR ((p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + 1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) AND (p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + 1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52))))) : E (F ((((3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) OR (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p146)) AND ((2 <= p103) OR (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) AND ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 2) OR (p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + 1 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145))))) : A (G (((3 <= p53) OR (p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p128)))
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 ((2 <= p128)))
lola: processed formula length: 19
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: (2 <= p128)
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: 9 markings, 8 edges
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))
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 ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))
lola: processed formula length: 60
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: (1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)
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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 1)))
lola: processed formula length: 60
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: (2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= 0) AND (p174 <= 1)) OR (1 <= p137))))
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 ((((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= 0) AND (p174 <= 1)) OR (1 <= p137))))
lola: processed formula length: 96
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: ========================================
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) OR (2 <= p174)) AND (p137 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p70 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p70 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= 2))))
lola: processed formula length: 137
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p70) OR (3 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p163 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) OR (3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))
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 (((p163 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) OR (3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))
lola: processed formula length: 138
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + 1 <= p163) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= 2))
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
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p35 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))))
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 (((p35 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))))
lola: processed formula length: 121
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p35 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p53) OR (p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))
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 (((3 <= p53) OR (p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119))))
lola: processed formula length: 137
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p53 <= 2) AND (p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162))
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
lola: The predicate is not invariant.
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p103) AND (p35 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172))))
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 (((p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p103) AND (p35 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172))))
lola: processed formula length: 140
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p103 + 1 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162) OR (p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + 1 <= p35))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) AND (p128 + 1 <= p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136))))
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 (((2 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) AND (p128 + 1 <= p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136))))
lola: processed formula length: 207
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: ((2 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182) AND (3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) AND (p128 + 1 <= p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 10 will run for 585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p70) AND (2 <= p137) AND ((p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) OR (3 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172)) AND (2 <= p163))))
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 (((1 <= p70) AND (2 <= p137) AND ((p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) OR (3 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172)) AND (2 <= p163))))
lola: processed formula length: 220
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: ((1 <= p70) AND (2 <= p137) AND ((p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) OR (3 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172)) AND (2 <= p163))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola: ========================================
lola: subprocess 11 will run for 702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0) OR ((p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + 1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) AND (p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + 1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)))))
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 (((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0) OR ((p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + 1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) AND (p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + 1 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52)))))
lola: processed formula length: 274
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61) OR (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 877 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) AND (1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34) AND (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p173) AND (3 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26))))
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 (((1 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) AND (1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34) AND (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p173) AND (3 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26))))
lola: processed formula length: 236
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: ((1 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) AND (1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34) AND (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p173) AND (3 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 60 markings, 59 edges
lola: ========================================
lola: subprocess 13 will run for 1170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p163 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) OR (p164 <= p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94) OR (p44 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR (1 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69)) AND ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + 1 <= p164) OR (p53 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172)))))
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 ((((p163 <= p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52) OR (p164 <= p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94) OR (p44 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR (1 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69)) AND ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + 1 <= p164) OR (p53 <= p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172)))))
lola: processed formula length: 384
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: (((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + 1 <= p163) AND (p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94 + 1 <= p164) AND (p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + 1 <= p44) AND (p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 <= 0)) OR ((p164 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) AND (p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + 1 <= p53)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 87 markings, 86 edges
lola: ========================================
lola: subprocess 14 will run for 1755 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) OR (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p146)) AND ((2 <= p103) OR (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) AND ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 2) OR (p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + 1 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127) OR (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p146)) AND ((2 <= p103) OR (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) AND ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 2) OR (p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + 1 <= p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145)))))
lola: processed formula length: 387
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 15 will run for 3511 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p173) OR (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78) OR (p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p164) OR (p53 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR ((p128 + 1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((3 <= p173) OR (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78) OR (p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p164) OR (p53 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) OR ((p128 + 1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 0)))))
lola: processed formula length: 364
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p173 <= 2) AND (p77 + p76 + p75 + p74 + p73 + p72 + p71 + p78 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p164 + 1 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26) AND (p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + 1 <= p53) AND ((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p128) OR (1 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 170 markings, 169 edges
lola: RESULT
lola:
SUMMARY: yes no yes no yes no no yes no yes no no yes no yes no
lola:
preliminary result: yes no yes no yes no no yes no yes no no yes no yes no
lola: ========================================
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: memory consumption: 90292 KB
lola: time consumption: 59 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552791708804
--------------------
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="PermAdmissibility-COL-20"
export BK_EXAMINATION="ReachabilityCardinality"
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 PermAdmissibility-COL-20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r104-oct2-155272225900404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-20.tgz
mv PermAdmissibility-COL-20 execution
cd execution
if [ "ReachabilityCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
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 ;